Non-Patent Literature 
WIPO Prior Art 
EP Prior Art 
US Prior Art 
CN Prior Art 
JP Prior Art 
KR Prior Art | Ground | Reference | Owner of the Reference | Title | Semantic Mapping | Basis | Anticipation | Challenged Claims | ||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | |||||||
| 1 | ICDE: 2009 IEEE 25TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3. : 1483-1486 2009 (Lin, 2009) | IBM Thomas J. Watson Research Center | SmallBlue: Social Network Analysis For Expertise Search And Collective Intelligence | ▪ networking system ≈ social networking ▪ match aggregator ≈ Social Network | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||||
| 2 | CHI2009: PROCEEDINGS OF THE 27TH ANNUAL CHI CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS, VOLS 1-4. : 201-210 2009 (Chen, 2009) | The University of Minnesota, Twin Cities | Make New Friends, But Keep The Old - Recommending People On Social Networking Sites | ▪ networking system ≈ social networking ▪ match aggregator ≈ Social Network | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||||
| 3 | PROCEEDINGS OF THE IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE. : 77-80 2007 (Fu, 2007) | Tsinghua University (清华大学) | Finding Experts Using Social Network Analysis | ▪ match aggregator ≈ Social Network ▪ total number ≈ ranked list | X | X | X | X | X | X | X | X | X | ||||||||||||||||||||
| 4 | 17TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS. : 651-660 2001 (Han, 2001) | KAIST - Korea Advanced Institute of Science and Technology (한국과학기술원) | Prefetching Based On The Type-level Access Pattern In Object-relational DBMSs | ▪ total number ≈ Management System ▪ computer having one ≈ management system | X | X | X | X | |||||||||||||||||||||||||
| 5 | IEEE TRANSACTIONS ON INFORMATION TECHNOLOGY IN BIOMEDICINE. 4 (1): 52-57 MAR 2000 (Critchlow, 2000) | Lawrence Livermore National Laboratory (LLNL) | DataFoundry: Information Management For Scientific Data | ▪ readable medium ≈ transferring data ▪ match servers ≈ dynamic data | X | X | X | X | X | X | |||||||||||||||||||||||
| 6 | MEDICAL IMAGING 2000: PACS DESIGN AND EVALUATION - ENGINEERING AND CLINICAL ISSUES. 3980: 235-241 2000 (Slomka, 2000) | London Health Sciences Centre (LHSC), London, Ontario, Canada | Java-based PACS And Reporting System For Nuclear Medicine | ▪ user profiles ≈ patient data ▪ executable instruction, computer executable instruction ≈ web browser | X | X | X | X | X | X | |||||||||||||||||||||||
| 7 | PERFORMANCE EVALUATION REVIEW, SPECIAL ISSUE, VOL 27 NO 1, JUNE 1999. : 178-187 1999 (Fan, 1999) | University of Wisconsin–Madison | Web Prefetching Between Low-bandwidth Clients And Proxies: Potential And Performance | ▪ web server ≈ World Wide Web ▪ computer program product ≈ up mode | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||||
| 8 | US7251696B1 (Eric J. Horvitz, 2007) | (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC | System and methods enabling a mix of human and automated initiatives in the control of communication policies | ▪ computer executable instruction ≈ computer executable instruction ▪ match server ≈ computer readable medium ▪ instruction means ≈ readable medium storing ▪ networking system ≈ situation data | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ describes facilitating communication by optimizing communication modalities and one of the many features is comparing… ▪ discloses obtaining advertisement data by the search engine relating to the search request where the advertisement data… ▪ teaches that the user may specify a destination device column… ▪ teaches a method of transferring data between different types of terminals comprising a presence information… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||
| 9 | US20030056026A1 (Ed Anuff, 2003) | (Original Assignee) Vignette Corp (Current Assignee) Open Text SA | Graphical user interface for performing administration on web components of web sites in a portal framework | ▪ match server ≈ computer readable medium ▪ computer program product ≈ computer program product | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ discloses a summary of the invention s method of deploying components for a site between systems in a portal framework… ▪ teaches the customization of web pages and their corresponding links see paragraphs… ▪ teaches how a style sheet satisfies the document type root element name and root element attribute name… ▪ teaches a formatting specification that includes a standardized set of flexible styles attribute of which are set for… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||
| 10 | US20090177754A1 (Matthew Brezina, 2009) | (Original Assignee) Xobni Corp (Current Assignee) Verizon Media Inc | Presentation of Organized Personal and Public Data Using Communication Mediums | ▪ match aggregator ≈ predetermined criteria ▪ user profiles, match percentage ≈ profile information ▪ readable medium ≈ readable medium ▪ readable instruction means ≈ training data | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ teaches the memory storing the status report for a predefined length of time after the status report is transmitted to… ▪ teaches a receiver for receiving positioning data from satellites allowing the processor to use the positioning data… ▪ teaches notifying a sender of an alert of changes in a status of said alert… ▪ teaches a communication system comprising A mobile unit having a processor a memory and a wireless modem for… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||
| 11 | WO2009086014A1 (Francis J. Kane, 2009) | (Original Assignee) Amazon Technologies, Inc. | Widget-assisted detection and exposure of behavioral associations | ▪ user information ≈ respective users ▪ polling questions ≈ related items ▪ next polling question ≈ said users ▪ web server ≈ web server | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||
| 12 | WO2009085602A1 (Sihem Amer-Yahia, 2009) | (Original Assignee) Yahoo! Inc. | Recommendation system using social behavior analysis and vocabulary taxonomies | ▪ computer program product ≈ computer program product ▪ readable medium, readable instruction ≈ readable medium, based tag | X | X | X | X | X | X | X | X | X | ||||||||||||||||||||
| 13 | WO2009067262A2 (Michel Veillette, 2009) | (Original Assignee) Trilliant Networks, Inc. | Collector device and system utilizing standardized utility metering protocol | ▪ first polling ≈ applying compression ▪ next polling question, match aggregator ≈ active network ▪ match server ≈ lot number ▪ user information ≈ using one | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) | ▪ discloses using the one or more secondary wireless mesh access nodes to grant wireless network access to consumer… ▪ teaches of detecting an advanced metering infrastructure AMI enabled smart metering and acquiring AMI enabled smart… ▪ teaches of an energy management system inclusive of the limitations noted in claim… ▪ discloses use of minimal propagation delay path to optimize a mesh network… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||
| 14 | US20100042647A1 (Paul T. Schultz, 2010) | (Original Assignee) Verizon Business Network Services Inc (Current Assignee) Verizon Patent and Licensing Inc | Method and system for recording real-time communications | ▪ receiving match commands to identify users ≈ configured to store ▪ web server ≈ electronic mail, web server ▪ match commands ≈ key sequence | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ teaches adjusting the content of said personalized content channel to include said at least one selected recommended… ▪ teaches automatically selecting at least one recommended further content item having the highest recommendation… ▪ teaches wherein a like and a dislike is provided for each attribute of the content item… ▪ teaches alternate key when key requested is unavailable claim… | X | X | X | X | X | X | X | X | X | ||||||||||||||||||
| 15 | US20100036934A1 (Anthony K. Bruster, 2010) | (Original Assignee) BRUSTERPOWERS LLC (Current Assignee) BRUSTERPOWERS LLC | Network Based Community and Contest System and Method for Same | ▪ match server ≈ computer readable medium ▪ web server ≈ World Wide Web, network site ▪ computer program product ≈ first input | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) | ▪ discloses sending a textual component an animated component and audible component of the advertisement from the server… ▪ discloses identifying an advertisement in a certain category requested by the user a feature of the web page based on… ▪ teaches all claimed limitations as set forth in the rejection of claim… ▪ discloses the information displayed into groups is used for a recommendation service which is configured to recommend… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||
| 16 | US20090319940A1 (Gary W. Flake, 2009) | (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC | Network of trust as married to multi-scale | ▪ polling questions ≈ Internet protocol ▪ next polling questions ≈ device location ▪ user profiles ≈ profile data | X | X | X | X | X | X | X | X | X | ||||||||||||||||||||
| 17 | WO2008154648A1 (Adam D'angelo, 2008) | (Original Assignee) Facebook, Inc. | Personalized social networking application content | ▪ user profiles ≈ user profile data ▪ networking system ≈ social networking ▪ readable medium ≈ server address | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ discloses a method for providing customized advertisement to mobile users based on their profile US… ▪ teaches the limitation wherein administratively modifying at least one of said presentation attributes for a selected… ▪ teaches the invention substantially as claimed including enterprise application platform see abstract… ▪ teaches how a style sheet satisfies the document type root element name and root element attribute name… | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||
| 18 | US20090307038A1 (Al Chakra, 2009) | (Original Assignee) International Business Machines Corp (Current Assignee) International Business Machines Corp | System and method for creation of data feeds based on calender meeting participants | ▪ networking system ≈ social networking ▪ user profiles ≈ user profile data | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ teaches a user can set up a group calendar specifying the members in the group where every group member can access the… ▪ teaches user is allowed to modifying calendar when user security information is equal to row security information col… ▪ discloses an onscreen interactive display with a selection and comparison section for a plurality of carriers with a… ▪ teaches the user can select individual event categories andor subdivisions for display in… | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||
| 19 | JP2009282618A (Nobuhei Hashiguchi, 2009) | (Original Assignee) Marubeni Corp; 丸紅株式会社 | 電子広告配信システム及び方法 | ▪ executable instruction, computer executable instruction ≈ 信手段 ▪ selected answers ≈ ユーザ | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||||
| 20 | US20090282107A1 (Patrick J. O'Sullivan, 2009) | (Original Assignee) International Business Machines Corp (Current Assignee) International Business Machines Corp | Adaptive Electronic Introductions | ▪ computer program product ≈ computer usable program code, computer program product ▪ networking system ≈ social networking ▪ readable instruction ≈ searching data | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||||
| 21 | US20090199196A1 (Zahur Peracha, 2009) | (Original Assignee) Computer Associates Think Inc (Current Assignee) CA Inc | Automatic baselining of resource consumption for transactions | ▪ data processing system, data processing system having one ≈ network bandwidth ▪ match servers ≈ indicates one ▪ next polling question ≈ time window ▪ user profiles ≈ data usage ▪ user information ≈ using one | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ teaches distributing HTML formatted documents by email specifically when viewing the HTML formatted documents over the… ▪ teaches a load monitoring condition determination method for determining a load monitoring condition for performing… ▪ discloses wherein the means for aggregating the operational metric from the plurality of members to form the uni ed… ▪ teaches using a threshold value for an item being monitored… | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||||||||
| 22 | JP2009134520A (Mitsugi Miura, 2009) | (Original Assignee) Nec Corp; 日本電気株式会社 | ソーシャルネットワーク表示システム、方法、及びプログラム | ▪ next polling, data processing system ≈ コンピュ, するとき ▪ instruction means ≈ 選択命令 ▪ computer having one ≈ Ｍｅｔｈ | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||||||
| 23 | CN101553816A (镰田富久, 2009) | (Original Assignee) 株式会社爱可信 | 信息显示装置、信息显示程序以及信息显示系统 | ▪ first polling question ≈ 其将多个 ▪ computer having one ≈ 根据上述 | X | X | X | X | X | X | |||||||||||||||||||||||
| 24 | US20080081701A1 (Brian Shuster, 2008) | (Original Assignee) Shuster Brian M (Current Assignee) Pfaqutruma Research LLC | Virtual environment for computer game | ▪ net polling question ≈ identifying information ▪ readable medium ≈ have attributes ▪ instruction means ≈ first game | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) | ▪ discloses a gaming system that provides profile information to multiple users over a network… ▪ teaches a video game messaging system where a network server periodically updates a user s buddy list to reflect… ▪ teaches setting a state of said agent in said electronic system to absent state in response to sending the agent… ▪ discloses that the importingexporting transfer process may be performed on a computer or apparatus either locally or… | X | X | X | X | X | X | X | X | |||||||||||||||||||
| 25 | JP2009070156A (Keisuke Kaneyasu, 2009) | (Original Assignee) Ntt Docomo Inc; 株式会社エヌ・ティ・ティ・ドコモ | Information search system and information search method | ▪ receiving user information ≈ calculation ▪ user information ≈ データ | X | X | X | ||||||||||||||||||||||||||
| 26 | JP2009069899A (Takashi Nakajima, 2009) | (Original Assignee) Ricoh Co Ltd; 株式会社リコー | Object document creation system | ▪ web server, match server ≈ クライアント ▪ user information ≈ データ | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||
| 27 | WO2008024349A2 (Phil Gelber, 2008) | (Original Assignee) Wms Gaming Inc. | Automated remote configuration of wagering game machines | ▪ executable instruction ≈ executable instruction ▪ readable medium ≈ readable medium ▪ net polling question ≈ gaming machine ▪ user information ≈ using one | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ teaches determining whether a player has satisfied at least one criterion includes determining whether the player has… ▪ teaches a system for configuring gaming machines according to player gaming preferences… ▪ discloses that altering the main or bonus games require the same steps and are therefore analogous… ▪ discloses a player tracking and accounting system that uses magnetic cards to provide player identification and access… | X | X | X | X | |||||||||||||||||||||||
| 28 | US20090027392A1 (Apurva Rameshchandra Jadhav, 2009) | (Original Assignee) Yahoo Inc (Current Assignee) R2 Solutions LLC ; Altaba Inc | Connection sub-graphs in entity relationship graphs | ▪ readable medium ≈ readable medium ▪ m rows ≈ one candidate | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ teaches these methods to automatically match chat room users in realtime… ▪ discloses wherein the digital rights information is a pointer to link a user to a property rights database… ▪ teaches wherein the identifiers are social networking user identifiers each associated with a node on the… ▪ discloses providing job and recruitment services provided via the… | X | X | X | X | X | X | |||||||||||||||||||||
| 29 | US20080313000A1 (Melania Degeratu, 2008) | (Original Assignee) International Business Machines Corp (Current Assignee) International Business Machines Corp | System and method for facilitating skill gap analysis and remediation based on tag analytics | ▪ executable instruction, readable instruction ≈ textual information ▪ networking system ≈ social networking ▪ computer having one ≈ management system | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) | ▪ discloses a system for matching people for various purposes in an enterprise… ▪ teaches the search interface and affinity engine for generating a list of similar users and displaying an identifier… ▪ discloses the system said storage device further storing instructions adapted to be executed by said processor to track… ▪ discloses using public and private social networking derived information… | X | X | X | X | X | X | X | X | X | X | |||||||||||||||||
| 30 | US20080288599A1 (Michael Kutchmark, 2008) | (Original Assignee) PNC Financial Services Group Inc (Current Assignee) PNC Financial Services Group Inc | Apparatus, systems and methods for transformation services | ▪ user profiles ≈ access rights ▪ web server ≈ web server | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ discloses all subject matter of the claimed invention as discussed above with respect to claim… ▪ teaches a system for data distribution using peers to act as relays… ▪ teaches creating an atomic message unit consisting of a complete sequence of messaging bytes containing a peer… ▪ teaches popular content holds more weight and tends to be replicated more often… | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||||||||
| 31 | CN101496051A (T·K·H·格瑞派尔, 2009) | (Original Assignee) 微软公司 | 带有部分信息的玩家排名 | ▪ receiving user information ≈ 包括接收 ▪ first polling question ≈ 一个的 | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ discloses using email in gaming systems for communications between remote gaming machines and the administrator… ▪ teaches returning an error code alarm upon determining best matching array element exists… ▪ teaches a method for providing historical performance data… ▪ teaches that searches can be formed to find the exact matches greater than or less than searches objective function… | X | X | X | X | X | X | |||||||||||||||||||||
| 32 | CN101055580A (车完奎, 2007) | (Original Assignee) Lg电子株式会社 | 用于检索文档的系统、方法及用户接口 | ▪ first polling ≈ 通过检 ▪ net polling question ≈ 网络连 | X | X | X | X | X | X | |||||||||||||||||||||||
| 33 | US20090138817A1 (Ofir Oron, 2009) | (Original Assignee) Dolphin Software Ltd (Current Assignee) Dolphin Software Ltd | Efficient display systems and methods | ▪ computer program product ≈ computer program product ▪ receiving match commands to identify users ≈ configured to store ▪ user information ≈ said database ▪ readable instruction ≈ program code ▪ m rows ≈ same row | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||
| 34 | US20080172415A1 (Mark M. Fakhari, 2008) | (Original Assignee) Fakhari Mark M; Manoj Ramnani | System and method of matching candidates and employers | ▪ user profiles, match percentage ≈ profile information, profile data ▪ net polling question ≈ key position | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ teaches these methods to automatically match chat room users in realtime… ▪ discloses wherein the digital rights information is a pointer to link a user to a property rights database… ▪ teaches wherein the identifiers are social networking user identifiers each associated with a node on the… ▪ discloses providing job and recruitment services provided via the… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||
| 35 | US20080168048A1 (Ronald S. Bell, 2008) | (Original Assignee) Yahoo Inc (Current Assignee) R2 Solutions LLC ; Altaba Inc | User content feeds from user storage devices to a public search engine | ▪ next polling questions ≈ said indication ▪ web server ≈ web server | X | X | X | X | X | X | X | X | X | ||||||||||||||||||||
| 36 | CN101395602A (P·W·兰西尔, 2009) | (Original Assignee) 亚马逊科技公司 | 用于分布式文件存储和索引服务的方法和装置 | ▪ web server ≈ 的至少一个部分 ▪ readable medium ≈ 的协调 ▪ first polling question ≈ 一个的 ▪ net polling question ≈ 对象中 | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) | ▪ teaches the commands including displaying a command window on a display of said first workstation and the second… ▪ teaches wherein the le information table and the organization table are separate see column… ▪ teaches disk imaging programs do not copy user data filebyfile but instead copy data clusterbycluster or… ▪ teaches wherein each segment is processed by a single thread to manage skew… | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||||||||
| 37 | US20080086387A1 (Dara O'Rourke, 2008) | (Original Assignee) University of California (Current Assignee) University of California | Information-delivery system and method and applications employing same | ▪ user profiles, match server ≈ user profile ▪ user information ≈ using one ▪ computer program product, computer program product comprising computer ≈ bar code | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ discloses use of product viewing histories of users to identify related products… ▪ teaches a receiving user rating information b gathering accumulated user rating information c calculating an overall… ▪ discloses content personalization based on actions performed during a current browsing session… ▪ teaches the method and system wherein validating a particular user event parameter comprises if the particular user… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||
| 38 | JP2008090560A (Tatsumi Mashita, 2008) | (Original Assignee) Nomura Research Institute Ltd; 株式会社野村総合研究所 | Post processing device | ▪ web server, match server ≈ クライアント ▪ executable instruction ≈ 前記コマンド ▪ networking system, data processing system ≈ 保持部と, apparatus ▪ next polling questions ≈ するとき ▪ minimum match percentage ≈ 前記第１ ▪ receiving user information ≈ データ送 ▪ other users ≈ other users | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||
| 39 | US20080065481A1 (Nicole S. Immorlica, 2008) | (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC | User-associated, interactive advertising monetization | ▪ match server ≈ computer readable medium ▪ user information ≈ user information ▪ computer program product comprising computer ≈ thereon computer | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ teaches the news release include promotional information page… ▪ discloses selecting a media output device via which to deliver a targeted advertisement see… ▪ teaches inserting advertisements to be displayed on the screen when the games are being played… ▪ discloses a method for determining an advertisement to provide during an advertising opportunity as in… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||
| 40 | JP2007334502A (Arihito Asai, 2007) | (Original Assignee) Fujifilm Corp; 富士フイルム株式会社 | Search device, method and program | ▪ next polling, data processing system ≈ コンピュ ▪ minimum match percentage ≈ 前記第１ ▪ receiving user information ≈ calculation ▪ selected answers ≈ ユーザ | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||
| 41 | JP2007323561A (Rina Nobuto, 2007) | (Original Assignee) Nec Corp; 日本電気株式会社 | Document collaboration history management system, mail system, and document collaboration history management method | ▪ next polling, data processing system ≈ コンピュ ▪ minimum match percentage ≈ 前記第１ ▪ user information ≈ References ▪ executable instruction, computer executable instruction ≈ 信手段 | X | X | X | X | X | X | X | X | X | ||||||||||||||||||||
| 42 | CN101278257A (A·芒茨, 2008) | (Original Assignee) 奈特希尔公司 | 用于分布式社区发现的方法和装置 | ▪ receiving user information ≈ 包括接收, 接收消息 ▪ net polling question ≈ 的强度 | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) | ▪ discloses comparing documents using probabilistic latent semantic analysis A person of ordinary skill in the art at the… ▪ discloses initiating a percolation message from a source node of a linked network comprising a percolation probability… ▪ teaches the method for creating and trading a content based financial instrument of claim… ▪ teaches calculating a weight for each of the one or more associations and storing the weight with each of the one or… | X | X | X | X | |||||||||||||||||||||||
| 43 | JP2007265282A (Masahiro Inose, 2007) | (Original Assignee) Nec Corp; Nec Soft Ltd; Ｎｅｃソフト株式会社; 日本電気株式会社 | 情報検索システム、端末、サーバ、プログラム、及び記録媒体 | ▪ next polling, data processing system ≈ コンピュ ▪ maximum number ≈ スポット ▪ user information ≈ データ ▪ selected answer ≈ 登録者 | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||
| 44 | JP2007233875A (Tatsumi Mashita, 2007) | (Original Assignee) Nomura Research Institute Ltd; 株式会社野村総合研究所 | 投稿処理装置 | ▪ next polling questions ≈ するとき ▪ receiving user information ≈ データ送 | X | X | X | X | X | X | |||||||||||||||||||||||
| 45 | JP2007233438A (Mitsuaki Morimoto, 2007) | (Original Assignee) Dainippon Printing Co Ltd; 大日本印刷株式会社 | トレンド解析サーバおよびトレンド解析方法 | ▪ next polling questions ≈ するとき ▪ minimum match percentage ≈ 前記第１ | X | X | X | X | X | X | |||||||||||||||||||||||
| 46 | US20060143236A1 (Michael Wu, 2006) | (Original Assignee) Bandwidth Productions Inc (Current Assignee) Concert Technology Corp | Interactive music playlist sharing system and methods | ▪ match server ≈ computer readable medium ▪ instruction means ≈ readable medium storing ▪ data processing system ≈ data processing system, real time ▪ networking system ≈ social networking ▪ user information ≈ user information ▪ web server ≈ web server ▪ computer program product, computer program product comprising computer ≈ bar code | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) | ▪ discloses an identification being the identification of the control data structure column… ▪ teaches of wherein the control data structure is written to a specific area of the data storage medium designated to… ▪ discloses a DVDRAM image recording medium for use in an image recorder for recording television broadcast programs and… ▪ teaches a data management method for recorded programs stored on a digital recording device said method comprising… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||
| 47 | US7668857B2 (Jonathan Michael Cook, 2010) | (Original Assignee) International Business Machines Corp (Current Assignee) Twitter Inc | Meta-data tags used to describe data behaviors | ▪ computer program product ≈ computer program product ▪ data processing system ≈ data processing system ▪ readable instruction ≈ program code | X | X | X | X | X | X | X | X | X | X | |||||||||||||||||||
| 48 | US20080098454A1 (Soon Toh, 2008) | (Original Assignee) Toh Soon S | Network Management Appliance | ▪ computer program product comprising computer ≈ thereon computer ▪ web server ≈ web server | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) | ▪ discloses substantial features of the invention as above he does not explicitly disclose the additional recited feature… ▪ discloses as his invention a method for managing a network using a network management appliance which provides appliance… ▪ discloses measuring parameters such as data throughput by using the ping test… ▪ teaches the authentication requesting terminal according to claim… | X | X | X | X | X | X | |||||||||||||||||||||
| 49 | US20070100829A1 (J. Allen, 2007) | (Original Assignee) eCollege com (Current Assignee) eCollege com | Content manager system and method | ▪ computer having one ≈ management system ▪ next polling questions ≈ content delivery ▪ readable medium ≈ readable medium ▪ m rows ≈ low system | X | X | X | X | X | X | X | X | X | X | |||||||||||||||||||
| 50 | JP2007094551A (Takashi Fujimura, 2007) | (Original Assignee) Nippon Telegr & Teleph Corp <Ntt>; 日本電信電話株式会社 | コミュニティ管理装置、記事管理装置、コミュニティ管理方法、記事管理方法、及びプログラム | ▪ next polling, data processing system ≈ コンピュ ▪ selected answer ≈ 情報要求 ▪ executable instruction, computer executable instruction ≈ 信手段 | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||||
| 51 | JP2007072523A (Junko Murakami, 2007) | (Original Assignee) Fuji Xerox Co Ltd; 富士ゼロックス株式会社 | 協調作業場作成支援のためのプログラム、方法及び装置 | ▪ user information ≈ インタフェース ▪ readable instruction, instruction means ≈ の指示 | X | X | X | X | X | X | X | X | X | ||||||||||||||||||||
| 52 | US20070022174A1 (Alfredo Issa, 2007) | (Original Assignee) FlashPoint Technology Inc; Qurio Holdings Inc (Current Assignee) Qurio Holdings Inc | Syndication feeds for peer computer devices and peer networks | ▪ match server ≈ computer readable medium ▪ executable instruction, computer executable instruction ≈ web browser | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ discloses the system for electronically exchanging messages of claim… ▪ discloses the indicator shows the user the current online or offline status of the peer that stores and publishes the… ▪ discloses web feed contents are published over a network obtaining by the computing device presence data describing an… ▪ teaches a coverage state detector for determining the coverage state of the wireless device see paragraph… | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||
| 53 | US20080256070A1 (Stuart John Inglis, 2008) | (Original Assignee) Reel Two Ltd (Current Assignee) REAL TIME GENOMICS Ltd | Data Collection Cataloguing and Searching Method and System | ▪ computer executable instruction ≈ computer executable instruction ▪ match server ≈ computer readable medium ▪ maximum number ≈ maximum number | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ discloses wherein said base hierarchical data structure is included in global data that is mapped from local data stored… ▪ discloses a method and apparatus for facilitating and controlling a buyer driven market where prospective buyers of… ▪ teaches a method for determining assignees related by common cited references with a source patent portfolio… ▪ discloses wherein the program stored by the encoding device comprises instructions to enforce the following rules when… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||||
| 54 | US20050278703A1 (Kevin Lo, 2005) | (Original Assignee) K5 Systems Inc (Current Assignee) K5 Systems Inc | Method for using statistical analysis to monitor and analyze performance of new network infrastructure or software applications for deployment thereof | ▪ match percentage ≈ standard deviation ▪ match servers ≈ expected behavior | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ discloses one or more interfaces to one or more communications channels that may include one or more interfaces to user… ▪ discloses wherein the digital rights information is a pointer to link a user to a property rights database… ▪ teaches wherein the second set of application programming interfaces comprises a… ▪ discloses A client session s time stamp is updated each time a message transaction containing the session id for the… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||
| 55 | US20060256074A1 (David Krum, 2006) | (Original Assignee) Robert Bosch GmbH (Current Assignee) Robert Bosch GmbH | Sensor-initiated exchange of information between devices | ▪ executable instruction ≈ executable instruction ▪ readable medium ≈ readable medium | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) | ▪ discloses using an accelerometer to asses the throwing motion but does not disclose determining the direction via the… ▪ discloses that the direction can be assessed via an accelerometer and gyroscopes paragraph… ▪ teaches a presentation state that includes a presentation and other information is synchronized between one or more… ▪ discloses a user device comprising a display disposed at a front side of the user device see gure… | X | ||||||||||||||||||||||||||
| 56 | US7647312B2 (James Dai, 2010) | (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC | System and method for automatic generation of suggested inline search terms | ▪ instruction means ≈ computational resources ▪ maximum number ≈ search service ▪ user profiles, match server ≈ user profile, usage data ▪ data processing system ≈ real time | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||
| 57 | US7593740B2 (Dennis P. Crowley, 2009) | (Original Assignee) Google LLC (Current Assignee) Google LLC | Location-based social software for mobile devices | ▪ receiving user information ≈ particular relationship ▪ readable medium ≈ readable medium ▪ computer program product, computer to perform operations ≈ location info ▪ user profiles ≈ user location | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||||
| 58 | US20060242014A1 (Charles Marshall, 2006) | (Original Assignee) Marshall Charles T; James Fan | Contacts networking technology | ▪ networking system ≈ networking system ▪ data processing system ≈ real time | X | X | X | X | X | X | X | X | X | ||||||||||||||||||||
| 59 | US20050278325A1 (Rada Mihalcea, 2005) | (Original Assignee) University of North Texas (Current Assignee) University of North Texas | Graph-based ranking algorithms for text processing | ▪ next polling questions ≈ visual indication ▪ m rows ≈ selected number ▪ first polling, first polling question ≈ reverse order | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) | ▪ discloses a natural language translation system for a humancomputer interface column… ▪ teaches a method and system for extracting words from a big group of words… ▪ discloses the above limitation but does not expressly teach wherein at least some of the correspondences between the… ▪ teaches the use of a text editor including a language editor and a graphics editor for constraining an authored text… | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||||||||
| 60 | US20050222931A1 (Jean-Claude Mamou, 2005) | (Original Assignee) Ascential Software Corp (Current Assignee) International Business Machines Corp | Real time data integration services for financial information data integration | ▪ computer program product comprising computer ≈ transformation function ▪ match percentage, minimum match percentage ≈ mapping function ▪ data processing system ≈ real time | X | X | X | X | X | X | X | X | X | X | |||||||||||||||||||
| 61 | JP2006227965A (Ikumi Fukuda, 2006) | (Original Assignee) Dainippon Printing Co Ltd; 大日本印刷株式会社 | Trend prediction apparatus and trend prediction method | ▪ first polling question ≈ collecting step ▪ networking system, data processing system ≈ apparatus | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||||
| 62 | US7310676B2 (Julian J. Bourne, 2007) | (Original Assignee) Proxpro Inc (Current Assignee) OL Security LLC | Method and computer system for matching mobile device users for business and social networking | ▪ net polling question ≈ identifying information ▪ web server ≈ World Wide Web ▪ user profiles ≈ profile data ▪ next polling question ≈ time window | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||||||||||
| 63 | JP2006107385A (Shinji Abe, 2006) | (Original Assignee) Nippon Telegr & Teleph Corp <Ntt>; 日本電信電話株式会社 | Posted article extraction method, apparatus, and program | ▪ next polling, data processing system ≈ コンピュ, apparatus ▪ total number ≈ total number ▪ selected answers ≈ ２次元, ユーザ | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||
| 64 | JP2006092074A (Takaaki Kashiwagi, 2006) | (Original Assignee) Fuji Xerox Co Ltd; 富士ゼロックス株式会社 | Attached document processing computer program and attached document processing apparatus and method | ▪ next polling, data processing system ≈ コンピュ, apparatus ▪ web server ≈ ブラウザ ▪ other users ≈ Web browser ▪ user information ≈ データ | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||||||
| 65 | US20050159970A1 (Orkut Buyukkokten, 2005) | (Original Assignee) Google LLC (Current Assignee) Google LLC | Methods and systems for the display and navigation of a social network | ▪ minimum match ≈ popularity data ▪ user profiles, match server ≈ first profile, user profile ▪ match aggregator ≈ shortest path ▪ readable instruction ≈ program code | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ discloses searching to find persons who have experience with the subject matter associated with a given search string… ▪ teaches various entities represented by nodes of the graph data structure have varying types to include a person a… ▪ discloses providing availability indicators for users found matching a search criteria and not belonging to a user s… ▪ discloses an interactive electronic representation of a page of a publicationbroadcast or of a photographic scene and… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||
| 66 | US20060010467A1 (Jonathan Segel, 2006) | (Original Assignee) Alcatel SA (Current Assignee) Alcatel Lucent SAS | Personalized video entertainment system | ▪ maximum number ≈ controlling delivery ▪ match servers ≈ genetic algorithm ▪ next polling questions ≈ selection button ▪ instruction means ≈ local data | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) | ▪ discloses the methodology for determining the cost of a targeted advertising campaign… ▪ discloses video document may be divided into segments each including ad spots… ▪ teaches the content includes a plurality of advertisements… ▪ teaches online tagging for articles ranking them by frequency and monitoring thresholds for better indexing and… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||||
| 67 | US20060009994A1 (Tad Hogg, 2006) | (Original Assignee) Hewlett Packard Development Co LP (Current Assignee) Hewlett Packard Development Co LP | System and method for reputation rating | ▪ readable instruction ≈ program code ▪ user information ≈ line network | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) | ▪ discloses a picture information displaying method for displaying on a display picture the information pertinent to… ▪ teaches wherein the various entities represented by nodes of the graph data structure have varying types to include a… ▪ discloses A method for matching and introducing users comprising determining that a first user and a second user are… ▪ discloses searching to find persons who have experience with the subject matter associated with a given search string… | X | X | X | ||||||||||||||||||||||||
| 68 | US20040243640A1 (Mark Bostleman, 2004) | (Original Assignee) MICRANAS SEMICONDUCTORS Inc; Micronas Semiconductors Inc (Current Assignee) MICRANAS SEMICONDUCTORS Inc ; Micronas Semiconductors Inc | System and method for providing selective data access and workflow in a network environment | ▪ executable instruction ≈ executable instruction ▪ readable medium ≈ readable medium ▪ user information ≈ desired amount ▪ receiving user information ≈ central server | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) | ▪ discloses that intranet internet protocol address is assigned to the first user from a plurality of intranet internet… ▪ teaches a nurse ie project manager sending a request to the lab which is run by lab technicians ie action implementer… ▪ discloses customization of user information within a social network wherein social network users are placed into… ▪ teaches a social content publication hierarchy wherein users may determine whether to send and receive information… | X | X | X | ||||||||||||||||||||||||
| 69 | US20040243607A1 (Venkat Tummalapalli, 2004) | (Original Assignee) Tummalapalli Venkat Ranga Reddy | Multidimensional repositories for problem discovery and capacity planning of database applications | ▪ match server ≈ computer readable medium ▪ instruction means ≈ comprises instructions ▪ executable instruction ≈ particular view ▪ match servers ≈ server system | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ discloses one or more interfaces to one or more communications channels that may include one or more interfaces to user… ▪ discloses an integration apparatus wherein the identifying manager device is further configured to provide an address… ▪ teaches of the configuration policy defines the application and the parameters needed to integrate a device for… ▪ teaches storing the record with a header before the mapping information in the memory mapped file… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||
| 70 | JP2005338979A (Satoru Chikaraishi, 2005) | (Original Assignee) Nippon Telegr & Teleph Corp <Ntt>; 日本電信電話株式会社 | ライセンス発行管理方法、装置、プログラムおよび同プログラムを記録した記録媒体 | ▪ web server, match server ≈ サーバ装置 ▪ next polling, data processing system ≈ コンピュ | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||||||
| 71 | US20050015432A1 (Hunter Cohen, 2005) | (Original Assignee) Cohen Hunter C. | Deriving contact information from emails | ▪ user information ≈ said database ▪ next polling question ≈ said users | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) | ▪ discloses checking said received email for authentication and integrity wherein authentication entails verifying that… ▪ teaches a method comprising receiving via a network a request to scan an electronic message prior to opening the… ▪ discloses verifying an association between a sender and at least one of trademarks service marks copyrighted data sounds… ▪ teaches the computerreadable nontransitory storage medium of claim… | X | X | X | X | X | X | |||||||||||||||||||||
| 72 | US7624160B2 (Roderick Charles Henderson, 2009) | (Original Assignee) International Business Machines Corp (Current Assignee) Snap Inc | Methods, systems, and computer program products for client side prefetching and caching of portlets | ▪ computer program product ≈ computer program product ▪ receiving match commands to identify users ≈ configured to store ▪ readable instruction ≈ program code ▪ executable instruction, computer executable instruction ≈ web browser ▪ data processing system ≈ other port ▪ match commands ≈ HTML page | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||||
| 73 | US20040167984A1 (Conrad Herrmann, 2004) | (Original Assignee) Zone Labs Inc (Current Assignee) Check Point Software Technologies Inc | System Providing Methodology for Access Control with Cooperative Enforcement | ▪ executable instruction ≈ executable instruction ▪ match aggregator, match servers ≈ collecting step ▪ readable medium ≈ readable medium ▪ computer having one ≈ security engine | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ teaches such a limitation wherein said interpreting data access privileges relating to users and services includes… ▪ discloses encoding content for conversion into visionenabled content… ▪ teaches a unique identification code for a device a group of N devices a set identification code and a corresponding… ▪ teaches storing shipping information and displaying the shipping information on the updateable electronic display… | X | X | X | X | X | X | X | ||||||||||||||||||||
| 74 | US20040162901A1 (Krishna Mangipudi, 2004) | (Original Assignee) Krishna Mangipudi; Vijay Basani | Method and apparatus for policy based class service and adaptive service level management within the context of an internet and intranet | ▪ match aggregator ≈ collect information ▪ web server ≈ web server | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ discloses monitoring several servers and their attributes and providing feedback associated with the server attributes… ▪ teaches that responds quickly to one of the messages and that has a small of connections in its connection table… ▪ discloses various different methodologies may be employed to provide downstream suballocations of bandwidth… ▪ teaches the load balancer management service is implemented as a… | X | X | X | X | X | X | |||||||||||||||||||||
| 75 | US7340477B1 (Douglas Marshall Tolbert, 2008) | (Original Assignee) Unisys Corp (Current Assignee) Unisys Corp | Method and system for a telemetry warehouse for storing, retrieving and analyzing data | ▪ computer executable instruction, computer program product ≈ storing computer program ▪ match server ≈ multiple dimension | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ discloses that deletion of a model can only be done by the owner who will have an owner identification… ▪ discloses the method machine and computer readable medium of claim… ▪ teaches the invention substantially as claimed as noted above… ▪ teaches receiving a request to decommission a simulation model associated with said performance data wherein said… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||
| 76 | US20050022207A1 (Genady Grabarnik, 2005) | (Original Assignee) International Business Machines Corp (Current Assignee) Facebook Inc | Methods and apparatus for creation of parsing rules | ▪ computer program product comprising computer ≈ machine readable medium ▪ first polling, first polling question ≈ more gene | X | X | X | X | X | X | |||||||||||||||||||||||
| 77 | JP2004362118A (Masafumi Eguchi, 2004) | (Original Assignee) Murata Mach Ltd; 村田機械株式会社 | 電子掲示板機能を備えたサーバ装置 | ▪ web server, match server ≈ サーバ装置 ▪ user information ≈ データ | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||
| 78 | JP2004318404A (Takao Miura, 2004) | (Original Assignee) Nec Corp; 日本電気株式会社 | 記事配信方法／プログラム／記録媒体／サーバ／端末／システム | ▪ next polling, data processing system ≈ コンピュ, 有する方 ▪ minimum match percentage ≈ 前記第１ ▪ computer executable instruction ≈ 読み取り ▪ computer to perform operations ≈ 該端末 | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||||
| 79 | US20030192031A1 (Sriram Srinivasan, 2003) | (Original Assignee) BEA Systems Inc (Current Assignee) Oracle International Corp | Systems and methods for application deployment | ▪ computer program product ≈ computer program product ▪ readable medium ≈ readable medium | X | X | X | X | X | X | X | X | X | ||||||||||||||||||||
| 80 | US7539697B1 (Prasad N. Akella, 2009) | (Original Assignee) Spoke Software (Current Assignee) Spoke Software | Creation and maintenance of social relationship network graphs | ▪ executable instruction ≈ executable instruction ▪ first polling ≈ electronic document ▪ user profiles ≈ usage data | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ teaches that this present invention relates to query processing and more specifically relates to techniques for… ▪ discloses the method the system and the computer readable medium according to claim… ▪ discloses receiving search term form user matching term with search chronicle and providing result of the search… ▪ teaches providing contextual information on communication devices… | X | X | X | X | X | X | |||||||||||||||||||||
| 81 | JP2004178072A (Takashi Nishi, 2004) | (Original Assignee) Oki Electric Ind Co Ltd; 沖電気工業株式会社 | Web page update notification method and apparatus | ▪ computer having one ≈ includes means ▪ networking system, data processing system ≈ apparatus | X | X | X | X | X | X | X | X | X | X | |||||||||||||||||||
| 82 | US7013290B2 (John Allen Ananian, 2006) | (Original Assignee) Haven Networks Inc (Current Assignee) Havenomics LLC | Personalized interactive digital catalog profiling | ▪ match servers ≈ demographic information ▪ next polling ≈ reference set ▪ user profiles, match server ≈ user profile ▪ data processing system, data processing system having one ≈ RFID signals ▪ web server ≈ end users | X | X | X | X | X | X | X | X | X | X | |||||||||||||||||||
| 83 | US20030034905A1 (Richard Anton, 2003) | (Original Assignee) Cyber Operations LLC (Current Assignee) Cyber Operations Inc | System and method for encoding and decoding data files | ▪ executable instruction, computer executable instruction ≈ executable instruction, web browser ▪ next polling question ≈ second compression ▪ readable medium ≈ readable medium ▪ computer program product comprising computer ≈ desired order | X | X | X | X | |||||||||||||||||||||||||
| 84 | US20030187813A1 (Neal Goldman, 2003) | (Original Assignee) Capital IQ Inc (Current Assignee) Capital IQ Inc | System and method for identifying relationship paths to a target entity | ▪ m rows, computer program product ≈ said platform ▪ match aggregator ≈ shortest path | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||
| 85 | US20030135565A1 (Julio Estrada, 2003) | (Original Assignee) KUBI SOFTWARE Inc (Current Assignee) KUBI SOFTWARE Inc | Electronic mail application with integrated collaborative space management | ▪ executable instruction, readable instruction ≈ textual information, data contents ▪ web server ≈ client terminals ▪ receiving user information ≈ central server ▪ n bytes ≈ mail server ▪ total number, maximum number ≈ task list | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ teaches a method of enhancing performance of a recipient s graphical user interface that displays information… ▪ teaches explicitly receiving from the computing device a time stamp that represents a time at which the user name was… ▪ teaches the information processing method as set forth in claim… ▪ teaches the invention substantially as claimed including document delivery architecture dynamically generates a… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||
| 86 | JP2003256323A (Takao Mori, 2003) | (Original Assignee) Fujitsu Ltd; 富士通株式会社 | サービス統合システム、サービス統合装置、およびサービス統合プログラム | ▪ next polling, data processing system ≈ コンピュ ▪ user information ≈ データ | X | X | X | X | X | X | |||||||||||||||||||||||
| 87 | US20020156756A1 (Robert Stanley, 2002) | (Original Assignee) BIOSENTIENTS Inc (Current Assignee) BIOSENTIENTS Inc | Intelligent molecular object data structure and method for application in heterogeneous data environments with high data density and dynamic application needs | ▪ networking system ≈ local computing environment ▪ total number ≈ Management System ▪ computer program product, computer to perform operations ≈ location info, analysis process ▪ next polling question ≈ on technology ▪ n bytes ≈ entire data ▪ m rows ≈ n layers | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ discloses wherein the program stored by the encoding device comprises instructions to enforce the following rules when… ▪ discloses delete action identi er such as cascade delete delete set null as well as nullity columns delete as claimed… ▪ discloses that switching includes switching between at least a tabular and a graphic format col… ▪ discloses various aspects of the invention can readily applied to other types of websites including intranet sites and… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||||
| 88 | JP2003141152A (Yoshihiro Ishihara, 2003) | (Original Assignee) Ntt Data Corp; 株式会社エヌ・ティ・ティ・データ | Information distribution server, information distribution method | ▪ minimum match percentage ≈ 前記第１ ▪ user information ≈ データ ▪ selected answers ≈ ユーザ | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||
| 89 | US20030182656A1 (Burton Leathers, 2003) | (Original Assignee) Cognos Inc (Current Assignee) International Business Machines Corp | Deployment manager for organizing and deploying an application in a distributed computing environment | ▪ computer executable instruction ≈ specifying information ▪ executable instruction ≈ existing application ▪ match commands ≈ HTML page | X | X | X | X | |||||||||||||||||||||||||
| 90 | US20030041198A1 (Scott Exton, 2003) | (Original Assignee) International Business Machines Corp (Current Assignee) International Business Machines Corp | Authorization model for administration | ▪ match server ≈ computer readable medium ▪ computer program product ≈ computer program product ▪ instruction means ≈ first permission | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ discloses the storage system is part of an access control system see… ▪ teaches a system of dividing user access into domains roles and using those domains to be associated with resource… ▪ teaches that the bank develops data including the sum date and effective period into a token preparation date the… ▪ teaches defining a resource manager in the content management system and associating with the resource manager the… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||
| 91 | US20020029296A1 (Ed Anuff, 2002) | (Original Assignee) Ed Anuff; Taylor John Dean; Miles Chaston; Macleod David; Peter Leiser; Oliver Muoto; Seth Ladygo; Brian Slesinsky; Terry Joyce (Current Assignee) Vignette Corp | Portal server that provides a customizable user interface for access to computer networks | ▪ match servers ≈ server system ▪ readable instruction ≈ enables use ▪ web server ≈ end users | X | X | X | X | X | X | |||||||||||||||||||||||
| 92 | US20030018964A1 (James Fox, 2003) | (Original Assignee) International Business Machines Corp (Current Assignee) International Business Machines Corp | Object model and framework for installation of software packages using a distributed directory | ▪ computer program product ≈ computer program product ▪ readable instruction ≈ program code | X | X | X | X | X | X | X | X | X | ||||||||||||||||||||
| 93 | US20020194267A1 (Daniel Flesner, 2002) | (Original Assignee) Vignette Corp (Current Assignee) Vignette Corp | Portal server that provides modification of user interfaces for access to computer networks | ▪ match server ≈ computer readable medium ▪ computer program product ≈ computer program product | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||
| 94 | US20020181685A1 (Alan Doherty, 2002) | (Original Assignee) Bell Canada Inc (Current Assignee) Bell Canada Inc | Method and system for facilitating telecommunications service provisioning and service assurance | ▪ computer having one ≈ management system ▪ user profiles ≈ content provider ▪ web server ≈ electronic mail ▪ maximum number ≈ order n | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) | ▪ discloses a process for creating and for managing a trouble ticket according to claims… ▪ discloses formatting the customized advisory information to a presentation format based on the network device through… ▪ discloses providing the work order to the service technician via pager or email which can receive messages at any time… ▪ discloses the service provider is a computing module associated with a computerbased language and the customized… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||
| 95 | US6643653B1 (Winson Chu, 2003) | (Original Assignee) Oracle International Corp (Current Assignee) Oracle International Corp | Method and apparatus for identifying a data sequence related to a given data sequence | ▪ receiving match commands to identify users ≈ configured to store ▪ executable instruction ≈ memory location ▪ match commands ≈ key sequence ▪ readable medium ≈ said blocks | X | X | X | X | |||||||||||||||||||||||||
| 96 | US20020184165A1 (Timothy Deboer, 2002) | (Original Assignee) International Business Machines Corp (Current Assignee) Twitter Inc | Web browser-based object oriented application component test client | ▪ match server ≈ computer readable medium ▪ executable instruction ≈ executable instruction ▪ next polling questions ≈ said indication, further user ▪ next polling question ≈ client side | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||||||
| 97 | US6772146B2 (Sanjeev Khemlani, 2004) | (Original Assignee) JPMorgan Chase Bank NA (Current Assignee) JPMorgan Chase Bank NA ; JPMorgan Chase Bank NA | Website for financial information | ▪ next polling question ≈ said parameters ▪ user information ≈ said database | X | X | X | X | X | X | |||||||||||||||||||||||
| 98 | US20020059201A1 (James Work, 2002) | (Original Assignee) Work James Duncan | Method and apparatus for internet-based human network brokering | ▪ net polling question ≈ verification information ▪ instruction means ≈ control instructions ▪ user profiles, match percentage ≈ profile information, user profiles ▪ readable medium ≈ readable medium ▪ data processing system ≈ other port ▪ user information ≈ using one | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ teaches the method wherein the entities comprise businesses… ▪ teaches a method in which a network broker searches a user profiles database to look for matches against the criteria… ▪ discloses clients and potential clients A client would represent a direct connection between the user and the client and… ▪ discloses comparing third party information identifying content that is absent and incorporating the information into… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||
| 99 | US20020194262A1 (D. Jorgenson, 2002) | (Original Assignee) HP Inc (Current Assignee) Hewlett Packard Development Co LP | System and method for controlling the interruption and resumption of access to WWW pages requiring certain prerequisites | ▪ web server ≈ World Wide Web ▪ computer program product, computer to perform operations ≈ location info | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ discloses the method of sharing state information as set forth in claim… ▪ discloses browser tool could come handy for those who don t want to click through to another site for ancillary… ▪ discloses as soon as the user selects a product the shopping agent gathers price availability sales tax shipping costs… ▪ teaches a system for monitoring usage of an electronic device comprising a client component installed in a client… | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||
| 100 | US6643661B2 (Kathleen Riddell Polizzi, 2003) | (Original Assignee) Brio Software Inc (Current Assignee) Oracle International Corp | Method and apparatus for implementing search and channel features in an enterprise-wide computer system | ▪ receiving match commands to identify users ≈ configured to store ▪ next polling questions ≈ generated index ▪ match servers ≈ search server | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||||||||||
| 101 | JP2002297883A (守克 ▲廣▼瀬, 2002) | (Original Assignee) Fujitsu Ltd; 富士通株式会社 | 知識情報管理方法、知識情報生成方法、知識情報利用方法および知識情報管理装置 | ▪ next polling, data processing system ≈ コンピュ ▪ user information ≈ データ ▪ selected answers ≈ ユーザ | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) | ▪ teaches at least one message originating from at least one member of an enterprise eg in paragraph… ▪ teaches verifying the changes to the second record in the second database means for verifying the changes to the… ▪ discloses the querying including comparing a set of contents to be installed with a set of contents already installed… ▪ discloses the use of a bulletin board for team members to post anything that might be of interest to the team such as… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||
| 102 | JP2002288187A (Ryoichi Sato, 2002) | (Original Assignee) Sharp Corp; シャープ株式会社 | 情報蓄積システム、情報提示システム、電子メール配信システム、情報蓄積方法、情報提示方法、電子メール配信方法及び情報処理プログラムを記録した記録媒体 | ▪ next polling, data processing system ≈ コンピュ ▪ computer executable instruction, executable instruction ≈ 読み取り, 信手段 | X | X | X | X | X | ||||||||||||||||||||||||
| 103 | EP1139608A2 (Erik Anderlind, 2001) | (Original Assignee) Nokia of America Corp (Current Assignee) Nokia of America Corp | Method and system for subscriber-configurable communications service | ▪ user profiles ≈ data messages ▪ receiving user information ≈ wireless data | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ teaches a system for transmitting data as claimed in claim… ▪ teaches the email server is operating on the database created for the mobile and transmits the email by reference to… ▪ teaches a detection component coupled to the processor wherein the detection component comprises a sensor for… ▪ teaches transferring emails from a user home account to a wireless device… | X | X | X | X | X | X | |||||||||||||||||||||
| 104 | US20020026359A1 (Kenneth Long, 2002) | (Original Assignee) CLICK TACTICS Inc (Current Assignee) CLICK TACTICS Inc | Targeted advertising method and system | ▪ match commands ≈ communication port ▪ web server ≈ electronic mail ▪ match servers ≈ client access ▪ computer program product, computer program product comprising computer ≈ bar code ▪ maximum number ≈ order n | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ discloses a method for providing customized advertisement to mobile users based on their profile US… ▪ teaches the limitations as shown in the rejection of claim… ▪ teaches an online ordering system for printed products whereby the user can edit and customize the output with the… ▪ discloses the idea of a user selecting an electronic coupon and storing the electronic coupon on the user s computer col… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||
| 105 | JP2002244988A (Yoshihiro Masuda, 2002) | (Original Assignee) Fuji Xerox Co Ltd; 富士ゼロックス株式会社 | 協調作業支援システム | ▪ user information ≈ インタフェース ▪ executable instruction, computer executable instruction ≈ 信手段 ▪ next polling questions ≈ の機器 | X | X | X | X | X | X | |||||||||||||||||||||||
| 106 | US20020078377A1 (Ching-Jye Chang, 2002) | (Original Assignee) International Business Machines Corp (Current Assignee) Trend Micro Inc | Method and apparatus in an application framework system for providing a port and network hardware resource firewall for distributed applications | ▪ computer program product ≈ computer program product ▪ data processing system ≈ data processing system ▪ executable instruction ≈ fourth instruction ▪ computer having one ≈ second mean | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ discloses one or more interfaces to one or more communications channels that may include one or more interfaces to user… ▪ discloses wherein the digital rights information is a pointer to link a user to a property rights database… ▪ discloses the user enters the starting date and time and ending date and time the market performance management system… ▪ teaches an intranet based reporting system infrastructure col… | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||||
| 107 | US6892179B1 (Giorgos C. Zacharia, 2005) | (Original Assignee) Open Ratings Inc (Current Assignee) Open Ratings Inc | System and method for ascribing a reputation to an entity | ▪ match server ≈ computer readable medium ▪ computer program product ≈ computer program product | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ discloses content supplier for posting content using content supplier computer such as a PDA ie portable terminal… ▪ teaches a method that takes into account only ratings and reviews for products meeting a certain threshold… ▪ discloses a contents management method wherein the managing and the classifying of the contents comprises analyzing meta… ▪ discloses analyzing the meta data to perform classification and classifying the contents according to the analyzed meta… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||
| 108 | US6675159B1 (Albert Deirchow Lin, 2004) | (Original Assignee) Science Applications International Corp SAIC (Current Assignee) Leidos Inc | Concept-based search and retrieval system | ▪ match aggregator ≈ statistical distribution ▪ n bytes ≈ logical structure | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ discloses the parsing module structuring each such identified term in the one or more concepts into canonical concepts… ▪ teaches the nontransitory computerreadable medium of claim… ▪ teaches identifying the topic of a query by collecting attributes from the input query accessing the query topic… ▪ teaches one or more queries associated with each of multiple query categories eg col… | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||||||||
| 109 | US6687741B1 (Alan Ramaley, 2004) | (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC | Sending a file as a link and/or as an attachment | ▪ match server ≈ computer readable medium ▪ computer program product comprising computer ≈ thereon computer | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ teaches receiving an email at the user s PC host system via LAN… ▪ teaches the memory storing the status report for a predefined length of time after the status report is transmitted to… ▪ teaches a detection component coupled to the processor wherein the detection component comprises a sensor for… ▪ teaches the status report transmitted from the mobile unit to the user interface unit according to one of SMTP POP… | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||||||||
| 110 | US6327628B1 (Ed Anuff, 2001) | (Original Assignee) Epicentric Inc (Current Assignee) Open Text SA | Portal server that provides a customizable user Interface for access to computer networks | ▪ match server ≈ computer readable medium ▪ computer program product ≈ computer program product ▪ instruction means ≈ first permission | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||||
| 111 | US6820204B1 (Nimesh Desai, 2004) | (Original Assignee) Nimesh Desai; Sanjay Udani; James David Kimble, Jr.; Thomas P. Werges; David Dean Richardson; Jeffrey A. Gustafson (Current Assignee) ZKEY INVESTMENTS LLC | System and method for selective information exchange | ▪ user profiles ≈ user profile information, user profile data ▪ executable instruction, instruction means ≈ include instructions ▪ user information ≈ respective users, stored data | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ teaches a method of updating personal information files of correspondents of a user of a mobile communication device… ▪ teaches the procurement system initially saves the identification feature into a file on a local workstation of the… ▪ teaches one or more group media channels that are based in part on group associations and content… ▪ discloses the information exchange system wherein the users may selectively grant access to their own pro les to one or… | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||||
| 112 | US6389540B1 (Robert W. Scheifler, 2002) | (Original Assignee) Sun Microsystems Inc (Current Assignee) Sun Microsystems Inc | Stack based access control using code and executor identifiers | ▪ data processing system ≈ data processing system ▪ match commands ≈ requested action ▪ readable medium ≈ readable medium | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ teaches the target object implementing access authorization in association with implied permission to other interfaces… ▪ teaches a method a system and a computer readable storage medium storing instructions for controlling a computer… ▪ teaches wherein the permission information includes information regarding permissible actions to be performed by at… ▪ teaches the storage user request rental of the storage comprising various parameters… | X | X | X | X | |||||||||||||||||||||||
| 113 | JP2001202405A (Shoichi Hayashi, 2001) | (Original Assignee) Fuji Xerox Co Ltd; 富士ゼロックス株式会社 | タスク関与者間のコミュニケーション機能を有するプロジェクト管理装置およびプロジェクト管理方法 | ▪ next polling, data processing system ≈ コンピュ ▪ minimum match ≈ 自動生成 ▪ computer executable instruction ≈ 読み取り ▪ readable instruction, instruction means ≈ の指示 ▪ selected answers ≈ ユーザ | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||
| 114 | US7035825B1 (Reed Padi Maw Sturtevant, 2006) | (Original Assignee) E piphany Inc (Current Assignee) E piphany Inc | Managing relationships of parties interacting on a network | ▪ match server ≈ computer readable medium ▪ instruction means ≈ readable medium storing ▪ computer program product comprising computer ≈ communication medium ▪ user profiles ≈ user profiles ▪ executable instruction, computer executable instruction ≈ web browser ▪ web server ≈ web server | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||
| 115 | US6950943B1 (Hamid Bacha, 2005) | (Original Assignee) International Business Machines Corp (Current Assignee) International Business Machines Corp | System for electronic repository of data enforcing access control on data search and retrieval | ▪ computer program product ≈ computer program product ▪ first polling ≈ electronic document | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) | ▪ teaches a security monitoring apparatus based on access log wherein representation of the time of the most recent read… ▪ discloses a method and apparatus for providing network security which comprises… ▪ teaches a method of updating and changing source address figures… ▪ teaches providing each of the plurality of folders with a public or private indication the folders indicated as public… | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||
| 116 | US6546397B1 (Steven H. Rempell, 2003) | (Original Assignee) AKIRA TECHNOLOGIES Inc (Current Assignee) EXPRESS MOBILE Inc | Browser based web site generation tool and run time engine | ▪ first polling, first polling question ≈ more gene ▪ data processing system ≈ real time | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) | ▪ discloses a method for implementing interactive modification of spacing constraints of genealogical charts as in claim… ▪ teaches the computer readable storage media as recited in claim… ▪ teaches parameters of the object include a title and a location see at least col… ▪ teaches a position indicator of numerical coordinates XY coordinate system… | X | X | X | X | X | X | |||||||||||||||||||||
| 117 | US6466983B1 (Steven Paul Strazza, 2002) | (Original Assignee) Steven Paul Strazza (Current Assignee) Cuica LLC | Systems and methods for controlling access to data maintained in a repository | ▪ next polling questions, net polling question ≈ specific order ▪ match aggregator, match server ≈ more values, page table | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ teaches an information processing apparatus according to claim… ▪ discloses one or more interfaces to one or more communications channels that may include one or more interfaces to user… ▪ discloses that deletion of a model can only be done by the owner who will have an owner identification… ▪ teaches a general way to select master node by using quality indicator from each of the node and… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||
| 118 | US6594673B1 (Marc A. Smith, 2003) | (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC | Visualizations for collaborative information | ▪ match server ≈ computer readable medium ▪ instruction means ≈ numeric values | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ discloses indexing media content on the internet comprising a mediax file containing a hierarchy of metadata however… ▪ discloses further comprising the step of matching the one or more keywords with one or more computerized bulletin board… ▪ teaches the computer controlled user interactive display system of claim… ▪ teaches broadcast content over cellular telephones see abstract in which he teaches wherein the mobile communication… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||
| 119 | US20030097361A1 (Erwin S. Huang, 2003) | (Original Assignee) Dinh Truong T (Current Assignee) Dinh Truong T ; Magically Inc | Message center based desktop systems | ▪ computer program product ≈ computer program product ▪ receiving match commands to identify users ≈ configured to store | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ teaches the memory storing the status report for a predefined length of time after the status report is transmitted to… ▪ teaches a detection component coupled to the processor wherein the detection component comprises a sensor for… ▪ teaches a computer implemented method and corresponding system for recording a calendar entry comprising the… ▪ teaches a means for determining a position of the mobile unit see col… | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||||
| 120 | US6351741B1 (Steve L. Flenniken, 2002) | (Original Assignee) Adobe Systems Inc (Current Assignee) Adobe Inc | Method of locating a file linked to a document in a relocated document directory structure | ▪ match server ≈ computer readable medium ▪ computer program product ≈ computer program product ▪ instruction means ≈ comprises instructions | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |||||||||||
| 121 | US6058366A (Erik Tarkiainen, 2000) | (Original Assignee) Lernout and Hauspie Speech Products NV (Current Assignee) Nuance Communications Inc | Generic run-time engine for interfacing between applications and speech engines | ▪ data processing system, data processing system having one ≈ measurement information ▪ computer program product, computer program product comprising computer ≈ digital storage medium | ▪ 35 U.S.C. 103(a) | ▪ discloses a lexicongrammar storage unit for saving lexicon data and grammar data used for recognizing the voice data… | X | X | X | X | X | X | X | X | X | X | |||||||||||||||||
| 122 | US6353851B1 (Vinod Anupam, 2002) | (Original Assignee) Nokia of America Corp (Current Assignee) Nokia of America Corp ; Wsou Investments LLC | Method and apparatus for sharing asymmetric information and services in simultaneously viewed documents on a communication system | ▪ web server ≈ World Wide Web ▪ match servers ≈ server system ▪ computer having one ≈ second mean | X | X | X | X | X | X | X | ||||||||||||||||||||||
| 123 | US6453310B1 (Jason L. Zander, 2002) | (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC | Installable schema for low-overhead databases | ▪ executable instruction, computer executable instruction ≈ application code ▪ computer program product, computer program product comprising computer ≈ accessed data ▪ readable instruction ≈ program code | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ teaches wherein the data page comprises clustered index leaf pages… ▪ discloses wherein the data model includes a class meeting pattern analysis metric operable to allow a user to determine… ▪ discloses indexing media content on the internet comprising a mediax file containing a hierarchy of metadata however… ▪ discloses the claimed invention as detailed above in the previous paragraph… | X | X | X | X | X | X | X | X | X | X | |||||||||||||||||
| 124 | US6349302B1 (Yuki Aoyama, 2002) | (Original Assignee) Hitachi Ltd (Current Assignee) Hitachi Ltd | Document processing method and system, and computer-readable recording medium having document processing program recorded therein | ▪ computer program product ≈ readable recording medium ▪ computer to perform operations ≈ processing step | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ discloses that access rights can be individually assigned to files pages… ▪ discloses applying a hash function to a concatenation of said block identifier and an identifier of a respective one of… ▪ discloses storing a plurality of patient records in a database see… ▪ teaches all aspects of the claimed invention with regard to claims… | X | X | X | X | X | X | X | X | X | ||||||||||||||||||
| 125 | US6338086B1 (Pavel Curtis, 2002) | (Original Assignee) Placeware Inc (Current Assignee) Microsoft Technology Licensing LLC | Collaborative object architecture | ▪ match server ≈ computer readable medium ▪ next polling ≈ electronic systems ▪ match servers ≈ server system | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ discloses a system method apparatus and computerreadable medium for intermediating between multiple… ▪ teaches a similar control system wherein the external control device comprises a storage duration management device… ▪ teaches the utilization of metadata to accurately locate and retrieve data that is being requested col… ▪ discloses selecting the objects from the palette includes dragging the objects from the palette to the window ieThe… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||
| 126 | US6366923B1 (Cecilia Lenk, 2002) | (Original Assignee) Webivore Res LLC (Current Assignee) WEBIVORE RESEARCH LLC ; Webivore Res LLC | Gathering selected information from the world wide web | ▪ readable medium ≈ readable medium ▪ computer program product, computer to perform operations ≈ location info ▪ executable instruction, computer executable instruction ≈ web browser | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ discloses a networked personal contact manager title comprising address books for multiple users where users can link to… ▪ teaches displaying an email address as a unique string col… ▪ discloses wherein the data model includes a cohorts analysis metric operable to provide a flexible mechanism for… ▪ discloses a method of deleting object data from a relational database as discussed in claim… | X | X | X | X | X | X | X | X | X | X | |||||||||||||||||
| 127 | JPH1125288A (Toru Yamakita, 1999) | (Original Assignee) Casio Comput Co Ltd; カシオ計算機株式会社 | Cyberspace system and cyberspace construction method | ▪ readable instruction, instruction means ≈ の指示 ▪ data processing system, data processing system having one ≈ plurality | X | X | X | X | X | X | X | X | X | ||||||||||||||||||||
| 128 | WO9800787A1 (Manuel Zahariev, 1998) | (Original Assignee) Datalink Systems Corporation | Electronic mail system for receiving and forwarding e-mail messages based on subscriber supplied criteria | ▪ next polling ≈ e-mail messages ▪ n bytes ≈ mail server | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) | ▪ teaches that a detected spam email will be routed to a spam folder… ▪ discloses mutiplexing said rst sub lter with at least one remainder sub lter to create at least part of said ensemble… ▪ teaches generation of a unique email address for use in communicating with a web site as illustrated in… ▪ teaches wherein modifying the email based upon at least in part the first filter input further comprises modifying the… | X | X | X | X | X | X | X | X | X | ||||||||||||||||||
| 129 | US5845299A (Samir Arora, 1998) | (Original Assignee) Rae Tech LLC (Current Assignee) WEBCOM GROUP Inc ; Adobe Inc | Draw-based editor for web pages | ▪ computer program product ≈ computer program product ▪ data processing system ≈ data processing system ▪ web server ≈ World Wide Web ▪ readable instruction ≈ program code ▪ executable instruction, computer executable instruction ≈ web browser | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ teaches a tool that enables personalization and customization of web pages from display templates… ▪ discloses a common style in that the multimedia publishing system includes style sheets that specify particular fonts in… ▪ discloses a subordinate content specification referencing the master specification for style navigation and content… ▪ discloses this limitation as clearly indicated in the cited figure and text… | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||
| 130 | US5987498A (William David Athing, 1999) | (Original Assignee) Atcom Inc (Current Assignee) CAIS Inc | Credit card operated computer on-line service communication system | ▪ net polling question ≈ identifying information ▪ match aggregator, match servers ≈ respective network, collecting step ▪ next polling ≈ e-mail messages ▪ web server ≈ World Wide Web | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(e) ▪ 35 U.S.C. 102(b) | ▪ teaches the protocol manager performing protocol conversion of messages between the subscriber devices and the… ▪ teaches speci c examples that the content count unit may be in bytes or words in col… ▪ teaches a plurality of services ie different software programs from among which a user of a wireless device selects… ▪ discloses receiving documents from corresponding representatives without requiring submission of the documents… | X | X | X | X | X | X | X | X | X | ||||||||||||||||||
| 131 | US5613113A (Robert D. Goldring, 1997) | (Original Assignee) International Business Machines Corp (Current Assignee) International Business Machines Corp | Consistent recreation of events from activity logs | ▪ computer having one ≈ management system ▪ n bytes ≈ sequence number ▪ readable medium ≈ data manager ▪ polling questions ≈ other event ▪ m rows ≈ time values | ▪ 35 U.S.C. 103(a) ▪ 35 U.S.C. 102(b) ▪ 35 U.S.C. 102(e) | ▪ teaches maintaining database includes drug companies insures medical facilities… ▪ teaches information gathered by the practitioner is uploaded to the server… ▪ teaches wherein upon going to the second level the traversal of the set of data elements includes determining if there… ▪ teaches the invention substantially as claimed as speci ed in claim… | X | X | X | X | X | X | X | X | X | X | X | X | X | ||||||||||||||
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | ICDE: 2009 IEEE 25TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3. : 1483-1486 2009 Publication Year: 2009 SmallBlue: Social Network Analysis For Expertise Search And Collective Intelligence IBM Thomas J. Watson Research Center Lin, Cao, Liu, Papadimitriou, Sun, Yan, Ieee |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system (social networking) , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
SmallBlue : Social Network Analysis For Expertise Search And Collective Intelligence . SmallBlue is a social networking (networking system) application that unlocks the valuable business intelligence of 'who knows what?' , 'who knows whom?' and 'who knows what about whom' within an organization , without requiring explicit involvement of individuals . The aim of SmallBlue is to locate knowledgeable colleagues , communities , and knowledge networks in companies . The suite also helps users manage their personal networks , and reach out to their extended network (the friends of their friends) to find and access expertise and information . |
| US9087321B2 CLAIM 2 . The poll-based networking system (social networking) as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
SmallBlue : Social Network Analysis For Expertise Search And Collective Intelligence . SmallBlue is a social networking (networking system) application that unlocks the valuable business intelligence of 'who knows what?' , 'who knows whom?' and 'who knows what about whom' within an organization , without requiring explicit involvement of individuals . The aim of SmallBlue is to locate knowledgeable colleagues , communities , and knowledge networks in companies . The suite also helps users manage their personal networks , and reach out to their extended network (the friends of their friends) to find and access expertise and information . |
| US9087321B2 CLAIM 3 . The poll-based networking system (social networking) as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
SmallBlue : Social Network Analysis For Expertise Search And Collective Intelligence . SmallBlue is a social networking (networking system) application that unlocks the valuable business intelligence of 'who knows what?' , 'who knows whom?' and 'who knows what about whom' within an organization , without requiring explicit involvement of individuals . The aim of SmallBlue is to locate knowledgeable colleagues , communities , and knowledge networks in companies . The suite also helps users manage their personal networks , and reach out to their extended network (the friends of their friends) to find and access expertise and information . |
| US9087321B2 CLAIM 4 . The poll-based networking system (social networking) as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
SmallBlue : Social Network Analysis For Expertise Search And Collective Intelligence . SmallBlue is a social networking (networking system) application that unlocks the valuable business intelligence of 'who knows what?' , 'who knows whom?' and 'who knows what about whom' within an organization , without requiring explicit involvement of individuals . The aim of SmallBlue is to locate knowledgeable colleagues , communities , and knowledge networks in companies . The suite also helps users manage their personal networks , and reach out to their extended network (the friends of their friends) to find and access expertise and information . |
| US9087321B2 CLAIM 5 . The poll-based networking system (social networking) as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
SmallBlue : Social Network Analysis For Expertise Search And Collective Intelligence . SmallBlue is a social networking (networking system) application that unlocks the valuable business intelligence of 'who knows what?' , 'who knows whom?' and 'who knows what about whom' within an organization , without requiring explicit involvement of individuals . The aim of SmallBlue is to locate knowledgeable colleagues , communities , and knowledge networks in companies . The suite also helps users manage their personal networks , and reach out to their extended network (the friends of their friends) to find and access expertise and information . |
| US9087321B2 CLAIM 6 . The poll-based networking system (social networking) as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
SmallBlue : Social Network (match aggregator) Analysis For Expertise Search And Collective Intelligence . SmallBlue is a social networking (networking system) application that unlocks the valuable business intelligence of 'who knows what?' , 'who knows whom?' and 'who knows what about whom' within an organization , without requiring explicit involvement of individuals . The aim of SmallBlue is to locate knowledgeable colleagues , communities , and knowledge networks in companies . The suite also helps users manage their personal networks , and reach out to their extended network (the friends of their friends) to find and access expertise and information . |
| US9087321B2 CLAIM 7 . The poll-based networking system (social networking) as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
SmallBlue : Social Network Analysis For Expertise Search And Collective Intelligence . SmallBlue is a social networking (networking system) application that unlocks the valuable business intelligence of 'who knows what?' , 'who knows whom?' and 'who knows what about whom' within an organization , without requiring explicit involvement of individuals . The aim of SmallBlue is to locate knowledgeable colleagues , communities , and knowledge networks in companies . The suite also helps users manage their personal networks , and reach out to their extended network (the friends of their friends) to find and access expertise and information . |
| US9087321B2 CLAIM 8 . The poll-based networking system (social networking) as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
SmallBlue : Social Network (match aggregator) Analysis For Expertise Search And Collective Intelligence . SmallBlue is a social networking (networking system) application that unlocks the valuable business intelligence of 'who knows what?' , 'who knows whom?' and 'who knows what about whom' within an organization , without requiring explicit involvement of individuals . The aim of SmallBlue is to locate knowledgeable colleagues , communities , and knowledge networks in companies . The suite also helps users manage their personal networks , and reach out to their extended network (the friends of their friends) to find and access expertise and information . |
| US9087321B2 CLAIM 9 . The poll-based networking system (social networking) as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
SmallBlue : Social Network Analysis For Expertise Search And Collective Intelligence . SmallBlue is a social networking (networking system) application that unlocks the valuable business intelligence of 'who knows what?' , 'who knows whom?' and 'who knows what about whom' within an organization , without requiring explicit involvement of individuals . The aim of SmallBlue is to locate knowledgeable colleagues , communities , and knowledge networks in companies . The suite also helps users manage their personal networks , and reach out to their extended network (the friends of their friends) to find and access expertise and information . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
SmallBlue : Social Network (match aggregator) Analysis For Expertise Search And Collective Intelligence . SmallBlue is a social networking application that unlocks the valuable business intelligence of 'who knows what?' , 'who knows whom?' and 'who knows what about whom' within an organization , without requiring explicit involvement of individuals . The aim of SmallBlue is to locate knowledgeable colleagues , communities , and knowledge networks in companies . The suite also helps users manage their personal networks , and reach out to their extended network (the friends of their friends) to find and access expertise and information . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
SmallBlue : Social Network (match aggregator) Analysis For Expertise Search And Collective Intelligence . SmallBlue is a social networking application that unlocks the valuable business intelligence of 'who knows what?' , 'who knows whom?' and 'who knows what about whom' within an organization , without requiring explicit involvement of individuals . The aim of SmallBlue is to locate knowledgeable colleagues , communities , and knowledge networks in companies . The suite also helps users manage their personal networks , and reach out to their extended network (the friends of their friends) to find and access expertise and information . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
SmallBlue : Social Network (match aggregator) Analysis For Expertise Search And Collective Intelligence . SmallBlue is a social networking application that unlocks the valuable business intelligence of 'who knows what?' , 'who knows whom?' and 'who knows what about whom' within an organization , without requiring explicit involvement of individuals . The aim of SmallBlue is to locate knowledgeable colleagues , communities , and knowledge networks in companies . The suite also helps users manage their personal networks , and reach out to their extended network (the friends of their friends) to find and access expertise and information . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
SmallBlue : Social Network (match aggregator) Analysis For Expertise Search And Collective Intelligence . SmallBlue is a social networking application that unlocks the valuable business intelligence of 'who knows what?' , 'who knows whom?' and 'who knows what about whom' within an organization , without requiring explicit involvement of individuals . The aim of SmallBlue is to locate knowledgeable colleagues , communities , and knowledge networks in companies . The suite also helps users manage their personal networks , and reach out to their extended network (the friends of their friends) to find and access expertise and information . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | CHI2009: PROCEEDINGS OF THE 27TH ANNUAL CHI CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS, VOLS 1-4. : 201-210 2009 Publication Year: 2009 Make New Friends, But Keep The Old - Recommending People On Social Networking Sites The University of Minnesota, Twin Cities Chen, Geyer, Dugan, Muller, Guy, Greenberg, Hudson, Hinkley, Ringelmorris, Olsen |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system (social networking) , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
Make New Friends , But Keep The Old - Recommending People On Social Networking Sites . This paper studies people recommendations designed to help users find known , offline contacts and discover new friends on social networking (networking system) sites . We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3 , 000 users . We found all-algorithms effective in expanding users' friend lists . Algorithms based on social network information were able to produce better-received recommendations and find more known contacts , for users , while algorithms using similarity of user-created content were stronger in discovering new friends . We also collected qualitative feedback from our survey users and draw several meaningful design implications . |
| US9087321B2 CLAIM 2 . The poll-based networking system (social networking) as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
Make New Friends , But Keep The Old - Recommending People On Social Networking Sites . This paper studies people recommendations designed to help users find known , offline contacts and discover new friends on social networking (networking system) sites . We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3 , 000 users . We found all-algorithms effective in expanding users' friend lists . Algorithms based on social network information were able to produce better-received recommendations and find more known contacts , for users , while algorithms using similarity of user-created content were stronger in discovering new friends . We also collected qualitative feedback from our survey users and draw several meaningful design implications . |
| US9087321B2 CLAIM 3 . The poll-based networking system (social networking) as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
Make New Friends , But Keep The Old - Recommending People On Social Networking Sites . This paper studies people recommendations designed to help users find known , offline contacts and discover new friends on social networking (networking system) sites . We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3 , 000 users . We found all-algorithms effective in expanding users' friend lists . Algorithms based on social network information were able to produce better-received recommendations and find more known contacts , for users , while algorithms using similarity of user-created content were stronger in discovering new friends . We also collected qualitative feedback from our survey users and draw several meaningful design implications . |
| US9087321B2 CLAIM 4 . The poll-based networking system (social networking) as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
Make New Friends , But Keep The Old - Recommending People On Social Networking Sites . This paper studies people recommendations designed to help users find known , offline contacts and discover new friends on social networking (networking system) sites . We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3 , 000 users . We found all-algorithms effective in expanding users' friend lists . Algorithms based on social network information were able to produce better-received recommendations and find more known contacts , for users , while algorithms using similarity of user-created content were stronger in discovering new friends . We also collected qualitative feedback from our survey users and draw several meaningful design implications . |
| US9087321B2 CLAIM 5 . The poll-based networking system (social networking) as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
Make New Friends , But Keep The Old - Recommending People On Social Networking Sites . This paper studies people recommendations designed to help users find known , offline contacts and discover new friends on social networking (networking system) sites . We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3 , 000 users . We found all-algorithms effective in expanding users' friend lists . Algorithms based on social network information were able to produce better-received recommendations and find more known contacts , for users , while algorithms using similarity of user-created content were stronger in discovering new friends . We also collected qualitative feedback from our survey users and draw several meaningful design implications . |
| US9087321B2 CLAIM 6 . The poll-based networking system (social networking) as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Make New Friends , But Keep The Old - Recommending People On Social Network (match aggregator) ing Sites . This paper studies people recommendations designed to help users find known , offline contacts and discover new friends on social networking (networking system) sites . We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3 , 000 users . We found all-algorithms effective in expanding users' friend lists . Algorithms based on social network information were able to produce better-received recommendations and find more known contacts , for users , while algorithms using similarity of user-created content were stronger in discovering new friends . We also collected qualitative feedback from our survey users and draw several meaningful design implications . |
| US9087321B2 CLAIM 7 . The poll-based networking system (social networking) as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
Make New Friends , But Keep The Old - Recommending People On Social Networking Sites . This paper studies people recommendations designed to help users find known , offline contacts and discover new friends on social networking (networking system) sites . We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3 , 000 users . We found all-algorithms effective in expanding users' friend lists . Algorithms based on social network information were able to produce better-received recommendations and find more known contacts , for users , while algorithms using similarity of user-created content were stronger in discovering new friends . We also collected qualitative feedback from our survey users and draw several meaningful design implications . |
| US9087321B2 CLAIM 8 . The poll-based networking system (social networking) as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Make New Friends , But Keep The Old - Recommending People On Social Network (match aggregator) ing Sites . This paper studies people recommendations designed to help users find known , offline contacts and discover new friends on social networking (networking system) sites . We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3 , 000 users . We found all-algorithms effective in expanding users' friend lists . Algorithms based on social network information were able to produce better-received recommendations and find more known contacts , for users , while algorithms using similarity of user-created content were stronger in discovering new friends . We also collected qualitative feedback from our survey users and draw several meaningful design implications . |
| US9087321B2 CLAIM 9 . The poll-based networking system (social networking) as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
Make New Friends , But Keep The Old - Recommending People On Social Networking Sites . This paper studies people recommendations designed to help users find known , offline contacts and discover new friends on social networking (networking system) sites . We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3 , 000 users . We found all-algorithms effective in expanding users' friend lists . Algorithms based on social network information were able to produce better-received recommendations and find more known contacts , for users , while algorithms using similarity of user-created content were stronger in discovering new friends . We also collected qualitative feedback from our survey users and draw several meaningful design implications . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Make New Friends , But Keep The Old - Recommending People On Social Network (match aggregator) ing Sites . This paper studies people recommendations designed to help users find known , offline contacts and discover new friends on social networking sites . We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3 , 000 users . We found all-algorithms effective in expanding users' friend lists . Algorithms based on social network information were able to produce better-received recommendations and find more known contacts , for users , while algorithms using similarity of user-created content were stronger in discovering new friends . We also collected qualitative feedback from our survey users and draw several meaningful design implications . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Make New Friends , But Keep The Old - Recommending People On Social Network (match aggregator) ing Sites . This paper studies people recommendations designed to help users find known , offline contacts and discover new friends on social networking sites . We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3 , 000 users . We found all-algorithms effective in expanding users' friend lists . Algorithms based on social network information were able to produce better-received recommendations and find more known contacts , for users , while algorithms using similarity of user-created content were stronger in discovering new friends . We also collected qualitative feedback from our survey users and draw several meaningful design implications . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Make New Friends , But Keep The Old - Recommending People On Social Network (match aggregator) ing Sites . This paper studies people recommendations designed to help users find known , offline contacts and discover new friends on social networking sites . We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3 , 000 users . We found all-algorithms effective in expanding users' friend lists . Algorithms based on social network information were able to produce better-received recommendations and find more known contacts , for users , while algorithms using similarity of user-created content were stronger in discovering new friends . We also collected qualitative feedback from our survey users and draw several meaningful design implications . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Make New Friends , But Keep The Old - Recommending People On Social Network (match aggregator) ing Sites . This paper studies people recommendations designed to help users find known , offline contacts and discover new friends on social networking sites . We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3 , 000 users . We found all-algorithms effective in expanding users' friend lists . Algorithms based on social network information were able to produce better-received recommendations and find more known contacts , for users , while algorithms using similarity of user-created content were stronger in discovering new friends . We also collected qualitative feedback from our survey users and draw several meaningful design implications . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | PROCEEDINGS OF THE IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE. : 77-80 2007 Publication Year: 2007 Finding Experts Using Social Network Analysis Tsinghua University (清华大学) Fu, Xiang, Liu, Zhang, Ma, Haas, Kacprzyk, Motwani, Broder, Ho, Young |
|---|---|
| US9087321B2 CLAIM 4 . The poll-based networking system as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number (ranked list) of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
Finding Experts Using Social Network Analysis . Searching an organization's document repositories for experts is a frequently occurred problem in intranet information management . A common method for finding experts in an organization is to use social networks people are not isolated but connected by various kinds of associations . In organizations , people explicitly send email to one another thus social networks are likely to be contained in the patterns of communication . Moreover , in some web pages , the relationship among people is also recorded . In our approach we propose several strategies in discovering the associations among people from emails and web pages . Based on the social networks , we proposed an expertise propagation algorithm : from a ranked list (total number) of candidates according to their probability of being expert for a certain topic , we select a small set of the top ones as seed , and then use the social networks among the candidates to discover other potential experts . The experiments on TREC enterprise track show significant performance improvement with the algorithm . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Finding Experts Using Social Network (match aggregator) Analysis . Searching an organization's document repositories for experts is a frequently occurred problem in intranet information management . A common method for finding experts in an organization is to use social networks people are not isolated but connected by various kinds of associations . In organizations , people explicitly send email to one another thus social networks are likely to be contained in the patterns of communication . Moreover , in some web pages , the relationship among people is also recorded . In our approach we propose several strategies in discovering the associations among people from emails and web pages . Based on the social networks , we proposed an expertise propagation algorithm : from a ranked list of candidates according to their probability of being expert for a certain topic , we select a small set of the top ones as seed , and then use the social networks among the candidates to discover other potential experts . The experiments on TREC enterprise track show significant performance improvement with the algorithm . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Finding Experts Using Social Network (match aggregator) Analysis . Searching an organization's document repositories for experts is a frequently occurred problem in intranet information management . A common method for finding experts in an organization is to use social networks people are not isolated but connected by various kinds of associations . In organizations , people explicitly send email to one another thus social networks are likely to be contained in the patterns of communication . Moreover , in some web pages , the relationship among people is also recorded . In our approach we propose several strategies in discovering the associations among people from emails and web pages . Based on the social networks , we proposed an expertise propagation algorithm : from a ranked list of candidates according to their probability of being expert for a certain topic , we select a small set of the top ones as seed , and then use the social networks among the candidates to discover other potential experts . The experiments on TREC enterprise track show significant performance improvement with the algorithm . |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , further comprising an act of causing the one or more processors to perform operations of : determining a total number (ranked list) of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
Finding Experts Using Social Network Analysis . Searching an organization's document repositories for experts is a frequently occurred problem in intranet information management . A common method for finding experts in an organization is to use social networks people are not isolated but connected by various kinds of associations . In organizations , people explicitly send email to one another thus social networks are likely to be contained in the patterns of communication . Moreover , in some web pages , the relationship among people is also recorded . In our approach we propose several strategies in discovering the associations among people from emails and web pages . Based on the social networks , we proposed an expertise propagation algorithm : from a ranked list (total number) of candidates according to their probability of being expert for a certain topic , we select a small set of the top ones as seed , and then use the social networks among the candidates to discover other potential experts . The experiments on TREC enterprise track show significant performance improvement with the algorithm . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Finding Experts Using Social Network (match aggregator) Analysis . Searching an organization's document repositories for experts is a frequently occurred problem in intranet information management . A common method for finding experts in an organization is to use social networks people are not isolated but connected by various kinds of associations . In organizations , people explicitly send email to one another thus social networks are likely to be contained in the patterns of communication . Moreover , in some web pages , the relationship among people is also recorded . In our approach we propose several strategies in discovering the associations among people from emails and web pages . Based on the social networks , we proposed an expertise propagation algorithm : from a ranked list of candidates according to their probability of being expert for a certain topic , we select a small set of the top ones as seed , and then use the social networks among the candidates to discover other potential experts . The experiments on TREC enterprise track show significant performance improvement with the algorithm . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Finding Experts Using Social Network (match aggregator) Analysis . Searching an organization's document repositories for experts is a frequently occurred problem in intranet information management . A common method for finding experts in an organization is to use social networks people are not isolated but connected by various kinds of associations . In organizations , people explicitly send email to one another thus social networks are likely to be contained in the patterns of communication . Moreover , in some web pages , the relationship among people is also recorded . In our approach we propose several strategies in discovering the associations among people from emails and web pages . Based on the social networks , we proposed an expertise propagation algorithm : from a ranked list of candidates according to their probability of being expert for a certain topic , we select a small set of the top ones as seed , and then use the social networks among the candidates to discover other potential experts . The experiments on TREC enterprise track show significant performance improvement with the algorithm . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number (ranked list) of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
Finding Experts Using Social Network Analysis . Searching an organization's document repositories for experts is a frequently occurred problem in intranet information management . A common method for finding experts in an organization is to use social networks people are not isolated but connected by various kinds of associations . In organizations , people explicitly send email to one another thus social networks are likely to be contained in the patterns of communication . Moreover , in some web pages , the relationship among people is also recorded . In our approach we propose several strategies in discovering the associations among people from emails and web pages . Based on the social networks , we proposed an expertise propagation algorithm : from a ranked list (total number) of candidates according to their probability of being expert for a certain topic , we select a small set of the top ones as seed , and then use the social networks among the candidates to discover other potential experts . The experiments on TREC enterprise track show significant performance improvement with the algorithm . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Finding Experts Using Social Network (match aggregator) Analysis . Searching an organization's document repositories for experts is a frequently occurred problem in intranet information management . A common method for finding experts in an organization is to use social networks people are not isolated but connected by various kinds of associations . In organizations , people explicitly send email to one another thus social networks are likely to be contained in the patterns of communication . Moreover , in some web pages , the relationship among people is also recorded . In our approach we propose several strategies in discovering the associations among people from emails and web pages . Based on the social networks , we proposed an expertise propagation algorithm : from a ranked list of candidates according to their probability of being expert for a certain topic , we select a small set of the top ones as seed , and then use the social networks among the candidates to discover other potential experts . The experiments on TREC enterprise track show significant performance improvement with the algorithm . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (Social Network) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Finding Experts Using Social Network (match aggregator) Analysis . Searching an organization's document repositories for experts is a frequently occurred problem in intranet information management . A common method for finding experts in an organization is to use social networks people are not isolated but connected by various kinds of associations . In organizations , people explicitly send email to one another thus social networks are likely to be contained in the patterns of communication . Moreover , in some web pages , the relationship among people is also recorded . In our approach we propose several strategies in discovering the associations among people from emails and web pages . Based on the social networks , we proposed an expertise propagation algorithm : from a ranked list of candidates according to their probability of being expert for a certain topic , we select a small set of the top ones as seed , and then use the social networks among the candidates to discover other potential experts . The experiments on TREC enterprise track show significant performance improvement with the algorithm . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | 17TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS. : 651-660 2001 Publication Year: 2001 Prefetching Based On The Type-level Access Pattern In Object-relational DBMSs KAIST - Korea Advanced Institute of Science and Technology (한국과학기술원) Han, Whang, Moon, Song, Ieee Computer Society, Ieee Computer Society, Ieee Computer Society |
|---|---|
| US9087321B2 CLAIM 4 . The poll-based networking system as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number (Management System) of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
Prefetching Based On The Type-level Access Pattern In Object-relational DBMSs . Prefetching is an effective method for minimizing the number of round-trips between the client and the server in database management systems . In this paper , we propose new notions of the type-level access locality and the type-level access pattern . We also formally define the notions of capturing and prefetching to help understand the underlying mechanisms . We then develop an efficient prefetching policy based on these notions and the framework . The type-level access locality is a pheonomenon that repetitive patterns exist in the attributes referenced . The type-level access pattern is a pattern of attributes that are referenced in accessing the objects . Existing prefetching methods are based on object-level or page-level access patterns , which consist of object-ids or page-ids of the objects accessed . However the drawback of these methods is that they work only when exactly the same objects or pages are accessed repeatedly . In contrast , even though the same objects are not accessed repeatedly , our technique effectively prefetches objects if the same attributes are referenced repeatedly , i . e . , if there is type-level access locality . Many navigational applications in Object-Relational Database Management System (total number) s(ORDBMSs) have type-level access locality Therefore , our technique can be employed in ORDBMSs to effectively reduce the number of round-trips , thereby significantly enhancing the performance . We have conducted extensive experiments in a prototype ORDBMS to show the effectiveness of our algorithm . Experimental results using the OO7 benchmark and a real GIS application show that our technique provides orders of magnitude improvements in round-trips and several factors of improvements in overall performance over on-demand fetching and context-based prefetching , which is a state-of-the-art prefetching method . These results indicate that our approach provides a new paradigm in prefetching that improves performance of navigational applications significantly and is a practical method that can be implemented in commercial ORDBMSs . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one (management system) or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
Prefetching Based On The Type-level Access Pattern In Object-relational DBMSs . Prefetching is an effective method for minimizing the number of round-trips between the client and the server in database management system (computer having one) s . In this paper , we propose new notions of the type-level access locality and the type-level access pattern . We also formally define the notions of capturing and prefetching to help understand the underlying mechanisms . We then develop an efficient prefetching policy based on these notions and the framework . The type-level access locality is a pheonomenon that repetitive patterns exist in the attributes referenced . The type-level access pattern is a pattern of attributes that are referenced in accessing the objects . Existing prefetching methods are based on object-level or page-level access patterns , which consist of object-ids or page-ids of the objects accessed . However the drawback of these methods is that they work only when exactly the same objects or pages are accessed repeatedly . In contrast , even though the same objects are not accessed repeatedly , our technique effectively prefetches objects if the same attributes are referenced repeatedly , i . e . , if there is type-level access locality . Many navigational applications in Object-Relational Database Management Systems(ORDBMSs) have type-level access locality Therefore , our technique can be employed in ORDBMSs to effectively reduce the number of round-trips , thereby significantly enhancing the performance . We have conducted extensive experiments in a prototype ORDBMS to show the effectiveness of our algorithm . Experimental results using the OO7 benchmark and a real GIS application show that our technique provides orders of magnitude improvements in round-trips and several factors of improvements in overall performance over on-demand fetching and context-based prefetching , which is a state-of-the-art prefetching method . These results indicate that our approach provides a new paradigm in prefetching that improves performance of navigational applications significantly and is a practical method that can be implemented in commercial ORDBMSs . |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , further comprising an act of causing the one or more processors to perform operations of : determining a total number (Management System) of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
Prefetching Based On The Type-level Access Pattern In Object-relational DBMSs . Prefetching is an effective method for minimizing the number of round-trips between the client and the server in database management systems . In this paper , we propose new notions of the type-level access locality and the type-level access pattern . We also formally define the notions of capturing and prefetching to help understand the underlying mechanisms . We then develop an efficient prefetching policy based on these notions and the framework . The type-level access locality is a pheonomenon that repetitive patterns exist in the attributes referenced . The type-level access pattern is a pattern of attributes that are referenced in accessing the objects . Existing prefetching methods are based on object-level or page-level access patterns , which consist of object-ids or page-ids of the objects accessed . However the drawback of these methods is that they work only when exactly the same objects or pages are accessed repeatedly . In contrast , even though the same objects are not accessed repeatedly , our technique effectively prefetches objects if the same attributes are referenced repeatedly , i . e . , if there is type-level access locality . Many navigational applications in Object-Relational Database Management System (total number) s(ORDBMSs) have type-level access locality Therefore , our technique can be employed in ORDBMSs to effectively reduce the number of round-trips , thereby significantly enhancing the performance . We have conducted extensive experiments in a prototype ORDBMS to show the effectiveness of our algorithm . Experimental results using the OO7 benchmark and a real GIS application show that our technique provides orders of magnitude improvements in round-trips and several factors of improvements in overall performance over on-demand fetching and context-based prefetching , which is a state-of-the-art prefetching method . These results indicate that our approach provides a new paradigm in prefetching that improves performance of navigational applications significantly and is a practical method that can be implemented in commercial ORDBMSs . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number (Management System) of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
Prefetching Based On The Type-level Access Pattern In Object-relational DBMSs . Prefetching is an effective method for minimizing the number of round-trips between the client and the server in database management systems . In this paper , we propose new notions of the type-level access locality and the type-level access pattern . We also formally define the notions of capturing and prefetching to help understand the underlying mechanisms . We then develop an efficient prefetching policy based on these notions and the framework . The type-level access locality is a pheonomenon that repetitive patterns exist in the attributes referenced . The type-level access pattern is a pattern of attributes that are referenced in accessing the objects . Existing prefetching methods are based on object-level or page-level access patterns , which consist of object-ids or page-ids of the objects accessed . However the drawback of these methods is that they work only when exactly the same objects or pages are accessed repeatedly . In contrast , even though the same objects are not accessed repeatedly , our technique effectively prefetches objects if the same attributes are referenced repeatedly , i . e . , if there is type-level access locality . Many navigational applications in Object-Relational Database Management System (total number) s(ORDBMSs) have type-level access locality Therefore , our technique can be employed in ORDBMSs to effectively reduce the number of round-trips , thereby significantly enhancing the performance . We have conducted extensive experiments in a prototype ORDBMS to show the effectiveness of our algorithm . Experimental results using the OO7 benchmark and a real GIS application show that our technique provides orders of magnitude improvements in round-trips and several factors of improvements in overall performance over on-demand fetching and context-based prefetching , which is a state-of-the-art prefetching method . These results indicate that our approach provides a new paradigm in prefetching that improves performance of navigational applications significantly and is a practical method that can be implemented in commercial ORDBMSs . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | IEEE TRANSACTIONS ON INFORMATION TECHNOLOGY IN BIOMEDICINE. 4 (1): 52-57 MAR 2000 Publication Year: 2000 DataFoundry: Information Management For Scientific Data Lawrence Livermore National Laboratory (LLNL) Critchlow, Fidelis, Ganesh, Musick, Slezak |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (dynamic data) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
DataFoundry : Information Management For Scientific Data . Data warehouses and data marts have been successfully applied to a multitude of commercial business applications . They have proven to be invaluable tools by integrating information from distributed , heterogeneous sources and summarizing this data for use throughout the enterprise . Although the need for information dissemination is as vital in science as in business , working warehouses in this community are scarce because traditional warehousing techniques do not transfer to scientific environments . There are two primary reasons for this difficulty , First , schema integration is more difficult for scientific databases than for business sources , because of the complexity of the concepts and the associated relationships . While this difference has not yet been fully explored , it is an important consideration when determining how to integrate autonomous sources . Second , scientific data sources have highly dynamic data (match servers) representations (schemata) , When a data source participating in a warehouse changes its schema , both the mediator transferring data to the warehouse and the warehouse itself need to be updated to reflect these modifications . The cost of repeatedly performing these updates in a traditional warehouse , as is required in a dynamic environment , is prohibitive . This paper discusses these issues within the context of the DataFoundry project , an ongoing research effort at Lawrence Livermore National Laboratory . DataFoundry utilizes a unique integration strategy to identify corresponding instances while maintaining differences between data from different sources , and a novel architecture and an extensive meta-data infrastructure , which reduce the cost of maintaining a warehouse . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (dynamic data) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
DataFoundry : Information Management For Scientific Data . Data warehouses and data marts have been successfully applied to a multitude of commercial business applications . They have proven to be invaluable tools by integrating information from distributed , heterogeneous sources and summarizing this data for use throughout the enterprise . Although the need for information dissemination is as vital in science as in business , working warehouses in this community are scarce because traditional warehousing techniques do not transfer to scientific environments . There are two primary reasons for this difficulty , First , schema integration is more difficult for scientific databases than for business sources , because of the complexity of the concepts and the associated relationships . While this difference has not yet been fully explored , it is an important consideration when determining how to integrate autonomous sources . Second , scientific data sources have highly dynamic data (match servers) representations (schemata) , When a data source participating in a warehouse changes its schema , both the mediator transferring data to the warehouse and the warehouse itself need to be updated to reflect these modifications . The cost of repeatedly performing these updates in a traditional warehouse , as is required in a dynamic environment , is prohibitive . This paper discusses these issues within the context of the DataFoundry project , an ongoing research effort at Lawrence Livermore National Laboratory . DataFoundry utilizes a unique integration strategy to identify corresponding instances while maintaining differences between data from different sources , and a novel architecture and an extensive meta-data infrastructure , which reduce the cost of maintaining a warehouse . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (dynamic data) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
DataFoundry : Information Management For Scientific Data . Data warehouses and data marts have been successfully applied to a multitude of commercial business applications . They have proven to be invaluable tools by integrating information from distributed , heterogeneous sources and summarizing this data for use throughout the enterprise . Although the need for information dissemination is as vital in science as in business , working warehouses in this community are scarce because traditional warehousing techniques do not transfer to scientific environments . There are two primary reasons for this difficulty , First , schema integration is more difficult for scientific databases than for business sources , because of the complexity of the concepts and the associated relationships . While this difference has not yet been fully explored , it is an important consideration when determining how to integrate autonomous sources . Second , scientific data sources have highly dynamic data (match servers) representations (schemata) , When a data source participating in a warehouse changes its schema , both the mediator transferring data to the warehouse and the warehouse itself need to be updated to reflect these modifications . The cost of repeatedly performing these updates in a traditional warehouse , as is required in a dynamic environment , is prohibitive . This paper discusses these issues within the context of the DataFoundry project , an ongoing research effort at Lawrence Livermore National Laboratory . DataFoundry utilizes a unique integration strategy to identify corresponding instances while maintaining differences between data from different sources , and a novel architecture and an extensive meta-data infrastructure , which reduce the cost of maintaining a warehouse . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (dynamic data) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
DataFoundry : Information Management For Scientific Data . Data warehouses and data marts have been successfully applied to a multitude of commercial business applications . They have proven to be invaluable tools by integrating information from distributed , heterogeneous sources and summarizing this data for use throughout the enterprise . Although the need for information dissemination is as vital in science as in business , working warehouses in this community are scarce because traditional warehousing techniques do not transfer to scientific environments . There are two primary reasons for this difficulty , First , schema integration is more difficult for scientific databases than for business sources , because of the complexity of the concepts and the associated relationships . While this difference has not yet been fully explored , it is an important consideration when determining how to integrate autonomous sources . Second , scientific data sources have highly dynamic data (match servers) representations (schemata) , When a data source participating in a warehouse changes its schema , both the mediator transferring data to the warehouse and the warehouse itself need to be updated to reflect these modifications . The cost of repeatedly performing these updates in a traditional warehouse , as is required in a dynamic environment , is prohibitive . This paper discusses these issues within the context of the DataFoundry project , an ongoing research effort at Lawrence Livermore National Laboratory . DataFoundry utilizes a unique integration strategy to identify corresponding instances while maintaining differences between data from different sources , and a novel architecture and an extensive meta-data infrastructure , which reduce the cost of maintaining a warehouse . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (dynamic data) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
DataFoundry : Information Management For Scientific Data . Data warehouses and data marts have been successfully applied to a multitude of commercial business applications . They have proven to be invaluable tools by integrating information from distributed , heterogeneous sources and summarizing this data for use throughout the enterprise . Although the need for information dissemination is as vital in science as in business , working warehouses in this community are scarce because traditional warehousing techniques do not transfer to scientific environments . There are two primary reasons for this difficulty , First , schema integration is more difficult for scientific databases than for business sources , because of the complexity of the concepts and the associated relationships . While this difference has not yet been fully explored , it is an important consideration when determining how to integrate autonomous sources . Second , scientific data sources have highly dynamic data (match servers) representations (schemata) , When a data source participating in a warehouse changes its schema , both the mediator transferring data to the warehouse and the warehouse itself need to be updated to reflect these modifications . The cost of repeatedly performing these updates in a traditional warehouse , as is required in a dynamic environment , is prohibitive . This paper discusses these issues within the context of the DataFoundry project , an ongoing research effort at Lawrence Livermore National Laboratory . DataFoundry utilizes a unique integration strategy to identify corresponding instances while maintaining differences between data from different sources , and a novel architecture and an extensive meta-data infrastructure , which reduce the cost of maintaining a warehouse . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (dynamic data) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
DataFoundry : Information Management For Scientific Data . Data warehouses and data marts have been successfully applied to a multitude of commercial business applications . They have proven to be invaluable tools by integrating information from distributed , heterogeneous sources and summarizing this data for use throughout the enterprise . Although the need for information dissemination is as vital in science as in business , working warehouses in this community are scarce because traditional warehousing techniques do not transfer to scientific environments . There are two primary reasons for this difficulty , First , schema integration is more difficult for scientific databases than for business sources , because of the complexity of the concepts and the associated relationships . While this difference has not yet been fully explored , it is an important consideration when determining how to integrate autonomous sources . Second , scientific data sources have highly dynamic data (match servers) representations (schemata) , When a data source participating in a warehouse changes its schema , both the mediator transferring data to the warehouse and the warehouse itself need to be updated to reflect these modifications . The cost of repeatedly performing these updates in a traditional warehouse , as is required in a dynamic environment , is prohibitive . This paper discusses these issues within the context of the DataFoundry project , an ongoing research effort at Lawrence Livermore National Laboratory . DataFoundry utilizes a unique integration strategy to identify corresponding instances while maintaining differences between data from different sources , and a novel architecture and an extensive meta-data infrastructure , which reduce the cost of maintaining a warehouse . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | MEDICAL IMAGING 2000: PACS DESIGN AND EVALUATION - ENGINEERING AND CLINICAL ISSUES. 3980: 235-241 2000 Publication Year: 2000 Java-based PACS And Reporting System For Nuclear Medicine London Health Sciences Centre (LHSC), London, Ontario, Canada Slomka, Elliott, Driedger, Blaine, Siegel |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (patient data) of other users that have a likelihood of match within a predetermined threshold . |
Java-based PACS And Reporting System For Nuclear Medicine . In medical imaging practice , images and reports often need be reviewed and edited from many locations . We have designed and implemented a Java-based Remote Viewing and Reporting System (JaRRViS) for a nuclear medicine department , which is deployed as a web service , at the fraction of the cost of dedicated PACS systems . The system can be extended to other imaging modalities . JaRRViS interfaces to the clinical patient data (user profiles) bases of imaging workstations . Specialized nuclear medicine applets support interactive displays of data such as 3-D gated SPECT with all the necessary options such as cine , filtering , dynamic lookup tables , and reorientation . The reporting module is implemented as a separate applet using Java Foundation Classes (JFC) Swing Editor Kit and allows composition of multimedia reports after selection and annotation of appropriate images . The reports are stored on the server in the HTML format . JaRRViS uses Java Servlets for the preparation and storage of final reports . The http links to the reports or to the patient's raw images with applets can be obtained from JaRRViS by any Hospital Information System (HIS) via standard queries . Such links can be sent via e-mail or included as text fields in any HIS database , providing direct access to the patient reports and images via standard web browsers . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (patient data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
Java-based PACS And Reporting System For Nuclear Medicine . In medical imaging practice , images and reports often need be reviewed and edited from many locations . We have designed and implemented a Java-based Remote Viewing and Reporting System (JaRRViS) for a nuclear medicine department , which is deployed as a web service , at the fraction of the cost of dedicated PACS systems . The system can be extended to other imaging modalities . JaRRViS interfaces to the clinical patient data (user profiles) bases of imaging workstations . Specialized nuclear medicine applets support interactive displays of data such as 3-D gated SPECT with all the necessary options such as cine , filtering , dynamic lookup tables , and reorientation . The reporting module is implemented as a separate applet using Java Foundation Classes (JFC) Swing Editor Kit and allows composition of multimedia reports after selection and annotation of appropriate images . The reports are stored on the server in the HTML format . JaRRViS uses Java Servlets for the preparation and storage of final reports . The http links to the reports or to the patient's raw images with applets can be obtained from JaRRViS by any Hospital Information System (HIS) via standard queries . Such links can be sent via e-mail or included as text fields in any HIS database , providing direct access to the patient reports and images via standard web browsers . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (web browser) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (patient data) of other users that have a likelihood of match within a predetermined threshold . |
Java-based PACS And Reporting System For Nuclear Medicine . In medical imaging practice , images and reports often need be reviewed and edited from many locations . We have designed and implemented a Java-based Remote Viewing and Reporting System (JaRRViS) for a nuclear medicine department , which is deployed as a web service , at the fraction of the cost of dedicated PACS systems . The system can be extended to other imaging modalities . JaRRViS interfaces to the clinical patient data (user profiles) bases of imaging workstations . Specialized nuclear medicine applets support interactive displays of data such as 3-D gated SPECT with all the necessary options such as cine , filtering , dynamic lookup tables , and reorientation . The reporting module is implemented as a separate applet using Java Foundation Classes (JFC) Swing Editor Kit and allows composition of multimedia reports after selection and annotation of appropriate images . The reports are stored on the server in the HTML format . JaRRViS uses Java Servlets for the preparation and storage of final reports . The http links to the reports or to the patient's raw images with applets can be obtained from JaRRViS by any Hospital Information System (HIS) via standard queries . Such links can be sent via e-mail or included as text fields in any HIS database , providing direct access to the patient reports and images via standard web browser (executable instruction, computer executable instruction) s . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (patient data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
Java-based PACS And Reporting System For Nuclear Medicine . In medical imaging practice , images and reports often need be reviewed and edited from many locations . We have designed and implemented a Java-based Remote Viewing and Reporting System (JaRRViS) for a nuclear medicine department , which is deployed as a web service , at the fraction of the cost of dedicated PACS systems . The system can be extended to other imaging modalities . JaRRViS interfaces to the clinical patient data (user profiles) bases of imaging workstations . Specialized nuclear medicine applets support interactive displays of data such as 3-D gated SPECT with all the necessary options such as cine , filtering , dynamic lookup tables , and reorientation . The reporting module is implemented as a separate applet using Java Foundation Classes (JFC) Swing Editor Kit and allows composition of multimedia reports after selection and annotation of appropriate images . The reports are stored on the server in the HTML format . JaRRViS uses Java Servlets for the preparation and storage of final reports . The http links to the reports or to the patient's raw images with applets can be obtained from JaRRViS by any Hospital Information System (HIS) via standard queries . Such links can be sent via e-mail or included as text fields in any HIS database , providing direct access to the patient reports and images via standard web browsers . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (patient data) of other users that have a likelihood of match within a predetermined threshold . |
Java-based PACS And Reporting System For Nuclear Medicine . In medical imaging practice , images and reports often need be reviewed and edited from many locations . We have designed and implemented a Java-based Remote Viewing and Reporting System (JaRRViS) for a nuclear medicine department , which is deployed as a web service , at the fraction of the cost of dedicated PACS systems . The system can be extended to other imaging modalities . JaRRViS interfaces to the clinical patient data (user profiles) bases of imaging workstations . Specialized nuclear medicine applets support interactive displays of data such as 3-D gated SPECT with all the necessary options such as cine , filtering , dynamic lookup tables , and reorientation . The reporting module is implemented as a separate applet using Java Foundation Classes (JFC) Swing Editor Kit and allows composition of multimedia reports after selection and annotation of appropriate images . The reports are stored on the server in the HTML format . JaRRViS uses Java Servlets for the preparation and storage of final reports . The http links to the reports or to the patient's raw images with applets can be obtained from JaRRViS by any Hospital Information System (HIS) via standard queries . Such links can be sent via e-mail or included as text fields in any HIS database , providing direct access to the patient reports and images via standard web browsers . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (patient data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
Java-based PACS And Reporting System For Nuclear Medicine . In medical imaging practice , images and reports often need be reviewed and edited from many locations . We have designed and implemented a Java-based Remote Viewing and Reporting System (JaRRViS) for a nuclear medicine department , which is deployed as a web service , at the fraction of the cost of dedicated PACS systems . The system can be extended to other imaging modalities . JaRRViS interfaces to the clinical patient data (user profiles) bases of imaging workstations . Specialized nuclear medicine applets support interactive displays of data such as 3-D gated SPECT with all the necessary options such as cine , filtering , dynamic lookup tables , and reorientation . The reporting module is implemented as a separate applet using Java Foundation Classes (JFC) Swing Editor Kit and allows composition of multimedia reports after selection and annotation of appropriate images . The reports are stored on the server in the HTML format . JaRRViS uses Java Servlets for the preparation and storage of final reports . The http links to the reports or to the patient's raw images with applets can be obtained from JaRRViS by any Hospital Information System (HIS) via standard queries . Such links can be sent via e-mail or included as text fields in any HIS database , providing direct access to the patient reports and images via standard web browsers . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | PERFORMANCE EVALUATION REVIEW, SPECIAL ISSUE, VOL 27 NO 1, JUNE 1999. : 178-187 1999 Publication Year: 1999 Web Prefetching Between Low-bandwidth Clients And Proxies: Potential And Performance University of Wisconsin–Madison Fan, Cao, Lin, Jacobson, Assoc Comp Machinery, Assoc Comp Machinery, Assoc Comp Machinery, Assoc Comp Machinery |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Web Prefetching Between Low-bandwidth Clients And Proxies : Potential And Performance . The majority of the Internet population access the World Wide Web (web server) via dial-up modem connections . Studies have shown that the limited modem bandwidth is the main contributor to latency perceived by users . In this paper , we investigate one approach to reduce latency : prefetching between caching proxies and browsers . The approach relies on the proxy to predict which cached documents a user might reference next , and takes advantage of the idle time between user requests to push or pull the documents to the user . Using traces of modem Web accesses , we evaluate the potential of the technique at reducing client latency , examine the design of prediction algorithms , and investigate their performance varying the parameters and implementation concerns . Our results show that prefetching combined with large browser cache and delta-compression can reduce client latency up to 23 . 4% . The reduction is achieved using the Prediction-by-Partial-Matching (PPM) algorithm , whose accuracy ranges from 40% to 73% : depending on its parameters , and which generates 1% to 15% extra traffic on the modem links . A perfect predictor can increase the latency reduction to 28 . 5% , whereas without prefetching , large browser cache and delta-compression can only reduce latency by 14 . 4% . Depending on the desired properties of the algorithm , several configurations for PPM can be best choices . Among several attractive simplifications of the scheme , some do more harm than others ; in particular , it is important for the predictor to observe all accesses made by users , including browser cache hits . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Web Prefetching Between Low-bandwidth Clients And Proxies : Potential And Performance . The majority of the Internet population access the World Wide Web (web server) via dial-up modem connections . Studies have shown that the limited modem bandwidth is the main contributor to latency perceived by users . In this paper , we investigate one approach to reduce latency : prefetching between caching proxies and browsers . The approach relies on the proxy to predict which cached documents a user might reference next , and takes advantage of the idle time between user requests to push or pull the documents to the user . Using traces of modem Web accesses , we evaluate the potential of the technique at reducing client latency , examine the design of prediction algorithms , and investigate their performance varying the parameters and implementation concerns . Our results show that prefetching combined with large browser cache and delta-compression can reduce client latency up to 23 . 4% . The reduction is achieved using the Prediction-by-Partial-Matching (PPM) algorithm , whose accuracy ranges from 40% to 73% : depending on its parameters , and which generates 1% to 15% extra traffic on the modem links . A perfect predictor can increase the latency reduction to 28 . 5% , whereas without prefetching , large browser cache and delta-compression can only reduce latency by 14 . 4% . Depending on the desired properties of the algorithm , several configurations for PPM can be best choices . Among several attractive simplifications of the scheme , some do more harm than others ; in particular , it is important for the predictor to observe all accesses made by users , including browser cache hits . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Web Prefetching Between Low-bandwidth Clients And Proxies : Potential And Performance . The majority of the Internet population access the World Wide Web (web server) via dial-up modem connections . Studies have shown that the limited modem bandwidth is the main contributor to latency perceived by users . In this paper , we investigate one approach to reduce latency : prefetching between caching proxies and browsers . The approach relies on the proxy to predict which cached documents a user might reference next , and takes advantage of the idle time between user requests to push or pull the documents to the user . Using traces of modem Web accesses , we evaluate the potential of the technique at reducing client latency , examine the design of prediction algorithms , and investigate their performance varying the parameters and implementation concerns . Our results show that prefetching combined with large browser cache and delta-compression can reduce client latency up to 23 . 4% . The reduction is achieved using the Prediction-by-Partial-Matching (PPM) algorithm , whose accuracy ranges from 40% to 73% : depending on its parameters , and which generates 1% to 15% extra traffic on the modem links . A perfect predictor can increase the latency reduction to 28 . 5% , whereas without prefetching , large browser cache and delta-compression can only reduce latency by 14 . 4% . Depending on the desired properties of the algorithm , several configurations for PPM can be best choices . Among several attractive simplifications of the scheme , some do more harm than others ; in particular , it is important for the predictor to observe all accesses made by users , including browser cache hits . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Web Prefetching Between Low-bandwidth Clients And Proxies : Potential And Performance . The majority of the Internet population access the World Wide Web (web server) via dial-up modem connections . Studies have shown that the limited modem bandwidth is the main contributor to latency perceived by users . In this paper , we investigate one approach to reduce latency : prefetching between caching proxies and browsers . The approach relies on the proxy to predict which cached documents a user might reference next , and takes advantage of the idle time between user requests to push or pull the documents to the user . Using traces of modem Web accesses , we evaluate the potential of the technique at reducing client latency , examine the design of prediction algorithms , and investigate their performance varying the parameters and implementation concerns . Our results show that prefetching combined with large browser cache and delta-compression can reduce client latency up to 23 . 4% . The reduction is achieved using the Prediction-by-Partial-Matching (PPM) algorithm , whose accuracy ranges from 40% to 73% : depending on its parameters , and which generates 1% to 15% extra traffic on the modem links . A perfect predictor can increase the latency reduction to 28 . 5% , whereas without prefetching , large browser cache and delta-compression can only reduce latency by 14 . 4% . Depending on the desired properties of the algorithm , several configurations for PPM can be best choices . Among several attractive simplifications of the scheme , some do more harm than others ; in particular , it is important for the predictor to observe all accesses made by users , including browser cache hits . |
| US9087321B2 CLAIM 19 . A computer program product (up mode) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
Web Prefetching Between Low-bandwidth Clients And Proxies : Potential And Performance . The majority of the Internet population access the World Wide Web via dial-up mode (computer program product) m connections . Studies have shown that the limited modem bandwidth is the main contributor to latency perceived by users . In this paper , we investigate one approach to reduce latency : prefetching between caching proxies and browsers . The approach relies on the proxy to predict which cached documents a user might reference next , and takes advantage of the idle time between user requests to push or pull the documents to the user . Using traces of modem Web accesses , we evaluate the potential of the technique at reducing client latency , examine the design of prediction algorithms , and investigate their performance varying the parameters and implementation concerns . Our results show that prefetching combined with large browser cache and delta-compression can reduce client latency up to 23 . 4% . The reduction is achieved using the Prediction-by-Partial-Matching (PPM) algorithm , whose accuracy ranges from 40% to 73% : depending on its parameters , and which generates 1% to 15% extra traffic on the modem links . A perfect predictor can increase the latency reduction to 28 . 5% , whereas without prefetching , large browser cache and delta-compression can only reduce latency by 14 . 4% . Depending on the desired properties of the algorithm , several configurations for PPM can be best choices . Among several attractive simplifications of the scheme , some do more harm than others ; in particular , it is important for the predictor to observe all accesses made by users , including browser cache hits . |
| US9087321B2 CLAIM 20 . The computer program product (up mode) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
Web Prefetching Between Low-bandwidth Clients And Proxies : Potential And Performance . The majority of the Internet population access the World Wide Web via dial-up mode (computer program product) m connections . Studies have shown that the limited modem bandwidth is the main contributor to latency perceived by users . In this paper , we investigate one approach to reduce latency : prefetching between caching proxies and browsers . The approach relies on the proxy to predict which cached documents a user might reference next , and takes advantage of the idle time between user requests to push or pull the documents to the user . Using traces of modem Web accesses , we evaluate the potential of the technique at reducing client latency , examine the design of prediction algorithms , and investigate their performance varying the parameters and implementation concerns . Our results show that prefetching combined with large browser cache and delta-compression can reduce client latency up to 23 . 4% . The reduction is achieved using the Prediction-by-Partial-Matching (PPM) algorithm , whose accuracy ranges from 40% to 73% : depending on its parameters , and which generates 1% to 15% extra traffic on the modem links . A perfect predictor can increase the latency reduction to 28 . 5% , whereas without prefetching , large browser cache and delta-compression can only reduce latency by 14 . 4% . Depending on the desired properties of the algorithm , several configurations for PPM can be best choices . Among several attractive simplifications of the scheme , some do more harm than others ; in particular , it is important for the predictor to observe all accesses made by users , including browser cache hits . |
| US9087321B2 CLAIM 21 . The computer program product (up mode) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
Web Prefetching Between Low-bandwidth Clients And Proxies : Potential And Performance . The majority of the Internet population access the World Wide Web via dial-up mode (computer program product) m connections . Studies have shown that the limited modem bandwidth is the main contributor to latency perceived by users . In this paper , we investigate one approach to reduce latency : prefetching between caching proxies and browsers . The approach relies on the proxy to predict which cached documents a user might reference next , and takes advantage of the idle time between user requests to push or pull the documents to the user . Using traces of modem Web accesses , we evaluate the potential of the technique at reducing client latency , examine the design of prediction algorithms , and investigate their performance varying the parameters and implementation concerns . Our results show that prefetching combined with large browser cache and delta-compression can reduce client latency up to 23 . 4% . The reduction is achieved using the Prediction-by-Partial-Matching (PPM) algorithm , whose accuracy ranges from 40% to 73% : depending on its parameters , and which generates 1% to 15% extra traffic on the modem links . A perfect predictor can increase the latency reduction to 28 . 5% , whereas without prefetching , large browser cache and delta-compression can only reduce latency by 14 . 4% . Depending on the desired properties of the algorithm , several configurations for PPM can be best choices . Among several attractive simplifications of the scheme , some do more harm than others ; in particular , it is important for the predictor to observe all accesses made by users , including browser cache hits . |
| US9087321B2 CLAIM 22 . The computer program product (up mode) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
Web Prefetching Between Low-bandwidth Clients And Proxies : Potential And Performance . The majority of the Internet population access the World Wide Web via dial-up mode (computer program product) m connections . Studies have shown that the limited modem bandwidth is the main contributor to latency perceived by users . In this paper , we investigate one approach to reduce latency : prefetching between caching proxies and browsers . The approach relies on the proxy to predict which cached documents a user might reference next , and takes advantage of the idle time between user requests to push or pull the documents to the user . Using traces of modem Web accesses , we evaluate the potential of the technique at reducing client latency , examine the design of prediction algorithms , and investigate their performance varying the parameters and implementation concerns . Our results show that prefetching combined with large browser cache and delta-compression can reduce client latency up to 23 . 4% . The reduction is achieved using the Prediction-by-Partial-Matching (PPM) algorithm , whose accuracy ranges from 40% to 73% : depending on its parameters , and which generates 1% to 15% extra traffic on the modem links . A perfect predictor can increase the latency reduction to 28 . 5% , whereas without prefetching , large browser cache and delta-compression can only reduce latency by 14 . 4% . Depending on the desired properties of the algorithm , several configurations for PPM can be best choices . Among several attractive simplifications of the scheme , some do more harm than others ; in particular , it is important for the predictor to observe all accesses made by users , including browser cache hits . |
| US9087321B2 CLAIM 23 . The computer program product (up mode) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
Web Prefetching Between Low-bandwidth Clients And Proxies : Potential And Performance . The majority of the Internet population access the World Wide Web via dial-up mode (computer program product) m connections . Studies have shown that the limited modem bandwidth is the main contributor to latency perceived by users . In this paper , we investigate one approach to reduce latency : prefetching between caching proxies and browsers . The approach relies on the proxy to predict which cached documents a user might reference next , and takes advantage of the idle time between user requests to push or pull the documents to the user . Using traces of modem Web accesses , we evaluate the potential of the technique at reducing client latency , examine the design of prediction algorithms , and investigate their performance varying the parameters and implementation concerns . Our results show that prefetching combined with large browser cache and delta-compression can reduce client latency up to 23 . 4% . The reduction is achieved using the Prediction-by-Partial-Matching (PPM) algorithm , whose accuracy ranges from 40% to 73% : depending on its parameters , and which generates 1% to 15% extra traffic on the modem links . A perfect predictor can increase the latency reduction to 28 . 5% , whereas without prefetching , large browser cache and delta-compression can only reduce latency by 14 . 4% . Depending on the desired properties of the algorithm , several configurations for PPM can be best choices . Among several attractive simplifications of the scheme , some do more harm than others ; in particular , it is important for the predictor to observe all accesses made by users , including browser cache hits . |
| US9087321B2 CLAIM 24 . The computer program product (up mode) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Web Prefetching Between Low-bandwidth Clients And Proxies : Potential And Performance . The majority of the Internet population access the World Wide Web (web server) via dial-up mode (computer program product) m connections . Studies have shown that the limited modem bandwidth is the main contributor to latency perceived by users . In this paper , we investigate one approach to reduce latency : prefetching between caching proxies and browsers . The approach relies on the proxy to predict which cached documents a user might reference next , and takes advantage of the idle time between user requests to push or pull the documents to the user . Using traces of modem Web accesses , we evaluate the potential of the technique at reducing client latency , examine the design of prediction algorithms , and investigate their performance varying the parameters and implementation concerns . Our results show that prefetching combined with large browser cache and delta-compression can reduce client latency up to 23 . 4% . The reduction is achieved using the Prediction-by-Partial-Matching (PPM) algorithm , whose accuracy ranges from 40% to 73% : depending on its parameters , and which generates 1% to 15% extra traffic on the modem links . A perfect predictor can increase the latency reduction to 28 . 5% , whereas without prefetching , large browser cache and delta-compression can only reduce latency by 14 . 4% . Depending on the desired properties of the algorithm , several configurations for PPM can be best choices . Among several attractive simplifications of the scheme , some do more harm than others ; in particular , it is important for the predictor to observe all accesses made by users , including browser cache hits . |
| US9087321B2 CLAIM 25 . The computer program product (up mode) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
Web Prefetching Between Low-bandwidth Clients And Proxies : Potential And Performance . The majority of the Internet population access the World Wide Web via dial-up mode (computer program product) m connections . Studies have shown that the limited modem bandwidth is the main contributor to latency perceived by users . In this paper , we investigate one approach to reduce latency : prefetching between caching proxies and browsers . The approach relies on the proxy to predict which cached documents a user might reference next , and takes advantage of the idle time between user requests to push or pull the documents to the user . Using traces of modem Web accesses , we evaluate the potential of the technique at reducing client latency , examine the design of prediction algorithms , and investigate their performance varying the parameters and implementation concerns . Our results show that prefetching combined with large browser cache and delta-compression can reduce client latency up to 23 . 4% . The reduction is achieved using the Prediction-by-Partial-Matching (PPM) algorithm , whose accuracy ranges from 40% to 73% : depending on its parameters , and which generates 1% to 15% extra traffic on the modem links . A perfect predictor can increase the latency reduction to 28 . 5% , whereas without prefetching , large browser cache and delta-compression can only reduce latency by 14 . 4% . Depending on the desired properties of the algorithm , several configurations for PPM can be best choices . Among several attractive simplifications of the scheme , some do more harm than others ; in particular , it is important for the predictor to observe all accesses made by users , including browser cache hits . |
| US9087321B2 CLAIM 26 . The computer program product (up mode) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
Web Prefetching Between Low-bandwidth Clients And Proxies : Potential And Performance . The majority of the Internet population access the World Wide Web (web server) via dial-up mode (computer program product) m connections . Studies have shown that the limited modem bandwidth is the main contributor to latency perceived by users . In this paper , we investigate one approach to reduce latency : prefetching between caching proxies and browsers . The approach relies on the proxy to predict which cached documents a user might reference next , and takes advantage of the idle time between user requests to push or pull the documents to the user . Using traces of modem Web accesses , we evaluate the potential of the technique at reducing client latency , examine the design of prediction algorithms , and investigate their performance varying the parameters and implementation concerns . Our results show that prefetching combined with large browser cache and delta-compression can reduce client latency up to 23 . 4% . The reduction is achieved using the Prediction-by-Partial-Matching (PPM) algorithm , whose accuracy ranges from 40% to 73% : depending on its parameters , and which generates 1% to 15% extra traffic on the modem links . A perfect predictor can increase the latency reduction to 28 . 5% , whereas without prefetching , large browser cache and delta-compression can only reduce latency by 14 . 4% . Depending on the desired properties of the algorithm , several configurations for PPM can be best choices . Among several attractive simplifications of the scheme , some do more harm than others ; in particular , it is important for the predictor to observe all accesses made by users , including browser cache hits . |
| US9087321B2 CLAIM 27 . The computer program product (up mode) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
Web Prefetching Between Low-bandwidth Clients And Proxies : Potential And Performance . The majority of the Internet population access the World Wide Web via dial-up mode (computer program product) m connections . Studies have shown that the limited modem bandwidth is the main contributor to latency perceived by users . In this paper , we investigate one approach to reduce latency : prefetching between caching proxies and browsers . The approach relies on the proxy to predict which cached documents a user might reference next , and takes advantage of the idle time between user requests to push or pull the documents to the user . Using traces of modem Web accesses , we evaluate the potential of the technique at reducing client latency , examine the design of prediction algorithms , and investigate their performance varying the parameters and implementation concerns . Our results show that prefetching combined with large browser cache and delta-compression can reduce client latency up to 23 . 4% . The reduction is achieved using the Prediction-by-Partial-Matching (PPM) algorithm , whose accuracy ranges from 40% to 73% : depending on its parameters , and which generates 1% to 15% extra traffic on the modem links . A perfect predictor can increase the latency reduction to 28 . 5% , whereas without prefetching , large browser cache and delta-compression can only reduce latency by 14 . 4% . Depending on the desired properties of the algorithm , several configurations for PPM can be best choices . Among several attractive simplifications of the scheme , some do more harm than others ; in particular , it is important for the predictor to observe all accesses made by users , including browser cache hits . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US7251696B1 Filed: 2002-10-28 Issued: 2007-07-31 System and methods enabling a mix of human and automated initiatives in the control of communication policies (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Eric J. Horvitz |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system (situation data) , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US7251696B1 CLAIM 25 . The method of claim 23 , where the contactor data comprises at least one of : a contactor situation data (networking system) and a contactor preference data . |
| US9087321B2 CLAIM 2 . The poll-based networking system (situation data) as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7251696B1 CLAIM 25 . The method of claim 23 , where the contactor data comprises at least one of : a contactor situation data (networking system) and a contactor preference data . |
| US9087321B2 CLAIM 3 . The poll-based networking system (situation data) as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US7251696B1 CLAIM 25 . The method of claim 23 , where the contactor data comprises at least one of : a contactor situation data (networking system) and a contactor preference data . |
| US9087321B2 CLAIM 4 . The poll-based networking system (situation data) as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US7251696B1 CLAIM 25 . The method of claim 23 , where the contactor data comprises at least one of : a contactor situation data (networking system) and a contactor preference data . |
| US9087321B2 CLAIM 5 . The poll-based networking system (situation data) as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US7251696B1 CLAIM 25 . The method of claim 23 , where the contactor data comprises at least one of : a contactor situation data (networking system) and a contactor preference data . |
| US9087321B2 CLAIM 6 . The poll-based networking system (situation data) as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7251696B1 CLAIM 15 . A computer readable medium (match server) storing computer executable components of the system of claim 1 . US7251696B1 CLAIM 25 . The method of claim 23 , where the contactor data comprises at least one of : a contactor situation data (networking system) and a contactor preference data . |
| US9087321B2 CLAIM 7 . The poll-based networking system (situation data) as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7251696B1 CLAIM 15 . A computer readable medium (match server) storing computer executable components of the system of claim 1 . US7251696B1 CLAIM 25 . The method of claim 23 , where the contactor data comprises at least one of : a contactor situation data (networking system) and a contactor preference data . |
| US9087321B2 CLAIM 8 . The poll-based networking system (situation data) as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7251696B1 CLAIM 15 . A computer readable medium (match server) storing computer executable components of the system of claim 1 . US7251696B1 CLAIM 25 . The method of claim 23 , where the contactor data comprises at least one of : a contactor situation data (networking system) and a contactor preference data . |
| US9087321B2 CLAIM 9 . The poll-based networking system (situation data) as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7251696B1 CLAIM 15 . A computer readable medium (match server) storing computer executable components of the system of claim 1 . US7251696B1 CLAIM 25 . The method of claim 23 , where the contactor data comprises at least one of : a contactor situation data (networking system) and a contactor preference data . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (computer executable instruction) means to execute the instruction means (readable medium storing) to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US7251696B1 CLAIM 15 . A computer readable medium storing (instruction means) computer executable components of the system of claim 1 . US7251696B1 CLAIM 38 . A computer readable medium storing computer executable instruction (computer executable instruction) s operable to perform the method of claim 37 . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7251696B1 CLAIM 15 . A computer readable medium (match server) storing computer executable components of the system of claim 1 . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7251696B1 CLAIM 15 . A computer readable medium (match server) storing computer executable components of the system of claim 1 . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7251696B1 CLAIM 15 . A computer readable medium (match server) storing computer executable components of the system of claim 1 . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7251696B1 CLAIM 15 . A computer readable medium (match server) storing computer executable components of the system of claim 1 . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means (readable medium storing) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US7251696B1 CLAIM 15 . A computer readable medium storing (instruction means) computer executable components of the system of claim 1 . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means (readable medium storing) for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7251696B1 CLAIM 15 . A computer readable medium storing (instruction means) computer executable components of the system of claim 1 . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means (readable medium storing) for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US7251696B1 CLAIM 15 . A computer readable medium storing (instruction means) computer executable components of the system of claim 1 . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means (readable medium storing) for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US7251696B1 CLAIM 15 . A computer readable medium storing (instruction means) computer executable components of the system of claim 1 . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means (readable medium storing) for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US7251696B1 CLAIM 15 . A computer readable medium storing (instruction means) computer executable components of the system of claim 1 . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means (readable medium storing) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7251696B1 CLAIM 15 . A computer readable medium (match server) storing computer executable components of the system of claim 1 . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7251696B1 CLAIM 15 . A computer readable medium (match server) storing computer executable components of the system of claim 1 . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means (readable medium storing) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7251696B1 CLAIM 15 . A computer readable medium (match server) storing computer executable components of the system of claim 1 . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7251696B1 CLAIM 15 . A computer readable medium (match server) storing computer executable components of the system of claim 1 . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20030056026A1 Filed: 2002-05-16 Issued: 2003-03-20 Graphical user interface for performing administration on web components of web sites in a portal framework (Original Assignee) Vignette Corp (Current Assignee) Open Text SA Ed Anuff, Edith Harbaugh, Ethan Vonderweid, John Petersen, Amy Phillips, Noah Guyot, Dean Moses, Dave MacLeod, Siddharth Chaudhary |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030056026A1 CLAIM 25 . A computer program product for performing administration on a portal server framework on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030056026A1 CLAIM 25 . A computer program product for performing administration on a portal server framework on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030056026A1 CLAIM 25 . A computer program product for performing administration on a portal server framework on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030056026A1 CLAIM 25 . A computer program product for performing administration on a portal server framework on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030056026A1 CLAIM 25 . A computer program product for performing administration on a portal server framework on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030056026A1 CLAIM 25 . A computer program product for performing administration on a portal server framework on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030056026A1 CLAIM 25 . A computer program product for performing administration on a portal server framework on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030056026A1 CLAIM 25 . A computer program product for performing administration on a portal server framework on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 CLAIM 19 . A computer program product (computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20030056026A1 CLAIM 25 . A computer program product (computer program product) for performing administration on a portal server framework on a computer network , comprising : a computer readable medium ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 CLAIM 20 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20030056026A1 CLAIM 25 . A computer program product (computer program product) for performing administration on a portal server framework on a computer network , comprising : a computer readable medium ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 CLAIM 21 . The computer program product (computer program product) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20030056026A1 CLAIM 25 . A computer program product (computer program product) for performing administration on a portal server framework on a computer network , comprising : a computer readable medium ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 CLAIM 22 . The computer program product (computer program product) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20030056026A1 CLAIM 25 . A computer program product (computer program product) for performing administration on a portal server framework on a computer network , comprising : a computer readable medium ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 CLAIM 23 . The computer program product (computer program product) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20030056026A1 CLAIM 25 . A computer program product (computer program product) for performing administration on a portal server framework on a computer network , comprising : a computer readable medium ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 CLAIM 24 . The computer program product (computer program product) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030056026A1 CLAIM 25 . A computer program product (computer program product) for performing administration on a portal server framework on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 CLAIM 25 . The computer program product (computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030056026A1 CLAIM 25 . A computer program product (computer program product) for performing administration on a portal server framework on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 CLAIM 26 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030056026A1 CLAIM 25 . A computer program product (computer program product) for performing administration on a portal server framework on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 CLAIM 27 . The computer program product (computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030056026A1 CLAIM 25 . A computer program product (computer program product) for performing administration on a portal server framework on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : providing a first console class configured to instantiate a first console object operable to : perform a first administration operation to instantiate a set of site objects ; and perform a second administration operation to instantiate a first set of permission objects , each permission object in the first set of permission objects defining a first set of users having access to , and first set of administrative privileges associated with , a site object in the set of site objects ; whereby , upon installation on the computer network , the class is executable by a processor on the network . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20090177754A1 Filed: 2009-01-05 Issued: 2009-07-09 Presentation of Organized Personal and Public Data Using Communication Mediums (Original Assignee) Xobni Corp (Current Assignee) Verizon Media Inc Matthew Brezina, Adam Smith |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (profile information) of other users that have a likelihood of match within a predetermined threshold . |
US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (profile information) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 3 . The poll-based networking system as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage (profile information) . |
US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 4 . The poll-based networking system as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage (profile information) , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (profile information) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (predetermined criteria) , to a plurality of match servers (profile information) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090177754A1 CLAIM 11 . The method of claim 1 , further comprising : identifying one or more related email attachments associated with the attachment based on one or more predetermined criteria (match aggregator) ; and presenting the attachment and the related email attachments to a user . US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (predetermined criteria) , to a plurality of match servers (profile information) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090177754A1 CLAIM 11 . The method of claim 1 , further comprising : identifying one or more related email attachments associated with the attachment based on one or more predetermined criteria (match aggregator) ; and presenting the attachment and the related email attachments to a user . US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (profile information) of other users that have a likelihood of match within a predetermined threshold . |
US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (profile information) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 12 . The computer implemented method as set forth in claim 11 , wherein , in cumulatively comparing , further comprising an act of causing the one or more processors to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage (profile information) . |
US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage (profile information) , further comprising an act of causing the one or more processors to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (profile information) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (predetermined criteria) , to a plurality of match servers (profile information) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090177754A1 CLAIM 11 . The method of claim 1 , further comprising : identifying one or more related email attachments associated with the attachment based on one or more predetermined criteria (match aggregator) ; and presenting the attachment and the related email attachments to a user . US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (predetermined criteria) , to a plurality of match servers (profile information) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090177754A1 CLAIM 11 . The method of claim 1 , further comprising : identifying one or more related email attachments associated with the attachment based on one or more predetermined criteria (match aggregator) ; and presenting the attachment and the related email attachments to a user . US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (profile information) of other users that have a likelihood of match within a predetermined threshold . |
US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (profile information) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage (profile information) . |
US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage (profile information) between the user and the selected other user . |
US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (profile information) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (predetermined criteria) , to a plurality of match servers (profile information) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090177754A1 CLAIM 11 . The method of claim 1 , further comprising : identifying one or more related email attachments associated with the attachment based on one or more predetermined criteria (match aggregator) ; and presenting the attachment and the related email attachments to a user . US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (predetermined criteria) , to a plurality of match servers (profile information) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090177754A1 CLAIM 11 . The method of claim 1 , further comprising : identifying one or more related email attachments associated with the attachment based on one or more predetermined criteria (match aggregator) ; and presenting the attachment and the related email attachments to a user . US20090177754A1 CLAIM 27 . A computer-readable medium having instructions stored thereon , which , when executed by a processor , causes the processor to perform operations comprising : displaying a sidebar tool to facilitate a selection of an message attachment information view and a personal profile information (user profiles, match percentage, minimum match percentage, match servers) view ; displaying content associated with one or more message attachments when the message attachment information is selected ; and displaying personal or public data of one or more users associated with the one or more message attachments when the personal profile information view is selected . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | WO2009086014A1 Filed: 2008-12-18 Issued: 2009-07-09 Widget-assisted detection and exposure of behavioral associations (Original Assignee) Amazon Technologies, Inc. Francis J. Kane, Cory Hicks |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (respective users) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
WO2009086014A1 CLAIM 34 . A system , comprising : an event recording system that maintains , for each of a plurality of users , at least (1) a record of catalog items selected by the respective users (user information) from an electronic catalog of a first web site , and (2) a record of other web sites accessed by the respective user ; an association mining system that analyzes the records of catalog item selections and web site accesses of users on an aggregated basis to detect behavioral associations between particular web sites and particular catalog items ; and a recommendation system configured to use the detected behavioral associations , in combination with a record of web sites accessed by a target user , to generate personalized catalog-item recommendations for the target user . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question (said users) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (related items) . |
WO2009086014A1 CLAIM 1 . A system , comprising : an event recording system that collects and stores event data that identifies web sites accessed by users , the event data reported by computing devices of said users (next polling question) via execution of widget code included in web pages of said web sites ; an association mining system configured to detect behavioral associations between specific web sites at least in part by analyzing of the event data on an aggregated basis ; and a content generation system that interacts with the widget code included in said web pages to cause the computing devices to display information on said web pages regarding said behavioral associations detected by the association mining system . WO2009086014A1 CLAIM 12 . A computer storage device having executable widget code stored thereon , said widget code adapted to be incorporated into a web page of a web site and to report , to a content provider system that is distinct from said web site , user accesses to the web page , said widget code further configured to retrieve from the content provider system , and to display on said web page , content descriptive of one or more behaviorally related items (polling questions) . |
| US9087321B2 CLAIM 4 . The poll-based networking system as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions (related items) as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
WO2009086014A1 CLAIM 12 . A computer storage device having executable widget code stored thereon , said widget code adapted to be incorporated into a web page of a web site and to report , to a content provider system that is distinct from said web site , user accesses to the web page , said widget code further configured to retrieve from the content provider system , and to display on said web page , content descriptive of one or more behaviorally related items (polling questions) . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
WO2009086014A1 CLAIM 27 . The method of Claim 25 , further comprising incorporating descriptions of the personalized set of catalog items into the web page , and transmitting the web page from a web server (web server) to the user computing device . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
WO2009086014A1 CLAIM 27 . The method of Claim 25 , further comprising incorporating descriptions of the personalized set of catalog items into the web page , and transmitting the web page from a web server (web server) to the user computing device . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (respective users) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
WO2009086014A1 CLAIM 34 . A system , comprising : an event recording system that maintains , for each of a plurality of users , at least (1) a record of catalog items selected by the respective users (user information) from an electronic catalog of a first web site , and (2) a record of other web sites accessed by the respective user ; an association mining system that analyzes the records of catalog item selections and web site accesses of users on an aggregated basis to detect behavioral associations between particular web sites and particular catalog items ; and a recommendation system configured to use the detected behavioral associations , in combination with a record of web sites accessed by a target user , to generate personalized catalog-item recommendations for the target user . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question (said users) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (related items) . |
WO2009086014A1 CLAIM 1 . A system , comprising : an event recording system that collects and stores event data that identifies web sites accessed by users , the event data reported by computing devices of said users (next polling question) via execution of widget code included in web pages of said web sites ; an association mining system configured to detect behavioral associations between specific web sites at least in part by analyzing of the event data on an aggregated basis ; and a content generation system that interacts with the widget code included in said web pages to cause the computing devices to display information on said web pages regarding said behavioral associations detected by the association mining system . WO2009086014A1 CLAIM 12 . A computer storage device having executable widget code stored thereon , said widget code adapted to be incorporated into a web page of a web site and to report , to a content provider system that is distinct from said web site , user accesses to the web page , said widget code further configured to retrieve from the content provider system , and to display on said web page , content descriptive of one or more behaviorally related items (polling questions) . |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , further comprising an act of causing the one or more processors to perform operations of : determining a total number of polling questions (related items) as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
WO2009086014A1 CLAIM 12 . A computer storage device having executable widget code stored thereon , said widget code adapted to be incorporated into a web page of a web site and to report , to a content provider system that is distinct from said web site , user accesses to the web page , said widget code further configured to retrieve from the content provider system , and to display on said web page , content descriptive of one or more behaviorally related items (polling questions) . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
WO2009086014A1 CLAIM 27 . The method of Claim 25 , further comprising incorporating descriptions of the personalized set of catalog items into the web page , and transmitting the web page from a web server (web server) to the user computing device . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
WO2009086014A1 CLAIM 27 . The method of Claim 25 , further comprising incorporating descriptions of the personalized set of catalog items into the web page , and transmitting the web page from a web server (web server) to the user computing device . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (respective users) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
WO2009086014A1 CLAIM 34 . A system , comprising : an event recording system that maintains , for each of a plurality of users , at least (1) a record of catalog items selected by the respective users (user information) from an electronic catalog of a first web site , and (2) a record of other web sites accessed by the respective user ; an association mining system that analyzes the records of catalog item selections and web site accesses of users on an aggregated basis to detect behavioral associations between particular web sites and particular catalog items ; and a recommendation system configured to use the detected behavioral associations , in combination with a record of web sites accessed by a target user , to generate personalized catalog-item recommendations for the target user . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question (said users) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (related items) . |
WO2009086014A1 CLAIM 1 . A system , comprising : an event recording system that collects and stores event data that identifies web sites accessed by users , the event data reported by computing devices of said users (next polling question) via execution of widget code included in web pages of said web sites ; an association mining system configured to detect behavioral associations between specific web sites at least in part by analyzing of the event data on an aggregated basis ; and a content generation system that interacts with the widget code included in said web pages to cause the computing devices to display information on said web pages regarding said behavioral associations detected by the association mining system . WO2009086014A1 CLAIM 12 . A computer storage device having executable widget code stored thereon , said widget code adapted to be incorporated into a web page of a web site and to report , to a content provider system that is distinct from said web site , user accesses to the web page , said widget code further configured to retrieve from the content provider system , and to display on said web page , content descriptive of one or more behaviorally related items (polling questions) . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions (related items) as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
WO2009086014A1 CLAIM 12 . A computer storage device having executable widget code stored thereon , said widget code adapted to be incorporated into a web page of a web site and to report , to a content provider system that is distinct from said web site , user accesses to the web page , said widget code further configured to retrieve from the content provider system , and to display on said web page , content descriptive of one or more behaviorally related items (polling questions) . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
WO2009086014A1 CLAIM 27 . The method of Claim 25 , further comprising incorporating descriptions of the personalized set of catalog items into the web page , and transmitting the web page from a web server (web server) to the user computing device . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
WO2009086014A1 CLAIM 27 . The method of Claim 25 , further comprising incorporating descriptions of the personalized set of catalog items into the web page , and transmitting the web page from a web server (web server) to the user computing device . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | WO2009085602A1 Filed: 2008-12-10 Issued: 2009-07-09 Recommendation system using social behavior analysis and vocabulary taxonomies (Original Assignee) Yahoo! Inc. Sihem Amer-Yahia, Alban Galland, Ramana Yerneni, Cong Yu |
|---|---|
| US9087321B2 CLAIM 19 . A computer program product (computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
WO2009085602A1 CLAIM 20 . A computer program product (computer program product) , comprising computer-readable medium comprising instructions for causing a processing unit to perform a method for recommending items of potential interest to users in a computer-based network , the method comprising : obtaining information relating to one or more types of computer-based social behavior for multiple users ; determining one or more implied topic-specific social networks based at least in part on the obtained social behavior information and utilizing a semantically-sensitive vocabulary-based taxonomy ; and facilitating presentation of a graphical user interface to the user including a recommendation of an item of potential interest to a user in the topic- specific social network , wherein the recommended item is determined based on social behavior associated with users in the topic-specific social network ; facilitating presentation , within the graphical user interface , of an indication of the rationale utilized in determining that the item may be of interest to the user ; facilitating presentation , within the graphical user interface , of an opportunity for the user to provide feedback relating to the recommendation . |
| US9087321B2 CLAIM 20 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
WO2009085602A1 CLAIM 20 . A computer program product (computer program product) , comprising computer-readable medium comprising instructions for causing a processing unit to perform a method for recommending items of potential interest to users in a computer-based network , the method comprising : obtaining information relating to one or more types of computer-based social behavior for multiple users ; determining one or more implied topic-specific social networks based at least in part on the obtained social behavior information and utilizing a semantically-sensitive vocabulary-based taxonomy ; and facilitating presentation of a graphical user interface to the user including a recommendation of an item of potential interest to a user in the topic- specific social network , wherein the recommended item is determined based on social behavior associated with users in the topic-specific social network ; facilitating presentation , within the graphical user interface , of an indication of the rationale utilized in determining that the item may be of interest to the user ; facilitating presentation , within the graphical user interface , of an opportunity for the user to provide feedback relating to the recommendation . |
| US9087321B2 CLAIM 21 . The computer program product (computer program product) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
WO2009085602A1 CLAIM 20 . A computer program product (computer program product) , comprising computer-readable medium comprising instructions for causing a processing unit to perform a method for recommending items of potential interest to users in a computer-based network , the method comprising : obtaining information relating to one or more types of computer-based social behavior for multiple users ; determining one or more implied topic-specific social networks based at least in part on the obtained social behavior information and utilizing a semantically-sensitive vocabulary-based taxonomy ; and facilitating presentation of a graphical user interface to the user including a recommendation of an item of potential interest to a user in the topic- specific social network , wherein the recommended item is determined based on social behavior associated with users in the topic-specific social network ; facilitating presentation , within the graphical user interface , of an indication of the rationale utilized in determining that the item may be of interest to the user ; facilitating presentation , within the graphical user interface , of an opportunity for the user to provide feedback relating to the recommendation . |
| US9087321B2 CLAIM 22 . The computer program product (computer program product) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
WO2009085602A1 CLAIM 20 . A computer program product (computer program product) , comprising computer-readable medium comprising instructions for causing a processing unit to perform a method for recommending items of potential interest to users in a computer-based network , the method comprising : obtaining information relating to one or more types of computer-based social behavior for multiple users ; determining one or more implied topic-specific social networks based at least in part on the obtained social behavior information and utilizing a semantically-sensitive vocabulary-based taxonomy ; and facilitating presentation of a graphical user interface to the user including a recommendation of an item of potential interest to a user in the topic- specific social network , wherein the recommended item is determined based on social behavior associated with users in the topic-specific social network ; facilitating presentation , within the graphical user interface , of an indication of the rationale utilized in determining that the item may be of interest to the user ; facilitating presentation , within the graphical user interface , of an opportunity for the user to provide feedback relating to the recommendation . |
| US9087321B2 CLAIM 23 . The computer program product (computer program product) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
WO2009085602A1 CLAIM 20 . A computer program product (computer program product) , comprising computer-readable medium comprising instructions for causing a processing unit to perform a method for recommending items of potential interest to users in a computer-based network , the method comprising : obtaining information relating to one or more types of computer-based social behavior for multiple users ; determining one or more implied topic-specific social networks based at least in part on the obtained social behavior information and utilizing a semantically-sensitive vocabulary-based taxonomy ; and facilitating presentation of a graphical user interface to the user including a recommendation of an item of potential interest to a user in the topic- specific social network , wherein the recommended item is determined based on social behavior associated with users in the topic-specific social network ; facilitating presentation , within the graphical user interface , of an indication of the rationale utilized in determining that the item may be of interest to the user ; facilitating presentation , within the graphical user interface , of an opportunity for the user to provide feedback relating to the recommendation . |
| US9087321B2 CLAIM 24 . The computer program product (computer program product) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
WO2009085602A1 CLAIM 20 . A computer program product (computer program product) , comprising computer-readable medium comprising instructions for causing a processing unit to perform a method for recommending items of potential interest to users in a computer-based network , the method comprising : obtaining information relating to one or more types of computer-based social behavior for multiple users ; determining one or more implied topic-specific social networks based at least in part on the obtained social behavior information and utilizing a semantically-sensitive vocabulary-based taxonomy ; and facilitating presentation of a graphical user interface to the user including a recommendation of an item of potential interest to a user in the topic- specific social network , wherein the recommended item is determined based on social behavior associated with users in the topic-specific social network ; facilitating presentation , within the graphical user interface , of an indication of the rationale utilized in determining that the item may be of interest to the user ; facilitating presentation , within the graphical user interface , of an opportunity for the user to provide feedback relating to the recommendation . |
| US9087321B2 CLAIM 25 . The computer program product (computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
WO2009085602A1 CLAIM 20 . A computer program product (computer program product) , comprising computer-readable medium comprising instructions for causing a processing unit to perform a method for recommending items of potential interest to users in a computer-based network , the method comprising : obtaining information relating to one or more types of computer-based social behavior for multiple users ; determining one or more implied topic-specific social networks based at least in part on the obtained social behavior information and utilizing a semantically-sensitive vocabulary-based taxonomy ; and facilitating presentation of a graphical user interface to the user including a recommendation of an item of potential interest to a user in the topic- specific social network , wherein the recommended item is determined based on social behavior associated with users in the topic-specific social network ; facilitating presentation , within the graphical user interface , of an indication of the rationale utilized in determining that the item may be of interest to the user ; facilitating presentation , within the graphical user interface , of an opportunity for the user to provide feedback relating to the recommendation . |
| US9087321B2 CLAIM 26 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
WO2009085602A1 CLAIM 20 . A computer program product (computer program product) , comprising computer-readable medium comprising instructions for causing a processing unit to perform a method for recommending items of potential interest to users in a computer-based network , the method comprising : obtaining information relating to one or more types of computer-based social behavior for multiple users ; determining one or more implied topic-specific social networks based at least in part on the obtained social behavior information and utilizing a semantically-sensitive vocabulary-based taxonomy ; and facilitating presentation of a graphical user interface to the user including a recommendation of an item of potential interest to a user in the topic- specific social network , wherein the recommended item is determined based on social behavior associated with users in the topic-specific social network ; facilitating presentation , within the graphical user interface , of an indication of the rationale utilized in determining that the item may be of interest to the user ; facilitating presentation , within the graphical user interface , of an opportunity for the user to provide feedback relating to the recommendation . |
| US9087321B2 CLAIM 27 . The computer program product (computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
WO2009085602A1 CLAIM 20 . A computer program product (computer program product) , comprising computer-readable medium comprising instructions for causing a processing unit to perform a method for recommending items of potential interest to users in a computer-based network , the method comprising : obtaining information relating to one or more types of computer-based social behavior for multiple users ; determining one or more implied topic-specific social networks based at least in part on the obtained social behavior information and utilizing a semantically-sensitive vocabulary-based taxonomy ; and facilitating presentation of a graphical user interface to the user including a recommendation of an item of potential interest to a user in the topic- specific social network , wherein the recommended item is determined based on social behavior associated with users in the topic-specific social network ; facilitating presentation , within the graphical user interface , of an indication of the rationale utilized in determining that the item may be of interest to the user ; facilitating presentation , within the graphical user interface , of an opportunity for the user to provide feedback relating to the recommendation . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | WO2009067262A2 Filed: 2008-11-21 Issued: 2009-05-28 Collector device and system utilizing standardized utility metering protocol (Original Assignee) Trilliant Networks, Inc. Michel Veillette |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (using one) from a user to generate a unique user profile for the user ; providing the user a first polling (applying compression) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
WO2009067262A2 CLAIM 179 . The system of claim 167 , wherein the means for compressing first table prior to transmitting to the head end server includes a processor for applying compression (first polling) algorithms for compressing the first table . WO2009067262A2 CLAIM 184 . The system of claim 182 , wherein the collector processor compresses the first table using one (user information) or more compression algorithms prior to transmitting to the head end server . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question (active network) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (applying compression) question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
WO2009067262A2 CLAIM 179 . The system of claim 167 , wherein the means for compressing first table prior to transmitting to the head end server includes a processor for applying compression (first polling) algorithms for compressing the first table . WO2009067262A2 CLAIM 206 . The system of claim 205 , wherein the means for seeking the new collector by the node includes a receiver for detecting active network (next polling question, match aggregator, match servers) s and receiving responses from the new collector , a transmitter for transmitting a request for association , and a processor to run software for associating with a new collector . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (active network) , to a plurality of match servers (active network) , each match server (lot number) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
WO2009067262A2 CLAIM 146 . The system of claim 141 , wherein the means for generating a substantially random time slot within a prescheduled reporting time window for each node comprises a random time slot number (match server) generator . WO2009067262A2 CLAIM 206 . The system of claim 205 , wherein the means for seeking the new collector by the node includes a receiver for detecting active network (next polling question, match aggregator, match servers) s and receiving responses from the new collector , a transmitter for transmitting a request for association , and a processor to run software for associating with a new collector . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (lot number) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
WO2009067262A2 CLAIM 146 . The system of claim 141 , wherein the means for generating a substantially random time slot within a prescheduled reporting time window for each node comprises a random time slot number (match server) generator . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (active network) , to a plurality of match servers (active network) , each match server (lot number) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
WO2009067262A2 CLAIM 146 . The system of claim 141 , wherein the means for generating a substantially random time slot within a prescheduled reporting time window for each node comprises a random time slot number (match server) generator . WO2009067262A2 CLAIM 206 . The system of claim 205 , wherein the means for seeking the new collector by the node includes a receiver for detecting active network (next polling question, match aggregator, match servers) s and receiving responses from the new collector , a transmitter for transmitting a request for association , and a processor to run software for associating with a new collector . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (lot number) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
WO2009067262A2 CLAIM 146 . The system of claim 141 , wherein the means for generating a substantially random time slot within a prescheduled reporting time window for each node comprises a random time slot number (match server) generator . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (using one) from a user to generate a unique user profile for the user ; providing the user a first polling (applying compression) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
WO2009067262A2 CLAIM 179 . The system of claim 167 , wherein the means for compressing first table prior to transmitting to the head end server includes a processor for applying compression (first polling) algorithms for compressing the first table . WO2009067262A2 CLAIM 184 . The system of claim 182 , wherein the collector processor compresses the first table using one (user information) or more compression algorithms prior to transmitting to the head end server . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question (active network) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (applying compression) question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
WO2009067262A2 CLAIM 179 . The system of claim 167 , wherein the means for compressing first table prior to transmitting to the head end server includes a processor for applying compression (first polling) algorithms for compressing the first table . WO2009067262A2 CLAIM 206 . The system of claim 205 , wherein the means for seeking the new collector by the node includes a receiver for detecting active network (next polling question, match aggregator, match servers) s and receiving responses from the new collector , a transmitter for transmitting a request for association , and a processor to run software for associating with a new collector . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (active network) , to a plurality of match servers (active network) , each match server (lot number) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
WO2009067262A2 CLAIM 146 . The system of claim 141 , wherein the means for generating a substantially random time slot within a prescheduled reporting time window for each node comprises a random time slot number (match server) generator . WO2009067262A2 CLAIM 206 . The system of claim 205 , wherein the means for seeking the new collector by the node includes a receiver for detecting active network (next polling question, match aggregator, match servers) s and receiving responses from the new collector , a transmitter for transmitting a request for association , and a processor to run software for associating with a new collector . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (lot number) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
WO2009067262A2 CLAIM 146 . The system of claim 141 , wherein the means for generating a substantially random time slot within a prescheduled reporting time window for each node comprises a random time slot number (match server) generator . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (active network) , to a plurality of match servers (active network) , each match server (lot number) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
WO2009067262A2 CLAIM 146 . The system of claim 141 , wherein the means for generating a substantially random time slot within a prescheduled reporting time window for each node comprises a random time slot number (match server) generator . WO2009067262A2 CLAIM 206 . The system of claim 205 , wherein the means for seeking the new collector by the node includes a receiver for detecting active network (next polling question, match aggregator, match servers) s and receiving responses from the new collector , a transmitter for transmitting a request for association , and a processor to run software for associating with a new collector . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (lot number) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
WO2009067262A2 CLAIM 146 . The system of claim 141 , wherein the means for generating a substantially random time slot within a prescheduled reporting time window for each node comprises a random time slot number (match server) generator . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (using one) from a user to generate a unique user profile for the user ; providing the user a first polling (applying compression) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
WO2009067262A2 CLAIM 179 . The system of claim 167 , wherein the means for compressing first table prior to transmitting to the head end server includes a processor for applying compression (first polling) algorithms for compressing the first table . WO2009067262A2 CLAIM 184 . The system of claim 182 , wherein the collector processor compresses the first table using one (user information) or more compression algorithms prior to transmitting to the head end server . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question (active network) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (applying compression) question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
WO2009067262A2 CLAIM 179 . The system of claim 167 , wherein the means for compressing first table prior to transmitting to the head end server includes a processor for applying compression (first polling) algorithms for compressing the first table . WO2009067262A2 CLAIM 206 . The system of claim 205 , wherein the means for seeking the new collector by the node includes a receiver for detecting active network (next polling question, match aggregator, match servers) s and receiving responses from the new collector , a transmitter for transmitting a request for association , and a processor to run software for associating with a new collector . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (active network) , to a plurality of match servers (active network) , each match server (lot number) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
WO2009067262A2 CLAIM 146 . The system of claim 141 , wherein the means for generating a substantially random time slot within a prescheduled reporting time window for each node comprises a random time slot number (match server) generator . WO2009067262A2 CLAIM 206 . The system of claim 205 , wherein the means for seeking the new collector by the node includes a receiver for detecting active network (next polling question, match aggregator, match servers) s and receiving responses from the new collector , a transmitter for transmitting a request for association , and a processor to run software for associating with a new collector . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (lot number) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
WO2009067262A2 CLAIM 146 . The system of claim 141 , wherein the means for generating a substantially random time slot within a prescheduled reporting time window for each node comprises a random time slot number (match server) generator . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (active network) , to a plurality of match servers (active network) , each match server (lot number) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
WO2009067262A2 CLAIM 146 . The system of claim 141 , wherein the means for generating a substantially random time slot within a prescheduled reporting time window for each node comprises a random time slot number (match server) generator . WO2009067262A2 CLAIM 206 . The system of claim 205 , wherein the means for seeking the new collector by the node includes a receiver for detecting active network (next polling question, match aggregator, match servers) s and receiving responses from the new collector , a transmitter for transmitting a request for association , and a processor to run software for associating with a new collector . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (lot number) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
WO2009067262A2 CLAIM 146 . The system of claim 141 , wherein the means for generating a substantially random time slot within a prescheduled reporting time window for each node comprises a random time slot number (match server) generator . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20100042647A1 Filed: 2008-08-14 Issued: 2010-02-18 Method and system for recording real-time communications (Original Assignee) Verizon Business Network Services Inc (Current Assignee) Verizon Patent and Licensing Inc Paul T. Schultz, Robert A. Sartini, Martin W. MCKEE |
|---|---|
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands (key sequence) to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20100042647A1 CLAIM 2 . A method of claim 1 , wherein the rule specifies one of key sequence (match commands) s to initiate recording and delivery of media content , buffering time , duration of the recording , a target device for receiving delivery of the media content , media type for the delivery , or any combination thereof . US20100042647A1 CLAIM 19 . A system comprising : a platform configured to receive a request from a user device over a communication network to record media content transported in a communication session with the user device ; and a database configured to store (receiving match commands to identify users) a rule for treatment of the content , wherein the platform is further configured to buffer and deliver the media content , according to the rule , during the communication session . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (electronic mail, web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20100042647A1 CLAIM 3 . A method of claim 2 , wherein the target device includes either a wireless device , a web server (web server) , a mobile computer , set top box , or a desktop computer . US20100042647A1 CLAIM 5 . A method of claim 2 , wherein the media type includes electronic mail (web server) , instant communication , short message service , multimedia messaging service . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (electronic mail, web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20100042647A1 CLAIM 3 . A method of claim 2 , wherein the target device includes either a wireless device , a web server (web server) , a mobile computer , set top box , or a desktop computer . US20100042647A1 CLAIM 5 . A method of claim 2 , wherein the media type includes electronic mail (web server) , instant communication , short message service , multimedia messaging service . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands (key sequence) to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20100042647A1 CLAIM 2 . A method of claim 1 , wherein the rule specifies one of key sequence (match commands) s to initiate recording and delivery of media content , buffering time , duration of the recording , a target device for receiving delivery of the media content , media type for the delivery , or any combination thereof . US20100042647A1 CLAIM 19 . A system comprising : a platform configured to receive a request from a user device over a communication network to record media content transported in a communication session with the user device ; and a database configured to store (receiving match commands to identify users) a rule for treatment of the content , wherein the platform is further configured to buffer and deliver the media content , according to the rule , during the communication session . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (electronic mail, web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20100042647A1 CLAIM 3 . A method of claim 2 , wherein the target device includes either a wireless device , a web server (web server) , a mobile computer , set top box , or a desktop computer . US20100042647A1 CLAIM 5 . A method of claim 2 , wherein the media type includes electronic mail (web server) , instant communication , short message service , multimedia messaging service . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (electronic mail, web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20100042647A1 CLAIM 3 . A method of claim 2 , wherein the target device includes either a wireless device , a web server (web server) , a mobile computer , set top box , or a desktop computer . US20100042647A1 CLAIM 5 . A method of claim 2 , wherein the media type includes electronic mail (web server) , instant communication , short message service , multimedia messaging service . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands (key sequence) to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20100042647A1 CLAIM 2 . A method of claim 1 , wherein the rule specifies one of key sequence (match commands) s to initiate recording and delivery of media content , buffering time , duration of the recording , a target device for receiving delivery of the media content , media type for the delivery , or any combination thereof . US20100042647A1 CLAIM 19 . A system comprising : a platform configured to receive a request from a user device over a communication network to record media content transported in a communication session with the user device ; and a database configured to store (receiving match commands to identify users) a rule for treatment of the content , wherein the platform is further configured to buffer and deliver the media content , according to the rule , during the communication session . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (electronic mail, web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20100042647A1 CLAIM 3 . A method of claim 2 , wherein the target device includes either a wireless device , a web server (web server) , a mobile computer , set top box , or a desktop computer . US20100042647A1 CLAIM 5 . A method of claim 2 , wherein the media type includes electronic mail (web server) , instant communication , short message service , multimedia messaging service . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (electronic mail, web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20100042647A1 CLAIM 3 . A method of claim 2 , wherein the target device includes either a wireless device , a web server (web server) , a mobile computer , set top box , or a desktop computer . US20100042647A1 CLAIM 5 . A method of claim 2 , wherein the media type includes electronic mail (web server) , instant communication , short message service , multimedia messaging service . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20100036934A1 Filed: 2008-08-07 Issued: 2010-02-11 Network Based Community and Contest System and Method for Same (Original Assignee) BRUSTERPOWERS LLC (Current Assignee) BRUSTERPOWERS LLC Anthony K. Bruster |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (World Wide Web, network site) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20100036934A1 CLAIM 1 . A method of creating a community of users on a network comprising : presenting a topic on a first user-accessible network site (web server) ; receiving from a user an indication that the user has experienced the topic ; receiving from the user content relating to the topic ; and posting on a second user accessible network site the content . US20100036934A1 CLAIM 2 . The method of claim 1 wherein the first user-accessible network site is a World Wide Web (web server) page . US20100036934A1 CLAIM 17 . A computer readable medium (match server) containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20100036934A1 CLAIM 17 . A computer readable medium (match server) containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (World Wide Web, network site) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20100036934A1 CLAIM 1 . A method of creating a community of users on a network comprising : presenting a topic on a first user-accessible network site (web server) ; receiving from a user an indication that the user has experienced the topic ; receiving from the user content relating to the topic ; and posting on a second user accessible network site the content . US20100036934A1 CLAIM 2 . The method of claim 1 wherein the first user-accessible network site is a World Wide Web (web server) page . US20100036934A1 CLAIM 17 . A computer readable medium (match server) containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20100036934A1 CLAIM 17 . A computer readable medium (match server) containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (World Wide Web, network site) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20100036934A1 CLAIM 1 . A method of creating a community of users on a network comprising : presenting a topic on a first user-accessible network site (web server) ; receiving from a user an indication that the user has experienced the topic ; receiving from the user content relating to the topic ; and posting on a second user accessible network site the content . US20100036934A1 CLAIM 2 . The method of claim 1 wherein the first user-accessible network site is a World Wide Web (web server) page . US20100036934A1 CLAIM 17 . A computer readable medium (match server) containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20100036934A1 CLAIM 17 . A computer readable medium (match server) containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (World Wide Web, network site) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20100036934A1 CLAIM 1 . A method of creating a community of users on a network comprising : presenting a topic on a first user-accessible network site (web server) ; receiving from a user an indication that the user has experienced the topic ; receiving from the user content relating to the topic ; and posting on a second user accessible network site the content . US20100036934A1 CLAIM 2 . The method of claim 1 wherein the first user-accessible network site is a World Wide Web (web server) page . US20100036934A1 CLAIM 17 . A computer readable medium (match server) containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20100036934A1 CLAIM 17 . A computer readable medium (match server) containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 CLAIM 19 . A computer program product (first input) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20100036934A1 CLAIM 17 . A computer readable medium containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input (computer program product) element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 CLAIM 20 . The computer program product (first input) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20100036934A1 CLAIM 17 . A computer readable medium containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input (computer program product) element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 CLAIM 21 . The computer program product (first input) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20100036934A1 CLAIM 17 . A computer readable medium containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input (computer program product) element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 CLAIM 22 . The computer program product (first input) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20100036934A1 CLAIM 17 . A computer readable medium containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input (computer program product) element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 CLAIM 23 . The computer program product (first input) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20100036934A1 CLAIM 17 . A computer readable medium containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input (computer program product) element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 CLAIM 24 . The computer program product (first input) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (World Wide Web, network site) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20100036934A1 CLAIM 1 . A method of creating a community of users on a network comprising : presenting a topic on a first user-accessible network site (web server) ; receiving from a user an indication that the user has experienced the topic ; receiving from the user content relating to the topic ; and posting on a second user accessible network site the content . US20100036934A1 CLAIM 2 . The method of claim 1 wherein the first user-accessible network site is a World Wide Web (web server) page . US20100036934A1 CLAIM 17 . A computer readable medium (match server) containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input (computer program product) element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 CLAIM 25 . The computer program product (first input) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20100036934A1 CLAIM 17 . A computer readable medium (match server) containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input (computer program product) element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 CLAIM 26 . The computer program product (first input) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (World Wide Web, network site) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20100036934A1 CLAIM 1 . A method of creating a community of users on a network comprising : presenting a topic on a first user-accessible network site (web server) ; receiving from a user an indication that the user has experienced the topic ; receiving from the user content relating to the topic ; and posting on a second user accessible network site the content . US20100036934A1 CLAIM 2 . The method of claim 1 wherein the first user-accessible network site is a World Wide Web (web server) page . US20100036934A1 CLAIM 17 . A computer readable medium (match server) containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input (computer program product) element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 CLAIM 27 . The computer program product (first input) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20100036934A1 CLAIM 17 . A computer readable medium (match server) containing programming instructions to : present on a remote computer a first graphical user interface page having a link to user-posted content , a link to a topic , a first input (computer program product) element for a user to indicate having experienced the topic , and a second input element for a user to indicate a desire to experience the topic . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20090319940A1 Filed: 2008-06-20 Issued: 2009-12-24 Network of trust as married to multi-scale (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Gary W. Flake, Blaise Aguera y Arcas, Anthony T. Chor, Karim Farouki, Stephen L. Lawler, Ariel J. Lazier, Adam P. Sheppard, Richard Stephen Szeliski |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (profile data) of other users that have a likelihood of match within a predetermined threshold . |
US20090319940A1 CLAIM 6 . The system of claim 5 , the organization component identifies the interest with the browsing session by examining at least one of an application executing in connection with the browsing session , a user behavior within the browsing session , a portion of profile data (user profiles) , a browsing history related to a browsing session , usage of the browsing session , a portion of implicit user data , a portion of explicit user data , data related to a user preference , or content interaction history for a user . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (Internet protocol) . |
US20090319940A1 CLAIM 4 . The system of claim 1 , the network is at least one of a social network , a computing network , a business network , an Internet protocol (polling questions) (IP) network , or a cellular network . US20090319940A1 CLAIM 6 . The system of claim 5 , the organization component identifies the interest with the browsing session by examining at least one of an application executing in connection with the browsing session , a user behavior within the browsing session , a portion of profile data (user profiles) , a browsing history related to a browsing session , usage of the browsing session , a portion of implicit user data , a portion of explicit user data , data related to a user preference , or content interaction history for a user . US20090319940A1 CLAIM 7 . The system of claim 5 , the organization component identifies the interest with the browsing session by examining at least one of an application version data , type of application , frequency of use of the application , copyright data for the application , manufacturer of the application , size of the application , a click frequency within the browsing session , scroll frequency within the browsing session , a portion of highlighting within the browsing session , an input received during the browsing session , input device location (next polling questions) , a duration of browsing on a particular portion of data , an explicit tagging within the browsing session , a frequency of browsing a portion of data , a data feed subscription , or data related to a user setting for a personalized web site . |
| US9087321B2 CLAIM 4 . The poll-based networking system as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions (Internet protocol) as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20090319940A1 CLAIM 4 . The system of claim 1 , the network is at least one of a social network , a computing network , a business network , an Internet protocol (polling questions) (IP) network , or a cellular network . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (profile data) of other users that have a likelihood of match within a predetermined threshold . |
US20090319940A1 CLAIM 6 . The system of claim 5 , the organization component identifies the interest with the browsing session by examining at least one of an application executing in connection with the browsing session , a user behavior within the browsing session , a portion of profile data (user profiles) , a browsing history related to a browsing session , usage of the browsing session , a portion of implicit user data , a portion of explicit user data , data related to a user preference , or content interaction history for a user . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (Internet protocol) . |
US20090319940A1 CLAIM 4 . The system of claim 1 , the network is at least one of a social network , a computing network , a business network , an Internet protocol (polling questions) (IP) network , or a cellular network . US20090319940A1 CLAIM 6 . The system of claim 5 , the organization component identifies the interest with the browsing session by examining at least one of an application executing in connection with the browsing session , a user behavior within the browsing session , a portion of profile data (user profiles) , a browsing history related to a browsing session , usage of the browsing session , a portion of implicit user data , a portion of explicit user data , data related to a user preference , or content interaction history for a user . US20090319940A1 CLAIM 7 . The system of claim 5 , the organization component identifies the interest with the browsing session by examining at least one of an application version data , type of application , frequency of use of the application , copyright data for the application , manufacturer of the application , size of the application , a click frequency within the browsing session , scroll frequency within the browsing session , a portion of highlighting within the browsing session , an input received during the browsing session , input device location (next polling questions) , a duration of browsing on a particular portion of data , an explicit tagging within the browsing session , a frequency of browsing a portion of data , a data feed subscription , or data related to a user setting for a personalized web site . |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , further comprising an act of causing the one or more processors to perform operations of : determining a total number of polling questions (Internet protocol) as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20090319940A1 CLAIM 4 . The system of claim 1 , the network is at least one of a social network , a computing network , a business network , an Internet protocol (polling questions) (IP) network , or a cellular network . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (profile data) of other users that have a likelihood of match within a predetermined threshold . |
US20090319940A1 CLAIM 6 . The system of claim 5 , the organization component identifies the interest with the browsing session by examining at least one of an application executing in connection with the browsing session , a user behavior within the browsing session , a portion of profile data (user profiles) , a browsing history related to a browsing session , usage of the browsing session , a portion of implicit user data , a portion of explicit user data , data related to a user preference , or content interaction history for a user . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (Internet protocol) . |
US20090319940A1 CLAIM 4 . The system of claim 1 , the network is at least one of a social network , a computing network , a business network , an Internet protocol (polling questions) (IP) network , or a cellular network . US20090319940A1 CLAIM 6 . The system of claim 5 , the organization component identifies the interest with the browsing session by examining at least one of an application executing in connection with the browsing session , a user behavior within the browsing session , a portion of profile data (user profiles) , a browsing history related to a browsing session , usage of the browsing session , a portion of implicit user data , a portion of explicit user data , data related to a user preference , or content interaction history for a user . US20090319940A1 CLAIM 7 . The system of claim 5 , the organization component identifies the interest with the browsing session by examining at least one of an application version data , type of application , frequency of use of the application , copyright data for the application , manufacturer of the application , size of the application , a click frequency within the browsing session , scroll frequency within the browsing session , a portion of highlighting within the browsing session , an input received during the browsing session , input device location (next polling questions) , a duration of browsing on a particular portion of data , an explicit tagging within the browsing session , a frequency of browsing a portion of data , a data feed subscription , or data related to a user setting for a personalized web site . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions (Internet protocol) as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20090319940A1 CLAIM 4 . The system of claim 1 , the network is at least one of a social network , a computing network , a business network , an Internet protocol (polling questions) (IP) network , or a cellular network . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | WO2008154648A1 Filed: 2008-06-12 Issued: 2008-12-18 Personalized social networking application content (Original Assignee) Facebook, Inc. Adam D'angelo, Charlie Cheever, Ari Steinberg, James Wang, Mark Slee |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system (social networking) , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profile data) of other users that have a likelihood of match within a predetermined threshold . |
WO2008154648A1 CLAIM 1 . A method of providing access to user profile data (user profiles) maintained by a social network website to a third-party application server , the method comprising : receiving , at the social network website , a request to access an application from a user ; identifying the third-party application server associated with the request ; determining a user profile associated with the user providing the request to access the application , the user profile including a user identifier ; and transmitting the user identifier , user data associated with the user identifier , and the request to access the application to the third-party application server . WO2008154648A1 CLAIM 11 . A system for sharing user profile data between a social network website and a third-party application server , the system comprising a profile store including a profile for each of a plurality of users of the social networking (networking system) website , each profile identifying a connection to each of a plurality of other users of the social networking website ; an application identification module adapted to communicate with the profile store , the application identification module including a plurality of application profiles , each application profile including an application identifier , an application address and application data , the application data identifying data from a profile ; and a communication module adapted to communicate with the application identification module and the profile store , the communication module receiving a destination application identifier and a requesting profile and transmitting data associated with the requesting profile to the application address associated with the destination application identifier . |
| US9087321B2 CLAIM 2 . The poll-based networking system (social networking) as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
WO2008154648A1 CLAIM 1 . A method of providing access to user profile data (user profiles) maintained by a social network website to a third-party application server , the method comprising : receiving , at the social network website , a request to access an application from a user ; identifying the third-party application server associated with the request ; determining a user profile associated with the user providing the request to access the application , the user profile including a user identifier ; and transmitting the user identifier , user data associated with the user identifier , and the request to access the application to the third-party application server . WO2008154648A1 CLAIM 11 . A system for sharing user profile data between a social network website and a third-party application server , the system comprising a profile store including a profile for each of a plurality of users of the social networking (networking system) website , each profile identifying a connection to each of a plurality of other users of the social networking website ; an application identification module adapted to communicate with the profile store , the application identification module including a plurality of application profiles , each application profile including an application identifier , an application address and application data , the application data identifying data from a profile ; and a communication module adapted to communicate with the application identification module and the profile store , the communication module receiving a destination application identifier and a requesting profile and transmitting data associated with the requesting profile to the application address associated with the destination application identifier . |
| US9087321B2 CLAIM 3 . The poll-based networking system (social networking) as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
WO2008154648A1 CLAIM 11 . A system for sharing user profile data between a social network website and a third-party application server , the system comprising a profile store including a profile for each of a plurality of users of the social networking (networking system) website , each profile identifying a connection to each of a plurality of other users of the social networking website ; an application identification module adapted to communicate with the profile store , the application identification module including a plurality of application profiles , each application profile including an application identifier , an application address and application data , the application data identifying data from a profile ; and a communication module adapted to communicate with the application identification module and the profile store , the communication module receiving a destination application identifier and a requesting profile and transmitting data associated with the requesting profile to the application address associated with the destination application identifier . |
| US9087321B2 CLAIM 4 . The poll-based networking system (social networking) as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
WO2008154648A1 CLAIM 11 . A system for sharing user profile data between a social network website and a third-party application server , the system comprising a profile store including a profile for each of a plurality of users of the social networking (networking system) website , each profile identifying a connection to each of a plurality of other users of the social networking website ; an application identification module adapted to communicate with the profile store , the application identification module including a plurality of application profiles , each application profile including an application identifier , an application address and application data , the application data identifying data from a profile ; and a communication module adapted to communicate with the application identification module and the profile store , the communication module receiving a destination application identifier and a requesting profile and transmitting data associated with the requesting profile to the application address associated with the destination application identifier . |
| US9087321B2 CLAIM 5 . The poll-based networking system (social networking) as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
WO2008154648A1 CLAIM 11 . A system for sharing user profile data between a social network website and a third-party application server , the system comprising a profile store including a profile for each of a plurality of users of the social networking (networking system) website , each profile identifying a connection to each of a plurality of other users of the social networking website ; an application identification module adapted to communicate with the profile store , the application identification module including a plurality of application profiles , each application profile including an application identifier , an application address and application data , the application data identifying data from a profile ; and a communication module adapted to communicate with the application identification module and the profile store , the communication module receiving a destination application identifier and a requesting profile and transmitting data associated with the requesting profile to the application address associated with the destination application identifier . |
| US9087321B2 CLAIM 6 . The poll-based networking system (social networking) as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
WO2008154648A1 CLAIM 11 . A system for sharing user profile data between a social network website and a third-party application server , the system comprising a profile store including a profile for each of a plurality of users of the social networking (networking system) website , each profile identifying a connection to each of a plurality of other users of the social networking website ; an application identification module adapted to communicate with the profile store , the application identification module including a plurality of application profiles , each application profile including an application identifier , an application address and application data , the application data identifying data from a profile ; and a communication module adapted to communicate with the application identification module and the profile store , the communication module receiving a destination application identifier and a requesting profile and transmitting data associated with the requesting profile to the application address associated with the destination application identifier . |
| US9087321B2 CLAIM 7 . The poll-based networking system (social networking) as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
WO2008154648A1 CLAIM 11 . A system for sharing user profile data between a social network website and a third-party application server , the system comprising a profile store including a profile for each of a plurality of users of the social networking (networking system) website , each profile identifying a connection to each of a plurality of other users of the social networking website ; an application identification module adapted to communicate with the profile store , the application identification module including a plurality of application profiles , each application profile including an application identifier , an application address and application data , the application data identifying data from a profile ; and a communication module adapted to communicate with the application identification module and the profile store , the communication module receiving a destination application identifier and a requesting profile and transmitting data associated with the requesting profile to the application address associated with the destination application identifier . |
| US9087321B2 CLAIM 8 . The poll-based networking system (social networking) as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
WO2008154648A1 CLAIM 11 . A system for sharing user profile data between a social network website and a third-party application server , the system comprising a profile store including a profile for each of a plurality of users of the social networking (networking system) website , each profile identifying a connection to each of a plurality of other users of the social networking website ; an application identification module adapted to communicate with the profile store , the application identification module including a plurality of application profiles , each application profile including an application identifier , an application address and application data , the application data identifying data from a profile ; and a communication module adapted to communicate with the application identification module and the profile store , the communication module receiving a destination application identifier and a requesting profile and transmitting data associated with the requesting profile to the application address associated with the destination application identifier . |
| US9087321B2 CLAIM 9 . The poll-based networking system (social networking) as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
WO2008154648A1 CLAIM 11 . A system for sharing user profile data between a social network website and a third-party application server , the system comprising a profile store including a profile for each of a plurality of users of the social networking (networking system) website , each profile identifying a connection to each of a plurality of other users of the social networking website ; an application identification module adapted to communicate with the profile store , the application identification module including a plurality of application profiles , each application profile including an application identifier , an application address and application data , the application data identifying data from a profile ; and a communication module adapted to communicate with the application identification module and the profile store , the communication module receiving a destination application identifier and a requesting profile and transmitting data associated with the requesting profile to the application address associated with the destination application identifier . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profile data) of other users that have a likelihood of match within a predetermined threshold . |
WO2008154648A1 CLAIM 1 . A method of providing access to user profile data (user profiles) maintained by a social network website to a third-party application server , the method comprising : receiving , at the social network website , a request to access an application from a user ; identifying the third-party application server associated with the request ; determining a user profile associated with the user providing the request to access the application , the user profile including a user identifier ; and transmitting the user identifier , user data associated with the user identifier , and the request to access the application to the third-party application server . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
WO2008154648A1 CLAIM 1 . A method of providing access to user profile data (user profiles) maintained by a social network website to a third-party application server , the method comprising : receiving , at the social network website , a request to access an application from a user ; identifying the third-party application server associated with the request ; determining a user profile associated with the user providing the request to access the application , the user profile including a user identifier ; and transmitting the user identifier , user data associated with the user identifier , and the request to access the application to the third-party application server . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profile data) of other users that have a likelihood of match within a predetermined threshold . |
WO2008154648A1 CLAIM 1 . A method of providing access to user profile data (user profiles) maintained by a social network website to a third-party application server , the method comprising : receiving , at the social network website , a request to access an application from a user ; identifying the third-party application server associated with the request ; determining a user profile associated with the user providing the request to access the application , the user profile including a user identifier ; and transmitting the user identifier , user data associated with the user identifier , and the request to access the application to the third-party application server . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
WO2008154648A1 CLAIM 1 . A method of providing access to user profile data (user profiles) maintained by a social network website to a third-party application server , the method comprising : receiving , at the social network website , a request to access an application from a user ; identifying the third-party application server associated with the request ; determining a user profile associated with the user providing the request to access the application , the user profile including a user identifier ; and transmitting the user identifier , user data associated with the user identifier , and the request to access the application to the third-party application server . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20090307038A1 Filed: 2008-06-10 Issued: 2009-12-10 System and method for creation of data feeds based on calender meeting participants (Original Assignee) International Business Machines Corp (Current Assignee) International Business Machines Corp Al Chakra, Melvin R. Jones, JR., Julie A. Meserve |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system (social networking) , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profile data) of other users that have a likelihood of match within a predetermined threshold . |
US20090307038A1 CLAIM 4 . The method of claim 1 , wherein the information about the topics includes one or more of personal notes about one or more of the participants , links to online articles , information from social networking (networking system) websites , electronic business cards , data from a participant' ; s employer database , and information from web pages about one or more of the participants . US20090307038A1 CLAIM 8 . An apparatus for determining data feeds in an electronic calendar , the apparatus comprising : a client calendar application configured to present meeting schedules and participant related data feeds ; a user profile data (user profiles) base including information about the meeting participants ; and a calendar management server configured to identify participants of a meeting scheduled in the electronic calendar , determine topics relevant to the participants of the meeting , select data feeds based on the topics relevant to the participants of the meeting , wherein the data feeds provide information about the topics , and present the data feeds to one or more of the participants of the meeting . |
| US9087321B2 CLAIM 2 . The poll-based networking system (social networking) as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20090307038A1 CLAIM 4 . The method of claim 1 , wherein the information about the topics includes one or more of personal notes about one or more of the participants , links to online articles , information from social networking (networking system) websites , electronic business cards , data from a participant' ; s employer database , and information from web pages about one or more of the participants . US20090307038A1 CLAIM 8 . An apparatus for determining data feeds in an electronic calendar , the apparatus comprising : a client calendar application configured to present meeting schedules and participant related data feeds ; a user profile data (user profiles) base including information about the meeting participants ; and a calendar management server configured to identify participants of a meeting scheduled in the electronic calendar , determine topics relevant to the participants of the meeting , select data feeds based on the topics relevant to the participants of the meeting , wherein the data feeds provide information about the topics , and present the data feeds to one or more of the participants of the meeting . |
| US9087321B2 CLAIM 3 . The poll-based networking system (social networking) as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20090307038A1 CLAIM 4 . The method of claim 1 , wherein the information about the topics includes one or more of personal notes about one or more of the participants , links to online articles , information from social networking (networking system) websites , electronic business cards , data from a participant' ; s employer database , and information from web pages about one or more of the participants . |
| US9087321B2 CLAIM 4 . The poll-based networking system (social networking) as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20090307038A1 CLAIM 4 . The method of claim 1 , wherein the information about the topics includes one or more of personal notes about one or more of the participants , links to online articles , information from social networking (networking system) websites , electronic business cards , data from a participant' ; s employer database , and information from web pages about one or more of the participants . |
| US9087321B2 CLAIM 5 . The poll-based networking system (social networking) as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20090307038A1 CLAIM 4 . The method of claim 1 , wherein the information about the topics includes one or more of personal notes about one or more of the participants , links to online articles , information from social networking (networking system) websites , electronic business cards , data from a participant' ; s employer database , and information from web pages about one or more of the participants . |
| US9087321B2 CLAIM 6 . The poll-based networking system (social networking) as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090307038A1 CLAIM 4 . The method of claim 1 , wherein the information about the topics includes one or more of personal notes about one or more of the participants , links to online articles , information from social networking (networking system) websites , electronic business cards , data from a participant' ; s employer database , and information from web pages about one or more of the participants . |
| US9087321B2 CLAIM 7 . The poll-based networking system (social networking) as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20090307038A1 CLAIM 4 . The method of claim 1 , wherein the information about the topics includes one or more of personal notes about one or more of the participants , links to online articles , information from social networking (networking system) websites , electronic business cards , data from a participant' ; s employer database , and information from web pages about one or more of the participants . |
| US9087321B2 CLAIM 8 . The poll-based networking system (social networking) as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090307038A1 CLAIM 4 . The method of claim 1 , wherein the information about the topics includes one or more of personal notes about one or more of the participants , links to online articles , information from social networking (networking system) websites , electronic business cards , data from a participant' ; s employer database , and information from web pages about one or more of the participants . |
| US9087321B2 CLAIM 9 . The poll-based networking system (social networking) as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20090307038A1 CLAIM 4 . The method of claim 1 , wherein the information about the topics includes one or more of personal notes about one or more of the participants , links to online articles , information from social networking (networking system) websites , electronic business cards , data from a participant' ; s employer database , and information from web pages about one or more of the participants . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profile data) of other users that have a likelihood of match within a predetermined threshold . |
US20090307038A1 CLAIM 8 . An apparatus for determining data feeds in an electronic calendar , the apparatus comprising : a client calendar application configured to present meeting schedules and participant related data feeds ; a user profile data (user profiles) base including information about the meeting participants ; and a calendar management server configured to identify participants of a meeting scheduled in the electronic calendar , determine topics relevant to the participants of the meeting , select data feeds based on the topics relevant to the participants of the meeting , wherein the data feeds provide information about the topics , and present the data feeds to one or more of the participants of the meeting . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20090307038A1 CLAIM 8 . An apparatus for determining data feeds in an electronic calendar , the apparatus comprising : a client calendar application configured to present meeting schedules and participant related data feeds ; a user profile data (user profiles) base including information about the meeting participants ; and a calendar management server configured to identify participants of a meeting scheduled in the electronic calendar , determine topics relevant to the participants of the meeting , select data feeds based on the topics relevant to the participants of the meeting , wherein the data feeds provide information about the topics , and present the data feeds to one or more of the participants of the meeting . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profile data) of other users that have a likelihood of match within a predetermined threshold . |
US20090307038A1 CLAIM 8 . An apparatus for determining data feeds in an electronic calendar , the apparatus comprising : a client calendar application configured to present meeting schedules and participant related data feeds ; a user profile data (user profiles) base including information about the meeting participants ; and a calendar management server configured to identify participants of a meeting scheduled in the electronic calendar , determine topics relevant to the participants of the meeting , select data feeds based on the topics relevant to the participants of the meeting , wherein the data feeds provide information about the topics , and present the data feeds to one or more of the participants of the meeting . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20090307038A1 CLAIM 8 . An apparatus for determining data feeds in an electronic calendar , the apparatus comprising : a client calendar application configured to present meeting schedules and participant related data feeds ; a user profile data (user profiles) base including information about the meeting participants ; and a calendar management server configured to identify participants of a meeting scheduled in the electronic calendar , determine topics relevant to the participants of the meeting , select data feeds based on the topics relevant to the participants of the meeting , wherein the data feeds provide information about the topics , and present the data feeds to one or more of the participants of the meeting . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2009282618A Filed: 2008-05-20 Issued: 2009-12-03 電子広告配信システム及び方法 (Original Assignee) Marubeni Corp; 丸紅株式会社 Nobuhei Hashiguchi, 信平 橋口 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers (ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 3 . The poll-based networking system as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers (ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 4 . The poll-based networking system as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (信手段) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2009282618A CLAIM 1 通信ネットワークを介して接続可能な広告配信装置及び電子広告出力装置を含むシステムであって、 前記電子広告出力装置は、広告を出力する広告出力手段と、 端末識別情報を記憶した携帯端末をかざすことにより前記端末識別情報を取得すると共に前記広告配信装置の前記通信ネットワーク上のアドレス情報を前記携帯端末に送信する手段と、 取得した前記端末識別情報を、前記携帯端末をかざした際に前記広告出力手段が出力していた広告の記録を示すログ情報に関連付けて前記通信ネットワークを介して前記広告配信装置に送信する手段と、を備え、 前記広告配信装置は、前記電子広告出力装置から送信された前記端末識別情報及び前記ログ情報を受信し、さらに前記携帯端末から前記端末識別情報を伴ってページ要求情報を受信したことに応じて、前記ログ情報に基づいて、前記携帯端末をかざした際に前記電子広告出力装置が出力していた広告に対応するコンテンツを抽出して、前記コンテンツを出力可能なページ情報を構成し、前記端末識別情報を送信した携帯端末に前記ページ情報を送信する広告配信手段 (executable instruction, computer executable instruction) を備える広告配信システム。 JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers (ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 12 . The computer implemented method as set forth in claim 11 , wherein , in cumulatively comparing , further comprising an act of causing the one or more processors to perform operations of : matching the user to other users based upon all of the selected answers (ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , further comprising an act of causing the one or more processors to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers (ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers (ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2009282618A CLAIM 6 前記広告配信装置は、前記携帯端末が表示した前記リンク情報を含むページにおいて、前記ユーザ (selected answers) が前記リンク情報を選択したことを示す情報を受信したことに応じて、前記リンク情報を、前記ユーザを識別するユーザ識別情報及び前記端末識別情報に関連付けてユーザ属性情報として記憶する手段をさらに備え、 前記広告配信手段は、受信した前記端末識別情報に基づいて前記ユーザ属性情報を参照し、前記ユーザ識別情報に関連付けて記憶した前記リンク情報に基づいて前記ページ情報に含めるリンク情報を変更する請求項５に記載の広告配信システム。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20090282107A1 Filed: 2008-05-09 Issued: 2009-11-12 Adaptive Electronic Introductions (Original Assignee) International Business Machines Corp (Current Assignee) International Business Machines Corp Patrick J. O'Sullivan, Hema Srikanth, Carol S. Zimmet |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system (social networking) , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20090282107A1 CLAIM 10 . The method of claim 1 , further comprising searching social networking (networking system) sites for information to be included in said electronic introduction . |
| US9087321B2 CLAIM 2 . The poll-based networking system (social networking) as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20090282107A1 CLAIM 10 . The method of claim 1 , further comprising searching social networking (networking system) sites for information to be included in said electronic introduction . |
| US9087321B2 CLAIM 3 . The poll-based networking system (social networking) as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20090282107A1 CLAIM 10 . The method of claim 1 , further comprising searching social networking (networking system) sites for information to be included in said electronic introduction . |
| US9087321B2 CLAIM 4 . The poll-based networking system (social networking) as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20090282107A1 CLAIM 10 . The method of claim 1 , further comprising searching social networking (networking system) sites for information to be included in said electronic introduction . |
| US9087321B2 CLAIM 5 . The poll-based networking system (social networking) as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20090282107A1 CLAIM 10 . The method of claim 1 , further comprising searching social networking (networking system) sites for information to be included in said electronic introduction . |
| US9087321B2 CLAIM 6 . The poll-based networking system (social networking) as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090282107A1 CLAIM 10 . The method of claim 1 , further comprising searching social networking (networking system) sites for information to be included in said electronic introduction . |
| US9087321B2 CLAIM 7 . The poll-based networking system (social networking) as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20090282107A1 CLAIM 10 . The method of claim 1 , further comprising searching social networking (networking system) sites for information to be included in said electronic introduction . |
| US9087321B2 CLAIM 8 . The poll-based networking system (social networking) as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090282107A1 CLAIM 10 . The method of claim 1 , further comprising searching social networking (networking system) sites for information to be included in said electronic introduction . |
| US9087321B2 CLAIM 9 . The poll-based networking system (social networking) as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20090282107A1 CLAIM 10 . The method of claim 1 , further comprising searching social networking (networking system) sites for information to be included in said electronic introduction . |
| US9087321B2 CLAIM 19 . A computer program product (computer usable program code, computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20090282107A1 CLAIM 19 . A computer program product (computer program product) for providing adaptive electronic introductions , the computer program product comprising : a computer usable medium having computer usable program code (computer program product) embodied therewith , the computer usable program code comprising : computer usable program code configured gather information and assemble information into an electronic introduction ; computer usable program code configured to associate said electronic introduction with a communication from said sender to a recipient ; computer usable program code configured to display said electronic introduction on request from said recipient ; and computer usable program code configured to automatically update said electronic introduction . |
| US9087321B2 CLAIM 20 . The computer program product (computer usable program code, computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20090282107A1 CLAIM 19 . A computer program product (computer program product) for providing adaptive electronic introductions , the computer program product comprising : a computer usable medium having computer usable program code (computer program product) embodied therewith , the computer usable program code comprising : computer usable program code configured gather information and assemble information into an electronic introduction ; computer usable program code configured to associate said electronic introduction with a communication from said sender to a recipient ; computer usable program code configured to display said electronic introduction on request from said recipient ; and computer usable program code configured to automatically update said electronic introduction . |
| US9087321B2 CLAIM 21 . The computer program product (computer usable program code, computer program product) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20090282107A1 CLAIM 19 . A computer program product (computer program product) for providing adaptive electronic introductions , the computer program product comprising : a computer usable medium having computer usable program code (computer program product) embodied therewith , the computer usable program code comprising : computer usable program code configured gather information and assemble information into an electronic introduction ; computer usable program code configured to associate said electronic introduction with a communication from said sender to a recipient ; computer usable program code configured to display said electronic introduction on request from said recipient ; and computer usable program code configured to automatically update said electronic introduction . |
| US9087321B2 CLAIM 22 . The computer program product (computer usable program code, computer program product) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20090282107A1 CLAIM 19 . A computer program product (computer program product) for providing adaptive electronic introductions , the computer program product comprising : a computer usable medium having computer usable program code (computer program product) embodied therewith , the computer usable program code comprising : computer usable program code configured gather information and assemble information into an electronic introduction ; computer usable program code configured to associate said electronic introduction with a communication from said sender to a recipient ; computer usable program code configured to display said electronic introduction on request from said recipient ; and computer usable program code configured to automatically update said electronic introduction . |
| US9087321B2 CLAIM 23 . The computer program product (computer usable program code, computer program product) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20090282107A1 CLAIM 19 . A computer program product (computer program product) for providing adaptive electronic introductions , the computer program product comprising : a computer usable medium having computer usable program code (computer program product) embodied therewith , the computer usable program code comprising : computer usable program code configured gather information and assemble information into an electronic introduction ; computer usable program code configured to associate said electronic introduction with a communication from said sender to a recipient ; computer usable program code configured to display said electronic introduction on request from said recipient ; and computer usable program code configured to automatically update said electronic introduction . |
| US9087321B2 CLAIM 24 . The computer program product (computer usable program code, computer program product) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090282107A1 CLAIM 19 . A computer program product (computer program product) for providing adaptive electronic introductions , the computer program product comprising : a computer usable medium having computer usable program code (computer program product) embodied therewith , the computer usable program code comprising : computer usable program code configured gather information and assemble information into an electronic introduction ; computer usable program code configured to associate said electronic introduction with a communication from said sender to a recipient ; computer usable program code configured to display said electronic introduction on request from said recipient ; and computer usable program code configured to automatically update said electronic introduction . |
| US9087321B2 CLAIM 25 . The computer program product (computer usable program code, computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20090282107A1 CLAIM 19 . A computer program product (computer program product) for providing adaptive electronic introductions , the computer program product comprising : a computer usable medium having computer usable program code (computer program product) embodied therewith , the computer usable program code comprising : computer usable program code configured gather information and assemble information into an electronic introduction ; computer usable program code configured to associate said electronic introduction with a communication from said sender to a recipient ; computer usable program code configured to display said electronic introduction on request from said recipient ; and computer usable program code configured to automatically update said electronic introduction . |
| US9087321B2 CLAIM 26 . The computer program product (computer usable program code, computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090282107A1 CLAIM 19 . A computer program product (computer program product) for providing adaptive electronic introductions , the computer program product comprising : a computer usable medium having computer usable program code (computer program product) embodied therewith , the computer usable program code comprising : computer usable program code configured gather information and assemble information into an electronic introduction ; computer usable program code configured to associate said electronic introduction with a communication from said sender to a recipient ; computer usable program code configured to display said electronic introduction on request from said recipient ; and computer usable program code configured to automatically update said electronic introduction . |
| US9087321B2 CLAIM 27 . The computer program product (computer usable program code, computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20090282107A1 CLAIM 19 . A computer program product (computer program product) for providing adaptive electronic introductions , the computer program product comprising : a computer usable medium having computer usable program code (computer program product) embodied therewith , the computer usable program code comprising : computer usable program code configured gather information and assemble information into an electronic introduction ; computer usable program code configured to associate said electronic introduction with a communication from said sender to a recipient ; computer usable program code configured to display said electronic introduction on request from said recipient ; and computer usable program code configured to automatically update said electronic introduction . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20090199196A1 Filed: 2008-02-01 Issued: 2009-08-06 Automatic baselining of resource consumption for transactions (Original Assignee) Computer Associates Think Inc (Current Assignee) CA Inc Zahur Peracha |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (network bandwidth) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (using one) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (data usage) of other users that have a likelihood of match within a predetermined threshold . |
US20090199196A1 CLAIM 1 . A computer implemented method for monitoring a transaction , comprising : performing a plurality of transactions by an application using one (user information) or more resources ; determining a first usage of each of the one or more resources by a first transaction of the plurality of transactions ; determining a difference between the first usage and a predicted usage for each the one or more resources with respect to the first transaction ; and reporting health information for the one or more resources with respect to the first application , the health information derived from the difference between the first usage and the predicted usage . US20090199196A1 CLAIM 8 . The computer implemented method of claim 1 , wherein the resources include a central processing unit , network bandwidth (data processing system, data processing system having one) , hard disk bandwidth , and memory . US20090199196A1 CLAIM 19 . The computer implemented method of claim 18 , further comprising : accessing two or more baseline functions ; applying each of the two or more baseline functions to previous resource data usage (user profiles) values to generate predicated resource data for each of the one or more resources ; and deriving the predicted value associated usage of each resource from the predicted resource data for each resource . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question (time window) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (data usage) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20090199196A1 CLAIM 6 . The computer implemented method of claim 1 , wherein said step of determining the difference includes : identifying a time window (next polling question) ; and calculating the predicted usage based on a set of performance data associated with the resource , the first transaction and the time window . US20090199196A1 CLAIM 19 . The computer implemented method of claim 18 , further comprising : accessing two or more baseline functions ; applying each of the two or more baseline functions to previous resource data usage (user profiles) values to generate predicated resource data for each of the one or more resources ; and deriving the predicted value associated usage of each resource from the predicted resource data for each resource . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (indicates one) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090199196A1 CLAIM 17 . The one or more processor readable storage devices of claim 11 , wherein the baseline deviation information indicates one (match servers) of two or more levels of health for two or more resources used to process the one or more requests . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (indicates one) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090199196A1 CLAIM 17 . The one or more processor readable storage devices of claim 11 , wherein the baseline deviation information indicates one (match servers) of two or more levels of health for two or more resources used to process the one or more requests . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (using one) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (data usage) of other users that have a likelihood of match within a predetermined threshold . |
US20090199196A1 CLAIM 1 . A computer implemented method for monitoring a transaction , comprising : performing a plurality of transactions by an application using one (user information) or more resources ; determining a first usage of each of the one or more resources by a first transaction of the plurality of transactions ; determining a difference between the first usage and a predicted usage for each the one or more resources with respect to the first transaction ; and reporting health information for the one or more resources with respect to the first application , the health information derived from the difference between the first usage and the predicted usage . US20090199196A1 CLAIM 19 . The computer implemented method of claim 18 , further comprising : accessing two or more baseline functions ; applying each of the two or more baseline functions to previous resource data usage (user profiles) values to generate predicated resource data for each of the one or more resources ; and deriving the predicted value associated usage of each resource from the predicted resource data for each resource . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question (time window) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (data usage) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20090199196A1 CLAIM 6 . The computer implemented method of claim 1 , wherein said step of determining the difference includes : identifying a time window (next polling question) ; and calculating the predicted usage based on a set of performance data associated with the resource , the first transaction and the time window . US20090199196A1 CLAIM 19 . The computer implemented method of claim 18 , further comprising : accessing two or more baseline functions ; applying each of the two or more baseline functions to previous resource data usage (user profiles) values to generate predicated resource data for each of the one or more resources ; and deriving the predicted value associated usage of each resource from the predicted resource data for each resource . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (indicates one) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090199196A1 CLAIM 17 . The one or more processor readable storage devices of claim 11 , wherein the baseline deviation information indicates one (match servers) of two or more levels of health for two or more resources used to process the one or more requests . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (indicates one) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090199196A1 CLAIM 17 . The one or more processor readable storage devices of claim 11 , wherein the baseline deviation information indicates one (match servers) of two or more levels of health for two or more resources used to process the one or more requests . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (using one) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (data usage) of other users that have a likelihood of match within a predetermined threshold . |
US20090199196A1 CLAIM 1 . A computer implemented method for monitoring a transaction , comprising : performing a plurality of transactions by an application using one (user information) or more resources ; determining a first usage of each of the one or more resources by a first transaction of the plurality of transactions ; determining a difference between the first usage and a predicted usage for each the one or more resources with respect to the first transaction ; and reporting health information for the one or more resources with respect to the first application , the health information derived from the difference between the first usage and the predicted usage . US20090199196A1 CLAIM 19 . The computer implemented method of claim 18 , further comprising : accessing two or more baseline functions ; applying each of the two or more baseline functions to previous resource data usage (user profiles) values to generate predicated resource data for each of the one or more resources ; and deriving the predicted value associated usage of each resource from the predicted resource data for each resource . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question (time window) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (data usage) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20090199196A1 CLAIM 6 . The computer implemented method of claim 1 , wherein said step of determining the difference includes : identifying a time window (next polling question) ; and calculating the predicted usage based on a set of performance data associated with the resource , the first transaction and the time window . US20090199196A1 CLAIM 19 . The computer implemented method of claim 18 , further comprising : accessing two or more baseline functions ; applying each of the two or more baseline functions to previous resource data usage (user profiles) values to generate predicated resource data for each of the one or more resources ; and deriving the predicted value associated usage of each resource from the predicted resource data for each resource . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (indicates one) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090199196A1 CLAIM 17 . The one or more processor readable storage devices of claim 11 , wherein the baseline deviation information indicates one (match servers) of two or more levels of health for two or more resources used to process the one or more requests . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (indicates one) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090199196A1 CLAIM 17 . The one or more processor readable storage devices of claim 11 , wherein the baseline deviation information indicates one (match servers) of two or more levels of health for two or more resources used to process the one or more requests . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2009134520A Filed: 2007-11-30 Issued: 2009-06-18 ソーシャルネットワーク表示システム、方法、及びプログラム (Original Assignee) Nec Corp; 日本電気株式会社 Mitsugi Miura, 貢 三浦 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (コンピュ, するとき) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2009134520A CLAIM 2 請求項１に記載のソーシャルネットワーク表示システムであって、 前記構成部は、前記計算部による前記グラフレイアウトの計算の際に使用するために前記複数のノードのそれぞれに付与されている重みであって、前記縮約可能ノードに付与されている前記重みを、前記上位ノードの前記ノードグループに前記縮約可能ノードを登録するとき (next polling, data processing system, next polling questions) に前記上位ノードの前記重みへ加算することでノードグループ重みを算出して当該上位ノードに付与し、 前記計算部は、前記グラフレイアウトを計算するべき前記ノードグループに登録されているノードの中に、他のノードグループにおける前記上位ノードが存在する場合には、当該上位ノードに付与された前記ノードグループ重みを使用して前記グラフレイアウトを計算する ソーシャルネットワーク表示システム。 JP2009134520A CLAIM 14 請求項８から請求項１３までのいずれかに記載のソーシャルネットワーク表示方法をコンピュ (next polling, data processing system, next polling questions) ータによって実現するためのプログラム。 |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (コンピュ, するとき) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2009134520A CLAIM 2 請求項１に記載のソーシャルネットワーク表示システムであって、 前記構成部は、前記計算部による前記グラフレイアウトの計算の際に使用するために前記複数のノードのそれぞれに付与されている重みであって、前記縮約可能ノードに付与されている前記重みを、前記上位ノードの前記ノードグループに前記縮約可能ノードを登録するとき (next polling, data processing system, next polling questions) に前記上位ノードの前記重みへ加算することでノードグループ重みを算出して当該上位ノードに付与し、 前記計算部は、前記グラフレイアウトを計算するべき前記ノードグループに登録されているノードの中に、他のノードグループにおける前記上位ノードが存在する場合には、当該上位ノードに付与された前記ノードグループ重みを使用して前記グラフレイアウトを計算する ソーシャルネットワーク表示システム。 JP2009134520A CLAIM 14 請求項８から請求項１３までのいずれかに記載のソーシャルネットワーク表示方法をコンピュ (next polling, data processing system, next polling questions) ータによって実現するためのプログラム。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one (Ｍｅｔｈ) or more processors and a memory specifically encoded with computer executable instruction means (選択命令) to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2009134520A CLAIM 6 請求項１から請求項５までのいずれかに記載のソーシャルネットワーク表示システムであって、 前記計算部が計算するべき前記ノードグループを選択するための選択命令 (instruction means) を入力する入力部をさらに備え、 前記計算部は、前記入力部が入力する前記選択命令によって選択された前記ノードグループに登録されているノードの前記ネットワークデータを抽出して、前記グラフレイアウトを計算する ソーシャルネットワーク表示システム。 JP2009134520A CLAIM 7 請求項１から請求項６までのいずれかに記載のソーシャルネットワーク表示システムであって、 前記計算部は、Ｆｏｒｃｅ Ｄｉｒｅｃｔｅｄ Ｍｅｔｈ (computer having one) ｏｄに基づくグラフレイアウトアルゴリズムを使用して、前記グラフレイアウトを計算する ソーシャルネットワーク表示システム。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (コンピュ, するとき) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2009134520A CLAIM 2 請求項１に記載のソーシャルネットワーク表示システムであって、 前記構成部は、前記計算部による前記グラフレイアウトの計算の際に使用するために前記複数のノードのそれぞれに付与されている重みであって、前記縮約可能ノードに付与されている前記重みを、前記上位ノードの前記ノードグループに前記縮約可能ノードを登録するとき (next polling, data processing system, next polling questions) に前記上位ノードの前記重みへ加算することでノードグループ重みを算出して当該上位ノードに付与し、 前記計算部は、前記グラフレイアウトを計算するべき前記ノードグループに登録されているノードの中に、他のノードグループにおける前記上位ノードが存在する場合には、当該上位ノードに付与された前記ノードグループ重みを使用して前記グラフレイアウトを計算する ソーシャルネットワーク表示システム。 JP2009134520A CLAIM 14 請求項８から請求項１３までのいずれかに記載のソーシャルネットワーク表示方法をコンピュ (next polling, data processing system, next polling questions) ータによって実現するためのプログラム。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means (選択命令) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2009134520A CLAIM 6 請求項１から請求項５までのいずれかに記載のソーシャルネットワーク表示システムであって、 前記計算部が計算するべき前記ノードグループを選択するための選択命令 (instruction means) を入力する入力部をさらに備え、 前記計算部は、前記入力部が入力する前記選択命令によって選択された前記ノードグループに登録されているノードの前記ネットワークデータを抽出して、前記グラフレイアウトを計算する ソーシャルネットワーク表示システム。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means (選択命令) for causing the computer to perform operations of : providing the user with a next polling (コンピュ, するとき) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2009134520A CLAIM 2 請求項１に記載のソーシャルネットワーク表示システムであって、 前記構成部は、前記計算部による前記グラフレイアウトの計算の際に使用するために前記複数のノードのそれぞれに付与されている重みであって、前記縮約可能ノードに付与されている前記重みを、前記上位ノードの前記ノードグループに前記縮約可能ノードを登録するとき (next polling, data processing system, next polling questions) に前記上位ノードの前記重みへ加算することでノードグループ重みを算出して当該上位ノードに付与し、 前記計算部は、前記グラフレイアウトを計算するべき前記ノードグループに登録されているノードの中に、他のノードグループにおける前記上位ノードが存在する場合には、当該上位ノードに付与された前記ノードグループ重みを使用して前記グラフレイアウトを計算する ソーシャルネットワーク表示システム。 JP2009134520A CLAIM 6 請求項１から請求項５までのいずれかに記載のソーシャルネットワーク表示システムであって、 前記計算部が計算するべき前記ノードグループを選択するための選択命令 (instruction means) を入力する入力部をさらに備え、 前記計算部は、前記入力部が入力する前記選択命令によって選択された前記ノードグループに登録されているノードの前記ネットワークデータを抽出して、前記グラフレイアウトを計算する ソーシャルネットワーク表示システム。 JP2009134520A CLAIM 14 請求項８から請求項１３までのいずれかに記載のソーシャルネットワーク表示方法をコンピュ (next polling, data processing system, next polling questions) ータによって実現するためのプログラム。 |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means (選択命令) for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2009134520A CLAIM 6 請求項１から請求項５までのいずれかに記載のソーシャルネットワーク表示システムであって、 前記計算部が計算するべき前記ノードグループを選択するための選択命令 (instruction means) を入力する入力部をさらに備え、 前記計算部は、前記入力部が入力する前記選択命令によって選択された前記ノードグループに登録されているノードの前記ネットワークデータを抽出して、前記グラフレイアウトを計算する ソーシャルネットワーク表示システム。 |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means (選択命令) for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2009134520A CLAIM 6 請求項１から請求項５までのいずれかに記載のソーシャルネットワーク表示システムであって、 前記計算部が計算するべき前記ノードグループを選択するための選択命令 (instruction means) を入力する入力部をさらに備え、 前記計算部は、前記入力部が入力する前記選択命令によって選択された前記ノードグループに登録されているノードの前記ネットワークデータを抽出して、前記グラフレイアウトを計算する ソーシャルネットワーク表示システム。 |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means (選択命令) for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2009134520A CLAIM 6 請求項１から請求項５までのいずれかに記載のソーシャルネットワーク表示システムであって、 前記計算部が計算するべき前記ノードグループを選択するための選択命令 (instruction means) を入力する入力部をさらに備え、 前記計算部は、前記入力部が入力する前記選択命令によって選択された前記ノードグループに登録されているノードの前記ネットワークデータを抽出して、前記グラフレイアウトを計算する ソーシャルネットワーク表示システム。 |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means (選択命令) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2009134520A CLAIM 6 請求項１から請求項５までのいずれかに記載のソーシャルネットワーク表示システムであって、 前記計算部が計算するべき前記ノードグループを選択するための選択命令 (instruction means) を入力する入力部をさらに備え、 前記計算部は、前記入力部が入力する前記選択命令によって選択された前記ノードグループに登録されているノードの前記ネットワークデータを抽出して、前記グラフレイアウトを計算する ソーシャルネットワーク表示システム。 |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means (選択命令) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2009134520A CLAIM 6 請求項１から請求項５までのいずれかに記載のソーシャルネットワーク表示システムであって、 前記計算部が計算するべき前記ノードグループを選択するための選択命令 (instruction means) を入力する入力部をさらに備え、 前記計算部は、前記入力部が入力する前記選択命令によって選択された前記ノードグループに登録されているノードの前記ネットワークデータを抽出して、前記グラフレイアウトを計算する ソーシャルネットワーク表示システム。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | CN101553816A Filed: 2007-11-07 Issued: 2009-10-07 信息显示装置、信息显示程序以及信息显示系统 (Original Assignee) 株式会社爱可信 镰田富久, 铃木浩之, 川端文雄 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question (其将多个) , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
CN101553816A CLAIM 1 . 一种信息显示装置，其特征在于，具备： 访问处理部，其对由用户指定的文件访问进行处理； 词句提取部，其按照规定的提取规则从成为上述文件访问的对象的文件中提取多个词句； 关键词保持部，其将多个 (first polling question) 关键词与权重相关联地进行存储； 有用信息保持部，其将用于提供给用户的有用信息与关键词相对应地存储多个，该关键词与该有用信息的内容相关联； 权重处理部，其在从上述文件中提取出多个词句时，从上述关键词保持部中选择与这些多个词句一致的关键词，根据与所选择的关键词相关联的权重来确定优先关键词； 信息选择部，其从上述有用信息保持部中选择与上述优先关键词相对应的有用信息并显示在画面上； 反馈接受部，其从用户处接受对上述文件的内容是否关心的评价输入；以及 权重调整部，其根据所输入的评价来调整权重，将调整得到的权重记录到上述关键词保持部中，其中，上述权重与由上述权重处理部选择出的关键词相关联。 |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question (其将多个) and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
CN101553816A CLAIM 1 . 一种信息显示装置，其特征在于，具备： 访问处理部，其对由用户指定的文件访问进行处理； 词句提取部，其按照规定的提取规则从成为上述文件访问的对象的文件中提取多个词句； 关键词保持部，其将多个 (first polling question) 关键词与权重相关联地进行存储； 有用信息保持部，其将用于提供给用户的有用信息与关键词相对应地存储多个，该关键词与该有用信息的内容相关联； 权重处理部，其在从上述文件中提取出多个词句时，从上述关键词保持部中选择与这些多个词句一致的关键词，根据与所选择的关键词相关联的权重来确定优先关键词； 信息选择部，其从上述有用信息保持部中选择与上述优先关键词相对应的有用信息并显示在画面上； 反馈接受部，其从用户处接受对上述文件的内容是否关心的评价输入；以及 权重调整部，其根据所输入的评价来调整权重，将调整得到的权重记录到上述关键词保持部中，其中，上述权重与由上述权重处理部选择出的关键词相关联。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one (根据上述) or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question (其将多个) , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
CN101553816A CLAIM 1 . 一种信息显示装置，其特征在于，具备： 访问处理部，其对由用户指定的文件访问进行处理； 词句提取部，其按照规定的提取规则从成为上述文件访问的对象的文件中提取多个词句； 关键词保持部，其将多个 (first polling question) 关键词与权重相关联地进行存储； 有用信息保持部，其将用于提供给用户的有用信息与关键词相对应地存储多个，该关键词与该有用信息的内容相关联； 权重处理部，其在从上述文件中提取出多个词句时，从上述关键词保持部中选择与这些多个词句一致的关键词，根据与所选择的关键词相关联的权重来确定优先关键词； 信息选择部，其从上述有用信息保持部中选择与上述优先关键词相对应的有用信息并显示在画面上； 反馈接受部，其从用户处接受对上述文件的内容是否关心的评价输入；以及 权重调整部，其根据所输入的评价来调整权重，将调整得到的权重记录到上述关键词保持部中，其中，上述权重与由上述权重处理部选择出的关键词相关联。 CN101553816A CLAIM 4 . 根据权利要求3所述的信息显示装置，其特征在于，在判断为直到发生规定的触发事件为止没有来自用户的回 答输入的情况下，上述权重调整部根据上述 (computer having one) 评价预测部的预测 结果来调整与上述关键词相关联的权重。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question (其将多个) and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
CN101553816A CLAIM 1 . 一种信息显示装置，其特征在于，具备： 访问处理部，其对由用户指定的文件访问进行处理； 词句提取部，其按照规定的提取规则从成为上述文件访问的对象的文件中提取多个词句； 关键词保持部，其将多个 (first polling question) 关键词与权重相关联地进行存储； 有用信息保持部，其将用于提供给用户的有用信息与关键词相对应地存储多个，该关键词与该有用信息的内容相关联； 权重处理部，其在从上述文件中提取出多个词句时，从上述关键词保持部中选择与这些多个词句一致的关键词，根据与所选择的关键词相关联的权重来确定优先关键词； 信息选择部，其从上述有用信息保持部中选择与上述优先关键词相对应的有用信息并显示在画面上； 反馈接受部，其从用户处接受对上述文件的内容是否关心的评价输入；以及 权重调整部，其根据所输入的评价来调整权重，将调整得到的权重记录到上述关键词保持部中，其中，上述权重与由上述权重处理部选择出的关键词相关联。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question (其将多个) , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
CN101553816A CLAIM 1 . 一种信息显示装置，其特征在于，具备： 访问处理部，其对由用户指定的文件访问进行处理； 词句提取部，其按照规定的提取规则从成为上述文件访问的对象的文件中提取多个词句； 关键词保持部，其将多个 (first polling question) 关键词与权重相关联地进行存储； 有用信息保持部，其将用于提供给用户的有用信息与关键词相对应地存储多个，该关键词与该有用信息的内容相关联； 权重处理部，其在从上述文件中提取出多个词句时，从上述关键词保持部中选择与这些多个词句一致的关键词，根据与所选择的关键词相关联的权重来确定优先关键词； 信息选择部，其从上述有用信息保持部中选择与上述优先关键词相对应的有用信息并显示在画面上； 反馈接受部，其从用户处接受对上述文件的内容是否关心的评价输入；以及 权重调整部，其根据所输入的评价来调整权重，将调整得到的权重记录到上述关键词保持部中，其中，上述权重与由上述权重处理部选择出的关键词相关联。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question (其将多个) and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
CN101553816A CLAIM 1 . 一种信息显示装置，其特征在于，具备： 访问处理部，其对由用户指定的文件访问进行处理； 词句提取部，其按照规定的提取规则从成为上述文件访问的对象的文件中提取多个词句； 关键词保持部，其将多个 (first polling question) 关键词与权重相关联地进行存储； 有用信息保持部，其将用于提供给用户的有用信息与关键词相对应地存储多个，该关键词与该有用信息的内容相关联； 权重处理部，其在从上述文件中提取出多个词句时，从上述关键词保持部中选择与这些多个词句一致的关键词，根据与所选择的关键词相关联的权重来确定优先关键词； 信息选择部，其从上述有用信息保持部中选择与上述优先关键词相对应的有用信息并显示在画面上； 反馈接受部，其从用户处接受对上述文件的内容是否关心的评价输入；以及 权重调整部，其根据所输入的评价来调整权重，将调整得到的权重记录到上述关键词保持部中，其中，上述权重与由上述权重处理部选择出的关键词相关联。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20080081701A1 Filed: 2007-10-03 Issued: 2008-04-03 Virtual environment for computer game (Original Assignee) Shuster Brian M (Current Assignee) Pfaqutruma Research LLC Brian Shuster |
|---|---|
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means (first game) to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20080081701A1 CLAIM 16 . The method of claim 14 , further tracking identities of game participants authorized by a first game (instruction means) participant to receive game output data for displaying a personalized content item associated with identifying information for the first game participant . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means (first game) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20080081701A1 CLAIM 16 . The method of claim 14 , further tracking identities of game participants authorized by a first game (instruction means) participant to receive game output data for displaying a personalized content item associated with identifying information for the first game participant . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means (first game) for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question (identifying information) against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20080081701A1 CLAIM 14 . A method for managing an interactive multiplayer computer game system to provide each player with an option to personally determine elements that appear in the game environment , comprising : maintaining a database of electronic content for a game environment having personalized content items each associated with identifying information (net polling question) for game participants and common content items not associated with identifying information for game participants ; hosting a game process in which remote game participants provide input via remote clients to a host for manipulation of modeled avatar objects in a multi-user game including the electronic content ; and serving output from the game process to the remote clients to cause displays of a game environment thereat , wherein the output is configured to cause simultaneous display of common content items and personalized content items within a game scene viewed in common by the game participants , so that a first client displays a first common content item , first and second avatars , and a first personalized content item , and does not display a second personalized content item , while a second client displays the first common content item , first and second avatars , and the second personalized content item , and does not display the first personalized content item , whereby different game participants are enabled to interact each other in game environments that include personalized elements visible only to selected ones of the game participants . US20080081701A1 CLAIM 16 . The method of claim 14 , further tracking identities of game participants authorized by a first game (instruction means) participant to receive game output data for displaying a personalized content item associated with identifying information for the first game participant . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means (first game) for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20080081701A1 CLAIM 16 . The method of claim 14 , further tracking identities of game participants authorized by a first game (instruction means) participant to receive game output data for displaying a personalized content item associated with identifying information for the first game participant . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means (first game) for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20080081701A1 CLAIM 16 . The method of claim 14 , further tracking identities of game participants authorized by a first game (instruction means) participant to receive game output data for displaying a personalized content item associated with identifying information for the first game participant . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means (first game) for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20080081701A1 CLAIM 16 . The method of claim 14 , further tracking identities of game participants authorized by a first game (instruction means) participant to receive game output data for displaying a personalized content item associated with identifying information for the first game participant . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means (first game) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080081701A1 CLAIM 16 . The method of claim 14 , further tracking identities of game participants authorized by a first game (instruction means) participant to receive game output data for displaying a personalized content item associated with identifying information for the first game participant . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means (first game) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080081701A1 CLAIM 16 . The method of claim 14 , further tracking identities of game participants authorized by a first game (instruction means) participant to receive game output data for displaying a personalized content item associated with identifying information for the first game participant . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2009070156A Filed: 2007-09-13 Issued: 2009-04-02 Information search system and information search method (Original Assignee) Ntt Docomo Inc; 株式会社エヌ・ティ・ティ・ドコモ Keisuke Kaneyasu, 圭介 兼保 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (データ) (calculation) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2009070156A CLAIM 1 端末から入力されたキーワードに基づきデータ (user information) ベースの検索を行なうと共に、その検索結果を前記端末に出力して表示させるための情報検索システムであって、 入力されたキーワードを含むＷｅｂページを前記データベースから検索する検索手段と、検索された各Ｗｅｂページにおける閲覧者の数を計算する閲覧者数計算手段と、前記閲覧者数計算手段によって計算された前記閲覧者の数に基づいて、前記検索された各Ｗｅｂページを序列化する情報序列化手段とを備えることを特徴とする情報検索システム。 An information search system for searching a database based on a keyword input from a terminal and outputting and displaying the search result on the terminal , Search means for searching the web page including the input keyword from the database , browser number calculation (receiving user information) means for calculating the number of viewers in each searched Web page , and the browser number calculation means An information ordering system comprising information ordering means for ordering the searched web pages based on the number of viewers . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (データ) (calculation) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2009070156A CLAIM 1 端末から入力されたキーワードに基づきデータ (user information) ベースの検索を行なうと共に、その検索結果を前記端末に出力して表示させるための情報検索システムであって、 入力されたキーワードを含むＷｅｂページを前記データベースから検索する検索手段と、検索された各Ｗｅｂページにおける閲覧者の数を計算する閲覧者数計算手段と、前記閲覧者数計算手段によって計算された前記閲覧者の数に基づいて、前記検索された各Ｗｅｂページを序列化する情報序列化手段とを備えることを特徴とする情報検索システム。 An information search system for searching a database based on a keyword input from a terminal and outputting and displaying the search result on the terminal , Search means for searching the web page including the input keyword from the database , browser number calculation (receiving user information) means for calculating the number of viewers in each searched Web page , and the browser number calculation means An information ordering system comprising information ordering means for ordering the searched web pages based on the number of viewers . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (データ) (calculation) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2009070156A CLAIM 1 端末から入力されたキーワードに基づきデータ (user information) ベースの検索を行なうと共に、その検索結果を前記端末に出力して表示させるための情報検索システムであって、 入力されたキーワードを含むＷｅｂページを前記データベースから検索する検索手段と、検索された各Ｗｅｂページにおける閲覧者の数を計算する閲覧者数計算手段と、前記閲覧者数計算手段によって計算された前記閲覧者の数に基づいて、前記検索された各Ｗｅｂページを序列化する情報序列化手段とを備えることを特徴とする情報検索システム。 An information search system for searching a database based on a keyword input from a terminal and outputting and displaying the search result on the terminal , Search means for searching the web page including the input keyword from the database , browser number calculation (receiving user information) means for calculating the number of viewers in each searched Web page , and the browser number calculation means An information ordering system comprising information ordering means for ordering the searched web pages based on the number of viewers . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2009069899A Filed: 2007-09-10 Issued: 2009-04-02 Object document creation system (Original Assignee) Ricoh Co Ltd; 株式会社リコー Takashi Nakajima, 崇 中島 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2009069899A CLAIM 1 異なるデータ (user information) 構造を備えるオブジェクトを格納できるオブジェクト文書ファイルを読み込むファイル入出力部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を表示する情報を作成する表示処理部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を登録するオブジェクト関係テーブルと、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの中身を登録するオブジェクトテーブルと を具備するサーバと、 前記サーバに接続され、前記表示処理部が作成した前記情報を表示するクライアントと を具備することを特徴とする、オブジェクト文書作成システム。 A file input / output unit for reading an object document file capable of storing objects having different data structures ; A display processing unit for creating information for displaying the relationship between the objects stored in the object document file obtained in the file input / output unit ; An object relation table for registering relations of the objects stored in the object document file , obtained by the file input / output unit ; A server comprising an object table for registering the contents of the object stored in the object document file obtained in the file input / output unit ; An object document creation system comprising : a client connected to the server and displaying the information created by the display processing unit . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (クライアント) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (クライアント) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2009069899A CLAIM 1 異なるデータ構造を備えるオブジェクトを格納できるオブジェクト文書ファイルを読み込むファイル入出力部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を表示する情報を作成する表示処理部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を登録するオブジェクト関係テーブルと、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの中身を登録するオブジェクトテーブルと を具備するサーバと、 前記サーバに接続され、前記表示処理部が作成した前記情報を表示するクライアント (web server, match server) と を具備することを特徴とする、オブジェクト文書作成システム。 A file input / output unit for reading an object document file capable of storing objects having different data structures ; A display processing unit for creating information for displaying the relationship between the objects stored in the object document file obtained in the file input / output unit ; An object relation table for registering relations of the objects stored in the object document file , obtained by the file input / output unit ; A server comprising an object table for registering the contents of the object stored in the object document file obtained in the file input / output unit ; An object document creation system comprising : a client connected to the server and displaying the information created by the display processing unit . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (クライアント) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2009069899A CLAIM 1 異なるデータ構造を備えるオブジェクトを格納できるオブジェクト文書ファイルを読み込むファイル入出力部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を表示する情報を作成する表示処理部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を登録するオブジェクト関係テーブルと、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの中身を登録するオブジェクトテーブルと を具備するサーバと、 前記サーバに接続され、前記表示処理部が作成した前記情報を表示するクライアント (web server, match server) と を具備することを特徴とする、オブジェクト文書作成システム。 A file input / output unit for reading an object document file capable of storing objects having different data structures ; A display processing unit for creating information for displaying the relationship between the objects stored in the object document file obtained in the file input / output unit ; An object relation table for registering relations of the objects stored in the object document file , obtained by the file input / output unit ; A server comprising an object table for registering the contents of the object stored in the object document file obtained in the file input / output unit ; An object document creation system comprising : a client connected to the server and displaying the information created by the display processing unit . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (クライアント) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (クライアント) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2009069899A CLAIM 1 異なるデータ構造を備えるオブジェクトを格納できるオブジェクト文書ファイルを読み込むファイル入出力部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を表示する情報を作成する表示処理部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を登録するオブジェクト関係テーブルと、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの中身を登録するオブジェクトテーブルと を具備するサーバと、 前記サーバに接続され、前記表示処理部が作成した前記情報を表示するクライアント (web server, match server) と を具備することを特徴とする、オブジェクト文書作成システム。 A file input / output unit for reading an object document file capable of storing objects having different data structures ; A display processing unit for creating information for displaying the relationship between the objects stored in the object document file obtained in the file input / output unit ; An object relation table for registering relations of the objects stored in the object document file , obtained by the file input / output unit ; A server comprising an object table for registering the contents of the object stored in the object document file obtained in the file input / output unit ; An object document creation system comprising : a client connected to the server and displaying the information created by the display processing unit . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (クライアント) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2009069899A CLAIM 1 異なるデータ構造を備えるオブジェクトを格納できるオブジェクト文書ファイルを読み込むファイル入出力部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を表示する情報を作成する表示処理部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を登録するオブジェクト関係テーブルと、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの中身を登録するオブジェクトテーブルと を具備するサーバと、 前記サーバに接続され、前記表示処理部が作成した前記情報を表示するクライアント (web server, match server) と を具備することを特徴とする、オブジェクト文書作成システム。 A file input / output unit for reading an object document file capable of storing objects having different data structures ; A display processing unit for creating information for displaying the relationship between the objects stored in the object document file obtained in the file input / output unit ; An object relation table for registering relations of the objects stored in the object document file , obtained by the file input / output unit ; A server comprising an object table for registering the contents of the object stored in the object document file obtained in the file input / output unit ; An object document creation system comprising : a client connected to the server and displaying the information created by the display processing unit . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2009069899A CLAIM 1 異なるデータ (user information) 構造を備えるオブジェクトを格納できるオブジェクト文書ファイルを読み込むファイル入出力部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を表示する情報を作成する表示処理部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を登録するオブジェクト関係テーブルと、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの中身を登録するオブジェクトテーブルと を具備するサーバと、 前記サーバに接続され、前記表示処理部が作成した前記情報を表示するクライアントと を具備することを特徴とする、オブジェクト文書作成システム。 A file input / output unit for reading an object document file capable of storing objects having different data structures ; A display processing unit for creating information for displaying the relationship between the objects stored in the object document file obtained in the file input / output unit ; An object relation table for registering relations of the objects stored in the object document file , obtained by the file input / output unit ; A server comprising an object table for registering the contents of the object stored in the object document file obtained in the file input / output unit ; An object document creation system comprising : a client connected to the server and displaying the information created by the display processing unit . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (クライアント) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (クライアント) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2009069899A CLAIM 1 異なるデータ構造を備えるオブジェクトを格納できるオブジェクト文書ファイルを読み込むファイル入出力部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を表示する情報を作成する表示処理部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を登録するオブジェクト関係テーブルと、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの中身を登録するオブジェクトテーブルと を具備するサーバと、 前記サーバに接続され、前記表示処理部が作成した前記情報を表示するクライアント (web server, match server) と を具備することを特徴とする、オブジェクト文書作成システム。 A file input / output unit for reading an object document file capable of storing objects having different data structures ; A display processing unit for creating information for displaying the relationship between the objects stored in the object document file obtained in the file input / output unit ; An object relation table for registering relations of the objects stored in the object document file , obtained by the file input / output unit ; A server comprising an object table for registering the contents of the object stored in the object document file obtained in the file input / output unit ; An object document creation system comprising : a client connected to the server and displaying the information created by the display processing unit . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (クライアント) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2009069899A CLAIM 1 異なるデータ構造を備えるオブジェクトを格納できるオブジェクト文書ファイルを読み込むファイル入出力部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を表示する情報を作成する表示処理部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を登録するオブジェクト関係テーブルと、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの中身を登録するオブジェクトテーブルと を具備するサーバと、 前記サーバに接続され、前記表示処理部が作成した前記情報を表示するクライアント (web server, match server) と を具備することを特徴とする、オブジェクト文書作成システム。 A file input / output unit for reading an object document file capable of storing objects having different data structures ; A display processing unit for creating information for displaying the relationship between the objects stored in the object document file obtained in the file input / output unit ; An object relation table for registering relations of the objects stored in the object document file , obtained by the file input / output unit ; A server comprising an object table for registering the contents of the object stored in the object document file obtained in the file input / output unit ; An object document creation system comprising : a client connected to the server and displaying the information created by the display processing unit . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (クライアント) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (クライアント) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2009069899A CLAIM 1 異なるデータ構造を備えるオブジェクトを格納できるオブジェクト文書ファイルを読み込むファイル入出力部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を表示する情報を作成する表示処理部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を登録するオブジェクト関係テーブルと、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの中身を登録するオブジェクトテーブルと を具備するサーバと、 前記サーバに接続され、前記表示処理部が作成した前記情報を表示するクライアント (web server, match server) と を具備することを特徴とする、オブジェクト文書作成システム。 A file input / output unit for reading an object document file capable of storing objects having different data structures ; A display processing unit for creating information for displaying the relationship between the objects stored in the object document file obtained in the file input / output unit ; An object relation table for registering relations of the objects stored in the object document file , obtained by the file input / output unit ; A server comprising an object table for registering the contents of the object stored in the object document file obtained in the file input / output unit ; An object document creation system comprising : a client connected to the server and displaying the information created by the display processing unit . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (クライアント) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2009069899A CLAIM 1 異なるデータ構造を備えるオブジェクトを格納できるオブジェクト文書ファイルを読み込むファイル入出力部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を表示する情報を作成する表示処理部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を登録するオブジェクト関係テーブルと、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの中身を登録するオブジェクトテーブルと を具備するサーバと、 前記サーバに接続され、前記表示処理部が作成した前記情報を表示するクライアント (web server, match server) と を具備することを特徴とする、オブジェクト文書作成システム。 A file input / output unit for reading an object document file capable of storing objects having different data structures ; A display processing unit for creating information for displaying the relationship between the objects stored in the object document file obtained in the file input / output unit ; An object relation table for registering relations of the objects stored in the object document file , obtained by the file input / output unit ; A server comprising an object table for registering the contents of the object stored in the object document file obtained in the file input / output unit ; An object document creation system comprising : a client connected to the server and displaying the information created by the display processing unit . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2009069899A CLAIM 1 異なるデータ (user information) 構造を備えるオブジェクトを格納できるオブジェクト文書ファイルを読み込むファイル入出力部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を表示する情報を作成する表示処理部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を登録するオブジェクト関係テーブルと、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの中身を登録するオブジェクトテーブルと を具備するサーバと、 前記サーバに接続され、前記表示処理部が作成した前記情報を表示するクライアントと を具備することを特徴とする、オブジェクト文書作成システム。 A file input / output unit for reading an object document file capable of storing objects having different data structures ; A display processing unit for creating information for displaying the relationship between the objects stored in the object document file obtained in the file input / output unit ; An object relation table for registering relations of the objects stored in the object document file , obtained by the file input / output unit ; A server comprising an object table for registering the contents of the object stored in the object document file obtained in the file input / output unit ; An object document creation system comprising : a client connected to the server and displaying the information created by the display processing unit . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (クライアント) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (クライアント) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2009069899A CLAIM 1 異なるデータ構造を備えるオブジェクトを格納できるオブジェクト文書ファイルを読み込むファイル入出力部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を表示する情報を作成する表示処理部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を登録するオブジェクト関係テーブルと、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの中身を登録するオブジェクトテーブルと を具備するサーバと、 前記サーバに接続され、前記表示処理部が作成した前記情報を表示するクライアント (web server, match server) と を具備することを特徴とする、オブジェクト文書作成システム。 A file input / output unit for reading an object document file capable of storing objects having different data structures ; A display processing unit for creating information for displaying the relationship between the objects stored in the object document file obtained in the file input / output unit ; An object relation table for registering relations of the objects stored in the object document file , obtained by the file input / output unit ; A server comprising an object table for registering the contents of the object stored in the object document file obtained in the file input / output unit ; An object document creation system comprising : a client connected to the server and displaying the information created by the display processing unit . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (クライアント) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2009069899A CLAIM 1 異なるデータ構造を備えるオブジェクトを格納できるオブジェクト文書ファイルを読み込むファイル入出力部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を表示する情報を作成する表示処理部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を登録するオブジェクト関係テーブルと、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの中身を登録するオブジェクトテーブルと を具備するサーバと、 前記サーバに接続され、前記表示処理部が作成した前記情報を表示するクライアント (web server, match server) と を具備することを特徴とする、オブジェクト文書作成システム。 A file input / output unit for reading an object document file capable of storing objects having different data structures ; A display processing unit for creating information for displaying the relationship between the objects stored in the object document file obtained in the file input / output unit ; An object relation table for registering relations of the objects stored in the object document file , obtained by the file input / output unit ; A server comprising an object table for registering the contents of the object stored in the object document file obtained in the file input / output unit ; An object document creation system comprising : a client connected to the server and displaying the information created by the display processing unit . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (クライアント) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (クライアント) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2009069899A CLAIM 1 異なるデータ構造を備えるオブジェクトを格納できるオブジェクト文書ファイルを読み込むファイル入出力部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を表示する情報を作成する表示処理部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を登録するオブジェクト関係テーブルと、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの中身を登録するオブジェクトテーブルと を具備するサーバと、 前記サーバに接続され、前記表示処理部が作成した前記情報を表示するクライアント (web server, match server) と を具備することを特徴とする、オブジェクト文書作成システム。 A file input / output unit for reading an object document file capable of storing objects having different data structures ; A display processing unit for creating information for displaying the relationship between the objects stored in the object document file obtained in the file input / output unit ; An object relation table for registering relations of the objects stored in the object document file , obtained by the file input / output unit ; A server comprising an object table for registering the contents of the object stored in the object document file obtained in the file input / output unit ; An object document creation system comprising : a client connected to the server and displaying the information created by the display processing unit . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (クライアント) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2009069899A CLAIM 1 異なるデータ構造を備えるオブジェクトを格納できるオブジェクト文書ファイルを読み込むファイル入出力部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を表示する情報を作成する表示処理部と、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの関係を登録するオブジェクト関係テーブルと、 前記ファイル入出力部にて得られた、前記オブジェクト文書ファイルに格納されている前記オブジェクトの中身を登録するオブジェクトテーブルと を具備するサーバと、 前記サーバに接続され、前記表示処理部が作成した前記情報を表示するクライアント (web server, match server) と を具備することを特徴とする、オブジェクト文書作成システム。 A file input / output unit for reading an object document file capable of storing objects having different data structures ; A display processing unit for creating information for displaying the relationship between the objects stored in the object document file obtained in the file input / output unit ; An object relation table for registering relations of the objects stored in the object document file , obtained by the file input / output unit ; A server comprising an object table for registering the contents of the object stored in the object document file obtained in the file input / output unit ; An object document creation system comprising : a client connected to the server and displaying the information created by the display processing unit . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | WO2008024349A2 Filed: 2007-08-21 Issued: 2008-02-28 Automated remote configuration of wagering game machines (Original Assignee) Wms Gaming Inc. Phil Gelber, Larry Pacey |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (using one) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
WO2008024349A2 CLAIM 17 . A machine-readable medium having machine-executable instructions for causing one (user information) or more processors to perform a method , the method comprising : receiving performance data from a first set of one or more wagering game machines , the wagering game machines operable to present a wagering game upon which monetary value may be wagered ; storing the performance data in a database ; analyzing the performance data in accordance with a rule set ; and determining according to the rule set a configuration for a second set of one or more gaming machines . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (executable instruction) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (using one) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
WO2008024349A2 CLAIM 17 . A machine-readable medium having machine-executable instruction (executable instruction) s for causing one (user information) or more processors to perform a method , the method comprising : receiving performance data from a first set of one or more wagering game machines , the wagering game machines operable to present a wagering game upon which monetary value may be wagered ; storing the performance data in a database ; analyzing the performance data in accordance with a rule set ; and determining according to the rule set a configuration for a second set of one or more gaming machines . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (using one) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
WO2008024349A2 CLAIM 17 . A machine-readable medium having machine-executable instructions for causing one (user information) or more processors to perform a method , the method comprising : receiving performance data from a first set of one or more wagering game machines , the wagering game machines operable to present a wagering game upon which monetary value may be wagered ; storing the performance data in a database ; analyzing the performance data in accordance with a rule set ; and determining according to the rule set a configuration for a second set of one or more gaming machines . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question (gaming machine) against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
WO2008024349A2 CLAIM 1 . A method comprising : receiving performance data from a first set of one or more wagering game machines , the wagering game machines operable to present a wagering game upon which monetary value may be wagered ; storing the performance data in a database ; analyzing the performance data in accordance with a rule set ; and determining according to the rule set a configuration for a second set of one or more gaming machine (net polling question) s . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20090027392A1 Filed: 2007-07-23 Issued: 2009-01-29 Connection sub-graphs in entity relationship graphs (Original Assignee) Yahoo Inc (Current Assignee) R2 Solutions LLC ; Altaba Inc Apurva Rameshchandra Jadhav, Ashutosh Joshi |
|---|---|
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (one candidate) per user . |
US20090027392A1 CLAIM 1 . A method comprising performing a machine-executed operation involving instructions , wherein said instructions are instructions which , when executed by one or more processors , cause the one or more processors to perform certain steps including : establishing a first entity and a second entity in an entity relationship graph , wherein the entity relationship graph comprises a set of entities interconnected through a plurality of edge relationships and wherein the first entity and the second entity are included in the set of entities ; determining a plurality of candidate path relationships between the first entity and the second entity , wherein each of the plurality of candidate path relationships terminates at both the first entity and the second entity and comprises one or more edge relationships in the plurality of edge relationships ; for each candidate path relationship in the plurality of candidate path relationships : determining a path type that is associated with a candidate path relationship ; and generating a score value for the candidate path relationship based in part on the path type that is associated with the candidate path relationship ; wherein the score value represents a likelihood that the candidate path relationship is of interest to a user ; and selecting , in the plurality of candidate path relationships , one candidate (m rows) path relationship having a score value that satisfies one or more first criteria ; wherein the machine-executed operation is at least one of (a) sending said instructions over transmission media , (b) receiving said instructions over transmission media , (c) storing said instructions onto a machine-readable storage medium , and (d) executing the instructions . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (one candidate) per user . |
US20090027392A1 CLAIM 1 . A method comprising performing a machine-executed operation involving instructions , wherein said instructions are instructions which , when executed by one or more processors , cause the one or more processors to perform certain steps including : establishing a first entity and a second entity in an entity relationship graph , wherein the entity relationship graph comprises a set of entities interconnected through a plurality of edge relationships and wherein the first entity and the second entity are included in the set of entities ; determining a plurality of candidate path relationships between the first entity and the second entity , wherein each of the plurality of candidate path relationships terminates at both the first entity and the second entity and comprises one or more edge relationships in the plurality of edge relationships ; for each candidate path relationship in the plurality of candidate path relationships : determining a path type that is associated with a candidate path relationship ; and generating a score value for the candidate path relationship based in part on the path type that is associated with the candidate path relationship ; wherein the score value represents a likelihood that the candidate path relationship is of interest to a user ; and selecting , in the plurality of candidate path relationships , one candidate (m rows) path relationship having a score value that satisfies one or more first criteria ; wherein the machine-executed operation is at least one of (a) sending said instructions over transmission media , (b) receiving said instructions over transmission media , (c) storing said instructions onto a machine-readable storage medium , and (d) executing the instructions . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (one candidate) per user . |
US20090027392A1 CLAIM 1 . A method comprising performing a machine-executed operation involving instructions , wherein said instructions are instructions which , when executed by one or more processors , cause the one or more processors to perform certain steps including : establishing a first entity and a second entity in an entity relationship graph , wherein the entity relationship graph comprises a set of entities interconnected through a plurality of edge relationships and wherein the first entity and the second entity are included in the set of entities ; determining a plurality of candidate path relationships between the first entity and the second entity , wherein each of the plurality of candidate path relationships terminates at both the first entity and the second entity and comprises one or more edge relationships in the plurality of edge relationships ; for each candidate path relationship in the plurality of candidate path relationships : determining a path type that is associated with a candidate path relationship ; and generating a score value for the candidate path relationship based in part on the path type that is associated with the candidate path relationship ; wherein the score value represents a likelihood that the candidate path relationship is of interest to a user ; and selecting , in the plurality of candidate path relationships , one candidate (m rows) path relationship having a score value that satisfies one or more first criteria ; wherein the machine-executed operation is at least one of (a) sending said instructions over transmission media , (b) receiving said instructions over transmission media , (c) storing said instructions onto a machine-readable storage medium , and (d) executing the instructions . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (one candidate) per user . |
US20090027392A1 CLAIM 1 . A method comprising performing a machine-executed operation involving instructions , wherein said instructions are instructions which , when executed by one or more processors , cause the one or more processors to perform certain steps including : establishing a first entity and a second entity in an entity relationship graph , wherein the entity relationship graph comprises a set of entities interconnected through a plurality of edge relationships and wherein the first entity and the second entity are included in the set of entities ; determining a plurality of candidate path relationships between the first entity and the second entity , wherein each of the plurality of candidate path relationships terminates at both the first entity and the second entity and comprises one or more edge relationships in the plurality of edge relationships ; for each candidate path relationship in the plurality of candidate path relationships : determining a path type that is associated with a candidate path relationship ; and generating a score value for the candidate path relationship based in part on the path type that is associated with the candidate path relationship ; wherein the score value represents a likelihood that the candidate path relationship is of interest to a user ; and selecting , in the plurality of candidate path relationships , one candidate (m rows) path relationship having a score value that satisfies one or more first criteria ; wherein the machine-executed operation is at least one of (a) sending said instructions over transmission media , (b) receiving said instructions over transmission media , (c) storing said instructions onto a machine-readable storage medium , and (d) executing the instructions . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (one candidate) per user . |
US20090027392A1 CLAIM 1 . A method comprising performing a machine-executed operation involving instructions , wherein said instructions are instructions which , when executed by one or more processors , cause the one or more processors to perform certain steps including : establishing a first entity and a second entity in an entity relationship graph , wherein the entity relationship graph comprises a set of entities interconnected through a plurality of edge relationships and wherein the first entity and the second entity are included in the set of entities ; determining a plurality of candidate path relationships between the first entity and the second entity , wherein each of the plurality of candidate path relationships terminates at both the first entity and the second entity and comprises one or more edge relationships in the plurality of edge relationships ; for each candidate path relationship in the plurality of candidate path relationships : determining a path type that is associated with a candidate path relationship ; and generating a score value for the candidate path relationship based in part on the path type that is associated with the candidate path relationship ; wherein the score value represents a likelihood that the candidate path relationship is of interest to a user ; and selecting , in the plurality of candidate path relationships , one candidate (m rows) path relationship having a score value that satisfies one or more first criteria ; wherein the machine-executed operation is at least one of (a) sending said instructions over transmission media , (b) receiving said instructions over transmission media , (c) storing said instructions onto a machine-readable storage medium , and (d) executing the instructions . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (one candidate) per user . |
US20090027392A1 CLAIM 1 . A method comprising performing a machine-executed operation involving instructions , wherein said instructions are instructions which , when executed by one or more processors , cause the one or more processors to perform certain steps including : establishing a first entity and a second entity in an entity relationship graph , wherein the entity relationship graph comprises a set of entities interconnected through a plurality of edge relationships and wherein the first entity and the second entity are included in the set of entities ; determining a plurality of candidate path relationships between the first entity and the second entity , wherein each of the plurality of candidate path relationships terminates at both the first entity and the second entity and comprises one or more edge relationships in the plurality of edge relationships ; for each candidate path relationship in the plurality of candidate path relationships : determining a path type that is associated with a candidate path relationship ; and generating a score value for the candidate path relationship based in part on the path type that is associated with the candidate path relationship ; wherein the score value represents a likelihood that the candidate path relationship is of interest to a user ; and selecting , in the plurality of candidate path relationships , one candidate (m rows) path relationship having a score value that satisfies one or more first criteria ; wherein the machine-executed operation is at least one of (a) sending said instructions over transmission media , (b) receiving said instructions over transmission media , (c) storing said instructions onto a machine-readable storage medium , and (d) executing the instructions . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20080313000A1 Filed: 2007-06-15 Issued: 2008-12-18 System and method for facilitating skill gap analysis and remediation based on tag analytics (Original Assignee) International Business Machines Corp (Current Assignee) International Business Machines Corp Melania Degeratu, Neal M. Keller, Michael Sava, Wlodek W. Zadrozny, Lei Zhang |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system (social networking) , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20080313000A1 CLAIM 1 . A computer-based method for operating upon a store of social networking (networking system) data representative of members of an organization in order to provide mentoring services within the organization , the computer-based method comprising the steps of : identifying concepts within a mentor member' ; s (“mentor”) social networking tagging data that are familiar to the mentor , with mentor concept labels ; identifying concepts within a mentee member' ; s (“mentee”) social networking tagging data that are familiar to mentee , with mentee concept labels ; matching mentors to mentees based on a comparison of said concept labels ; and delivering mentoring services based on the matching . |
| US9087321B2 CLAIM 2 . The poll-based networking system (social networking) as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20080313000A1 CLAIM 1 . A computer-based method for operating upon a store of social networking (networking system) data representative of members of an organization in order to provide mentoring services within the organization , the computer-based method comprising the steps of : identifying concepts within a mentor member' ; s (“mentor”) social networking tagging data that are familiar to the mentor , with mentor concept labels ; identifying concepts within a mentee member' ; s (“mentee”) social networking tagging data that are familiar to mentee , with mentee concept labels ; matching mentors to mentees based on a comparison of said concept labels ; and delivering mentoring services based on the matching . |
| US9087321B2 CLAIM 3 . The poll-based networking system (social networking) as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20080313000A1 CLAIM 1 . A computer-based method for operating upon a store of social networking (networking system) data representative of members of an organization in order to provide mentoring services within the organization , the computer-based method comprising the steps of : identifying concepts within a mentor member' ; s (“mentor”) social networking tagging data that are familiar to the mentor , with mentor concept labels ; identifying concepts within a mentee member' ; s (“mentee”) social networking tagging data that are familiar to mentee , with mentee concept labels ; matching mentors to mentees based on a comparison of said concept labels ; and delivering mentoring services based on the matching . |
| US9087321B2 CLAIM 4 . The poll-based networking system (social networking) as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20080313000A1 CLAIM 1 . A computer-based method for operating upon a store of social networking (networking system) data representative of members of an organization in order to provide mentoring services within the organization , the computer-based method comprising the steps of : identifying concepts within a mentor member' ; s (“mentor”) social networking tagging data that are familiar to the mentor , with mentor concept labels ; identifying concepts within a mentee member' ; s (“mentee”) social networking tagging data that are familiar to mentee , with mentee concept labels ; matching mentors to mentees based on a comparison of said concept labels ; and delivering mentoring services based on the matching . |
| US9087321B2 CLAIM 5 . The poll-based networking system (social networking) as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20080313000A1 CLAIM 1 . A computer-based method for operating upon a store of social networking (networking system) data representative of members of an organization in order to provide mentoring services within the organization , the computer-based method comprising the steps of : identifying concepts within a mentor member' ; s (“mentor”) social networking tagging data that are familiar to the mentor , with mentor concept labels ; identifying concepts within a mentee member' ; s (“mentee”) social networking tagging data that are familiar to mentee , with mentee concept labels ; matching mentors to mentees based on a comparison of said concept labels ; and delivering mentoring services based on the matching . |
| US9087321B2 CLAIM 6 . The poll-based networking system (social networking) as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080313000A1 CLAIM 1 . A computer-based method for operating upon a store of social networking (networking system) data representative of members of an organization in order to provide mentoring services within the organization , the computer-based method comprising the steps of : identifying concepts within a mentor member' ; s (“mentor”) social networking tagging data that are familiar to the mentor , with mentor concept labels ; identifying concepts within a mentee member' ; s (“mentee”) social networking tagging data that are familiar to mentee , with mentee concept labels ; matching mentors to mentees based on a comparison of said concept labels ; and delivering mentoring services based on the matching . |
| US9087321B2 CLAIM 7 . The poll-based networking system (social networking) as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080313000A1 CLAIM 1 . A computer-based method for operating upon a store of social networking (networking system) data representative of members of an organization in order to provide mentoring services within the organization , the computer-based method comprising the steps of : identifying concepts within a mentor member' ; s (“mentor”) social networking tagging data that are familiar to the mentor , with mentor concept labels ; identifying concepts within a mentee member' ; s (“mentee”) social networking tagging data that are familiar to mentee , with mentee concept labels ; matching mentors to mentees based on a comparison of said concept labels ; and delivering mentoring services based on the matching . |
| US9087321B2 CLAIM 8 . The poll-based networking system (social networking) as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080313000A1 CLAIM 1 . A computer-based method for operating upon a store of social networking (networking system) data representative of members of an organization in order to provide mentoring services within the organization , the computer-based method comprising the steps of : identifying concepts within a mentor member' ; s (“mentor”) social networking tagging data that are familiar to the mentor , with mentor concept labels ; identifying concepts within a mentee member' ; s (“mentee”) social networking tagging data that are familiar to mentee , with mentee concept labels ; matching mentors to mentees based on a comparison of said concept labels ; and delivering mentoring services based on the matching . |
| US9087321B2 CLAIM 9 . The poll-based networking system (social networking) as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080313000A1 CLAIM 1 . A computer-based method for operating upon a store of social networking (networking system) data representative of members of an organization in order to provide mentoring services within the organization , the computer-based method comprising the steps of : identifying concepts within a mentor member' ; s (“mentor”) social networking tagging data that are familiar to the mentor , with mentor concept labels ; identifying concepts within a mentee member' ; s (“mentee”) social networking tagging data that are familiar to mentee , with mentee concept labels ; matching mentors to mentees based on a comparison of said concept labels ; and delivering mentoring services based on the matching . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one (management system) or more processors and a memory specifically encoded with computer executable instruction (textual information) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20080313000A1 CLAIM 18 . A workforce management system (computer having one) , comprising : a system bus ; at least one database in communication with the system bus that includes workforce employee data , and social networking data associated with said employees ; a matching functional unit , the matching functional unit comprising : a text mining function for mining contextual information (executable instruction, readable instruction, computer executable instruction, readable instruction means) from said at least one database to generate context labels for an employee , a clustering function for generating concept labels for an employee based on said text mining , and a matching function that sorts and matches employees by said context and concept labels in accordance with a matching criteria ; and a user interface for providing user input to the support operation of the workforce management system . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20080288599A1 Filed: 2007-05-18 Issued: 2008-11-20 Apparatus, systems and methods for transformation services (Original Assignee) PNC Financial Services Group Inc (Current Assignee) PNC Financial Services Group Inc Michael Kutchmark, Randal Heuler, Robert Bills, W. Scott Edwards, Sergly Nepomyashchvy |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (access rights) of other users that have a likelihood of match within a predetermined threshold . |
US20080288599A1 CLAIM 24 . The system of claim 21 , comprising : a web server coupled to the web container , the web server to deliver web content and provide a first secure connection to the data source system , the web server to receive the request over a cryptographic protocol and to verify access authorization and access rights (user profiles) of the data source system based on the request ; and a first keystore coupled to the web server , the first keystore comprising a keystore file containing both public and private encryption keys . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (access rights) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20080288599A1 CLAIM 24 . The system of claim 21 , comprising : a web server coupled to the web container , the web server to deliver web content and provide a first secure connection to the data source system , the web server to receive the request over a cryptographic protocol and to verify access authorization and access rights (user profiles) of the data source system based on the request ; and a first keystore coupled to the web server , the first keystore comprising a keystore file containing both public and private encryption keys . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080288599A1 CLAIM 24 . The system of claim 21 , comprising : a web server (web server) coupled to the web container , the web server to deliver web content and provide a first secure connection to the data source system , the web server to receive the request over a cryptographic protocol and to verify access authorization and access rights of the data source system based on the request ; and a first keystore coupled to the web server , the first keystore comprising a keystore file containing both public and private encryption keys . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080288599A1 CLAIM 24 . The system of claim 21 , comprising : a web server (web server) coupled to the web container , the web server to deliver web content and provide a first secure connection to the data source system , the web server to receive the request over a cryptographic protocol and to verify access authorization and access rights of the data source system based on the request ; and a first keystore coupled to the web server , the first keystore comprising a keystore file containing both public and private encryption keys . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (access rights) of other users that have a likelihood of match within a predetermined threshold . |
US20080288599A1 CLAIM 24 . The system of claim 21 , comprising : a web server coupled to the web container , the web server to deliver web content and provide a first secure connection to the data source system , the web server to receive the request over a cryptographic protocol and to verify access authorization and access rights (user profiles) of the data source system based on the request ; and a first keystore coupled to the web server , the first keystore comprising a keystore file containing both public and private encryption keys . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (access rights) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20080288599A1 CLAIM 24 . The system of claim 21 , comprising : a web server coupled to the web container , the web server to deliver web content and provide a first secure connection to the data source system , the web server to receive the request over a cryptographic protocol and to verify access authorization and access rights (user profiles) of the data source system based on the request ; and a first keystore coupled to the web server , the first keystore comprising a keystore file containing both public and private encryption keys . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080288599A1 CLAIM 24 . The system of claim 21 , comprising : a web server (web server) coupled to the web container , the web server to deliver web content and provide a first secure connection to the data source system , the web server to receive the request over a cryptographic protocol and to verify access authorization and access rights of the data source system based on the request ; and a first keystore coupled to the web server , the first keystore comprising a keystore file containing both public and private encryption keys . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080288599A1 CLAIM 24 . The system of claim 21 , comprising : a web server (web server) coupled to the web container , the web server to deliver web content and provide a first secure connection to the data source system , the web server to receive the request over a cryptographic protocol and to verify access authorization and access rights of the data source system based on the request ; and a first keystore coupled to the web server , the first keystore comprising a keystore file containing both public and private encryption keys . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (access rights) of other users that have a likelihood of match within a predetermined threshold . |
US20080288599A1 CLAIM 24 . The system of claim 21 , comprising : a web server coupled to the web container , the web server to deliver web content and provide a first secure connection to the data source system , the web server to receive the request over a cryptographic protocol and to verify access authorization and access rights (user profiles) of the data source system based on the request ; and a first keystore coupled to the web server , the first keystore comprising a keystore file containing both public and private encryption keys . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (access rights) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20080288599A1 CLAIM 24 . The system of claim 21 , comprising : a web server coupled to the web container , the web server to deliver web content and provide a first secure connection to the data source system , the web server to receive the request over a cryptographic protocol and to verify access authorization and access rights (user profiles) of the data source system based on the request ; and a first keystore coupled to the web server , the first keystore comprising a keystore file containing both public and private encryption keys . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080288599A1 CLAIM 24 . The system of claim 21 , comprising : a web server (web server) coupled to the web container , the web server to deliver web content and provide a first secure connection to the data source system , the web server to receive the request over a cryptographic protocol and to verify access authorization and access rights of the data source system based on the request ; and a first keystore coupled to the web server , the first keystore comprising a keystore file containing both public and private encryption keys . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080288599A1 CLAIM 24 . The system of claim 21 , comprising : a web server (web server) coupled to the web container , the web server to deliver web content and provide a first secure connection to the data source system , the web server to receive the request over a cryptographic protocol and to verify access authorization and access rights of the data source system based on the request ; and a first keystore coupled to the web server , the first keystore comprising a keystore file containing both public and private encryption keys . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | CN101496051A Filed: 2007-02-13 Issued: 2009-07-29 带有部分信息的玩家排名 (Original Assignee) 微软公司 T·K·H·格瑞派尔 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (包括接收) from a user to generate a unique user profile for the user ; providing the user a first polling question (一个的) , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
CN101496051A CLAIM 9 . 如权利要求1所述的方法，其特征在于，还包括接收 (receiving user information) 包括第三队伍的第四玩家的第四均值和第四方差的第四得分，其中所述游戏结果标识所述第一队伍战胜所述第二队伍和所述第三队伍，但未标识所述第二队伍是否战胜所述第三队伍以及所述第三队伍是否战胜所述第二队伍。 CN101496051A CLAIM 11 . 一种方法包括： a)接收第一队伍、第二队伍和第三队伍之间的游戏的结果，所述第一队伍包括第一玩家，所述第二队伍包括第二玩家，所述第三队伍包括第三玩家，所述结果定义所述第一队伍战胜所述第二队伍和所述第三队伍，但是未定义所述第二队伍和所述第三队伍之间的相对游戏结果； b)接收表示与所述第一队伍的第一玩家相关联的分布的、包括第一均值和第一方差的第一得分； c)接收表示与所述第二队伍的第二玩家相关联的分布的、包括第二均值和第二方差的第二得分； d)接收表示与所述第三队伍的第三玩家相关联的分布的、包括第三均值和第三方差的第三得分； e)将所述第一队伍排序在所述第二队伍和所述第三队伍之前； f)生成具有至少三行和至少两列的排名矩阵； g)在所述至少三行的每一排名矩阵元素中对所述第一、第二和第三玩家中的每一个的 (first polling question) 排名进行编码，其中对所述排名进行编码包括将所述第一玩家与所述第二和第三队伍进行比较、将所述第二玩家与所述第一队伍进行比较、以及将所述第三玩家与所述第一队伍进行比较； h)至少部分地基于所述排名矩阵来更新所述第一均值和所述第一方差；以及 i)提供对所述更新的第一均值和第一方差的指示。 |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question (一个的) and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
CN101496051A CLAIM 11 . 一种方法包括： a)接收第一队伍、第二队伍和第三队伍之间的游戏的结果，所述第一队伍包括第一玩家，所述第二队伍包括第二玩家，所述第三队伍包括第三玩家，所述结果定义所述第一队伍战胜所述第二队伍和所述第三队伍，但是未定义所述第二队伍和所述第三队伍之间的相对游戏结果； b)接收表示与所述第一队伍的第一玩家相关联的分布的、包括第一均值和第一方差的第一得分； c)接收表示与所述第二队伍的第二玩家相关联的分布的、包括第二均值和第二方差的第二得分； d)接收表示与所述第三队伍的第三玩家相关联的分布的、包括第三均值和第三方差的第三得分； e)将所述第一队伍排序在所述第二队伍和所述第三队伍之前； f)生成具有至少三行和至少两列的排名矩阵； g)在所述至少三行的每一排名矩阵元素中对所述第一、第二和第三玩家中的每一个的 (first polling question) 排名进行编码，其中对所述排名进行编码包括将所述第一玩家与所述第二和第三队伍进行比较、将所述第二玩家与所述第一队伍进行比较、以及将所述第三玩家与所述第一队伍进行比较； h)至少部分地基于所述排名矩阵来更新所述第一均值和所述第一方差；以及 i)提供对所述更新的第一均值和第一方差的指示。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (包括接收) from a user to generate a unique user profile for the user ; providing the user a first polling question (一个的) , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
CN101496051A CLAIM 9 . 如权利要求1所述的方法，其特征在于，还包括接收 (receiving user information) 包括第三队伍的第四玩家的第四均值和第四方差的第四得分，其中所述游戏结果标识所述第一队伍战胜所述第二队伍和所述第三队伍，但未标识所述第二队伍是否战胜所述第三队伍以及所述第三队伍是否战胜所述第二队伍。 CN101496051A CLAIM 11 . 一种方法包括： a)接收第一队伍、第二队伍和第三队伍之间的游戏的结果，所述第一队伍包括第一玩家，所述第二队伍包括第二玩家，所述第三队伍包括第三玩家，所述结果定义所述第一队伍战胜所述第二队伍和所述第三队伍，但是未定义所述第二队伍和所述第三队伍之间的相对游戏结果； b)接收表示与所述第一队伍的第一玩家相关联的分布的、包括第一均值和第一方差的第一得分； c)接收表示与所述第二队伍的第二玩家相关联的分布的、包括第二均值和第二方差的第二得分； d)接收表示与所述第三队伍的第三玩家相关联的分布的、包括第三均值和第三方差的第三得分； e)将所述第一队伍排序在所述第二队伍和所述第三队伍之前； f)生成具有至少三行和至少两列的排名矩阵； g)在所述至少三行的每一排名矩阵元素中对所述第一、第二和第三玩家中的每一个的 (first polling question) 排名进行编码，其中对所述排名进行编码包括将所述第一玩家与所述第二和第三队伍进行比较、将所述第二玩家与所述第一队伍进行比较、以及将所述第三玩家与所述第一队伍进行比较； h)至少部分地基于所述排名矩阵来更新所述第一均值和所述第一方差；以及 i)提供对所述更新的第一均值和第一方差的指示。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question (一个的) and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
CN101496051A CLAIM 11 . 一种方法包括： a)接收第一队伍、第二队伍和第三队伍之间的游戏的结果，所述第一队伍包括第一玩家，所述第二队伍包括第二玩家，所述第三队伍包括第三玩家，所述结果定义所述第一队伍战胜所述第二队伍和所述第三队伍，但是未定义所述第二队伍和所述第三队伍之间的相对游戏结果； b)接收表示与所述第一队伍的第一玩家相关联的分布的、包括第一均值和第一方差的第一得分； c)接收表示与所述第二队伍的第二玩家相关联的分布的、包括第二均值和第二方差的第二得分； d)接收表示与所述第三队伍的第三玩家相关联的分布的、包括第三均值和第三方差的第三得分； e)将所述第一队伍排序在所述第二队伍和所述第三队伍之前； f)生成具有至少三行和至少两列的排名矩阵； g)在所述至少三行的每一排名矩阵元素中对所述第一、第二和第三玩家中的每一个的 (first polling question) 排名进行编码，其中对所述排名进行编码包括将所述第一玩家与所述第二和第三队伍进行比较、将所述第二玩家与所述第一队伍进行比较、以及将所述第三玩家与所述第一队伍进行比较； h)至少部分地基于所述排名矩阵来更新所述第一均值和所述第一方差；以及 i)提供对所述更新的第一均值和第一方差的指示。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (包括接收) from a user to generate a unique user profile for the user ; providing the user a first polling question (一个的) , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
CN101496051A CLAIM 9 . 如权利要求1所述的方法，其特征在于，还包括接收 (receiving user information) 包括第三队伍的第四玩家的第四均值和第四方差的第四得分，其中所述游戏结果标识所述第一队伍战胜所述第二队伍和所述第三队伍，但未标识所述第二队伍是否战胜所述第三队伍以及所述第三队伍是否战胜所述第二队伍。 CN101496051A CLAIM 11 . 一种方法包括： a)接收第一队伍、第二队伍和第三队伍之间的游戏的结果，所述第一队伍包括第一玩家，所述第二队伍包括第二玩家，所述第三队伍包括第三玩家，所述结果定义所述第一队伍战胜所述第二队伍和所述第三队伍，但是未定义所述第二队伍和所述第三队伍之间的相对游戏结果； b)接收表示与所述第一队伍的第一玩家相关联的分布的、包括第一均值和第一方差的第一得分； c)接收表示与所述第二队伍的第二玩家相关联的分布的、包括第二均值和第二方差的第二得分； d)接收表示与所述第三队伍的第三玩家相关联的分布的、包括第三均值和第三方差的第三得分； e)将所述第一队伍排序在所述第二队伍和所述第三队伍之前； f)生成具有至少三行和至少两列的排名矩阵； g)在所述至少三行的每一排名矩阵元素中对所述第一、第二和第三玩家中的每一个的 (first polling question) 排名进行编码，其中对所述排名进行编码包括将所述第一玩家与所述第二和第三队伍进行比较、将所述第二玩家与所述第一队伍进行比较、以及将所述第三玩家与所述第一队伍进行比较； h)至少部分地基于所述排名矩阵来更新所述第一均值和所述第一方差；以及 i)提供对所述更新的第一均值和第一方差的指示。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question (一个的) and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
CN101496051A CLAIM 11 . 一种方法包括： a)接收第一队伍、第二队伍和第三队伍之间的游戏的结果，所述第一队伍包括第一玩家，所述第二队伍包括第二玩家，所述第三队伍包括第三玩家，所述结果定义所述第一队伍战胜所述第二队伍和所述第三队伍，但是未定义所述第二队伍和所述第三队伍之间的相对游戏结果； b)接收表示与所述第一队伍的第一玩家相关联的分布的、包括第一均值和第一方差的第一得分； c)接收表示与所述第二队伍的第二玩家相关联的分布的、包括第二均值和第二方差的第二得分； d)接收表示与所述第三队伍的第三玩家相关联的分布的、包括第三均值和第三方差的第三得分； e)将所述第一队伍排序在所述第二队伍和所述第三队伍之前； f)生成具有至少三行和至少两列的排名矩阵； g)在所述至少三行的每一排名矩阵元素中对所述第一、第二和第三玩家中的每一个的 (first polling question) 排名进行编码，其中对所述排名进行编码包括将所述第一玩家与所述第二和第三队伍进行比较、将所述第二玩家与所述第一队伍进行比较、以及将所述第三玩家与所述第一队伍进行比较； h)至少部分地基于所述排名矩阵来更新所述第一均值和所述第一方差；以及 i)提供对所述更新的第一均值和第一方差的指示。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | CN101055580A Filed: 2007-02-08 Issued: 2007-10-17 用于检索文档的系统、方法及用户接口 (Original Assignee) Lg电子株式会社 车完奎, 金晶中, 安汉峻 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (通过检) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
CN101055580A CLAIM 9 . 一种检索文档的方法，所述方法包括如下步骤：通过检 (first polling) 索式输入单元接收用户输入的检索式；从所述检索式中提取关键词；对每个关键词加权；以及基于已加权的关键词检索相似文档，其中，利用存储在文档数据库中的文档的特征信息的索引，对所述关键词加的权重反映每个文档中所述关键词的出现频率。 |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (通过检) question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
CN101055580A CLAIM 9 . 一种检索文档的方法，所述方法包括如下步骤：通过检 (first polling) 索式输入单元接收用户输入的检索式；从所述检索式中提取关键词；对每个关键词加权；以及基于已加权的关键词检索相似文档，其中，利用存储在文档数据库中的文档的特征信息的索引，对所述关键词加的权重反映每个文档中所述关键词的出现频率。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (通过检) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
CN101055580A CLAIM 9 . 一种检索文档的方法，所述方法包括如下步骤：通过检 (first polling) 索式输入单元接收用户输入的检索式；从所述检索式中提取关键词；对每个关键词加权；以及基于已加权的关键词检索相似文档，其中，利用存储在文档数据库中的文档的特征信息的索引，对所述关键词加的权重反映每个文档中所述关键词的出现频率。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (通过检) question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
CN101055580A CLAIM 9 . 一种检索文档的方法，所述方法包括如下步骤：通过检 (first polling) 索式输入单元接收用户输入的检索式；从所述检索式中提取关键词；对每个关键词加权；以及基于已加权的关键词检索相似文档，其中，利用存储在文档数据库中的文档的特征信息的索引，对所述关键词加的权重反映每个文档中所述关键词的出现频率。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (通过检) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
CN101055580A CLAIM 9 . 一种检索文档的方法，所述方法包括如下步骤：通过检 (first polling) 索式输入单元接收用户输入的检索式；从所述检索式中提取关键词；对每个关键词加权；以及基于已加权的关键词检索相似文档，其中，利用存储在文档数据库中的文档的特征信息的索引，对所述关键词加的权重反映每个文档中所述关键词的出现频率。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (通过检) question and the net polling question (网络连) against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
CN101055580A CLAIM 6 . 根据权利要求1所述的系统，其中所述输出单元向与网络连 (net polling question) 接的客户端提供多种用户接口，并且所述用户接口为用户通过各种路径输入检索式的环境，包括第一用户接口、第二用户接口和第三用户接口之一，其中在所述第一用户接口中以句子为单位输入检索式，在所述第二用户接口中将检索到的文档用作检索式，在所述第三用户接口中通过附上或上载文本文件输入检索式。 CN101055580A CLAIM 9 . 一种检索文档的方法，所述方法包括如下步骤：通过检 (first polling) 索式输入单元接收用户输入的检索式；从所述检索式中提取关键词；对每个关键词加权；以及基于已加权的关键词检索相似文档，其中，利用存储在文档数据库中的文档的特征信息的索引，对所述关键词加的权重反映每个文档中所述关键词的出现频率。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20090138817A1 Filed: 2007-02-07 Issued: 2009-05-28 Efficient display systems and methods (Original Assignee) Dolphin Software Ltd (Current Assignee) Dolphin Software Ltd Ofir Oron, Gabriel Marcus, Ofer Ber, Eyal Livne |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (said database) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20090138817A1 CLAIM 31 . A system for arranging items for display , comprising : a database configured to store items ; a clustering module configured to provide a plurality of items which are to be displayed on at least one page , wherein at least one of said provided items is extracted from said database (user information) ; and an arranger module configured to arrange said plurality of items in rows on said at least one page , wherein at least one row on at least one of said pages includes at least two of said plurality of items , said arranger module including a width module configured for at least one of said pages to determine cell widths which differ from one another for at least two items from said plurality which are arranged on said page . |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20090138817A1 CLAIM 31 . A system for arranging items for display , comprising : a database configured to store (receiving match commands to identify users) items ; a clustering module configured to provide a plurality of items which are to be displayed on at least one page , wherein at least one of said provided items is extracted from said database ; and an arranger module configured to arrange said plurality of items in rows on said at least one page , wherein at least one row on at least one of said pages includes at least two of said plurality of items , said arranger module including a width module configured for at least one of said pages to determine cell widths which differ from one another for at least two items from said plurality which are arranged on said page . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (same row) per user . |
US20090138817A1 CLAIM 9 . The method of claim 1 , wherein each item arranged for display on a same row (m rows) on said page has an identical cell width . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (same row) per user . |
US20090138817A1 CLAIM 9 . The method of claim 1 , wherein each item arranged for display on a same row (m rows) on said page has an identical cell width . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (said database) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20090138817A1 CLAIM 31 . A system for arranging items for display , comprising : a database configured to store items ; a clustering module configured to provide a plurality of items which are to be displayed on at least one page , wherein at least one of said provided items is extracted from said database (user information) ; and an arranger module configured to arrange said plurality of items in rows on said at least one page , wherein at least one row on at least one of said pages includes at least two of said plurality of items , said arranger module including a width module configured for at least one of said pages to determine cell widths which differ from one another for at least two items from said plurality which are arranged on said page . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20090138817A1 CLAIM 31 . A system for arranging items for display , comprising : a database configured to store (receiving match commands to identify users) items ; a clustering module configured to provide a plurality of items which are to be displayed on at least one page , wherein at least one of said provided items is extracted from said database ; and an arranger module configured to arrange said plurality of items in rows on said at least one page , wherein at least one row on at least one of said pages includes at least two of said plurality of items , said arranger module including a width module configured for at least one of said pages to determine cell widths which differ from one another for at least two items from said plurality which are arranged on said page . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (same row) per user . |
US20090138817A1 CLAIM 9 . The method of claim 1 , wherein each item arranged for display on a same row (m rows) on said page has an identical cell width . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (same row) per user . |
US20090138817A1 CLAIM 9 . The method of claim 1 , wherein each item arranged for display on a same row (m rows) on said page has an identical cell width . |
| US9087321B2 CLAIM 19 . A computer program product (computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (said database) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20090138817A1 CLAIM 31 . A system for arranging items for display , comprising : a database configured to store items ; a clustering module configured to provide a plurality of items which are to be displayed on at least one page , wherein at least one of said provided items is extracted from said database (user information) ; and an arranger module configured to arrange said plurality of items in rows on said at least one page , wherein at least one row on at least one of said pages includes at least two of said plurality of items , said arranger module including a width module configured for at least one of said pages to determine cell widths which differ from one another for at least two items from said plurality which are arranged on said page . US20090138817A1 CLAIM 37 . A computer program product (computer program product) comprising a computer useable medium having computer readable program code embodied therein for arranging items for display , the computer program product comprising : computer readable program code for causing the computer to provide a plurality of items for arrangement for display on at least one page ; and computer readable program code for causing the computer to arrange said plurality of items in rows on said at least one page , wherein said arranging on at least one of said pages includes : determining cell widths which differ from one another for at least two items which are arranged on said page , and for at least one row on said page arranging at least two items on said row . |
| US9087321B2 CLAIM 20 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20090138817A1 CLAIM 37 . A computer program product (computer program product) comprising a computer useable medium having computer readable program code embodied therein for arranging items for display , the computer program product comprising : computer readable program code for causing the computer to provide a plurality of items for arrangement for display on at least one page ; and computer readable program code for causing the computer to arrange said plurality of items in rows on said at least one page , wherein said arranging on at least one of said pages includes : determining cell widths which differ from one another for at least two items which are arranged on said page , and for at least one row on said page arranging at least two items on said row . |
| US9087321B2 CLAIM 21 . The computer program product (computer program product) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20090138817A1 CLAIM 37 . A computer program product (computer program product) comprising a computer useable medium having computer readable program code embodied therein for arranging items for display , the computer program product comprising : computer readable program code for causing the computer to provide a plurality of items for arrangement for display on at least one page ; and computer readable program code for causing the computer to arrange said plurality of items in rows on said at least one page , wherein said arranging on at least one of said pages includes : determining cell widths which differ from one another for at least two items which are arranged on said page , and for at least one row on said page arranging at least two items on said row . |
| US9087321B2 CLAIM 22 . The computer program product (computer program product) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20090138817A1 CLAIM 37 . A computer program product (computer program product) comprising a computer useable medium having computer readable program code embodied therein for arranging items for display , the computer program product comprising : computer readable program code for causing the computer to provide a plurality of items for arrangement for display on at least one page ; and computer readable program code for causing the computer to arrange said plurality of items in rows on said at least one page , wherein said arranging on at least one of said pages includes : determining cell widths which differ from one another for at least two items which are arranged on said page , and for at least one row on said page arranging at least two items on said row . |
| US9087321B2 CLAIM 23 . The computer program product (computer program product) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20090138817A1 CLAIM 31 . A system for arranging items for display , comprising : a database configured to store (receiving match commands to identify users) items ; a clustering module configured to provide a plurality of items which are to be displayed on at least one page , wherein at least one of said provided items is extracted from said database ; and an arranger module configured to arrange said plurality of items in rows on said at least one page , wherein at least one row on at least one of said pages includes at least two of said plurality of items , said arranger module including a width module configured for at least one of said pages to determine cell widths which differ from one another for at least two items from said plurality which are arranged on said page . US20090138817A1 CLAIM 37 . A computer program product (computer program product) comprising a computer useable medium having computer readable program code embodied therein for arranging items for display , the computer program product comprising : computer readable program code for causing the computer to provide a plurality of items for arrangement for display on at least one page ; and computer readable program code for causing the computer to arrange said plurality of items in rows on said at least one page , wherein said arranging on at least one of said pages includes : determining cell widths which differ from one another for at least two items which are arranged on said page , and for at least one row on said page arranging at least two items on said row . |
| US9087321B2 CLAIM 24 . The computer program product (computer program product) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090138817A1 CLAIM 37 . A computer program product (computer program product) comprising a computer useable medium having computer readable program code embodied therein for arranging items for display , the computer program product comprising : computer readable program code for causing the computer to provide a plurality of items for arrangement for display on at least one page ; and computer readable program code for causing the computer to arrange said plurality of items in rows on said at least one page , wherein said arranging on at least one of said pages includes : determining cell widths which differ from one another for at least two items which are arranged on said page , and for at least one row on said page arranging at least two items on said row . |
| US9087321B2 CLAIM 25 . The computer program product (computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (same row) per user . |
US20090138817A1 CLAIM 9 . The method of claim 1 , wherein each item arranged for display on a same row (m rows) on said page has an identical cell width . US20090138817A1 CLAIM 37 . A computer program product (computer program product) comprising a computer useable medium having computer readable program code embodied therein for arranging items for display , the computer program product comprising : computer readable program code for causing the computer to provide a plurality of items for arrangement for display on at least one page ; and computer readable program code for causing the computer to arrange said plurality of items in rows on said at least one page , wherein said arranging on at least one of said pages includes : determining cell widths which differ from one another for at least two items which are arranged on said page , and for at least one row on said page arranging at least two items on said row . |
| US9087321B2 CLAIM 26 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20090138817A1 CLAIM 37 . A computer program product (computer program product) comprising a computer useable medium having computer readable program code embodied therein for arranging items for display , the computer program product comprising : computer readable program code for causing the computer to provide a plurality of items for arrangement for display on at least one page ; and computer readable program code for causing the computer to arrange said plurality of items in rows on said at least one page , wherein said arranging on at least one of said pages includes : determining cell widths which differ from one another for at least two items which are arranged on said page , and for at least one row on said page arranging at least two items on said row . |
| US9087321B2 CLAIM 27 . The computer program product (computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (same row) per user . |
US20090138817A1 CLAIM 9 . The method of claim 1 , wherein each item arranged for display on a same row (m rows) on said page has an identical cell width . US20090138817A1 CLAIM 37 . A computer program product (computer program product) comprising a computer useable medium having computer readable program code embodied therein for arranging items for display , the computer program product comprising : computer readable program code for causing the computer to provide a plurality of items for arrangement for display on at least one page ; and computer readable program code for causing the computer to arrange said plurality of items in rows on said at least one page , wherein said arranging on at least one of said pages includes : determining cell widths which differ from one another for at least two items which are arranged on said page , and for at least one row on said page arranging at least two items on said row . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20080172415A1 Filed: 2007-01-12 Issued: 2008-07-17 System and method of matching candidates and employers (Original Assignee) Fakhari Mark M; Manoj Ramnani Mark M. Fakhari, Manoj Ramnani |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (profile information, profile data) of other users that have a likelihood of match within a predetermined threshold . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (profile information, profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 3 . The poll-based networking system as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage (profile information, profile data) . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 4 . The poll-based networking system as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage (profile information, profile data) , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (profile information, profile data) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (profile information, profile data) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (profile information, profile data) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (profile information, profile data) of other users that have a likelihood of match within a predetermined threshold . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (profile information, profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 12 . The computer implemented method as set forth in claim 11 , wherein , in cumulatively comparing , further comprising an act of causing the one or more processors to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage (profile information, profile data) . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage (profile information, profile data) , further comprising an act of causing the one or more processors to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (profile information, profile data) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (profile information, profile data) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (profile information, profile data) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (profile information, profile data) of other users that have a likelihood of match within a predetermined threshold . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question (key position) against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (profile information, profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . US20080172415A1 CLAIM 2 . The method of matching candidates and employers according to claim 1 , wherein the step of requiring job candidates to enter their profile data into a candidate database further comprises the step of providing pre-defined templates which the job candidate must use for the profile data entry , the pre-defined templates being provided for key position (net polling question) requirements to thereby significantly improve matching quality , matching speed , and ease of use for both the employers and the candidates . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage (profile information, profile data) . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage (profile information, profile data) between the user and the selected other user . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (profile information, profile data) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (profile information, profile data) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (profile information, profile data) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080172415A1 CLAIM 1 . A computer-implemented method of matching candidates and employers , comprising the steps of : requiring job candidates to enter their profile data (user profiles, match percentage, minimum match percentage, match servers) into a candidate database , the profile data being formed from data comprising selections by the candidate from predefined lists of skills , wherein the selected skills are ranked according to the order of selection by the candidate ; requiring employers to enter profile information (user profiles, match percentage, minimum match percentage, match servers) about their open job requirements into an employer database ; generating match scores based on a comparison between the candidate profiles and the open job profiles ; identifying candidates with the best fit for a particular job opening based on the match scores ; permitting candidates to view only the job openings for which they have been selected as top candidates ; and permitting employers to view only the profiles of candidates who have authorized them to do so . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20080168048A1 Filed: 2007-01-04 Issued: 2008-07-10 User content feeds from user storage devices to a public search engine (Original Assignee) Yahoo Inc (Current Assignee) R2 Solutions LLC ; Altaba Inc Ronald S. Bell, Oliver M. Raskin, Duke T. Fan, Chris T. Kalaboukis, Ronald G. Martinez |
|---|---|
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (said indication) . |
US20080168048A1 CLAIM 12 . The method of claim 11 , said certain steps further comprising : in response to receiving from a searcher search criteria for which a file from said one or more files is determined relevant enough to include in search results , providing search results that include a link to said file , receiving an indication that said searcher selected said link , and in response to receiving said indication (next polling questions) , uploading said file for storage at a location that is accessible through a web server . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080168048A1 CLAIM 1 . A method comprising performing a machine-executed operation involving instructions , wherein said instructions are instructions which , when executed by one or more processors , cause the one or more processors to perform certain steps comprising : receiving identification of an unhosted file ; in response to receiving said identification , creating a word set representing information about said file ; uploading said file for storage at a location that is accessible through a web server (web server) ; and based on said word set , generating a search index entry for said file , wherein said search index is associated with a public search engine ; wherein the machine-executed operation is at least one of (a) sending said instructions over transmission media , (b) receiving said instructions over transmission media , (c) storing said instructions onto a machine-readable storage medium , and (d) executing the instructions . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080168048A1 CLAIM 1 . A method comprising performing a machine-executed operation involving instructions , wherein said instructions are instructions which , when executed by one or more processors , cause the one or more processors to perform certain steps comprising : receiving identification of an unhosted file ; in response to receiving said identification , creating a word set representing information about said file ; uploading said file for storage at a location that is accessible through a web server (web server) ; and based on said word set , generating a search index entry for said file , wherein said search index is associated with a public search engine ; wherein the machine-executed operation is at least one of (a) sending said instructions over transmission media , (b) receiving said instructions over transmission media , (c) storing said instructions onto a machine-readable storage medium , and (d) executing the instructions . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (said indication) . |
US20080168048A1 CLAIM 12 . The method of claim 11 , said certain steps further comprising : in response to receiving from a searcher search criteria for which a file from said one or more files is determined relevant enough to include in search results , providing search results that include a link to said file , receiving an indication that said searcher selected said link , and in response to receiving said indication (next polling questions) , uploading said file for storage at a location that is accessible through a web server . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080168048A1 CLAIM 1 . A method comprising performing a machine-executed operation involving instructions , wherein said instructions are instructions which , when executed by one or more processors , cause the one or more processors to perform certain steps comprising : receiving identification of an unhosted file ; in response to receiving said identification , creating a word set representing information about said file ; uploading said file for storage at a location that is accessible through a web server (web server) ; and based on said word set , generating a search index entry for said file , wherein said search index is associated with a public search engine ; wherein the machine-executed operation is at least one of (a) sending said instructions over transmission media , (b) receiving said instructions over transmission media , (c) storing said instructions onto a machine-readable storage medium , and (d) executing the instructions . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080168048A1 CLAIM 1 . A method comprising performing a machine-executed operation involving instructions , wherein said instructions are instructions which , when executed by one or more processors , cause the one or more processors to perform certain steps comprising : receiving identification of an unhosted file ; in response to receiving said identification , creating a word set representing information about said file ; uploading said file for storage at a location that is accessible through a web server (web server) ; and based on said word set , generating a search index entry for said file , wherein said search index is associated with a public search engine ; wherein the machine-executed operation is at least one of (a) sending said instructions over transmission media , (b) receiving said instructions over transmission media , (c) storing said instructions onto a machine-readable storage medium , and (d) executing the instructions . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (said indication) . |
US20080168048A1 CLAIM 12 . The method of claim 11 , said certain steps further comprising : in response to receiving from a searcher search criteria for which a file from said one or more files is determined relevant enough to include in search results , providing search results that include a link to said file , receiving an indication that said searcher selected said link , and in response to receiving said indication (next polling questions) , uploading said file for storage at a location that is accessible through a web server . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080168048A1 CLAIM 1 . A method comprising performing a machine-executed operation involving instructions , wherein said instructions are instructions which , when executed by one or more processors , cause the one or more processors to perform certain steps comprising : receiving identification of an unhosted file ; in response to receiving said identification , creating a word set representing information about said file ; uploading said file for storage at a location that is accessible through a web server (web server) ; and based on said word set , generating a search index entry for said file , wherein said search index is associated with a public search engine ; wherein the machine-executed operation is at least one of (a) sending said instructions over transmission media , (b) receiving said instructions over transmission media , (c) storing said instructions onto a machine-readable storage medium , and (d) executing the instructions . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080168048A1 CLAIM 1 . A method comprising performing a machine-executed operation involving instructions , wherein said instructions are instructions which , when executed by one or more processors , cause the one or more processors to perform certain steps comprising : receiving identification of an unhosted file ; in response to receiving said identification , creating a word set representing information about said file ; uploading said file for storage at a location that is accessible through a web server (web server) ; and based on said word set , generating a search index entry for said file , wherein said search index is associated with a public search engine ; wherein the machine-executed operation is at least one of (a) sending said instructions over transmission media , (b) receiving said instructions over transmission media , (c) storing said instructions onto a machine-readable storage medium , and (d) executing the instructions . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | CN101395602A Filed: 2006-11-30 Issued: 2009-03-25 用于分布式文件存储和索引服务的方法和装置 (Original Assignee) 亚马逊科技公司 P·W·兰西尔, A·V·马丁诺夫, J·S·拉森, J·R·科利特, R·W-C·楚, P·撒哈 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question (一个的) , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
CN101395602A CLAIM 50、 如权利要求37所述的方法，其中所述多个节点包括两个或 更多存储节点，且其中所述方法进一步包括：对被一个所述存储节点持久地存储的所述可搜索的索引的分区 重新划分，以在所述存储节点上产生两个或更多新分区，其中所迷两 个或更多新分区中的每个都包括存储在所述可搜索的索引中的所述 可搜索的数据服务对象的不同子集；在所述存储节点与存储节点中的一个或更多其他存储节点之间 通信，以定位自愿接收所述两个或更多新分区中的一个的 (first polling question) 另一个存储 节点；执行所述存储节点与另 一个存储节点之间的合作操作，以将所述 两个或更多新分区中的一个移动到所述另一个存储节点。 |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question (一个的) and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
CN101395602A CLAIM 50、 如权利要求37所述的方法，其中所述多个节点包括两个或 更多存储节点，且其中所述方法进一步包括：对被一个所述存储节点持久地存储的所述可搜索的索引的分区 重新划分，以在所述存储节点上产生两个或更多新分区，其中所迷两 个或更多新分区中的每个都包括存储在所述可搜索的索引中的所述 可搜索的数据服务对象的不同子集；在所述存储节点与存储节点中的一个或更多其他存储节点之间 通信，以定位自愿接收所述两个或更多新分区中的一个的 (first polling question) 另一个存储 节点；执行所述存储节点与另 一个存储节点之间的合作操作，以将所述 两个或更多新分区中的一个移动到所述另一个存储节点。 |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (的至少一个部分) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
CN101395602A CLAIM 16、 如权利要求l所述的系统，其中为了对所迷可搜索的数据服 务的客户端应用程序执行所述可搜索的数据服务的操作，所述Web 服务接口暴露多个服务请求，其中所述服务请求包括：增加请求，其将指定的可搜索的数据服务对象增加到指定的可搜 索的索引；替换请求，其替换在指定的可搜索的索引中的指定的可搜索的数据服务对象的指定部分或全部；删除请求，其从指定的可搜索的索引中删除指定的可搜索的数据 服务对象的至少一个部分 (web server) ；列表属性请求，其返回在指定的可搜索的索引中的一个或更多指定的可搜索的数据服务对象的属性的列表；以及查询请求，其返回在指定的可搜索的索引中的与在所述查询请求 中指定的查询表达式匹配的可搜索的数据服务对象的一组实体标识符。 |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (的至少一个部分) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
CN101395602A CLAIM 16、 如权利要求l所述的系统，其中为了对所迷可搜索的数据服 务的客户端应用程序执行所述可搜索的数据服务的操作，所述Web 服务接口暴露多个服务请求，其中所述服务请求包括：增加请求，其将指定的可搜索的数据服务对象增加到指定的可搜 索的索引；替换请求，其替换在指定的可搜索的索引中的指定的可搜索的数据服务对象的指定部分或全部；删除请求，其从指定的可搜索的索引中删除指定的可搜索的数据 服务对象的至少一个部分 (web server) ；列表属性请求，其返回在指定的可搜索的索引中的一个或更多指定的可搜索的数据服务对象的属性的列表；以及查询请求，其返回在指定的可搜索的索引中的与在所述查询请求 中指定的查询表达式匹配的可搜索的数据服务对象的一组实体标识符。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question (一个的) , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
CN101395602A CLAIM 50、 如权利要求37所述的方法，其中所述多个节点包括两个或 更多存储节点，且其中所述方法进一步包括：对被一个所述存储节点持久地存储的所述可搜索的索引的分区 重新划分，以在所述存储节点上产生两个或更多新分区，其中所迷两 个或更多新分区中的每个都包括存储在所述可搜索的索引中的所述 可搜索的数据服务对象的不同子集；在所述存储节点与存储节点中的一个或更多其他存储节点之间 通信，以定位自愿接收所述两个或更多新分区中的一个的 (first polling question) 另一个存储 节点；执行所述存储节点与另 一个存储节点之间的合作操作，以将所述 两个或更多新分区中的一个移动到所述另一个存储节点。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question (一个的) and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
CN101395602A CLAIM 50、 如权利要求37所述的方法，其中所述多个节点包括两个或 更多存储节点，且其中所述方法进一步包括：对被一个所述存储节点持久地存储的所述可搜索的索引的分区 重新划分，以在所述存储节点上产生两个或更多新分区，其中所迷两 个或更多新分区中的每个都包括存储在所述可搜索的索引中的所述 可搜索的数据服务对象的不同子集；在所述存储节点与存储节点中的一个或更多其他存储节点之间 通信，以定位自愿接收所述两个或更多新分区中的一个的 (first polling question) 另一个存储 节点；执行所述存储节点与另 一个存储节点之间的合作操作，以将所述 两个或更多新分区中的一个移动到所述另一个存储节点。 |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (的至少一个部分) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
CN101395602A CLAIM 16、 如权利要求l所述的系统，其中为了对所迷可搜索的数据服 务的客户端应用程序执行所述可搜索的数据服务的操作，所述Web 服务接口暴露多个服务请求，其中所述服务请求包括：增加请求，其将指定的可搜索的数据服务对象增加到指定的可搜 索的索引；替换请求，其替换在指定的可搜索的索引中的指定的可搜索的数据服务对象的指定部分或全部；删除请求，其从指定的可搜索的索引中删除指定的可搜索的数据 服务对象的至少一个部分 (web server) ；列表属性请求，其返回在指定的可搜索的索引中的一个或更多指定的可搜索的数据服务对象的属性的列表；以及查询请求，其返回在指定的可搜索的索引中的与在所述查询请求 中指定的查询表达式匹配的可搜索的数据服务对象的一组实体标识符。 |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (的至少一个部分) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
CN101395602A CLAIM 16、 如权利要求l所述的系统，其中为了对所迷可搜索的数据服 务的客户端应用程序执行所述可搜索的数据服务的操作，所述Web 服务接口暴露多个服务请求，其中所述服务请求包括：增加请求，其将指定的可搜索的数据服务对象增加到指定的可搜 索的索引；替换请求，其替换在指定的可搜索的索引中的指定的可搜索的数据服务对象的指定部分或全部；删除请求，其从指定的可搜索的索引中删除指定的可搜索的数据 服务对象的至少一个部分 (web server) ；列表属性请求，其返回在指定的可搜索的索引中的一个或更多指定的可搜索的数据服务对象的属性的列表；以及查询请求，其返回在指定的可搜索的索引中的与在所述查询请求 中指定的查询表达式匹配的可搜索的数据服务对象的一组实体标识符。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question (一个的) , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
CN101395602A CLAIM 50、 如权利要求37所述的方法，其中所述多个节点包括两个或 更多存储节点，且其中所述方法进一步包括：对被一个所述存储节点持久地存储的所述可搜索的索引的分区 重新划分，以在所述存储节点上产生两个或更多新分区，其中所迷两 个或更多新分区中的每个都包括存储在所述可搜索的索引中的所述 可搜索的数据服务对象的不同子集；在所述存储节点与存储节点中的一个或更多其他存储节点之间 通信，以定位自愿接收所述两个或更多新分区中的一个的 (first polling question) 另一个存储 节点；执行所述存储节点与另 一个存储节点之间的合作操作，以将所述 两个或更多新分区中的一个移动到所述另一个存储节点。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question (一个的) and the net polling question (对象中) against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
CN101395602A CLAIM 50、 如权利要求37所述的方法，其中所述多个节点包括两个或 更多存储节点，且其中所述方法进一步包括：对被一个所述存储节点持久地存储的所述可搜索的索引的分区 重新划分，以在所述存储节点上产生两个或更多新分区，其中所迷两 个或更多新分区中的每个都包括存储在所述可搜索的索引中的所述 可搜索的数据服务对象的不同子集；在所述存储节点与存储节点中的一个或更多其他存储节点之间 通信，以定位自愿接收所述两个或更多新分区中的一个的 (first polling question) 另一个存储 节点；执行所述存储节点与另 一个存储节点之间的合作操作，以将所述 两个或更多新分区中的一个移动到所述另一个存储节点。 CN101395602A CLAIM 122、 一种方法，包括：在可搜索的数据服务的Web服务接口上从客户端应用程序接收 查询请求；将来自所述Web服务接口的每个查询请求转发到配置为参与所 述可搜索的数据服务的多个节点中的至少一个，其中每个查询请求都 包括查询标准；从所述多个节点的相应的一个接收对每个查询请求的查询结果， 其中每个查询结果包括来自所述可搜索的数据服务的可搜索的索引的满足所述查询请求的所述搜索标准的一个或更多可搜索的数据服 务对象中 (net polling question) 的每个的实体标识符；以及根据所述Web服务接口至少将所述实体标识符从满足所述查询 请求的所述一个或更多可搜索的数据服务对象中的每个返回到所述客户端应用程序，其中每个实体标识符在被所述客户端应用程序使用 的数据存储器中定位特定实体。 |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (的至少一个部分) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
CN101395602A CLAIM 16、 如权利要求l所述的系统，其中为了对所迷可搜索的数据服 务的客户端应用程序执行所述可搜索的数据服务的操作，所述Web 服务接口暴露多个服务请求，其中所述服务请求包括：增加请求，其将指定的可搜索的数据服务对象增加到指定的可搜 索的索引；替换请求，其替换在指定的可搜索的索引中的指定的可搜索的数据服务对象的指定部分或全部；删除请求，其从指定的可搜索的索引中删除指定的可搜索的数据 服务对象的至少一个部分 (web server) ；列表属性请求，其返回在指定的可搜索的索引中的一个或更多指定的可搜索的数据服务对象的属性的列表；以及查询请求，其返回在指定的可搜索的索引中的与在所述查询请求 中指定的查询表达式匹配的可搜索的数据服务对象的一组实体标识符。 |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (的至少一个部分) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
CN101395602A CLAIM 16、 如权利要求l所述的系统，其中为了对所迷可搜索的数据服 务的客户端应用程序执行所述可搜索的数据服务的操作，所述Web 服务接口暴露多个服务请求，其中所述服务请求包括：增加请求，其将指定的可搜索的数据服务对象增加到指定的可搜 索的索引；替换请求，其替换在指定的可搜索的索引中的指定的可搜索的数据服务对象的指定部分或全部；删除请求，其从指定的可搜索的索引中删除指定的可搜索的数据 服务对象的至少一个部分 (web server) ；列表属性请求，其返回在指定的可搜索的索引中的一个或更多指定的可搜索的数据服务对象的属性的列表；以及查询请求，其返回在指定的可搜索的索引中的与在所述查询请求 中指定的查询表达式匹配的可搜索的数据服务对象的一组实体标识符。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20080086387A1 Filed: 2006-10-04 Issued: 2008-04-10 Information-delivery system and method and applications employing same (Original Assignee) University of California (Current Assignee) University of California Dara O'Rourke, Kelly Bryant, Graham Bullock, Alastair Iles, Hye Y. Kim, Shufei Lei |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (using one) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profile) of other users that have a likelihood of match within a predetermined threshold . |
US20080086387A1 CLAIM 5 . The system of claim 1 , further comprising an application configured to determine the one or more ratings using one (user information) or more predetermined parameters specifying use of averaging or normalized averaging algorithms . US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (user profile) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (user profile) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (using one) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profile) of other users that have a likelihood of match within a predetermined threshold . |
US20080086387A1 CLAIM 5 . The system of claim 1 , further comprising an application configured to determine the one or more ratings using one (user information) or more predetermined parameters specifying use of averaging or normalized averaging algorithms . US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (user profile) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (user profile) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . |
| US9087321B2 CLAIM 19 . A computer program product (bar code) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations (bar code) of : receiving user information (using one) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profile) of other users that have a likelihood of match within a predetermined threshold . |
US20080086387A1 CLAIM 5 . The system of claim 1 , further comprising an application configured to determine the one or more ratings using one (user information) or more predetermined parameters specifying use of averaging or normalized averaging algorithms . US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . US20080086387A1 CLAIM 24 . The method of claim 20 , wherein the identity comprises a bar code (computer program product, computer program product comprising computer, computer to perform operations) , wherein the entity is determined from the bar code . |
| US9087321B2 CLAIM 20 . The computer program product (bar code) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations (bar code) of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . US20080086387A1 CLAIM 24 . The method of claim 20 , wherein the identity comprises a bar code (computer program product, computer program product comprising computer, computer to perform operations) , wherein the entity is determined from the bar code . |
| US9087321B2 CLAIM 21 . The computer program product (bar code) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations (bar code) of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20080086387A1 CLAIM 24 . The method of claim 20 , wherein the identity comprises a bar code (computer program product, computer program product comprising computer, computer to perform operations) , wherein the entity is determined from the bar code . |
| US9087321B2 CLAIM 22 . The computer program product (bar code) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations (bar code) of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20080086387A1 CLAIM 24 . The method of claim 20 , wherein the identity comprises a bar code (computer program product, computer program product comprising computer, computer to perform operations) , wherein the entity is determined from the bar code . |
| US9087321B2 CLAIM 23 . The computer program product (bar code) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations (bar code) of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20080086387A1 CLAIM 24 . The method of claim 20 , wherein the identity comprises a bar code (computer program product, computer program product comprising computer, computer to perform operations) , wherein the entity is determined from the bar code . |
| US9087321B2 CLAIM 24 . The computer program product (bar code) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations (bar code) of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . US20080086387A1 CLAIM 24 . The method of claim 20 , wherein the identity comprises a bar code (computer program product, computer program product comprising computer, computer to perform operations) , wherein the entity is determined from the bar code . |
| US9087321B2 CLAIM 25 . The computer program product (bar code) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (user profile) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . US20080086387A1 CLAIM 24 . The method of claim 20 , wherein the identity comprises a bar code (computer program product, computer program product comprising computer, computer to perform operations) , wherein the entity is determined from the bar code . |
| US9087321B2 CLAIM 26 . The computer program product (bar code) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations (bar code) of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . US20080086387A1 CLAIM 24 . The method of claim 20 , wherein the identity comprises a bar code (computer program product, computer program product comprising computer, computer to perform operations) , wherein the entity is determined from the bar code . |
| US9087321B2 CLAIM 27 . The computer program product (bar code) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (user profile) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080086387A1 CLAIM 13 . An information-delivery system comprising : a computer adapted to provide identification information ; a user profile (user profiles, match server) ; and a server in communication with the mobile computing device , wherein the server is adapted to automatically provide a rating to the mobile computing device based on the identification information and the user profile . US20080086387A1 CLAIM 24 . The method of claim 20 , wherein the identity comprises a bar code (computer program product, computer program product comprising computer, computer to perform operations) , wherein the entity is determined from the bar code . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2008090560A Filed: 2006-09-29 Issued: 2008-04-17 Post processing device (Original Assignee) Nomura Research Institute Ltd; 株式会社野村総合研究所 Tatsumi Mashita, 竜実 真下 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system (保持部と, apparatus, plurality) , comprising : a data processing system (保持部と, apparatus, plurality) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (データ送) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users (other users) , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2008090560A CLAIM 2 ユーザのクライアント端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . JP2008090560A CLAIM 4 前記共感データ受信部は、ユーザが選択した見解についての見地として、あらかじめ用意された複数の選択肢のうちのいずれかを示すデータを更に含む共感データを受信し、 前記共感度保持部は、複数の見地のそれぞれについて、あるユーザの他のユーザに対する共感度を対応付けたデータテーブルとして前記共感度データテーブルを保持し、 前記共感度更新部は、共感データが受信されたとき、共感データに指定された見地に関する共感データの送信元のユーザの前記抽出されたユーザに対する共感度を更新し、 前記ユーザ選定部は、投稿データの閲覧要求に際していずれかの見地が指定されたときには、指定された見地に関する共感度に応じてユーザを選定することを特徴とする請求項１から３のいずれかに記載の投稿処理装置。 The sympathy data receiving unit receives sympathy data further including data indicating any of a plurality (networking system, data processing system, data processing system having one) of options prepared in advance as a viewpoint about the opinion selected by the user , The co-sensitivity holding unit holds the co-sensitivity data table as a data table in which the co-sensitivity for another user for each of a plurality of viewpoints is associated , When the sympathy data is received , the sympathy update unit updates the sympathy for the extracted user of the user who transmitted the sympathy data related to the viewpoint specified in the sympathy data , 4 . The user selection unit according to claim 1 , wherein , when any viewpoint is designated in the posting request for posting data , the user selecting section selects a user according to the co-sensitivity regarding the designated viewpoint . The posting processing apparatus described . JP2008090560A CLAIM 7 第１のユーザからの共感度が所定値以上のユーザ群が、複数種類の見解を示している投稿データを抽出し、第１のユーザのクライアント端末に送信する投稿データ送 (receiving user information) 信部を更に備え、 前記共感データ受信部は、抽出された投稿データに対する複数種類の見解に対して、第１のユーザが共感できる度合いを示す共感データをクライアント端末から受信し、 前記共感度更新部は、共感データが受信されたとき、前記見解データテーブルを参照し、共感データに指定された見解を示したユーザを抽出し、第１のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１から６のいずれかに記載の投稿処理装置。 A group of users whose co-sensitivity from the first user is equal to or greater than a predetermined value further includes a post data transmission unit that extracts post data indicating a plurality of types of views and transmits the post data to the client terminal of the first user ; The sympathy data receiving unit receives sympathy data indicating the degree to which the first user can sympathize with a plurality of types of views on the extracted post data from the client terminal , When the sympathy data is received , the sympathy update unit refers to the opinion data table , extracts a user who indicates the opinion specified in the sympathy data , and sympathizes with the extracted user of the first user The post processing apparatus according to claim 1 , wherein the degree is updated . JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 2 . The poll-based networking system (保持部と, apparatus, plurality) as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users (other users) to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (するとき) . |
JP2008090560A CLAIM 2 ユーザのクライアント端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . JP2008090560A CLAIM 4 前記共感データ受信部は、ユーザが選択した見解についての見地として、あらかじめ用意された複数の選択肢のうちのいずれかを示すデータを更に含む共感データを受信し、 前記共感度保持部は、複数の見地のそれぞれについて、あるユーザの他のユーザに対する共感度を対応付けたデータテーブルとして前記共感度データテーブルを保持し、 前記共感度更新部は、共感データが受信されたとき、共感データに指定された見地に関する共感データの送信元のユーザの前記抽出されたユーザに対する共感度を更新し、 前記ユーザ選定部は、投稿データの閲覧要求に際していずれかの見地が指定されたときには、指定された見地に関する共感度に応じてユーザを選定することを特徴とする請求項１から３のいずれかに記載の投稿処理装置。 The sympathy data receiving unit receives sympathy data further including data indicating any of a plurality (networking system, data processing system, data processing system having one) of options prepared in advance as a viewpoint about the opinion selected by the user , The co-sensitivity holding unit holds the co-sensitivity data table as a data table in which the co-sensitivity for another user for each of a plurality of viewpoints is associated , When the sympathy data is received , the sympathy update unit updates the sympathy for the extracted user of the user who transmitted the sympathy data related to the viewpoint specified in the sympathy data , 4 . The user selection unit according to claim 1 , wherein , when any viewpoint is designated in the posting request for posting data , the user selecting section selects a user according to the co-sensitivity regarding the designated viewpoint . The posting processing apparatus described . JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 3 . The poll-based networking system (保持部と, apparatus, plurality) as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users (other users) based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2008090560A CLAIM 2 ユーザのクライアント端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . JP2008090560A CLAIM 4 前記共感データ受信部は、ユーザが選択した見解についての見地として、あらかじめ用意された複数の選択肢のうちのいずれかを示すデータを更に含む共感データを受信し、 前記共感度保持部は、複数の見地のそれぞれについて、あるユーザの他のユーザに対する共感度を対応付けたデータテーブルとして前記共感度データテーブルを保持し、 前記共感度更新部は、共感データが受信されたとき、共感データに指定された見地に関する共感データの送信元のユーザの前記抽出されたユーザに対する共感度を更新し、 前記ユーザ選定部は、投稿データの閲覧要求に際していずれかの見地が指定されたときには、指定された見地に関する共感度に応じてユーザを選定することを特徴とする請求項１から３のいずれかに記載の投稿処理装置。 The sympathy data receiving unit receives sympathy data further including data indicating any of a plurality (networking system, data processing system, data processing system having one) of options prepared in advance as a viewpoint about the opinion selected by the user , The co-sensitivity holding unit holds the co-sensitivity data table as a data table in which the co-sensitivity for another user for each of a plurality of viewpoints is associated , When the sympathy data is received , the sympathy update unit updates the sympathy for the extracted user of the user who transmitted the sympathy data related to the viewpoint specified in the sympathy data , 4 . The user selection unit according to claim 1 , wherein , when any viewpoint is designated in the posting request for posting data , the user selecting section selects a user according to the co-sensitivity regarding the designated viewpoint . The posting processing apparatus described . JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 4 . The poll-based networking system (保持部と, apparatus, plurality) as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users (other users) as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2008090560A CLAIM 2 ユーザのクライアント端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . JP2008090560A CLAIM 4 前記共感データ受信部は、ユーザが選択した見解についての見地として、あらかじめ用意された複数の選択肢のうちのいずれかを示すデータを更に含む共感データを受信し、 前記共感度保持部は、複数の見地のそれぞれについて、あるユーザの他のユーザに対する共感度を対応付けたデータテーブルとして前記共感度データテーブルを保持し、 前記共感度更新部は、共感データが受信されたとき、共感データに指定された見地に関する共感データの送信元のユーザの前記抽出されたユーザに対する共感度を更新し、 前記ユーザ選定部は、投稿データの閲覧要求に際していずれかの見地が指定されたときには、指定された見地に関する共感度に応じてユーザを選定することを特徴とする請求項１から３のいずれかに記載の投稿処理装置。 The sympathy data receiving unit receives sympathy data further including data indicating any of a plurality (networking system, data processing system, data processing system having one) of options prepared in advance as a viewpoint about the opinion selected by the user , The co-sensitivity holding unit holds the co-sensitivity data table as a data table in which the co-sensitivity for another user for each of a plurality of viewpoints is associated , When the sympathy data is received , the sympathy update unit updates the sympathy for the extracted user of the user who transmitted the sympathy data related to the viewpoint specified in the sympathy data , 4 . The user selection unit according to claim 1 , wherein , when any viewpoint is designated in the posting request for posting data , the user selecting section selects a user according to the co-sensitivity regarding the designated viewpoint . The posting processing apparatus described . JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 5 . The poll-based networking system (保持部と, apparatus, plurality) as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users (other users) ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2008090560A CLAIM 2 ユーザのクライアント端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . JP2008090560A CLAIM 4 前記共感データ受信部は、ユーザが選択した見解についての見地として、あらかじめ用意された複数の選択肢のうちのいずれかを示すデータを更に含む共感データを受信し、 前記共感度保持部は、複数の見地のそれぞれについて、あるユーザの他のユーザに対する共感度を対応付けたデータテーブルとして前記共感度データテーブルを保持し、 前記共感度更新部は、共感データが受信されたとき、共感データに指定された見地に関する共感データの送信元のユーザの前記抽出されたユーザに対する共感度を更新し、 前記ユーザ選定部は、投稿データの閲覧要求に際していずれかの見地が指定されたときには、指定された見地に関する共感度に応じてユーザを選定することを特徴とする請求項１から３のいずれかに記載の投稿処理装置。 The sympathy data receiving unit receives sympathy data further including data indicating any of a plurality (networking system, data processing system, data processing system having one) of options prepared in advance as a viewpoint about the opinion selected by the user , The co-sensitivity holding unit holds the co-sensitivity data table as a data table in which the co-sensitivity for another user for each of a plurality of viewpoints is associated , When the sympathy data is received , the sympathy update unit updates the sympathy for the extracted user of the user who transmitted the sympathy data related to the viewpoint specified in the sympathy data , 4 . The user selection unit according to claim 1 , wherein , when any viewpoint is designated in the posting request for posting data , the user selecting section selects a user according to the co-sensitivity regarding the designated viewpoint . The posting processing apparatus described . JP2008090560A CLAIM 5 クライアント端末から第１のコマンドを受信するコマンド受信部を更に備え、 第１のユーザと見解の傾向が近い第２のユーザの第３のユーザに対する共感度が設定されている状況において、 前記ユーザ選定部は、前記第１ (minimum match percentage) のユーザから前記第１のコマンドが受信されたとき、前記共感度データテーブルを参照し、前記第１のユーザからみた共感度に応じて、前記第１のユーザと見解の傾向が近い前記第２のユーザを選定し、 前記共感度更新部は、前記第２のユーザの前記第３のユーザに対する共感度と、前記第１のユーザの前記第２のユーザに対する共感度に応じて、前記第１のユーザの前記第３のユーザに対する共感度を更新することを特徴とする請求項１から４のいずれかに記載の投稿処理装置。 A command receiving unit for receiving a first command from the client terminal ; In the situation where the co-sensitivity for the third user of the second user who is close to the first user in view is set , When the first command is received from the first user , the user selection unit refers to the co-sensitivity data table and determines the first user according to the co-sensitivity viewed from the first user . And select the second user who has a close tendency to view , The co-sensitivity updating unit is configured to determine the third user' ; s third sensitivity according to the second user' ; s co-sensitivity with respect to the third user and the first user with respect to the second user . The post-processing apparatus according to claim 1 , wherein the co-sensitivity for the user is updated . JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 6 . The poll-based networking system (保持部と, apparatus, plurality) as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (クライアント) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (クライアント) being assigned a distinct subset of the other users (other users) , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2008090560A CLAIM 2 ユーザのクライアント (web server, match server) 端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . JP2008090560A CLAIM 4 前記共感データ受信部は、ユーザが選択した見解についての見地として、あらかじめ用意された複数の選択肢のうちのいずれかを示すデータを更に含む共感データを受信し、 前記共感度保持部は、複数の見地のそれぞれについて、あるユーザの他のユーザに対する共感度を対応付けたデータテーブルとして前記共感度データテーブルを保持し、 前記共感度更新部は、共感データが受信されたとき、共感データに指定された見地に関する共感データの送信元のユーザの前記抽出されたユーザに対する共感度を更新し、 前記ユーザ選定部は、投稿データの閲覧要求に際していずれかの見地が指定されたときには、指定された見地に関する共感度に応じてユーザを選定することを特徴とする請求項１から３のいずれかに記載の投稿処理装置。 The sympathy data receiving unit receives sympathy data further including data indicating any of a plurality (networking system, data processing system, data processing system having one) of options prepared in advance as a viewpoint about the opinion selected by the user , The co-sensitivity holding unit holds the co-sensitivity data table as a data table in which the co-sensitivity for another user for each of a plurality of viewpoints is associated , When the sympathy data is received , the sympathy update unit updates the sympathy for the extracted user of the user who transmitted the sympathy data related to the viewpoint specified in the sympathy data , 4 . The user selection unit according to claim 1 , wherein , when any viewpoint is designated in the posting request for posting data , the user selecting section selects a user according to the co-sensitivity regarding the designated viewpoint . The posting processing apparatus described . JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 7 . The poll-based networking system (保持部と, apparatus, plurality) as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (クライアント) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2008090560A CLAIM 2 ユーザのクライアント (web server, match server) 端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . JP2008090560A CLAIM 4 前記共感データ受信部は、ユーザが選択した見解についての見地として、あらかじめ用意された複数の選択肢のうちのいずれかを示すデータを更に含む共感データを受信し、 前記共感度保持部は、複数の見地のそれぞれについて、あるユーザの他のユーザに対する共感度を対応付けたデータテーブルとして前記共感度データテーブルを保持し、 前記共感度更新部は、共感データが受信されたとき、共感データに指定された見地に関する共感データの送信元のユーザの前記抽出されたユーザに対する共感度を更新し、 前記ユーザ選定部は、投稿データの閲覧要求に際していずれかの見地が指定されたときには、指定された見地に関する共感度に応じてユーザを選定することを特徴とする請求項１から３のいずれかに記載の投稿処理装置。 The sympathy data receiving unit receives sympathy data further including data indicating any of a plurality (networking system, data processing system, data processing system having one) of options prepared in advance as a viewpoint about the opinion selected by the user , The co-sensitivity holding unit holds the co-sensitivity data table as a data table in which the co-sensitivity for another user for each of a plurality of viewpoints is associated , When the sympathy data is received , the sympathy update unit updates the sympathy for the extracted user of the user who transmitted the sympathy data related to the viewpoint specified in the sympathy data , 4 . The user selection unit according to claim 1 , wherein , when any viewpoint is designated in the posting request for posting data , the user selecting section selects a user according to the co-sensitivity regarding the designated viewpoint . The posting processing apparatus described . |
| US9087321B2 CLAIM 8 . The poll-based networking system (保持部と, apparatus, plurality) as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (クライアント) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (クライアント) being assigned a distinct subset of the other users (other users) , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2008090560A CLAIM 2 ユーザのクライアント (web server, match server) 端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . JP2008090560A CLAIM 4 前記共感データ受信部は、ユーザが選択した見解についての見地として、あらかじめ用意された複数の選択肢のうちのいずれかを示すデータを更に含む共感データを受信し、 前記共感度保持部は、複数の見地のそれぞれについて、あるユーザの他のユーザに対する共感度を対応付けたデータテーブルとして前記共感度データテーブルを保持し、 前記共感度更新部は、共感データが受信されたとき、共感データに指定された見地に関する共感データの送信元のユーザの前記抽出されたユーザに対する共感度を更新し、 前記ユーザ選定部は、投稿データの閲覧要求に際していずれかの見地が指定されたときには、指定された見地に関する共感度に応じてユーザを選定することを特徴とする請求項１から３のいずれかに記載の投稿処理装置。 The sympathy data receiving unit receives sympathy data further including data indicating any of a plurality (networking system, data processing system, data processing system having one) of options prepared in advance as a viewpoint about the opinion selected by the user , The co-sensitivity holding unit holds the co-sensitivity data table as a data table in which the co-sensitivity for another user for each of a plurality of viewpoints is associated , When the sympathy data is received , the sympathy update unit updates the sympathy for the extracted user of the user who transmitted the sympathy data related to the viewpoint specified in the sympathy data , 4 . The user selection unit according to claim 1 , wherein , when any viewpoint is designated in the posting request for posting data , the user selecting section selects a user according to the co-sensitivity regarding the designated viewpoint . The posting processing apparatus described . JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 9 . The poll-based networking system (保持部と, apparatus, plurality) as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (クライアント) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2008090560A CLAIM 2 ユーザのクライアント (web server, match server) 端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . JP2008090560A CLAIM 4 前記共感データ受信部は、ユーザが選択した見解についての見地として、あらかじめ用意された複数の選択肢のうちのいずれかを示すデータを更に含む共感データを受信し、 前記共感度保持部は、複数の見地のそれぞれについて、あるユーザの他のユーザに対する共感度を対応付けたデータテーブルとして前記共感度データテーブルを保持し、 前記共感度更新部は、共感データが受信されたとき、共感データに指定された見地に関する共感データの送信元のユーザの前記抽出されたユーザに対する共感度を更新し、 前記ユーザ選定部は、投稿データの閲覧要求に際していずれかの見地が指定されたときには、指定された見地に関する共感度に応じてユーザを選定することを特徴とする請求項１から３のいずれかに記載の投稿処理装置。 The sympathy data receiving unit receives sympathy data further including data indicating any of a plurality (networking system, data processing system, data processing system having one) of options prepared in advance as a viewpoint about the opinion selected by the user , The co-sensitivity holding unit holds the co-sensitivity data table as a data table in which the co-sensitivity for another user for each of a plurality of viewpoints is associated , When the sympathy data is received , the sympathy update unit updates the sympathy for the extracted user of the user who transmitted the sympathy data related to the viewpoint specified in the sympathy data , 4 . The user selection unit according to claim 1 , wherein , when any viewpoint is designated in the posting request for posting data , the user selecting section selects a user according to the co-sensitivity regarding the designated viewpoint . The posting processing apparatus described . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (前記コマンド) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (データ送) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users (other users) , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2008090560A CLAIM 6 前記コマンド (executable instruction) 受信部は、クライアント端末から第２のコマンドを受信し、 前記共感度更新部は、前記第２のコマンドが受信されたとき、前記第２のコマンドの送信元のユーザが過去に送信した共感データに適合する見解を、その共感データの受信後に示したユーザを抽出し、前記第２のコマンドを送信したユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項５に記載の投稿処理装置。 The command receiving unit receives a second command from the client terminal , When the second command is received , the empathy update unit is a user who indicates an opinion that matches the empathy data transmitted in the past by the user who transmitted the second command after receiving the empathy data . The post processing apparatus according to claim 5 , wherein the co-sensitivity of the user who transmitted the second command to the extracted user is updated . JP2008090560A CLAIM 7 第１のユーザからの共感度が所定値以上のユーザ群が、複数種類の見解を示している投稿データを抽出し、第１のユーザのクライアント端末に送信する投稿データ送 (receiving user information) 信部を更に備え、 前記共感データ受信部は、抽出された投稿データに対する複数種類の見解に対して、第１のユーザが共感できる度合いを示す共感データをクライアント端末から受信し、 前記共感度更新部は、共感データが受信されたとき、前記見解データテーブルを参照し、共感データに指定された見解を示したユーザを抽出し、第１のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１から６のいずれかに記載の投稿処理装置。 A group of users whose co-sensitivity from the first user is equal to or greater than a predetermined value further includes a post data transmission unit that extracts post data indicating a plurality of types of views and transmits the post data to the client terminal of the first user ; The sympathy data receiving unit receives sympathy data indicating the degree to which the first user can sympathize with a plurality of types of views on the extracted post data from the client terminal , When the sympathy data is received , the sympathy update unit refers to the opinion data table , extracts a user who indicates the opinion specified in the sympathy data , and sympathizes with the extracted user of the first user The post processing apparatus according to claim 1 , wherein the degree is updated . JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users (other users) to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (するとき) . |
JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 12 . The computer implemented method as set forth in claim 11 , wherein , in cumulatively comparing , further comprising an act of causing the one or more processors to perform operations of : matching the user to other users (other users) based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users (other users) as a match percentage , further comprising an act of causing the one or more processors to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users (other users) ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2008090560A CLAIM 5 クライアント端末から第１のコマンドを受信するコマンド受信部を更に備え、 第１のユーザと見解の傾向が近い第２のユーザの第３のユーザに対する共感度が設定されている状況において、 前記ユーザ選定部は、前記第１ (minimum match percentage) のユーザから前記第１のコマンドが受信されたとき、前記共感度データテーブルを参照し、前記第１のユーザからみた共感度に応じて、前記第１のユーザと見解の傾向が近い前記第２のユーザを選定し、 前記共感度更新部は、前記第２のユーザの前記第３のユーザに対する共感度と、前記第１のユーザの前記第２のユーザに対する共感度に応じて、前記第１のユーザの前記第３のユーザに対する共感度を更新することを特徴とする請求項１から４のいずれかに記載の投稿処理装置。 A command receiving unit for receiving a first command from the client terminal ; In the situation where the co-sensitivity for the third user of the second user who is close to the first user in view is set , When the first command is received from the first user , the user selection unit refers to the co-sensitivity data table and determines the first user according to the co-sensitivity viewed from the first user . And select the second user who has a close tendency to view , The co-sensitivity updating unit is configured to determine the third user' ; s third sensitivity according to the second user' ; s co-sensitivity with respect to the third user and the first user with respect to the second user . The post-processing apparatus according to claim 1 , wherein the co-sensitivity for the user is updated . JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (クライアント) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (クライアント) being assigned a distinct subset of the other users (other users) , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2008090560A CLAIM 2 ユーザのクライアント (web server, match server) 端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (クライアント) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2008090560A CLAIM 2 ユーザのクライアント (web server, match server) 端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (クライアント) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (クライアント) being assigned a distinct subset of the other users (other users) , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2008090560A CLAIM 2 ユーザのクライアント (web server, match server) 端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (クライアント) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2008090560A CLAIM 2 ユーザのクライアント (web server, match server) 端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (データ送) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users (other users) , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2008090560A CLAIM 7 第１のユーザからの共感度が所定値以上のユーザ群が、複数種類の見解を示している投稿データを抽出し、第１のユーザのクライアント端末に送信する投稿データ送 (receiving user information) 信部を更に備え、 前記共感データ受信部は、抽出された投稿データに対する複数種類の見解に対して、第１のユーザが共感できる度合いを示す共感データをクライアント端末から受信し、 前記共感度更新部は、共感データが受信されたとき、前記見解データテーブルを参照し、共感データに指定された見解を示したユーザを抽出し、第１のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１から６のいずれかに記載の投稿処理装置。 A group of users whose co-sensitivity from the first user is equal to or greater than a predetermined value further includes a post data transmission unit that extracts post data indicating a plurality of types of views and transmits the post data to the client terminal of the first user ; The sympathy data receiving unit receives sympathy data indicating the degree to which the first user can sympathize with a plurality of types of views on the extracted post data from the client terminal , When the sympathy data is received , the sympathy update unit refers to the opinion data table , extracts a user who indicates the opinion specified in the sympathy data , and sympathizes with the extracted user of the first user The post processing apparatus according to claim 1 , wherein the degree is updated . JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users (other users) to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (するとき) . |
JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users (other users) based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users (other users) ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2008090560A CLAIM 5 クライアント端末から第１のコマンドを受信するコマンド受信部を更に備え、 第１のユーザと見解の傾向が近い第２のユーザの第３のユーザに対する共感度が設定されている状況において、 前記ユーザ選定部は、前記第１ (minimum match percentage) のユーザから前記第１のコマンドが受信されたとき、前記共感度データテーブルを参照し、前記第１のユーザからみた共感度に応じて、前記第１のユーザと見解の傾向が近い前記第２のユーザを選定し、 前記共感度更新部は、前記第２のユーザの前記第３のユーザに対する共感度と、前記第１のユーザの前記第２のユーザに対する共感度に応じて、前記第１のユーザの前記第３のユーザに対する共感度を更新することを特徴とする請求項１から４のいずれかに記載の投稿処理装置。 A command receiving unit for receiving a first command from the client terminal ; In the situation where the co-sensitivity for the third user of the second user who is close to the first user in view is set , When the first command is received from the first user , the user selection unit refers to the co-sensitivity data table and determines the first user according to the co-sensitivity viewed from the first user . And select the second user who has a close tendency to view , The co-sensitivity updating unit is configured to determine the third user' ; s third sensitivity according to the second user' ; s co-sensitivity with respect to the third user and the first user with respect to the second user . The post-processing apparatus according to claim 1 , wherein the co-sensitivity for the user is updated . JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (クライアント) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (クライアント) being assigned a distinct subset of the other users (other users) , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2008090560A CLAIM 2 ユーザのクライアント (web server, match server) 端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (クライアント) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2008090560A CLAIM 2 ユーザのクライアント (web server, match server) 端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (クライアント) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (クライアント) being assigned a distinct subset of the other users (other users) , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2008090560A CLAIM 2 ユーザのクライアント (web server, match server) 端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . JP2008090560A CLAIM 8 それぞれのユーザが選択した投稿データに対する見解、ユーザにより見解に対して示された共感できる度合い、および、あるユーザの他のユーザに対する共感度を電子的な公開の対象としないことを特徴とする請求項１から７のいずれかに記載の投稿処理装置。 The opinion on the post data selected by each user , the degree of empathy indicated by the user with respect to the opinion , and the co-sensitivity of a certain user to other users (other users) are not subject to electronic disclosure . Item 9 . The post processing device according to any one of Items 1 to 7 . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (クライアント) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2008090560A CLAIM 2 ユーザのクライアント (web server, match server) 端末から、内容に対するそのユーザの見解と表示方法が適合していない投稿データを示す不適合表示データを受信する不適合データ受信部を更に備え、 前記共感度更新部は、前記不適合表示データが受信されたとき、前記見解データテーブルを参照し、前記不適合表示データに示された投稿データについて、その投稿データの表示方法に適合する見解を示したユーザを抽出し、前記不適合表示データの送信元のユーザの前記抽出されたユーザに対する共感度を更新することを特徴とする請求項１に記載の投稿処理装置。 A non-conforming data receiving unit for receiving non-conforming display data indicating post data in which the user' ; s view on the content and the display method are not compatible from the user' ; s client terminal ; The co-sensitivity updating unit refers to the opinion data table when the nonconforming display data is received , and indicates an opinion that conforms to a display method of the post data for the post data indicated in the nonconforming display data . The posting processing apparatus according to claim 1 , wherein a user is extracted , and the co-sensitivity of the user who has transmitted the nonconforming display data with respect to the extracted user is updated . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20080065481A1 Filed: 2006-09-13 Issued: 2008-03-13 User-associated, interactive advertising monetization (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Nicole S. Immorlica, Kamal Jain, Jennifer T. Chayes, Christian H. Borgs, Mohammad Mahdian |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (user information) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20080065481A1 CLAIM 1 . A method for placing advertisements in a platform , comprising : obtaining user information (user information) and available advertisement locations from a networked platform ; and dynamically auctioning the available platform advertisement locations to potential advertisers based on a possible association with a particular user of the platform . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080065481A1 CLAIM 19 . A computer readable medium (match server) having stored thereon computer executable components of the system of claim 12 . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080065481A1 CLAIM 19 . A computer readable medium (match server) having stored thereon computer executable components of the system of claim 12 . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080065481A1 CLAIM 19 . A computer readable medium (match server) having stored thereon computer executable components of the system of claim 12 . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080065481A1 CLAIM 19 . A computer readable medium (match server) having stored thereon computer executable components of the system of claim 12 . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (user information) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20080065481A1 CLAIM 1 . A method for placing advertisements in a platform , comprising : obtaining user information (user information) and available advertisement locations from a networked platform ; and dynamically auctioning the available platform advertisement locations to potential advertisers based on a possible association with a particular user of the platform . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080065481A1 CLAIM 19 . A computer readable medium (match server) having stored thereon computer executable components of the system of claim 12 . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080065481A1 CLAIM 19 . A computer readable medium (match server) having stored thereon computer executable components of the system of claim 12 . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080065481A1 CLAIM 19 . A computer readable medium (match server) having stored thereon computer executable components of the system of claim 12 . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080065481A1 CLAIM 19 . A computer readable medium (match server) having stored thereon computer executable components of the system of claim 12 . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (user information) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20080065481A1 CLAIM 1 . A method for placing advertisements in a platform , comprising : obtaining user information (user information) and available advertisement locations from a networked platform ; and dynamically auctioning the available platform advertisement locations to potential advertisers based on a possible association with a particular user of the platform . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080065481A1 CLAIM 19 . A computer readable medium (match server) having stored thereon computer executable components of the system of claim 12 . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080065481A1 CLAIM 19 . A computer readable medium (match server) having stored thereon computer executable components of the system of claim 12 . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080065481A1 CLAIM 19 . A computer readable medium (match server) having stored thereon computer executable components of the system of claim 12 . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080065481A1 CLAIM 19 . A computer readable medium (match server) having stored thereon computer executable components of the system of claim 12 . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2007334502A Filed: 2006-06-13 Issued: 2007-12-27 Search device, method and program (Original Assignee) Fujifilm Corp; 富士フイルム株式会社 Arihito Asai, 有人 浅井 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (コンピュ) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (calculation) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation (receiving user information) unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : JP2007334502A CLAIM 10 請求項８または９に記載の検索方法をコンピュ (next polling, data processing system, next polling questions) ータに実行させるプログラム。 The program which makes a computer perform the search method of Claim 8 or 9 . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers (ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : JP2007334502A CLAIM 10 請求項８または９に記載の検索方法をコンピュ (next polling, data processing system, next polling questions) ータに実行させるプログラム。 The program which makes a computer perform the search method of Claim 8 or 9 . |
| US9087321B2 CLAIM 3 . The poll-based networking system as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers (ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 4 . The poll-based networking system as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザが任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１ (minimum match percentage) のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (calculation) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation (receiving user information) unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers (ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : JP2007334502A CLAIM 10 請求項８または９に記載の検索方法をコンピュ (next polling, data processing system, next polling questions) ータに実行させるプログラム。 The program which makes a computer perform the search method of Claim 8 or 9 . |
| US9087321B2 CLAIM 12 . The computer implemented method as set forth in claim 11 , wherein , in cumulatively comparing , further comprising an act of causing the one or more processors to perform operations of : matching the user to other users based upon all of the selected answers (ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , further comprising an act of causing the one or more processors to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザが任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１ (minimum match percentage) のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (calculation) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation (receiving user information) unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers (ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : JP2007334502A CLAIM 10 請求項８または９に記載の検索方法をコンピュ (next polling, data processing system, next polling questions) ータに実行させるプログラム。 The program which makes a computer perform the search method of Claim 8 or 9 . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers (ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2007334502A CLAIM 1 ネットワーク上で公開される日記形式の文書を含むウェブページであるウェブログのうち、ユーザ (selected answers) が任意に指定した第１のウェブログの文章を取得する第１文章取得部と、 前記ウェブログの文書に表現されている関心事を判断する基準となるキーワードを蓄積するキーワード蓄積部と、 前記ユーザの指定していない不特定の第２のウェブログの文書を取得する第２文書取得部と、 前記キーワード蓄積部の蓄積しているキーワードに基づいて、前記第１のウェブログの文書に表現されている関心事である第１の関心事および前記第２のウェブログの文書に表現されている関心事である第２の関心事をそれぞれ抽出する関心事抽出部と、 前記関心事抽出部の抽出した第２の関心事を前記第２のウェブログの公開元のアドレスと対応づけて記憶する関心事記憶部と、 前記関心事抽出部の抽出した第１の関心事と前記第２の関心事との類似の度合を算出する類似度算出部と、 前記第１の関心事と前記第２の関心事との類似の度合に従い、前記関心事記憶部から前記第２のウェブログの公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 A first sentence acquisition unit that acquires a sentence of a first weblog arbitrarily designated by a user among web logs that are web pages including a diary document published on a network ; A keyword accumulating unit for accumulating a keyword serving as a reference for judging the interest expressed in the weblog document ; A second document acquisition unit that acquires an unspecified second weblog document not designated by the user ; Based on the keywords stored in the keyword storage unit , it is expressed in the first interest and the second weblog document that are the interest expressed in the first weblog document . An interest extraction unit that extracts each of the second interests that are of interest ; An interest storage unit that stores the second interest extracted by the interest extraction unit in association with the address of the publishing source of the second weblog , A similarity calculation unit that calculates the degree of similarity between the first interest extracted by the interest extraction unit and the second interest ; An address extracting unit that extracts an address of a publishing source of the second weblog from the interest storage unit according to the degree of similarity between the first interest and the second interest ; A search device comprising : |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2007334502A CLAIM 3 前記第１ (minimum match percentage) のウェブログに、前記アドレス抽出部の抽出したアドレスへのアクセス情報を埋め込んだリンク情報を付加するリンク情報付加部をさらに備える請求項１または２に記載の検索装置。 The search device according to claim 1 , further comprising a link information adding unit that adds link information in which access information to the address extracted by the address extracting unit is embedded in the first web log . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007334502A CLAIM 4 ユーザ (selected answers) が任意に指定した第１の画像を取得する取得部と、 前記ユーザの指定していない不特定の第２の画像および前記画像の公開元のアドレスを蓄積する蓄積部と、 前記第１の画像および第２の画像から画像の属性をそれぞれ抽出する属性抽出部と、 前記第１の画像の属性と前記第２の画像の属性との類似の度合に従い、前記蓄積部から前記第２の画像の公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 An acquisition unit for acquiring a first image arbitrarily designated by the user ; An accumulating unit that accumulates an unspecified second image not designated by the user and an address of a publishing source of the image ; An attribute extraction unit for extracting image attributes from the first image and the second image ; An address extraction unit that extracts an address of the publication source of the second image from the storage unit according to the degree of similarity between the attribute of the first image and the attribute of the second image ; A search device comprising : |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007334502A CLAIM 4 ユーザ (selected answers) が任意に指定した第１の画像を取得する取得部と、 前記ユーザの指定していない不特定の第２の画像および前記画像の公開元のアドレスを蓄積する蓄積部と、 前記第１の画像および第２の画像から画像の属性をそれぞれ抽出する属性抽出部と、 前記第１の画像の属性と前記第２の画像の属性との類似の度合に従い、前記蓄積部から前記第２の画像の公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 An acquisition unit for acquiring a first image arbitrarily designated by the user ; An accumulating unit that accumulates an unspecified second image not designated by the user and an address of a publishing source of the image ; An attribute extraction unit for extracting image attributes from the first image and the second image ; An address extraction unit that extracts an address of the publication source of the second image from the storage unit according to the degree of similarity between the attribute of the first image and the attribute of the second image ; A search device comprising : |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007334502A CLAIM 4 ユーザ (selected answers) が任意に指定した第１の画像を取得する取得部と、 前記ユーザの指定していない不特定の第２の画像および前記画像の公開元のアドレスを蓄積する蓄積部と、 前記第１の画像および第２の画像から画像の属性をそれぞれ抽出する属性抽出部と、 前記第１の画像の属性と前記第２の画像の属性との類似の度合に従い、前記蓄積部から前記第２の画像の公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 An acquisition unit for acquiring a first image arbitrarily designated by the user ; An accumulating unit that accumulates an unspecified second image not designated by the user and an address of a publishing source of the image ; An attribute extraction unit for extracting image attributes from the first image and the second image ; An address extraction unit that extracts an address of the publication source of the second image from the storage unit according to the degree of similarity between the attribute of the first image and the attribute of the second image ; A search device comprising : |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007334502A CLAIM 4 ユーザ (selected answers) が任意に指定した第１の画像を取得する取得部と、 前記ユーザの指定していない不特定の第２の画像および前記画像の公開元のアドレスを蓄積する蓄積部と、 前記第１の画像および第２の画像から画像の属性をそれぞれ抽出する属性抽出部と、 前記第１の画像の属性と前記第２の画像の属性との類似の度合に従い、前記蓄積部から前記第２の画像の公開元のアドレスを抽出するアドレス抽出部と、 を備える検索装置。 An acquisition unit for acquiring a first image arbitrarily designated by the user ; An accumulating unit that accumulates an unspecified second image not designated by the user and an address of a publishing source of the image ; An attribute extraction unit for extracting image attributes from the first image and the second image ; An address extraction unit that extracts an address of the publication source of the second image from the storage unit according to the degree of similarity between the attribute of the first image and the attribute of the second image ; A search device comprising : |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2007323561A Filed: 2006-06-05 Issued: 2007-12-13 Document collaboration history management system, mail system, and document collaboration history management method (Original Assignee) Nec Corp; 日本電気株式会社 Rina Nobuto, Takahiro Oyadomari, Hidekazu Sakagami, Motohiko Sakaguchi, 秀和 坂上, 基彦 坂口, 里奈 延藤, 貴広 親泊 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (コンピュ) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (References) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007323561A CLAIM 6 請求項３乃至５の何れか１項に記載の文書のコラボレーション履歴管理システムにおいて、 前記メール登録手段が、 前記ユーザ端末から送られてきた電子メールのメッセージ識別子および前記電子メールのIn-Reply-Toヘッダ或いはReferences (user information) ヘッダから得られるメッセージ識別子を含むコラボレーション関連情報を前記コラボレーション情報管理システムに送信する構成を有することを特徴とする文書のコラボレーション履歴管理システム。 The document collaboration history management system according to any one of claims 3 to 5 , The email registration means A configuration in which collaboration related information including a message identifier of an email sent from the user terminal and a message identifier obtained from an In-Reply-To header or a References header of the email is transmitted to the collaboration information management system ; Document history management system for documents . JP2007323561A CLAIM 22 コンピュ (next polling, data processing system, next polling questions) ータを、 ユーザ端末から電子メールが送られてきたとき、前記電子メールのメール本文に記載されている文書識別子および前記電子メールのメッセージ識別子を含むコラボレーション関連情報と、前記メッセージ識別子および前記メール本文を含むコラボレーション情報とをコラボレーション情報管理システムに対して送信する構成と、文書管理システムに未登録の文書が前記電子メールに添付されている場合に、前記文書を前記文書管理システムに対して送信する構成と、前記文書に割り振られた文書識別子および前記メッセージ識別子を含むコラボレーション関連情報を前記コラボレーション情報管理システムに対して送信する構成とを有するメール登録手段として機能させるためのプログラム。 Computer When an e-mail is sent from the user terminal , collaboration related information including the document identifier described in the e-mail body of the e-mail and the message identifier of the e-mail , and collaboration information including the message identifier and the e-mail body A configuration for transmitting the document to the collaboration information management system , a configuration for transmitting the document to the document management system when an unregistered document is attached to the e-mail , and A program for functioning as mail registration means having a configuration for transmitting collaboration-related information including a document identifier assigned to a document and the message identifier to the collaboration information management system . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2007323561A CLAIM 22 コンピュ (next polling, data processing system, next polling questions) ータを、 ユーザ端末から電子メールが送られてきたとき、前記電子メールのメール本文に記載されている文書識別子および前記電子メールのメッセージ識別子を含むコラボレーション関連情報と、前記メッセージ識別子および前記メール本文を含むコラボレーション情報とをコラボレーション情報管理システムに対して送信する構成と、文書管理システムに未登録の文書が前記電子メールに添付されている場合に、前記文書を前記文書管理システムに対して送信する構成と、前記文書に割り振られた文書識別子および前記メッセージ識別子を含むコラボレーション関連情報を前記コラボレーション情報管理システムに対して送信する構成とを有するメール登録手段として機能させるためのプログラム。 Computer When an e-mail is sent from the user terminal , collaboration related information including the document identifier described in the e-mail body of the e-mail and the message identifier of the e-mail , and collaboration information including the message identifier and the e-mail body A configuration for transmitting the document to the collaboration information management system , a configuration for transmitting the document to the document management system when an unregistered document is attached to the e-mail , and A program for functioning as mail registration means having a configuration for transmitting collaboration-related information including a document identifier assigned to a document and the message identifier to the collaboration information management system . |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2007323561A CLAIM 2 請求項１記載の文書のコラボレーション履歴管理システムにおいて、 自システム内に存在する文書の文書識別子を管理する第２の手段を備え、且つ、 前記第１ (minimum match percentage) の手段が、 前記電子メッセージに含まれている文書識別子の文書が自システム内に存在するか否かを前記第２の手段に対して問い合わせ、存在することを確認した場合に限り、前記抽出した文書識別子と前記電子メッセージとを関連付けて管理する構成を有することを特徴とする文書のコラボレーション履歴管理システム。 The document collaboration history management system according to claim 1 , A second means for managing a document identifier of a document existing in the own system ; and The first means comprises : Only when the second means is inquired whether or not the document with the document identifier included in the electronic message exists in its own system and it is confirmed that the document exists , the extracted document identifier and the document A document collaboration history management system characterized by having a configuration for managing electronic messages in association with each other . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (信手段) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (References) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007323561A CLAIM 5 請求項４記載の文書のコラボレーション履歴管理システムにおいて、 前記メール登録手段が、 前記文書管理システムに未登録の文書を添付していた電子メールのメール本文に、前記文書に割り振られた文書識別子を記載すると共に、前記文書の属性情報に前記文書識別子を記載する構成を有し、且つ、 前記メールシステムが、 前記メール登録手段において文書識別子が記載された電子メールを、送信先に送信するメール送受信手段 (executable instruction, computer executable instruction) を備えたことを特徴とする文書のコラボレーション履歴管理システム。 In the document collaboration history management system according to claim 4 , The email registration means The document identifier assigned to the document is described in a mail body of an e-mail attached with an unregistered document in the document management system , and the document identifier is described in attribute information of the document . , and , The mail system is A document collaboration history management system , comprising : a mail transmission / reception unit that transmits an electronic mail in which a document identifier is described in the mail registration unit to a transmission destination . JP2007323561A CLAIM 6 請求項３乃至５の何れか１項に記載の文書のコラボレーション履歴管理システムにおいて、 前記メール登録手段が、 前記ユーザ端末から送られてきた電子メールのメッセージ識別子および前記電子メールのIn-Reply-Toヘッダ或いはReferences (user information) ヘッダから得られるメッセージ識別子を含むコラボレーション関連情報を前記コラボレーション情報管理システムに送信する構成を有することを特徴とする文書のコラボレーション履歴管理システム。 The document collaboration history management system according to any one of claims 3 to 5 , The email registration means A configuration in which collaboration related information including a message identifier of an email sent from the user terminal and a message identifier obtained from an In-Reply-To header or a References header of the email is transmitted to the collaboration information management system ; Document history management system for documents . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2007323561A CLAIM 22 コンピュ (next polling, data processing system, next polling questions) ータを、 ユーザ端末から電子メールが送られてきたとき、前記電子メールのメール本文に記載されている文書識別子および前記電子メールのメッセージ識別子を含むコラボレーション関連情報と、前記メッセージ識別子および前記メール本文を含むコラボレーション情報とをコラボレーション情報管理システムに対して送信する構成と、文書管理システムに未登録の文書が前記電子メールに添付されている場合に、前記文書を前記文書管理システムに対して送信する構成と、前記文書に割り振られた文書識別子および前記メッセージ識別子を含むコラボレーション関連情報を前記コラボレーション情報管理システムに対して送信する構成とを有するメール登録手段として機能させるためのプログラム。 Computer When an e-mail is sent from the user terminal , collaboration related information including the document identifier described in the e-mail body of the e-mail and the message identifier of the e-mail , and collaboration information including the message identifier and the e-mail body A configuration for transmitting the document to the collaboration information management system , a configuration for transmitting the document to the document management system when an unregistered document is attached to the e-mail , and A program for functioning as mail registration means having a configuration for transmitting collaboration-related information including a document identifier assigned to a document and the message identifier to the collaboration information management system . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2007323561A CLAIM 2 請求項１記載の文書のコラボレーション履歴管理システムにおいて、 自システム内に存在する文書の文書識別子を管理する第２の手段を備え、且つ、 前記第１ (minimum match percentage) の手段が、 前記電子メッセージに含まれている文書識別子の文書が自システム内に存在するか否かを前記第２の手段に対して問い合わせ、存在することを確認した場合に限り、前記抽出した文書識別子と前記電子メッセージとを関連付けて管理する構成を有することを特徴とする文書のコラボレーション履歴管理システム。 The document collaboration history management system according to claim 1 , A second means for managing a document identifier of a document existing in the own system ; and The first means comprises : Only when the second means is inquired whether or not the document with the document identifier included in the electronic message exists in its own system and it is confirmed that the document exists , the extracted document identifier and the document A document collaboration history management system characterized by having a configuration for managing electronic messages in association with each other . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (References) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007323561A CLAIM 6 請求項３乃至５の何れか１項に記載の文書のコラボレーション履歴管理システムにおいて、 前記メール登録手段が、 前記ユーザ端末から送られてきた電子メールのメッセージ識別子および前記電子メールのIn-Reply-Toヘッダ或いはReferences (user information) ヘッダから得られるメッセージ識別子を含むコラボレーション関連情報を前記コラボレーション情報管理システムに送信する構成を有することを特徴とする文書のコラボレーション履歴管理システム。 The document collaboration history management system according to any one of claims 3 to 5 , The email registration means A configuration in which collaboration related information including a message identifier of an email sent from the user terminal and a message identifier obtained from an In-Reply-To header or a References header of the email is transmitted to the collaboration information management system ; Document history management system for documents . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2007323561A CLAIM 22 コンピュ (next polling, data processing system, next polling questions) ータを、 ユーザ端末から電子メールが送られてきたとき、前記電子メールのメール本文に記載されている文書識別子および前記電子メールのメッセージ識別子を含むコラボレーション関連情報と、前記メッセージ識別子および前記メール本文を含むコラボレーション情報とをコラボレーション情報管理システムに対して送信する構成と、文書管理システムに未登録の文書が前記電子メールに添付されている場合に、前記文書を前記文書管理システムに対して送信する構成と、前記文書に割り振られた文書識別子および前記メッセージ識別子を含むコラボレーション関連情報を前記コラボレーション情報管理システムに対して送信する構成とを有するメール登録手段として機能させるためのプログラム。 Computer When an e-mail is sent from the user terminal , collaboration related information including the document identifier described in the e-mail body of the e-mail and the message identifier of the e-mail , and collaboration information including the message identifier and the e-mail body A configuration for transmitting the document to the collaboration information management system , a configuration for transmitting the document to the document management system when an unregistered document is attached to the e-mail , and A program for functioning as mail registration means having a configuration for transmitting collaboration-related information including a document identifier assigned to a document and the message identifier to the collaboration information management system . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2007323561A CLAIM 2 請求項１記載の文書のコラボレーション履歴管理システムにおいて、 自システム内に存在する文書の文書識別子を管理する第２の手段を備え、且つ、 前記第１ (minimum match percentage) の手段が、 前記電子メッセージに含まれている文書識別子の文書が自システム内に存在するか否かを前記第２の手段に対して問い合わせ、存在することを確認した場合に限り、前記抽出した文書識別子と前記電子メッセージとを関連付けて管理する構成を有することを特徴とする文書のコラボレーション履歴管理システム。 The document collaboration history management system according to claim 1 , A second means for managing a document identifier of a document existing in the own system ; and The first means comprises : Only when the second means is inquired whether or not the document with the document identifier included in the electronic message exists in its own system and it is confirmed that the document exists , the extracted document identifier and the document A document collaboration history management system characterized by having a configuration for managing electronic messages in association with each other . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | CN101278257A Filed: 2006-04-11 Issued: 2008-10-01 用于分布式社区发现的方法和装置 (Original Assignee) 奈特希尔公司 A·芒茨, B·A·雷扎伊 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (包括接收, 接收消息) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
CN101278257A CLAIM 7、 如权利要求6所述的方法，其中所述开始步骤包括步骤：发 送来自节点集合的个体逾渗消息，并且将社区确定为连接的组成部分，包括接收 (receiving user information) 所发送的消息的节点，所发送的消息的社区大小不随着 逾渗概率的增加而增加。 CN101278257A CLAIM 20、 一种用于将链接的节点分组到社区中的计算机实现的方法，包括步骤：为每个链接指定权重； 为每个节点分配权重； 开始来自指定节点的逾渗消息；确定连接的组成部分包括重复接收消息 (receiving user information) 的节点；以及 将社区识别为集合，所述集合的大小不随着逾渗概率的增加而增加。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (包括接收, 接收消息) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
CN101278257A CLAIM 7、 如权利要求6所述的方法，其中所述开始步骤包括步骤：发 送来自节点集合的个体逾渗消息，并且将社区确定为连接的组成部分，包括接收 (receiving user information) 所发送的消息的节点，所发送的消息的社区大小不随着 逾渗概率的增加而增加。 CN101278257A CLAIM 20、 一种用于将链接的节点分组到社区中的计算机实现的方法，包括步骤：为每个链接指定权重； 为每个节点分配权重； 开始来自指定节点的逾渗消息；确定连接的组成部分包括重复接收消息 (receiving user information) 的节点；以及 将社区识别为集合，所述集合的大小不随着逾渗概率的增加而增加。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (包括接收, 接收消息) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
CN101278257A CLAIM 7、 如权利要求6所述的方法，其中所述开始步骤包括步骤：发 送来自节点集合的个体逾渗消息，并且将社区确定为连接的组成部分，包括接收 (receiving user information) 所发送的消息的节点，所发送的消息的社区大小不随着 逾渗概率的增加而增加。 CN101278257A CLAIM 20、 一种用于将链接的节点分组到社区中的计算机实现的方法，包括步骤：为每个链接指定权重； 为每个节点分配权重； 开始来自指定节点的逾渗消息；确定连接的组成部分包括重复接收消息 (receiving user information) 的节点；以及 将社区识别为集合，所述集合的大小不随着逾渗概率的增加而增加。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question (的强度) against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
CN101278257A CLAIM 3、 如权利要求1所述的方法，其中所述确定步骤包括步骤：对 所述节点属于社区的强度 (net polling question) 进行量化。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2007265282A Filed: 2006-03-29 Issued: 2007-10-11 情報検索システム、端末、サーバ、プログラム、及び記録媒体 (Original Assignee) Nec Corp; Nec Soft Ltd; Ｎｅｃソフト株式会社; 日本電気株式会社 Masahiro Inose, Teruyuki Nakajima, 晃之 中嶋, 正博 猪瀬 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (コンピュ) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer (登録者) for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 JP2007265282A CLAIM 12 セマンティックＷｅｂの概念を考慮し、提供情報に意味情報を付加する機構を備えた情報検索システムに用いられるサーバにおいて、データ (user information) ベースから投稿情報や企業、店舗、及びイベントからの配信情報を検索する検索手段と、 該データベースに投稿情報を登録する第１の登録手段と、 利用者間の友人関係情報を登録する第２の登録手段と、 利用者を承認する利用者承認手段とを備えたことを特徴とするサーバ。 JP2007265282A CLAIM 13 セマンティックＷｅｂの概念を考慮し、提供情報に意味情報を付加する機構を備えた情報検索システムのコンピュ (next polling, data processing system, next polling questions) ータが情報検索処理を実行させるプログラムにおいて、 前記コンピュータに、企業、店舗、及びイベントが配信する情報を検索する第１の検索処理を実行させることを特徴とするプログラム。 |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer (登録者) for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 JP2007265282A CLAIM 13 セマンティックＷｅｂの概念を考慮し、提供情報に意味情報を付加する機構を備えた情報検索システムのコンピュ (next polling, data processing system, next polling questions) ータが情報検索処理を実行させるプログラムにおいて、 前記コンピュータに、企業、店舗、及びイベントが配信する情報を検索する第１の検索処理を実行させることを特徴とするプログラム。 |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (スポット) of members that fall within the maximum and minimum match percentage . |
JP2007265282A CLAIM 5 検索対象情報範囲として現在地点、駅名、住所、スポット (maximum number) 名等の位置情報を検索対象として検索する第４の検索手段をさらに備えたことを特徴とする請求項１から４のいずれか１項記載の情報検索システム。 |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer (登録者) , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer (登録者) of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer (登録者) , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer (登録者) of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer (登録者) for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 JP2007265282A CLAIM 12 セマンティックＷｅｂの概念を考慮し、提供情報に意味情報を付加する機構を備えた情報検索システムに用いられるサーバにおいて、データ (user information) ベースから投稿情報や企業、店舗、及びイベントからの配信情報を検索する検索手段と、 該データベースに投稿情報を登録する第１の登録手段と、 利用者間の友人関係情報を登録する第２の登録手段と、 利用者を承認する利用者承認手段とを備えたことを特徴とするサーバ。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer (登録者) for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 JP2007265282A CLAIM 13 セマンティックＷｅｂの概念を考慮し、提供情報に意味情報を付加する機構を備えた情報検索システムのコンピュ (next polling, data processing system, next polling questions) ータが情報検索処理を実行させるプログラムにおいて、 前記コンピュータに、企業、店舗、及びイベントが配信する情報を検索する第１の検索処理を実行させることを特徴とするプログラム。 |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (スポット) of members that fall within the maximum and minimum match percentage . |
JP2007265282A CLAIM 5 検索対象情報範囲として現在地点、駅名、住所、スポット (maximum number) 名等の位置情報を検索対象として検索する第４の検索手段をさらに備えたことを特徴とする請求項１から４のいずれか１項記載の情報検索システム。 |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer (登録者) , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer (登録者) of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer (登録者) , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer (登録者) of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer (登録者) for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 JP2007265282A CLAIM 12 セマンティックＷｅｂの概念を考慮し、提供情報に意味情報を付加する機構を備えた情報検索システムに用いられるサーバにおいて、データ (user information) ベースから投稿情報や企業、店舗、及びイベントからの配信情報を検索する検索手段と、 該データベースに投稿情報を登録する第１の登録手段と、 利用者間の友人関係情報を登録する第２の登録手段と、 利用者を承認する利用者承認手段とを備えたことを特徴とするサーバ。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer (登録者) for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 JP2007265282A CLAIM 13 セマンティックＷｅｂの概念を考慮し、提供情報に意味情報を付加する機構を備えた情報検索システムのコンピュ (next polling, data processing system, next polling questions) ータが情報検索処理を実行させるプログラムにおいて、 前記コンピュータに、企業、店舗、及びイベントが配信する情報を検索する第１の検索処理を実行させることを特徴とするプログラム。 |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (スポット) of members that fall within the maximum and minimum match percentage . |
JP2007265282A CLAIM 5 検索対象情報範囲として現在地点、駅名、住所、スポット (maximum number) 名等の位置情報を検索対象として検索する第４の検索手段をさらに備えたことを特徴とする請求項１から４のいずれか１項記載の情報検索システム。 |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer (登録者) , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer (登録者) of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer (登録者) , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer (登録者) of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007265282A CLAIM 3 友人登録を行う友人登録手段と、該友人登録手段に登録された友人からの友人登録者 (selected answer) 投稿情報のみを対象として検索する第２の検索手段とをさらに備えたことを特徴とする請求項１または２記載の情報検索システム。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2007233875A Filed: 2006-03-02 Issued: 2007-09-13 投稿処理装置 (Original Assignee) Nomura Research Institute Ltd; 株式会社野村総合研究所 Tatsumi Mashita, 竜実 真下 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (データ送) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007233875A CLAIM 1 クライアント端末から受信した投稿データを他のクライアント端末に対して電子的に公開する装置であって、 クライアント端末から投稿データの閲覧要求がなされたときに、要求された投稿データを送信する投稿データ送 (receiving user information) 信部と、 投稿データの内容に対する評価を示す内容評価データを、その投稿データについて閲覧要求をしたクライアント端末から受信する内容評価受信部と、 各種投稿データに対する内容評価データを集計して、クライアント端末のユーザごとの評価傾向を内容評価傾向データとして保持する内容評価傾向保持部と、 内容評価傾向データを参照して、ユーザ間における評価傾向の近さを内容評価類似値として指標化する内容評価類似値計算部と、 投稿データの閲覧要求がなされたとき、その要求元のユーザと近い評価傾向にあるユーザを内容評価類似値に基づいて選定する類似ユーザ選定部と、 閲覧要求された投稿データに対する前記選定されたユーザの内容評価データを参照して、その投稿データの表示方法を決定する表示方法決定部と、 前記閲覧要求された投稿データを送信するときに、前記表示方法を示す表示指定データを送信する表示指定部と、 クライアント端末のユーザから、そのユーザが過去に評価した内容評価データの取得要求を受信する内容評価要求受信部と、 取得要求された内容評価データを前記クライアント端末に送信する内容評価送信部と、 前記クライアント端末からユーザにより変更された内容評価データを受信する変更内容評価受信部と、を備え、 前記内容評価類似値計算部は、ユーザにより変更された内容評価データを参照して、ユーザ間における評価傾向の近さを内容評価類似値として再指標化し、 前記類似ユーザ選定部は、ユーザにより内容評価データが変更されたとき、そのユーザと近い評価傾向にあるユーザを再指標化された内容評価類似値に基づいて選定することを特徴とする投稿処理装置。 |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (するとき) . |
JP2007233875A CLAIM 1 クライアント端末から受信した投稿データを他のクライアント端末に対して電子的に公開する装置であって、 クライアント端末から投稿データの閲覧要求がなされたときに、要求された投稿データを送信する投稿データ送信部と、 投稿データの内容に対する評価を示す内容評価データを、その投稿データについて閲覧要求をしたクライアント端末から受信する内容評価受信部と、 各種投稿データに対する内容評価データを集計して、クライアント端末のユーザごとの評価傾向を内容評価傾向データとして保持する内容評価傾向保持部と、 内容評価傾向データを参照して、ユーザ間における評価傾向の近さを内容評価類似値として指標化する内容評価類似値計算部と、 投稿データの閲覧要求がなされたとき、その要求元のユーザと近い評価傾向にあるユーザを内容評価類似値に基づいて選定する類似ユーザ選定部と、 閲覧要求された投稿データに対する前記選定されたユーザの内容評価データを参照して、その投稿データの表示方法を決定する表示方法決定部と、 前記閲覧要求された投稿データを送信するとき (next polling questions) に、前記表示方法を示す表示指定データを送信する表示指定部と、 クライアント端末のユーザから、そのユーザが過去に評価した内容評価データの取得要求を受信する内容評価要求受信部と、 取得要求された内容評価データを前記クライアント端末に送信する内容評価送信部と、 前記クライアント端末からユーザにより変更された内容評価データを受信する変更内容評価受信部と、を備え、 前記内容評価類似値計算部は、ユーザにより変更された内容評価データを参照して、ユーザ間における評価傾向の近さを内容評価類似値として再指標化し、 前記類似ユーザ選定部は、ユーザにより内容評価データが変更されたとき、そのユーザと近い評価傾向にあるユーザを再指標化された内容評価類似値に基づいて選定することを特徴とする投稿処理装置。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (データ送) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007233875A CLAIM 1 クライアント端末から受信した投稿データを他のクライアント端末に対して電子的に公開する装置であって、 クライアント端末から投稿データの閲覧要求がなされたときに、要求された投稿データを送信する投稿データ送 (receiving user information) 信部と、 投稿データの内容に対する評価を示す内容評価データを、その投稿データについて閲覧要求をしたクライアント端末から受信する内容評価受信部と、 各種投稿データに対する内容評価データを集計して、クライアント端末のユーザごとの評価傾向を内容評価傾向データとして保持する内容評価傾向保持部と、 内容評価傾向データを参照して、ユーザ間における評価傾向の近さを内容評価類似値として指標化する内容評価類似値計算部と、 投稿データの閲覧要求がなされたとき、その要求元のユーザと近い評価傾向にあるユーザを内容評価類似値に基づいて選定する類似ユーザ選定部と、 閲覧要求された投稿データに対する前記選定されたユーザの内容評価データを参照して、その投稿データの表示方法を決定する表示方法決定部と、 前記閲覧要求された投稿データを送信するときに、前記表示方法を示す表示指定データを送信する表示指定部と、 クライアント端末のユーザから、そのユーザが過去に評価した内容評価データの取得要求を受信する内容評価要求受信部と、 取得要求された内容評価データを前記クライアント端末に送信する内容評価送信部と、 前記クライアント端末からユーザにより変更された内容評価データを受信する変更内容評価受信部と、を備え、 前記内容評価類似値計算部は、ユーザにより変更された内容評価データを参照して、ユーザ間における評価傾向の近さを内容評価類似値として再指標化し、 前記類似ユーザ選定部は、ユーザにより内容評価データが変更されたとき、そのユーザと近い評価傾向にあるユーザを再指標化された内容評価類似値に基づいて選定することを特徴とする投稿処理装置。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (するとき) . |
JP2007233875A CLAIM 1 クライアント端末から受信した投稿データを他のクライアント端末に対して電子的に公開する装置であって、 クライアント端末から投稿データの閲覧要求がなされたときに、要求された投稿データを送信する投稿データ送信部と、 投稿データの内容に対する評価を示す内容評価データを、その投稿データについて閲覧要求をしたクライアント端末から受信する内容評価受信部と、 各種投稿データに対する内容評価データを集計して、クライアント端末のユーザごとの評価傾向を内容評価傾向データとして保持する内容評価傾向保持部と、 内容評価傾向データを参照して、ユーザ間における評価傾向の近さを内容評価類似値として指標化する内容評価類似値計算部と、 投稿データの閲覧要求がなされたとき、その要求元のユーザと近い評価傾向にあるユーザを内容評価類似値に基づいて選定する類似ユーザ選定部と、 閲覧要求された投稿データに対する前記選定されたユーザの内容評価データを参照して、その投稿データの表示方法を決定する表示方法決定部と、 前記閲覧要求された投稿データを送信するとき (next polling questions) に、前記表示方法を示す表示指定データを送信する表示指定部と、 クライアント端末のユーザから、そのユーザが過去に評価した内容評価データの取得要求を受信する内容評価要求受信部と、 取得要求された内容評価データを前記クライアント端末に送信する内容評価送信部と、 前記クライアント端末からユーザにより変更された内容評価データを受信する変更内容評価受信部と、を備え、 前記内容評価類似値計算部は、ユーザにより変更された内容評価データを参照して、ユーザ間における評価傾向の近さを内容評価類似値として再指標化し、 前記類似ユーザ選定部は、ユーザにより内容評価データが変更されたとき、そのユーザと近い評価傾向にあるユーザを再指標化された内容評価類似値に基づいて選定することを特徴とする投稿処理装置。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (データ送) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007233875A CLAIM 1 クライアント端末から受信した投稿データを他のクライアント端末に対して電子的に公開する装置であって、 クライアント端末から投稿データの閲覧要求がなされたときに、要求された投稿データを送信する投稿データ送 (receiving user information) 信部と、 投稿データの内容に対する評価を示す内容評価データを、その投稿データについて閲覧要求をしたクライアント端末から受信する内容評価受信部と、 各種投稿データに対する内容評価データを集計して、クライアント端末のユーザごとの評価傾向を内容評価傾向データとして保持する内容評価傾向保持部と、 内容評価傾向データを参照して、ユーザ間における評価傾向の近さを内容評価類似値として指標化する内容評価類似値計算部と、 投稿データの閲覧要求がなされたとき、その要求元のユーザと近い評価傾向にあるユーザを内容評価類似値に基づいて選定する類似ユーザ選定部と、 閲覧要求された投稿データに対する前記選定されたユーザの内容評価データを参照して、その投稿データの表示方法を決定する表示方法決定部と、 前記閲覧要求された投稿データを送信するときに、前記表示方法を示す表示指定データを送信する表示指定部と、 クライアント端末のユーザから、そのユーザが過去に評価した内容評価データの取得要求を受信する内容評価要求受信部と、 取得要求された内容評価データを前記クライアント端末に送信する内容評価送信部と、 前記クライアント端末からユーザにより変更された内容評価データを受信する変更内容評価受信部と、を備え、 前記内容評価類似値計算部は、ユーザにより変更された内容評価データを参照して、ユーザ間における評価傾向の近さを内容評価類似値として再指標化し、 前記類似ユーザ選定部は、ユーザにより内容評価データが変更されたとき、そのユーザと近い評価傾向にあるユーザを再指標化された内容評価類似値に基づいて選定することを特徴とする投稿処理装置。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (するとき) . |
JP2007233875A CLAIM 1 クライアント端末から受信した投稿データを他のクライアント端末に対して電子的に公開する装置であって、 クライアント端末から投稿データの閲覧要求がなされたときに、要求された投稿データを送信する投稿データ送信部と、 投稿データの内容に対する評価を示す内容評価データを、その投稿データについて閲覧要求をしたクライアント端末から受信する内容評価受信部と、 各種投稿データに対する内容評価データを集計して、クライアント端末のユーザごとの評価傾向を内容評価傾向データとして保持する内容評価傾向保持部と、 内容評価傾向データを参照して、ユーザ間における評価傾向の近さを内容評価類似値として指標化する内容評価類似値計算部と、 投稿データの閲覧要求がなされたとき、その要求元のユーザと近い評価傾向にあるユーザを内容評価類似値に基づいて選定する類似ユーザ選定部と、 閲覧要求された投稿データに対する前記選定されたユーザの内容評価データを参照して、その投稿データの表示方法を決定する表示方法決定部と、 前記閲覧要求された投稿データを送信するとき (next polling questions) に、前記表示方法を示す表示指定データを送信する表示指定部と、 クライアント端末のユーザから、そのユーザが過去に評価した内容評価データの取得要求を受信する内容評価要求受信部と、 取得要求された内容評価データを前記クライアント端末に送信する内容評価送信部と、 前記クライアント端末からユーザにより変更された内容評価データを受信する変更内容評価受信部と、を備え、 前記内容評価類似値計算部は、ユーザにより変更された内容評価データを参照して、ユーザ間における評価傾向の近さを内容評価類似値として再指標化し、 前記類似ユーザ選定部は、ユーザにより内容評価データが変更されたとき、そのユーザと近い評価傾向にあるユーザを再指標化された内容評価類似値に基づいて選定することを特徴とする投稿処理装置。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2007233438A Filed: 2006-02-27 Issued: 2007-09-13 トレンド解析サーバおよびトレンド解析方法 (Original Assignee) Dainippon Printing Co Ltd; 大日本印刷株式会社 Mitsuaki Morimoto, Osamu Nakagawa, Tomohiro Nihongi, 修 中川, 智洋 二本木, 光昭 森本 |
|---|---|
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (するとき) . |
JP2007233438A CLAIM 1 インターネット上の複数のブログサイトで公開している情報を解析し、インターネットに接続された端末装置に解析結果を提供するトレンド解析サーバであって、前記トレンド解析サーバは、前記ブログサイトで公開しているブログ記事ごとに、前記ブログ記事が公開されている前記ブログサイトの情報並びに前記ブログ記事のタイトル、内容および公開日をブログ記事情報として取得する記事情報収集手段と、キーワードを抽出するとき (next polling questions) に参照する前記ブログ記事情報を定める条件（対象記事条件）に適合するすべての前記ブログ記事情報を解析し、所定の基準に従って１つ以上の単語をキーワードとして抽出するキーワード抽出手段と、前記キーワード抽出手段により抽出されたキーワードを少なくとも表示するＷｅｂページを生成するＷｅｂページ生成手段とを備え、前記Ｗｅｂページ生成手段は、第１の期間内に公開された前記ブログ記事の前記ブログ記事情報を前記対象記事条件として抽出したキーワードをトレンドキーワードとして表示する第１のＷｅｂページと、前記第１のＷｅｂページで表示された前記トレンドキーワードの中から一つの前記トレンドキーワードが選択されたときに、選択された前記トレンドキーワードが記述された前記ブログ記事情報の中で、最新の所定件数の前記ブログ記事情報を前記対象記事条件として抽出したキーワード（関連キーワード）、および、前記関連キーワードを抽出したときに参照した前記ブログ記事情報をリスト化して表示する第２のＷｅｂページとを生成することを特徴とするトレンド解析サーバ。 |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2007233438A CLAIM 1 インターネット上の複数のブログサイトで公開している情報を解析し、インターネットに接続された端末装置に解析結果を提供するトレンド解析サーバであって、前記トレンド解析サーバは、前記ブログサイトで公開しているブログ記事ごとに、前記ブログ記事が公開されている前記ブログサイトの情報並びに前記ブログ記事のタイトル、内容および公開日をブログ記事情報として取得する記事情報収集手段と、キーワードを抽出するときに参照する前記ブログ記事情報を定める条件（対象記事条件）に適合するすべての前記ブログ記事情報を解析し、所定の基準に従って１つ以上の単語をキーワードとして抽出するキーワード抽出手段と、前記キーワード抽出手段により抽出されたキーワードを少なくとも表示するＷｅｂページを生成するＷｅｂページ生成手段とを備え、前記Ｗｅｂページ生成手段は、第１の期間内に公開された前記ブログ記事の前記ブログ記事情報を前記対象記事条件として抽出したキーワードをトレンドキーワードとして表示する第１のＷｅｂページと、前記第１ (minimum match percentage) のＷｅｂページで表示された前記トレンドキーワードの中から一つの前記トレンドキーワードが選択されたときに、選択された前記トレンドキーワードが記述された前記ブログ記事情報の中で、最新の所定件数の前記ブログ記事情報を前記対象記事条件として抽出したキーワード（関連キーワード）、および、前記関連キーワードを抽出したときに参照した前記ブログ記事情報をリスト化して表示する第２のＷｅｂページとを生成することを特徴とするトレンド解析サーバ。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (するとき) . |
JP2007233438A CLAIM 1 インターネット上の複数のブログサイトで公開している情報を解析し、インターネットに接続された端末装置に解析結果を提供するトレンド解析サーバであって、前記トレンド解析サーバは、前記ブログサイトで公開しているブログ記事ごとに、前記ブログ記事が公開されている前記ブログサイトの情報並びに前記ブログ記事のタイトル、内容および公開日をブログ記事情報として取得する記事情報収集手段と、キーワードを抽出するとき (next polling questions) に参照する前記ブログ記事情報を定める条件（対象記事条件）に適合するすべての前記ブログ記事情報を解析し、所定の基準に従って１つ以上の単語をキーワードとして抽出するキーワード抽出手段と、前記キーワード抽出手段により抽出されたキーワードを少なくとも表示するＷｅｂページを生成するＷｅｂページ生成手段とを備え、前記Ｗｅｂページ生成手段は、第１の期間内に公開された前記ブログ記事の前記ブログ記事情報を前記対象記事条件として抽出したキーワードをトレンドキーワードとして表示する第１のＷｅｂページと、前記第１のＷｅｂページで表示された前記トレンドキーワードの中から一つの前記トレンドキーワードが選択されたときに、選択された前記トレンドキーワードが記述された前記ブログ記事情報の中で、最新の所定件数の前記ブログ記事情報を前記対象記事条件として抽出したキーワード（関連キーワード）、および、前記関連キーワードを抽出したときに参照した前記ブログ記事情報をリスト化して表示する第２のＷｅｂページとを生成することを特徴とするトレンド解析サーバ。 |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2007233438A CLAIM 1 インターネット上の複数のブログサイトで公開している情報を解析し、インターネットに接続された端末装置に解析結果を提供するトレンド解析サーバであって、前記トレンド解析サーバは、前記ブログサイトで公開しているブログ記事ごとに、前記ブログ記事が公開されている前記ブログサイトの情報並びに前記ブログ記事のタイトル、内容および公開日をブログ記事情報として取得する記事情報収集手段と、キーワードを抽出するときに参照する前記ブログ記事情報を定める条件（対象記事条件）に適合するすべての前記ブログ記事情報を解析し、所定の基準に従って１つ以上の単語をキーワードとして抽出するキーワード抽出手段と、前記キーワード抽出手段により抽出されたキーワードを少なくとも表示するＷｅｂページを生成するＷｅｂページ生成手段とを備え、前記Ｗｅｂページ生成手段は、第１の期間内に公開された前記ブログ記事の前記ブログ記事情報を前記対象記事条件として抽出したキーワードをトレンドキーワードとして表示する第１のＷｅｂページと、前記第１ (minimum match percentage) のＷｅｂページで表示された前記トレンドキーワードの中から一つの前記トレンドキーワードが選択されたときに、選択された前記トレンドキーワードが記述された前記ブログ記事情報の中で、最新の所定件数の前記ブログ記事情報を前記対象記事条件として抽出したキーワード（関連キーワード）、および、前記関連キーワードを抽出したときに参照した前記ブログ記事情報をリスト化して表示する第２のＷｅｂページとを生成することを特徴とするトレンド解析サーバ。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (するとき) . |
JP2007233438A CLAIM 1 インターネット上の複数のブログサイトで公開している情報を解析し、インターネットに接続された端末装置に解析結果を提供するトレンド解析サーバであって、前記トレンド解析サーバは、前記ブログサイトで公開しているブログ記事ごとに、前記ブログ記事が公開されている前記ブログサイトの情報並びに前記ブログ記事のタイトル、内容および公開日をブログ記事情報として取得する記事情報収集手段と、キーワードを抽出するとき (next polling questions) に参照する前記ブログ記事情報を定める条件（対象記事条件）に適合するすべての前記ブログ記事情報を解析し、所定の基準に従って１つ以上の単語をキーワードとして抽出するキーワード抽出手段と、前記キーワード抽出手段により抽出されたキーワードを少なくとも表示するＷｅｂページを生成するＷｅｂページ生成手段とを備え、前記Ｗｅｂページ生成手段は、第１の期間内に公開された前記ブログ記事の前記ブログ記事情報を前記対象記事条件として抽出したキーワードをトレンドキーワードとして表示する第１のＷｅｂページと、前記第１のＷｅｂページで表示された前記トレンドキーワードの中から一つの前記トレンドキーワードが選択されたときに、選択された前記トレンドキーワードが記述された前記ブログ記事情報の中で、最新の所定件数の前記ブログ記事情報を前記対象記事条件として抽出したキーワード（関連キーワード）、および、前記関連キーワードを抽出したときに参照した前記ブログ記事情報をリスト化して表示する第２のＷｅｂページとを生成することを特徴とするトレンド解析サーバ。 |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2007233438A CLAIM 1 インターネット上の複数のブログサイトで公開している情報を解析し、インターネットに接続された端末装置に解析結果を提供するトレンド解析サーバであって、前記トレンド解析サーバは、前記ブログサイトで公開しているブログ記事ごとに、前記ブログ記事が公開されている前記ブログサイトの情報並びに前記ブログ記事のタイトル、内容および公開日をブログ記事情報として取得する記事情報収集手段と、キーワードを抽出するときに参照する前記ブログ記事情報を定める条件（対象記事条件）に適合するすべての前記ブログ記事情報を解析し、所定の基準に従って１つ以上の単語をキーワードとして抽出するキーワード抽出手段と、前記キーワード抽出手段により抽出されたキーワードを少なくとも表示するＷｅｂページを生成するＷｅｂページ生成手段とを備え、前記Ｗｅｂページ生成手段は、第１の期間内に公開された前記ブログ記事の前記ブログ記事情報を前記対象記事条件として抽出したキーワードをトレンドキーワードとして表示する第１のＷｅｂページと、前記第１ (minimum match percentage) のＷｅｂページで表示された前記トレンドキーワードの中から一つの前記トレンドキーワードが選択されたときに、選択された前記トレンドキーワードが記述された前記ブログ記事情報の中で、最新の所定件数の前記ブログ記事情報を前記対象記事条件として抽出したキーワード（関連キーワード）、および、前記関連キーワードを抽出したときに参照した前記ブログ記事情報をリスト化して表示する第２のＷｅｂページとを生成することを特徴とするトレンド解析サーバ。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20060143236A1 Filed: 2005-12-29 Issued: 2006-06-29 Interactive music playlist sharing system and methods (Original Assignee) Bandwidth Productions Inc (Current Assignee) Concert Technology Corp Michael Wu |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system (social networking) , comprising : a data processing system (data processing system, real time) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (user information) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20060143236A1 CLAIM 5 . The system of claim 3 , wherein the server further includes a social networking (networking system) playlist module , including : a user invitation interface module for a first system user to invite other system users to share a set of playlists each containing a plurality of media files in any of a plurality of playlist formats over the network ; a playlist sharing interface module for sharing the set of playlists in the standard playlist format via the playlist submission module wherein the playlist sharing interface includes security controls for limiting playlist access to a predetermined set of designated users ; and a network communication interface module for direct communication between the first server user and other server users associated with the shared set of playlists . US20060143236A1 CLAIM 7 . The system of claim 1 , wherein the server further includes a real time (data processing system) playlist module , the real-time playlist module comprising : a media file selector module for enabling a first system user to interactively select media files from a at least one of the server-based playlist browsing interface module and the server-based playlist searching interface module for inclusion in a real time playlist ; a playlist manager interface module for enabling the first system user to edit , delete or add media files and information to the real time playlist ; and a playlist storage interface module for converting the real time playlist to a stored playlist associated with the first system user in the playlist sharing system . US20060143236A1 CLAIM 8 . A community media playlist relational database system , comprising : a playlist server in communication with a database of media playlists , the media playlists each including media identification information and user identification information , the at least one playlist server connected to a network for access thereto by a plurality of system users ; wherein the playlist server includes a server-provided network playlist interface module providing a front-end to the playlist server over the network , the network playlist interface module including : a playlist submission interface module for submitting media playlists to the playlist server by a system user over a network from a plurality of external media playlist formats , the playlist server recognizing the plurality of external formats and converting the submitted media playlists for inclusion in the database of media playlists ; a playlist linking interface module for linking the database of media playlists to additional media information through the network playlist interface module , the playlist linking interface module further linking the database of media playlists to a plurality of points of purchase for individual media items in the media playlists of the database of media playlists ; and a meta-affiliate interface module for distributing affiliate profits from at least one of the plurality of points of purchase when accessed via the playlist linking interface module to distribute at least a portion of the affiliate profits among at least one of the system users based upon media identification information , system user information (user information) , and playlist information . US20060143236A1 CLAIM 20 . A computer readable medium storing a computer program for causing a processor , used in a data processing system (data processing system) controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . |
| US9087321B2 CLAIM 2 . The poll-based networking system (social networking) as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20060143236A1 CLAIM 5 . The system of claim 3 , wherein the server further includes a social networking (networking system) playlist module , including : a user invitation interface module for a first system user to invite other system users to share a set of playlists each containing a plurality of media files in any of a plurality of playlist formats over the network ; a playlist sharing interface module for sharing the set of playlists in the standard playlist format via the playlist submission module wherein the playlist sharing interface includes security controls for limiting playlist access to a predetermined set of designated users ; and a network communication interface module for direct communication between the first server user and other server users associated with the shared set of playlists . |
| US9087321B2 CLAIM 3 . The poll-based networking system (social networking) as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20060143236A1 CLAIM 5 . The system of claim 3 , wherein the server further includes a social networking (networking system) playlist module , including : a user invitation interface module for a first system user to invite other system users to share a set of playlists each containing a plurality of media files in any of a plurality of playlist formats over the network ; a playlist sharing interface module for sharing the set of playlists in the standard playlist format via the playlist submission module wherein the playlist sharing interface includes security controls for limiting playlist access to a predetermined set of designated users ; and a network communication interface module for direct communication between the first server user and other server users associated with the shared set of playlists . |
| US9087321B2 CLAIM 4 . The poll-based networking system (social networking) as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20060143236A1 CLAIM 5 . The system of claim 3 , wherein the server further includes a social networking (networking system) playlist module , including : a user invitation interface module for a first system user to invite other system users to share a set of playlists each containing a plurality of media files in any of a plurality of playlist formats over the network ; a playlist sharing interface module for sharing the set of playlists in the standard playlist format via the playlist submission module wherein the playlist sharing interface includes security controls for limiting playlist access to a predetermined set of designated users ; and a network communication interface module for direct communication between the first server user and other server users associated with the shared set of playlists . |
| US9087321B2 CLAIM 5 . The poll-based networking system (social networking) as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20060143236A1 CLAIM 5 . The system of claim 3 , wherein the server further includes a social networking (networking system) playlist module , including : a user invitation interface module for a first system user to invite other system users to share a set of playlists each containing a plurality of media files in any of a plurality of playlist formats over the network ; a playlist sharing interface module for sharing the set of playlists in the standard playlist format via the playlist submission module wherein the playlist sharing interface includes security controls for limiting playlist access to a predetermined set of designated users ; and a network communication interface module for direct communication between the first server user and other server users associated with the shared set of playlists . |
| US9087321B2 CLAIM 6 . The poll-based networking system (social networking) as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20060143236A1 CLAIM 5 . The system of claim 3 , wherein the server further includes a social networking (networking system) playlist module , including : a user invitation interface module for a first system user to invite other system users to share a set of playlists each containing a plurality of media files in any of a plurality of playlist formats over the network ; a playlist sharing interface module for sharing the set of playlists in the standard playlist format via the playlist submission module wherein the playlist sharing interface includes security controls for limiting playlist access to a predetermined set of designated users ; and a network communication interface module for direct communication between the first server user and other server users associated with the shared set of playlists . US20060143236A1 CLAIM 20 . A computer readable medium (match server) storing a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . US20060143236A1 CLAIM 23 . A method for sharing media playlists including a plurality of media files among a plurality of users on a network , comprising : uploading a first playlist from a first user to a playlist sharing server over the network , the playlist sharing server including a database , a web server (web server) , and an interface to a network including the plurality of users ; uploading a second playlist from a second user to the playlist sharing server over the network ; converting the first playlist and the second playlist to a standard playlist format on the playlist sharing server ; storing the first playlist and the second playlist in the standard playlist format in the database associated with the playlist sharing server ; associating the first playlist and the second playlist with respective media identification information , media relation information , and user information for each the playlist in the database ; associating the first playlist and the second playlist with a plurality of third party media providers such that each media file in the first playlist is linked to at least one of the plurality of third party media providers that distributes that media file if any , and each media file in the second playlist is linked to at least one of the plurality of third party media providers that distributes that media file if any ; and sharing the first playlist and the second playlist with the first user and the second user via the web interface over the network . |
| US9087321B2 CLAIM 7 . The poll-based networking system (social networking) as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20060143236A1 CLAIM 5 . The system of claim 3 , wherein the server further includes a social networking (networking system) playlist module , including : a user invitation interface module for a first system user to invite other system users to share a set of playlists each containing a plurality of media files in any of a plurality of playlist formats over the network ; a playlist sharing interface module for sharing the set of playlists in the standard playlist format via the playlist submission module wherein the playlist sharing interface includes security controls for limiting playlist access to a predetermined set of designated users ; and a network communication interface module for direct communication between the first server user and other server users associated with the shared set of playlists . US20060143236A1 CLAIM 20 . A computer readable medium (match server) storing a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . |
| US9087321B2 CLAIM 8 . The poll-based networking system (social networking) as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20060143236A1 CLAIM 5 . The system of claim 3 , wherein the server further includes a social networking (networking system) playlist module , including : a user invitation interface module for a first system user to invite other system users to share a set of playlists each containing a plurality of media files in any of a plurality of playlist formats over the network ; a playlist sharing interface module for sharing the set of playlists in the standard playlist format via the playlist submission module wherein the playlist sharing interface includes security controls for limiting playlist access to a predetermined set of designated users ; and a network communication interface module for direct communication between the first server user and other server users associated with the shared set of playlists . US20060143236A1 CLAIM 20 . A computer readable medium (match server) storing a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . US20060143236A1 CLAIM 23 . A method for sharing media playlists including a plurality of media files among a plurality of users on a network , comprising : uploading a first playlist from a first user to a playlist sharing server over the network , the playlist sharing server including a database , a web server (web server) , and an interface to a network including the plurality of users ; uploading a second playlist from a second user to the playlist sharing server over the network ; converting the first playlist and the second playlist to a standard playlist format on the playlist sharing server ; storing the first playlist and the second playlist in the standard playlist format in the database associated with the playlist sharing server ; associating the first playlist and the second playlist with respective media identification information , media relation information , and user information for each the playlist in the database ; associating the first playlist and the second playlist with a plurality of third party media providers such that each media file in the first playlist is linked to at least one of the plurality of third party media providers that distributes that media file if any , and each media file in the second playlist is linked to at least one of the plurality of third party media providers that distributes that media file if any ; and sharing the first playlist and the second playlist with the first user and the second user via the web interface over the network . |
| US9087321B2 CLAIM 9 . The poll-based networking system (social networking) as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20060143236A1 CLAIM 5 . The system of claim 3 , wherein the server further includes a social networking (networking system) playlist module , including : a user invitation interface module for a first system user to invite other system users to share a set of playlists each containing a plurality of media files in any of a plurality of playlist formats over the network ; a playlist sharing interface module for sharing the set of playlists in the standard playlist format via the playlist submission module wherein the playlist sharing interface includes security controls for limiting playlist access to a predetermined set of designated users ; and a network communication interface module for direct communication between the first server user and other server users associated with the shared set of playlists . US20060143236A1 CLAIM 20 . A computer readable medium (match server) storing a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means (readable medium storing) to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (user information) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20060143236A1 CLAIM 8 . A community media playlist relational database system , comprising : a playlist server in communication with a database of media playlists , the media playlists each including media identification information and user identification information , the at least one playlist server connected to a network for access thereto by a plurality of system users ; wherein the playlist server includes a server-provided network playlist interface module providing a front-end to the playlist server over the network , the network playlist interface module including : a playlist submission interface module for submitting media playlists to the playlist server by a system user over a network from a plurality of external media playlist formats , the playlist server recognizing the plurality of external formats and converting the submitted media playlists for inclusion in the database of media playlists ; a playlist linking interface module for linking the database of media playlists to additional media information through the network playlist interface module , the playlist linking interface module further linking the database of media playlists to a plurality of points of purchase for individual media items in the media playlists of the database of media playlists ; and a meta-affiliate interface module for distributing affiliate profits from at least one of the plurality of points of purchase when accessed via the playlist linking interface module to distribute at least a portion of the affiliate profits among at least one of the system users based upon media identification information , system user information (user information) , and playlist information . US20060143236A1 CLAIM 20 . A computer readable medium storing (instruction means) a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20060143236A1 CLAIM 20 . A computer readable medium (match server) storing a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . US20060143236A1 CLAIM 23 . A method for sharing media playlists including a plurality of media files among a plurality of users on a network , comprising : uploading a first playlist from a first user to a playlist sharing server over the network , the playlist sharing server including a database , a web server (web server) , and an interface to a network including the plurality of users ; uploading a second playlist from a second user to the playlist sharing server over the network ; converting the first playlist and the second playlist to a standard playlist format on the playlist sharing server ; storing the first playlist and the second playlist in the standard playlist format in the database associated with the playlist sharing server ; associating the first playlist and the second playlist with respective media identification information , media relation information , and user information for each the playlist in the database ; associating the first playlist and the second playlist with a plurality of third party media providers such that each media file in the first playlist is linked to at least one of the plurality of third party media providers that distributes that media file if any , and each media file in the second playlist is linked to at least one of the plurality of third party media providers that distributes that media file if any ; and sharing the first playlist and the second playlist with the first user and the second user via the web interface over the network . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20060143236A1 CLAIM 20 . A computer readable medium (match server) storing a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20060143236A1 CLAIM 20 . A computer readable medium (match server) storing a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . US20060143236A1 CLAIM 23 . A method for sharing media playlists including a plurality of media files among a plurality of users on a network , comprising : uploading a first playlist from a first user to a playlist sharing server over the network , the playlist sharing server including a database , a web server (web server) , and an interface to a network including the plurality of users ; uploading a second playlist from a second user to the playlist sharing server over the network ; converting the first playlist and the second playlist to a standard playlist format on the playlist sharing server ; storing the first playlist and the second playlist in the standard playlist format in the database associated with the playlist sharing server ; associating the first playlist and the second playlist with respective media identification information , media relation information , and user information for each the playlist in the database ; associating the first playlist and the second playlist with a plurality of third party media providers such that each media file in the first playlist is linked to at least one of the plurality of third party media providers that distributes that media file if any , and each media file in the second playlist is linked to at least one of the plurality of third party media providers that distributes that media file if any ; and sharing the first playlist and the second playlist with the first user and the second user via the web interface over the network . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20060143236A1 CLAIM 20 . A computer readable medium (match server) storing a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . |
| US9087321B2 CLAIM 19 . A computer program product (bar code) for creating a poll-based network , the computer program product comprising computer-readable instruction means (readable medium storing) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations (bar code) of : receiving user information (user information) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20060143236A1 CLAIM 8 . A community media playlist relational database system , comprising : a playlist server in communication with a database of media playlists , the media playlists each including media identification information and user identification information , the at least one playlist server connected to a network for access thereto by a plurality of system users ; wherein the playlist server includes a server-provided network playlist interface module providing a front-end to the playlist server over the network , the network playlist interface module including : a playlist submission interface module for submitting media playlists to the playlist server by a system user over a network from a plurality of external media playlist formats , the playlist server recognizing the plurality of external formats and converting the submitted media playlists for inclusion in the database of media playlists ; a playlist linking interface module for linking the database of media playlists to additional media information through the network playlist interface module , the playlist linking interface module further linking the database of media playlists to a plurality of points of purchase for individual media items in the media playlists of the database of media playlists ; and a meta-affiliate interface module for distributing affiliate profits from at least one of the plurality of points of purchase when accessed via the playlist linking interface module to distribute at least a portion of the affiliate profits among at least one of the system users based upon media identification information , system user information (user information) , and playlist information . US20060143236A1 CLAIM 18 . The system of claim 16 , wherein the playlist server further comprises : a playlist toolbar interface module for sharing playlists on a third party website independently of the playlist browsing interface module by way a toolbar served from the playlist sharing system to the third party website upon placement of toolbar code (computer program product, computer program product comprising computer, computer to perform operations) on the third party website ; and , a toolbar meta-affiliate interface module for crediting purchases of media works from the toolbar via the link to third party ordering interface with the first system user account according to the affiliate data associated with the first system user account . US20060143236A1 CLAIM 20 . A computer readable medium storing (instruction means) a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . |
| US9087321B2 CLAIM 20 . The computer program product (bar code) as set forth in claim 19 , further comprising instruction means (readable medium storing) for causing the computer to perform operations (bar code) of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20060143236A1 CLAIM 18 . The system of claim 16 , wherein the playlist server further comprises : a playlist toolbar interface module for sharing playlists on a third party website independently of the playlist browsing interface module by way a toolbar served from the playlist sharing system to the third party website upon placement of toolbar code (computer program product, computer program product comprising computer, computer to perform operations) on the third party website ; and , a toolbar meta-affiliate interface module for crediting purchases of media works from the toolbar via the link to third party ordering interface with the first system user account according to the affiliate data associated with the first system user account . US20060143236A1 CLAIM 20 . A computer readable medium storing (instruction means) a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . |
| US9087321B2 CLAIM 21 . The computer program product (bar code) as set forth in claim 20 , further comprising instruction means (readable medium storing) for causing the computer to perform operations (bar code) of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20060143236A1 CLAIM 18 . The system of claim 16 , wherein the playlist server further comprises : a playlist toolbar interface module for sharing playlists on a third party website independently of the playlist browsing interface module by way a toolbar served from the playlist sharing system to the third party website upon placement of toolbar code (computer program product, computer program product comprising computer, computer to perform operations) on the third party website ; and , a toolbar meta-affiliate interface module for crediting purchases of media works from the toolbar via the link to third party ordering interface with the first system user account according to the affiliate data associated with the first system user account . US20060143236A1 CLAIM 20 . A computer readable medium storing (instruction means) a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . |
| US9087321B2 CLAIM 22 . The computer program product (bar code) as set forth in claim 21 , further comprising instruction means (readable medium storing) for causing the computer to perform operations (bar code) of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20060143236A1 CLAIM 18 . The system of claim 16 , wherein the playlist server further comprises : a playlist toolbar interface module for sharing playlists on a third party website independently of the playlist browsing interface module by way a toolbar served from the playlist sharing system to the third party website upon placement of toolbar code (computer program product, computer program product comprising computer, computer to perform operations) on the third party website ; and , a toolbar meta-affiliate interface module for crediting purchases of media works from the toolbar via the link to third party ordering interface with the first system user account according to the affiliate data associated with the first system user account . US20060143236A1 CLAIM 20 . A computer readable medium storing (instruction means) a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . |
| US9087321B2 CLAIM 23 . The computer program product (bar code) as set forth in claim 22 , further comprising instruction means (readable medium storing) for causing the computer to perform operations (bar code) of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20060143236A1 CLAIM 18 . The system of claim 16 , wherein the playlist server further comprises : a playlist toolbar interface module for sharing playlists on a third party website independently of the playlist browsing interface module by way a toolbar served from the playlist sharing system to the third party website upon placement of toolbar code (computer program product, computer program product comprising computer, computer to perform operations) on the third party website ; and , a toolbar meta-affiliate interface module for crediting purchases of media works from the toolbar via the link to third party ordering interface with the first system user account according to the affiliate data associated with the first system user account . US20060143236A1 CLAIM 20 . A computer readable medium storing (instruction means) a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . |
| US9087321B2 CLAIM 24 . The computer program product (bar code) as set forth in claim 23 , further comprising instruction means (readable medium storing) for causing the computer to perform operations (bar code) of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20060143236A1 CLAIM 18 . The system of claim 16 , wherein the playlist server further comprises : a playlist toolbar interface module for sharing playlists on a third party website independently of the playlist browsing interface module by way a toolbar served from the playlist sharing system to the third party website upon placement of toolbar code (computer program product, computer program product comprising computer, computer to perform operations) on the third party website ; and , a toolbar meta-affiliate interface module for crediting purchases of media works from the toolbar via the link to third party ordering interface with the first system user account according to the affiliate data associated with the first system user account . US20060143236A1 CLAIM 20 . A computer readable medium (match server) storing a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . US20060143236A1 CLAIM 23 . A method for sharing media playlists including a plurality of media files among a plurality of users on a network , comprising : uploading a first playlist from a first user to a playlist sharing server over the network , the playlist sharing server including a database , a web server (web server) , and an interface to a network including the plurality of users ; uploading a second playlist from a second user to the playlist sharing server over the network ; converting the first playlist and the second playlist to a standard playlist format on the playlist sharing server ; storing the first playlist and the second playlist in the standard playlist format in the database associated with the playlist sharing server ; associating the first playlist and the second playlist with respective media identification information , media relation information , and user information for each the playlist in the database ; associating the first playlist and the second playlist with a plurality of third party media providers such that each media file in the first playlist is linked to at least one of the plurality of third party media providers that distributes that media file if any , and each media file in the second playlist is linked to at least one of the plurality of third party media providers that distributes that media file if any ; and sharing the first playlist and the second playlist with the first user and the second user via the web interface over the network . |
| US9087321B2 CLAIM 25 . The computer program product (bar code) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20060143236A1 CLAIM 18 . The system of claim 16 , wherein the playlist server further comprises : a playlist toolbar interface module for sharing playlists on a third party website independently of the playlist browsing interface module by way a toolbar served from the playlist sharing system to the third party website upon placement of toolbar code (computer program product, computer program product comprising computer, computer to perform operations) on the third party website ; and , a toolbar meta-affiliate interface module for crediting purchases of media works from the toolbar via the link to third party ordering interface with the first system user account according to the affiliate data associated with the first system user account . US20060143236A1 CLAIM 20 . A computer readable medium (match server) storing a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . |
| US9087321B2 CLAIM 26 . The computer program product (bar code) as set forth in claim 19 , further comprising instruction means (readable medium storing) for causing the computer to perform operations (bar code) of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20060143236A1 CLAIM 18 . The system of claim 16 , wherein the playlist server further comprises : a playlist toolbar interface module for sharing playlists on a third party website independently of the playlist browsing interface module by way a toolbar served from the playlist sharing system to the third party website upon placement of toolbar code (computer program product, computer program product comprising computer, computer to perform operations) on the third party website ; and , a toolbar meta-affiliate interface module for crediting purchases of media works from the toolbar via the link to third party ordering interface with the first system user account according to the affiliate data associated with the first system user account . US20060143236A1 CLAIM 20 . A computer readable medium (match server) storing a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . US20060143236A1 CLAIM 23 . A method for sharing media playlists including a plurality of media files among a plurality of users on a network , comprising : uploading a first playlist from a first user to a playlist sharing server over the network , the playlist sharing server including a database , a web server (web server) , and an interface to a network including the plurality of users ; uploading a second playlist from a second user to the playlist sharing server over the network ; converting the first playlist and the second playlist to a standard playlist format on the playlist sharing server ; storing the first playlist and the second playlist in the standard playlist format in the database associated with the playlist sharing server ; associating the first playlist and the second playlist with respective media identification information , media relation information , and user information for each the playlist in the database ; associating the first playlist and the second playlist with a plurality of third party media providers such that each media file in the first playlist is linked to at least one of the plurality of third party media providers that distributes that media file if any , and each media file in the second playlist is linked to at least one of the plurality of third party media providers that distributes that media file if any ; and sharing the first playlist and the second playlist with the first user and the second user via the web interface over the network . |
| US9087321B2 CLAIM 27 . The computer program product (bar code) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20060143236A1 CLAIM 18 . The system of claim 16 , wherein the playlist server further comprises : a playlist toolbar interface module for sharing playlists on a third party website independently of the playlist browsing interface module by way a toolbar served from the playlist sharing system to the third party website upon placement of toolbar code (computer program product, computer program product comprising computer, computer to perform operations) on the third party website ; and , a toolbar meta-affiliate interface module for crediting purchases of media works from the toolbar via the link to third party ordering interface with the first system user account according to the affiliate data associated with the first system user account . US20060143236A1 CLAIM 20 . A computer readable medium (match server) storing a computer program for causing a processor , used in a data processing system controlling a media playlist sharing system , to : supply a web-based interface to a network including a plurality of system users ; provide an interface for uploading media playlists from the plurality of system users to the media playlist sharing system ; associate the playlists to respective system users ; associate the playlists to one or more third party providers for each of the media items on the playlists ; enable the sharing of the media playlists among the plurality of system users via the web-based interface ; provide network communications among the plurality of users via the web-based interface according to the content of the playlists associated with respective system users ; store affiliate associations between the system users and the third party providers ; and track the stored affiliate associations of each media item on the playlist associated with a user when that media item is selected for acquisition from a third party by another user . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US7668857B2 Filed: 2005-11-07 Issued: 2010-02-23 Meta-data tags used to describe data behaviors (Original Assignee) International Business Machines Corp (Current Assignee) Twitter Inc Jonathan Michael Cook, Randy Allan Rendahl, David G. Robinson, Shaw-Ben Shi, Lorraine Phyllis Vassberg |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (data processing system) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US7668857B2 CLAIM 14 . A data processing system (data processing system) for aggregating data , said data processing system comprising a data processor and a memory storage device operatively coupled to the data processor , and further comprising : a data provider of the data processing system that collects data , wherein the data provider assigns a behavior tag to a portion of the data in accordance with a data template to form modified data , and wherein the behavior tag includes a sub-tag ; a data sender of the data processing system , wherein the data sender sends the modified data to a data receiver program that writes the modified data into a database ; a data aggregator of the data processing system , wherein the data aggregator reads the modified data from the database and parses the modified data for the behavior tag assigned to the portion of the data ; and a rules engine of the data processing system wherein , responsive to data aggregator detecting the behavior tag and contacting the rules engine , the rules engine determines if a policy is associated with the behavior tag and if so , provides the policy to the data aggregator , and wherein the policy defines how the portion of the data assigned to the behavior tag is to be aggregated by the data aggregator ; and wherein the data aggregator aggregates the portion of the data using the policy to perform mathematical operations on the portion of the data associated with the behavior tag ; wherein the data aggregator provides the rules engine with the behavior tag and other system information associated with the data processing system , and wherein the rules engine creates a tempered list of behavior tag definitions based on the other system information to form the policy . |
| US9087321B2 CLAIM 19 . A computer program product (computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US7668857B2 CLAIM 10 . A computer program product (computer program product) comprising a computer-readable recordable storage medium , said storage medium comprising program code for accomplishing the method of claim 1 . |
| US9087321B2 CLAIM 20 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7668857B2 CLAIM 10 . A computer program product (computer program product) comprising a computer-readable recordable storage medium , said storage medium comprising program code for accomplishing the method of claim 1 . |
| US9087321B2 CLAIM 21 . The computer program product (computer program product) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US7668857B2 CLAIM 10 . A computer program product (computer program product) comprising a computer-readable recordable storage medium , said storage medium comprising program code for accomplishing the method of claim 1 . |
| US9087321B2 CLAIM 22 . The computer program product (computer program product) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US7668857B2 CLAIM 10 . A computer program product (computer program product) comprising a computer-readable recordable storage medium , said storage medium comprising program code for accomplishing the method of claim 1 . |
| US9087321B2 CLAIM 23 . The computer program product (computer program product) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US7668857B2 CLAIM 10 . A computer program product (computer program product) comprising a computer-readable recordable storage medium , said storage medium comprising program code for accomplishing the method of claim 1 . |
| US9087321B2 CLAIM 24 . The computer program product (computer program product) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7668857B2 CLAIM 10 . A computer program product (computer program product) comprising a computer-readable recordable storage medium , said storage medium comprising program code for accomplishing the method of claim 1 . |
| US9087321B2 CLAIM 25 . The computer program product (computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7668857B2 CLAIM 10 . A computer program product (computer program product) comprising a computer-readable recordable storage medium , said storage medium comprising program code for accomplishing the method of claim 1 . |
| US9087321B2 CLAIM 26 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7668857B2 CLAIM 10 . A computer program product (computer program product) comprising a computer-readable recordable storage medium , said storage medium comprising program code for accomplishing the method of claim 1 . |
| US9087321B2 CLAIM 27 . The computer program product (computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7668857B2 CLAIM 10 . A computer program product (computer program product) comprising a computer-readable recordable storage medium , said storage medium comprising program code for accomplishing the method of claim 1 . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20080098454A1 Filed: 2005-10-27 Issued: 2008-04-24 Network Management Appliance (Original Assignee) Toh Soon S Soon Toh |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080098454A1 CLAIM 12 . A network management appliance as claimed in claim 3 , wherein the server element comprises a web server (web server) for facilitating the monitoring and configuring of said configurable network parameters . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080098454A1 CLAIM 12 . A network management appliance as claimed in claim 3 , wherein the server element comprises a web server (web server) for facilitating the monitoring and configuring of said configurable network parameters . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080098454A1 CLAIM 12 . A network management appliance as claimed in claim 3 , wherein the server element comprises a web server (web server) for facilitating the monitoring and configuring of said configurable network parameters . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080098454A1 CLAIM 12 . A network management appliance as claimed in claim 3 , wherein the server element comprises a web server (web server) for facilitating the monitoring and configuring of said configurable network parameters . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080098454A1 CLAIM 12 . A network management appliance as claimed in claim 3 , wherein the server element comprises a web server (web server) for facilitating the monitoring and configuring of said configurable network parameters . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080098454A1 CLAIM 12 . A network management appliance as claimed in claim 3 , wherein the server element comprises a web server (web server) for facilitating the monitoring and configuring of said configurable network parameters . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20070100829A1 Filed: 2005-10-26 Issued: 2007-05-03 Content manager system and method (Original Assignee) eCollege com (Current Assignee) eCollege com J. Allen, Sarah Bradford, Brian Burson, Brandon Fleisher |
|---|---|
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (content delivery) . |
US20070100829A1 CLAIM 1 . A web-based content management system comprising : a central content repository for storing content and associated content metadata for use by a plurality of users ; a content repository search engine configured to facilitate searches of at least one of said content and said content metadata ; a permissions system configured to facilitate central management of user rights in at least one of content creation , content editing , content import , and content delivery (next polling questions) within said content repository ; a content delivery template configured to facilitate at least one of content authoring and content assembly within a course , wherein said content assembly includes establishing references to said educational content in said central content repository ; and a content usage tracking engine configured to monitor instances of said content within a plurality of courses . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (low system) per user . |
US20070100829A1 CLAIM 11 . The system of claim 1 , further comprising a workflow system (m rows) configured to facilitate assignment of a plurality of tasks and provision of a plurality of task-related notices to users relative to content to be stored in said repository . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (low system) per user . |
US20070100829A1 CLAIM 11 . The system of claim 1 , further comprising a workflow system (m rows) configured to facilitate assignment of a plurality of tasks and provision of a plurality of task-related notices to users relative to content to be stored in said repository . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one (management system) or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20070100829A1 CLAIM 1 . A web-based content management system (computer having one) comprising : a central content repository for storing content and associated content metadata for use by a plurality of users ; a content repository search engine configured to facilitate searches of at least one of said content and said content metadata ; a permissions system configured to facilitate central management of user rights in at least one of content creation , content editing , content import , and content delivery within said content repository ; a content delivery template configured to facilitate at least one of content authoring and content assembly within a course , wherein said content assembly includes establishing references to said educational content in said central content repository ; and a content usage tracking engine configured to monitor instances of said content within a plurality of courses . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (content delivery) . |
US20070100829A1 CLAIM 1 . A web-based content management system comprising : a central content repository for storing content and associated content metadata for use by a plurality of users ; a content repository search engine configured to facilitate searches of at least one of said content and said content metadata ; a permissions system configured to facilitate central management of user rights in at least one of content creation , content editing , content import , and content delivery (next polling questions) within said content repository ; a content delivery template configured to facilitate at least one of content authoring and content assembly within a course , wherein said content assembly includes establishing references to said educational content in said central content repository ; and a content usage tracking engine configured to monitor instances of said content within a plurality of courses . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (low system) per user . |
US20070100829A1 CLAIM 11 . The system of claim 1 , further comprising a workflow system (m rows) configured to facilitate assignment of a plurality of tasks and provision of a plurality of task-related notices to users relative to content to be stored in said repository . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (low system) per user . |
US20070100829A1 CLAIM 11 . The system of claim 1 , further comprising a workflow system (m rows) configured to facilitate assignment of a plurality of tasks and provision of a plurality of task-related notices to users relative to content to be stored in said repository . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (content delivery) . |
US20070100829A1 CLAIM 1 . A web-based content management system comprising : a central content repository for storing content and associated content metadata for use by a plurality of users ; a content repository search engine configured to facilitate searches of at least one of said content and said content metadata ; a permissions system configured to facilitate central management of user rights in at least one of content creation , content editing , content import , and content delivery (next polling questions) within said content repository ; a content delivery template configured to facilitate at least one of content authoring and content assembly within a course , wherein said content assembly includes establishing references to said educational content in said central content repository ; and a content usage tracking engine configured to monitor instances of said content within a plurality of courses . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (low system) per user . |
US20070100829A1 CLAIM 11 . The system of claim 1 , further comprising a workflow system (m rows) configured to facilitate assignment of a plurality of tasks and provision of a plurality of task-related notices to users relative to content to be stored in said repository . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (low system) per user . |
US20070100829A1 CLAIM 11 . The system of claim 1 , further comprising a workflow system (m rows) configured to facilitate assignment of a plurality of tasks and provision of a plurality of task-related notices to users relative to content to be stored in said repository . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2007094551A Filed: 2005-09-27 Issued: 2007-04-12 コミュニティ管理装置、記事管理装置、コミュニティ管理方法、記事管理方法、及びプログラム (Original Assignee) Nippon Telegr & Teleph Corp <Ntt>; 日本電信電話株式会社 Takashi Fujimura, Takashi Inoue, 孝史 井上, 考 藤村 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (コンピュ) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer (情報要求) for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 JP2007094551A CLAIM 9 投稿された記事を利用者ＩＤ単位で管理する記事管理装置とネットワーク装置を介して接続され、前記利用者ＩＤがコミュニティに属するか否かを管理するコミュニティ管理装置の機能をコンピュ (next polling, data processing system, next polling questions) ータに実現させるためのプログラムであって、前記コンピュータを、 前記記事管理装置によって配信される記事情報を、前記ネットワーク装置を介して収集し、前記記事情報から記事情報間のリンク情報を抽出し、前記リンク情報をリンク情報格納手段に格納する記事情報収集手段、 利用者ＩＤが前記コミュニティのメンバか否かを示すメンバ情報を格納したメンバ情報格納手段からメンバ情報を取得し、前記リンク情報と前記メンバ情報とから、既存メンバが投稿した記事情報に含まれるリンク情報を非メンバが投稿した記事情報に含まれるリンク情報よりも重みをつけてコミュニティスコアを算出し、前記コミュニティスコアをコミュニティスコア格納手段に格納するコミュニティスコア算出手段、 前記コミュニティスコアが所定の値より高くなると当該コミュニティスコアに対応する利用者ＩＤをメンバとし、所定の値より低くなると非メンバとし、メンバ情報格納手段に格納されているメンバ情報を更新するメンバ情報更新手段、 前記コミュニティスコアとメンバ情報の少なくとも一つを含むコミュニティ情報を、前記ネットワーク装置を介して配信するコミュニティ情報配信手段、 として機能させるためのプログラム。 |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer (情報要求) for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 JP2007094551A CLAIM 9 投稿された記事を利用者ＩＤ単位で管理する記事管理装置とネットワーク装置を介して接続され、前記利用者ＩＤがコミュニティに属するか否かを管理するコミュニティ管理装置の機能をコンピュ (next polling, data processing system, next polling questions) ータに実現させるためのプログラムであって、前記コンピュータを、 前記記事管理装置によって配信される記事情報を、前記ネットワーク装置を介して収集し、前記記事情報から記事情報間のリンク情報を抽出し、前記リンク情報をリンク情報格納手段に格納する記事情報収集手段、 利用者ＩＤが前記コミュニティのメンバか否かを示すメンバ情報を格納したメンバ情報格納手段からメンバ情報を取得し、前記リンク情報と前記メンバ情報とから、既存メンバが投稿した記事情報に含まれるリンク情報を非メンバが投稿した記事情報に含まれるリンク情報よりも重みをつけてコミュニティスコアを算出し、前記コミュニティスコアをコミュニティスコア格納手段に格納するコミュニティスコア算出手段、 前記コミュニティスコアが所定の値より高くなると当該コミュニティスコアに対応する利用者ＩＤをメンバとし、所定の値より低くなると非メンバとし、メンバ情報格納手段に格納されているメンバ情報を更新するメンバ情報更新手段、 前記コミュニティスコアとメンバ情報の少なくとも一つを含むコミュニティ情報を、前記ネットワーク装置を介して配信するコミュニティ情報配信手段、 として機能させるためのプログラム。 |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer (情報要求) , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer (情報要求) of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer (情報要求) , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer (情報要求) of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (信手段) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer (情報要求) for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007094551A CLAIM 1 投稿された記事を利用者ＩＤ単位で管理する記事管理装置とネットワーク装置を介して接続され、前記利用者ＩＤがコミュニティに属するか否かを管理するコミュニティ管理装置であって、 前記記事管理装置によって配信される記事情報を、前記ネットワーク装置を介して収集し、前記記事情報から記事情報間のリンク情報を抽出し、前記リンク情報をリンク情報格納手段に格納する記事情報収集手段と、 利用者ＩＤが前記コミュニティのメンバか否かを示すメンバ情報を格納したメンバ情報格納手段からメンバ情報を取得し、前記リンク情報と前記メンバ情報とから、既存メンバが投稿した記事情報に含まれるリンク情報を非メンバが投稿した記事情報に含まれるリンク情報よりも重みをつけてコミュニティスコアを算出し、前記コミュニティスコアをコミュニティスコア格納手段に格納するコミュニティスコア算出手段と、 前記コミュニティスコアが所定の値より高くなると当該コミュニティスコアに対応する利用者ＩＤをメンバとし、所定の値より低くなると非メンバとし、メンバ情報格納手段に格納されているメンバ情報を更新するメンバ情報更新手段と、 前記コミュニティスコアとメンバ情報の少なくとも一つを含むコミュニティ情報を、前記ネットワーク装置を介して配信するコミュニティ情報配信手段 (executable instruction, computer executable instruction) と、 を備えることを特徴とするコミュニティ管理装置。 JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer (情報要求) for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 JP2007094551A CLAIM 9 投稿された記事を利用者ＩＤ単位で管理する記事管理装置とネットワーク装置を介して接続され、前記利用者ＩＤがコミュニティに属するか否かを管理するコミュニティ管理装置の機能をコンピュ (next polling, data processing system, next polling questions) ータに実現させるためのプログラムであって、前記コンピュータを、 前記記事管理装置によって配信される記事情報を、前記ネットワーク装置を介して収集し、前記記事情報から記事情報間のリンク情報を抽出し、前記リンク情報をリンク情報格納手段に格納する記事情報収集手段、 利用者ＩＤが前記コミュニティのメンバか否かを示すメンバ情報を格納したメンバ情報格納手段からメンバ情報を取得し、前記リンク情報と前記メンバ情報とから、既存メンバが投稿した記事情報に含まれるリンク情報を非メンバが投稿した記事情報に含まれるリンク情報よりも重みをつけてコミュニティスコアを算出し、前記コミュニティスコアをコミュニティスコア格納手段に格納するコミュニティスコア算出手段、 前記コミュニティスコアが所定の値より高くなると当該コミュニティスコアに対応する利用者ＩＤをメンバとし、所定の値より低くなると非メンバとし、メンバ情報格納手段に格納されているメンバ情報を更新するメンバ情報更新手段、 前記コミュニティスコアとメンバ情報の少なくとも一つを含むコミュニティ情報を、前記ネットワーク装置を介して配信するコミュニティ情報配信手段、 として機能させるためのプログラム。 |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer (情報要求) , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer (情報要求) of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer (情報要求) , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer (情報要求) of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer (情報要求) for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer (情報要求) for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 JP2007094551A CLAIM 9 投稿された記事を利用者ＩＤ単位で管理する記事管理装置とネットワーク装置を介して接続され、前記利用者ＩＤがコミュニティに属するか否かを管理するコミュニティ管理装置の機能をコンピュ (next polling, data processing system, next polling questions) ータに実現させるためのプログラムであって、前記コンピュータを、 前記記事管理装置によって配信される記事情報を、前記ネットワーク装置を介して収集し、前記記事情報から記事情報間のリンク情報を抽出し、前記リンク情報をリンク情報格納手段に格納する記事情報収集手段、 利用者ＩＤが前記コミュニティのメンバか否かを示すメンバ情報を格納したメンバ情報格納手段からメンバ情報を取得し、前記リンク情報と前記メンバ情報とから、既存メンバが投稿した記事情報に含まれるリンク情報を非メンバが投稿した記事情報に含まれるリンク情報よりも重みをつけてコミュニティスコアを算出し、前記コミュニティスコアをコミュニティスコア格納手段に格納するコミュニティスコア算出手段、 前記コミュニティスコアが所定の値より高くなると当該コミュニティスコアに対応する利用者ＩＤをメンバとし、所定の値より低くなると非メンバとし、メンバ情報格納手段に格納されているメンバ情報を更新するメンバ情報更新手段、 前記コミュニティスコアとメンバ情報の少なくとも一つを含むコミュニティ情報を、前記ネットワーク装置を介して配信するコミュニティ情報配信手段、 として機能させるためのプログラム。 |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer (情報要求) , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer (情報要求) of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer (情報要求) , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer (情報要求) of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2007094551A CLAIM 5 請求項１または２に記載のコミュニティ管理装置とネットワーク装置を介して接続される記事管理装置であって、 記事情報を格納する記事情報格納手段と、利用者端末装置または他の記事管理装置からの利用者ＩＤ情報を含むフォロー記事追加要求を処理するフォロー記事書込手段とを備え、 前記フォロー記事書込手段は、フォロー記事追加要求から利用者ＩＤを抽出する利用者ＩＤ抽出手段と、 前記利用者ＩＤを含むコミュニティ情報要求 (selected answer) を、ネットワーク装置を介して前記コミュニティ管理装置に送信し、利用者ＩＤに関連づけられたコミュニティ情報を取得するコミュニティ情報取得手段と、 前記コミュニティ情報から前記フォロー記事の書込可否を判定するアクセス制御手段と、 を備え、 前記アクセス制御手段により書込可と判定された場合のみ前記フォロー記事を前記記事情報格納手段に格納する、 ことを特徴とする記事管理装置。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2007072523A Filed: 2005-09-02 Issued: 2007-03-22 協調作業場作成支援のためのプログラム、方法及び装置 (Original Assignee) Fuji Xerox Co Ltd; 富士ゼロックス株式会社 Junko Murakami, 淳子 村上 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (インタフェース) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007072523A CLAIM 16 請求項１〜１５のいずれか一項に記載のプログラムであって、前記コンピュータに対し、 前記メンバー候補の中から前記新たな協調作業場のメンバーとする人を選択するためのユーザインタフェース (user information) 手段を提供する、 処理を更に実行させるためのプログラム。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means (の指示) to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (インタフェース) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007072523A CLAIM 3 請求項２記載のプログラムであって、前記コンピュータに対し、 前記候補協調作業場を前記指示者に提示して、前記候補協調作業場を利用するか否かの指示 (readable instruction, instruction means, readable instruction means) を前記指示者から受け取り、 前記候補協調作業場を利用するとの指示を受けた場合は、前記新たな協調作業場を登録する代わりに、前記取得したユーザ間メッセージの内容を前記候補協調作業場に登録メッセージとして登録する、 処理を更に実行させるためのプログラム。 JP2007072523A CLAIM 16 請求項１〜１５のいずれか一項に記載のプログラムであって、前記コンピュータに対し、 前記メンバー候補の中から前記新たな協調作業場のメンバーとする人を選択するためのユーザインタフェース (user information) 手段を提供する、 処理を更に実行させるためのプログラム。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means (の指示) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (インタフェース) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2007072523A CLAIM 3 請求項２記載のプログラムであって、前記コンピュータに対し、 前記候補協調作業場を前記指示者に提示して、前記候補協調作業場を利用するか否かの指示 (readable instruction, instruction means, readable instruction means) を前記指示者から受け取り、 前記候補協調作業場を利用するとの指示を受けた場合は、前記新たな協調作業場を登録する代わりに、前記取得したユーザ間メッセージの内容を前記候補協調作業場に登録メッセージとして登録する、 処理を更に実行させるためのプログラム。 JP2007072523A CLAIM 16 請求項１〜１５のいずれか一項に記載のプログラムであって、前記コンピュータに対し、 前記メンバー候補の中から前記新たな協調作業場のメンバーとする人を選択するためのユーザインタフェース (user information) 手段を提供する、 処理を更に実行させるためのプログラム。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means (の指示) for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2007072523A CLAIM 3 請求項２記載のプログラムであって、前記コンピュータに対し、 前記候補協調作業場を前記指示者に提示して、前記候補協調作業場を利用するか否かの指示 (readable instruction, instruction means, readable instruction means) を前記指示者から受け取り、 前記候補協調作業場を利用するとの指示を受けた場合は、前記新たな協調作業場を登録する代わりに、前記取得したユーザ間メッセージの内容を前記候補協調作業場に登録メッセージとして登録する、 処理を更に実行させるためのプログラム。 |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means (の指示) for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2007072523A CLAIM 3 請求項２記載のプログラムであって、前記コンピュータに対し、 前記候補協調作業場を前記指示者に提示して、前記候補協調作業場を利用するか否かの指示 (readable instruction, instruction means, readable instruction means) を前記指示者から受け取り、 前記候補協調作業場を利用するとの指示を受けた場合は、前記新たな協調作業場を登録する代わりに、前記取得したユーザ間メッセージの内容を前記候補協調作業場に登録メッセージとして登録する、 処理を更に実行させるためのプログラム。 |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means (の指示) for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2007072523A CLAIM 3 請求項２記載のプログラムであって、前記コンピュータに対し、 前記候補協調作業場を前記指示者に提示して、前記候補協調作業場を利用するか否かの指示 (readable instruction, instruction means, readable instruction means) を前記指示者から受け取り、 前記候補協調作業場を利用するとの指示を受けた場合は、前記新たな協調作業場を登録する代わりに、前記取得したユーザ間メッセージの内容を前記候補協調作業場に登録メッセージとして登録する、 処理を更に実行させるためのプログラム。 |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means (の指示) for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2007072523A CLAIM 3 請求項２記載のプログラムであって、前記コンピュータに対し、 前記候補協調作業場を前記指示者に提示して、前記候補協調作業場を利用するか否かの指示 (readable instruction, instruction means, readable instruction means) を前記指示者から受け取り、 前記候補協調作業場を利用するとの指示を受けた場合は、前記新たな協調作業場を登録する代わりに、前記取得したユーザ間メッセージの内容を前記候補協調作業場に登録メッセージとして登録する、 処理を更に実行させるためのプログラム。 |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means (の指示) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007072523A CLAIM 3 請求項２記載のプログラムであって、前記コンピュータに対し、 前記候補協調作業場を前記指示者に提示して、前記候補協調作業場を利用するか否かの指示 (readable instruction, instruction means, readable instruction means) を前記指示者から受け取り、 前記候補協調作業場を利用するとの指示を受けた場合は、前記新たな協調作業場を登録する代わりに、前記取得したユーザ間メッセージの内容を前記候補協調作業場に登録メッセージとして登録する、 処理を更に実行させるためのプログラム。 |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means (の指示) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2007072523A CLAIM 3 請求項２記載のプログラムであって、前記コンピュータに対し、 前記候補協調作業場を前記指示者に提示して、前記候補協調作業場を利用するか否かの指示 (readable instruction, instruction means, readable instruction means) を前記指示者から受け取り、 前記候補協調作業場を利用するとの指示を受けた場合は、前記新たな協調作業場を登録する代わりに、前記取得したユーザ間メッセージの内容を前記候補協調作業場に登録メッセージとして登録する、 処理を更に実行させるためのプログラム。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20070022174A1 Filed: 2005-07-25 Issued: 2007-01-25 Syndication feeds for peer computer devices and peer networks (Original Assignee) FlashPoint Technology Inc; Qurio Holdings Inc (Current Assignee) Qurio Holdings Inc Alfredo Issa |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20070022174A1 CLAIM 34 . A computer readable medium (match server) including program instructions to be implemented by a computer , the program instructions for providing syndicated feeds from peers of a peer-to-peer network , the program instructions implementing steps comprising : receiving a request at a server for a syndicated feed from a peer on the peer-to-peer network ; determining whether the peer is currently online or offline ; pulling the requested feed from the peer and serving the requested feed to the requestor if the peer is currently online ; and retrieving the requested feed from a cache of the server and serving the requested feed to the requester if the peer is currently offline . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20070022174A1 CLAIM 34 . A computer readable medium (match server) including program instructions to be implemented by a computer , the program instructions for providing syndicated feeds from peers of a peer-to-peer network , the program instructions implementing steps comprising : receiving a request at a server for a syndicated feed from a peer on the peer-to-peer network ; determining whether the peer is currently online or offline ; pulling the requested feed from the peer and serving the requested feed to the requestor if the peer is currently online ; and retrieving the requested feed from a cache of the server and serving the requested feed to the requester if the peer is currently offline . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20070022174A1 CLAIM 34 . A computer readable medium (match server) including program instructions to be implemented by a computer , the program instructions for providing syndicated feeds from peers of a peer-to-peer network , the program instructions implementing steps comprising : receiving a request at a server for a syndicated feed from a peer on the peer-to-peer network ; determining whether the peer is currently online or offline ; pulling the requested feed from the peer and serving the requested feed to the requestor if the peer is currently online ; and retrieving the requested feed from a cache of the server and serving the requested feed to the requester if the peer is currently offline . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20070022174A1 CLAIM 34 . A computer readable medium (match server) including program instructions to be implemented by a computer , the program instructions for providing syndicated feeds from peers of a peer-to-peer network , the program instructions implementing steps comprising : receiving a request at a server for a syndicated feed from a peer on the peer-to-peer network ; determining whether the peer is currently online or offline ; pulling the requested feed from the peer and serving the requested feed to the requestor if the peer is currently online ; and retrieving the requested feed from a cache of the server and serving the requested feed to the requester if the peer is currently offline . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (web browser) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20070022174A1 CLAIM 7 . The method of claim 2 wherein the requestor is a feed portal that can communicate with the proxy node server over a network , wherein the feed portal can serve the feed to a web browser (executable instruction, computer executable instruction) on a client computer connecting to the feed portal . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20070022174A1 CLAIM 34 . A computer readable medium (match server) including program instructions to be implemented by a computer , the program instructions for providing syndicated feeds from peers of a peer-to-peer network , the program instructions implementing steps comprising : receiving a request at a server for a syndicated feed from a peer on the peer-to-peer network ; determining whether the peer is currently online or offline ; pulling the requested feed from the peer and serving the requested feed to the requestor if the peer is currently online ; and retrieving the requested feed from a cache of the server and serving the requested feed to the requester if the peer is currently offline . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20070022174A1 CLAIM 34 . A computer readable medium (match server) including program instructions to be implemented by a computer , the program instructions for providing syndicated feeds from peers of a peer-to-peer network , the program instructions implementing steps comprising : receiving a request at a server for a syndicated feed from a peer on the peer-to-peer network ; determining whether the peer is currently online or offline ; pulling the requested feed from the peer and serving the requested feed to the requestor if the peer is currently online ; and retrieving the requested feed from a cache of the server and serving the requested feed to the requester if the peer is currently offline . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20070022174A1 CLAIM 34 . A computer readable medium (match server) including program instructions to be implemented by a computer , the program instructions for providing syndicated feeds from peers of a peer-to-peer network , the program instructions implementing steps comprising : receiving a request at a server for a syndicated feed from a peer on the peer-to-peer network ; determining whether the peer is currently online or offline ; pulling the requested feed from the peer and serving the requested feed to the requestor if the peer is currently online ; and retrieving the requested feed from a cache of the server and serving the requested feed to the requester if the peer is currently offline . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20070022174A1 CLAIM 34 . A computer readable medium (match server) including program instructions to be implemented by a computer , the program instructions for providing syndicated feeds from peers of a peer-to-peer network , the program instructions implementing steps comprising : receiving a request at a server for a syndicated feed from a peer on the peer-to-peer network ; determining whether the peer is currently online or offline ; pulling the requested feed from the peer and serving the requested feed to the requestor if the peer is currently online ; and retrieving the requested feed from a cache of the server and serving the requested feed to the requester if the peer is currently offline . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20070022174A1 CLAIM 34 . A computer readable medium (match server) including program instructions to be implemented by a computer , the program instructions for providing syndicated feeds from peers of a peer-to-peer network , the program instructions implementing steps comprising : receiving a request at a server for a syndicated feed from a peer on the peer-to-peer network ; determining whether the peer is currently online or offline ; pulling the requested feed from the peer and serving the requested feed to the requestor if the peer is currently online ; and retrieving the requested feed from a cache of the server and serving the requested feed to the requester if the peer is currently offline . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20070022174A1 CLAIM 34 . A computer readable medium (match server) including program instructions to be implemented by a computer , the program instructions for providing syndicated feeds from peers of a peer-to-peer network , the program instructions implementing steps comprising : receiving a request at a server for a syndicated feed from a peer on the peer-to-peer network ; determining whether the peer is currently online or offline ; pulling the requested feed from the peer and serving the requested feed to the requestor if the peer is currently online ; and retrieving the requested feed from a cache of the server and serving the requested feed to the requester if the peer is currently offline . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20070022174A1 CLAIM 34 . A computer readable medium (match server) including program instructions to be implemented by a computer , the program instructions for providing syndicated feeds from peers of a peer-to-peer network , the program instructions implementing steps comprising : receiving a request at a server for a syndicated feed from a peer on the peer-to-peer network ; determining whether the peer is currently online or offline ; pulling the requested feed from the peer and serving the requested feed to the requestor if the peer is currently online ; and retrieving the requested feed from a cache of the server and serving the requested feed to the requester if the peer is currently offline . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20070022174A1 CLAIM 34 . A computer readable medium (match server) including program instructions to be implemented by a computer , the program instructions for providing syndicated feeds from peers of a peer-to-peer network , the program instructions implementing steps comprising : receiving a request at a server for a syndicated feed from a peer on the peer-to-peer network ; determining whether the peer is currently online or offline ; pulling the requested feed from the peer and serving the requested feed to the requestor if the peer is currently online ; and retrieving the requested feed from a cache of the server and serving the requested feed to the requester if the peer is currently offline . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20080256070A1 Filed: 2005-06-17 Issued: 2008-10-16 Data Collection Cataloguing and Searching Method and System (Original Assignee) Reel Two Ltd (Current Assignee) REAL TIME GENOMICS Ltd Stuart John Inglis |
|---|---|
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (maximum number) of members that fall within the maximum and minimum match percentage . |
US20080256070A1 CLAIM 15 . A method of cataloguing a data collection as claimed in claim 1 , further characterised by ; (vii) forming at least one ordered content data structure which defines a number of storage positions equal to the maximum number (maximum number) of unique data elements which can exist , (viii) associating with each storage position at least one data element , and (ix) storing within each storage position of the content data structure a positive or negative indicator depending on whether said at least one data element associated with the storage position is present within the data collection . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080256070A1 CLAIM 24 . Computer executable instructions stored on a computer readable medium (match server) , said computer executable instructions being adapted to execute the method of cataloguing a data structure as claimed in claim 1 . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080256070A1 CLAIM 24 . Computer executable instructions stored on a computer readable medium (match server) , said computer executable instructions being adapted to execute the method of cataloguing a data structure as claimed in claim 1 . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080256070A1 CLAIM 24 . Computer executable instructions stored on a computer readable medium (match server) , said computer executable instructions being adapted to execute the method of cataloguing a data structure as claimed in claim 1 . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080256070A1 CLAIM 24 . Computer executable instructions stored on a computer readable medium (match server) , said computer executable instructions being adapted to execute the method of cataloguing a data structure as claimed in claim 1 . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (computer executable instruction) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20080256070A1 CLAIM 24 . Computer executable instructions stored on a computer readable medium , said computer executable instruction (computer executable instruction) s being adapted to execute the method of cataloguing a data structure as claimed in claim 1 . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (maximum number) of members that fall within the maximum and minimum match percentage . |
US20080256070A1 CLAIM 15 . A method of cataloguing a data collection as claimed in claim 1 , further characterised by ; (vii) forming at least one ordered content data structure which defines a number of storage positions equal to the maximum number (maximum number) of unique data elements which can exist , (viii) associating with each storage position at least one data element , and (ix) storing within each storage position of the content data structure a positive or negative indicator depending on whether said at least one data element associated with the storage position is present within the data collection . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080256070A1 CLAIM 24 . Computer executable instructions stored on a computer readable medium (match server) , said computer executable instructions being adapted to execute the method of cataloguing a data structure as claimed in claim 1 . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080256070A1 CLAIM 24 . Computer executable instructions stored on a computer readable medium (match server) , said computer executable instructions being adapted to execute the method of cataloguing a data structure as claimed in claim 1 . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080256070A1 CLAIM 24 . Computer executable instructions stored on a computer readable medium (match server) , said computer executable instructions being adapted to execute the method of cataloguing a data structure as claimed in claim 1 . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080256070A1 CLAIM 24 . Computer executable instructions stored on a computer readable medium (match server) , said computer executable instructions being adapted to execute the method of cataloguing a data structure as claimed in claim 1 . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (maximum number) of members that fall within the maximum and minimum match percentage . |
US20080256070A1 CLAIM 15 . A method of cataloguing a data collection as claimed in claim 1 , further characterised by ; (vii) forming at least one ordered content data structure which defines a number of storage positions equal to the maximum number (maximum number) of unique data elements which can exist , (viii) associating with each storage position at least one data element , and (ix) storing within each storage position of the content data structure a positive or negative indicator depending on whether said at least one data element associated with the storage position is present within the data collection . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080256070A1 CLAIM 24 . Computer executable instructions stored on a computer readable medium (match server) , said computer executable instructions being adapted to execute the method of cataloguing a data structure as claimed in claim 1 . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080256070A1 CLAIM 24 . Computer executable instructions stored on a computer readable medium (match server) , said computer executable instructions being adapted to execute the method of cataloguing a data structure as claimed in claim 1 . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20080256070A1 CLAIM 24 . Computer executable instructions stored on a computer readable medium (match server) , said computer executable instructions being adapted to execute the method of cataloguing a data structure as claimed in claim 1 . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20080256070A1 CLAIM 24 . Computer executable instructions stored on a computer readable medium (match server) , said computer executable instructions being adapted to execute the method of cataloguing a data structure as claimed in claim 1 . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20050278703A1 Filed: 2005-06-15 Issued: 2005-12-15 Method for using statistical analysis to monitor and analyze performance of new network infrastructure or software applications for deployment thereof (Original Assignee) K5 Systems Inc (Current Assignee) K5 Systems Inc Kevin Lo, Richard Chung |
|---|---|
| US9087321B2 CLAIM 3 . The poll-based networking system as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage (standard deviation) . |
US20050278703A1 CLAIM 7 . The method of claim 1 wherein deriving the first and second statistical descriptions of behavior includes deriving at least statistical means and standard deviation (match percentage) s of at least a subset of data elements within the acquired time-series data . |
| US9087321B2 CLAIM 4 . The poll-based networking system as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage (standard deviation) , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20050278703A1 CLAIM 7 . The method of claim 1 wherein deriving the first and second statistical descriptions of behavior includes deriving at least statistical means and standard deviation (match percentage) s of at least a subset of data elements within the acquired time-series data . |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (standard deviation) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20050278703A1 CLAIM 7 . The method of claim 1 wherein deriving the first and second statistical descriptions of behavior includes deriving at least statistical means and standard deviation (match percentage) s of at least a subset of data elements within the acquired time-series data . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (expected behavior) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20050278703A1 CLAIM 1 . A method of monitoring a release of executing software applications or execution infrastructure to detect deviations in performance , said method comprising : acquiring a first set of time-series data from executing software applications and execution infrastructure ; deriving a first statistical description of expected behavior (match servers) from said first set of acquired data ; acquiring a second set of time-series data from the monitored release of executing software applications and execution infrastructure ; deriving a second statistical description of behavior from said second set of acquired data ; comparing the first and second statistical descriptions to identify instances where the first and second statistical descriptions deviate sufficiently to indicate a statistically significant probability that an operating anomaly exists within the monitored release of executing software applications and execution infrastructure . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (expected behavior) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20050278703A1 CLAIM 1 . A method of monitoring a release of executing software applications or execution infrastructure to detect deviations in performance , said method comprising : acquiring a first set of time-series data from executing software applications and execution infrastructure ; deriving a first statistical description of expected behavior (match servers) from said first set of acquired data ; acquiring a second set of time-series data from the monitored release of executing software applications and execution infrastructure ; deriving a second statistical description of behavior from said second set of acquired data ; comparing the first and second statistical descriptions to identify instances where the first and second statistical descriptions deviate sufficiently to indicate a statistically significant probability that an operating anomaly exists within the monitored release of executing software applications and execution infrastructure . |
| US9087321B2 CLAIM 12 . The computer implemented method as set forth in claim 11 , wherein , in cumulatively comparing , further comprising an act of causing the one or more processors to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage (standard deviation) . |
US20050278703A1 CLAIM 7 . The method of claim 1 wherein deriving the first and second statistical descriptions of behavior includes deriving at least statistical means and standard deviation (match percentage) s of at least a subset of data elements within the acquired time-series data . |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage (standard deviation) , further comprising an act of causing the one or more processors to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20050278703A1 CLAIM 7 . The method of claim 1 wherein deriving the first and second statistical descriptions of behavior includes deriving at least statistical means and standard deviation (match percentage) s of at least a subset of data elements within the acquired time-series data . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (standard deviation) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20050278703A1 CLAIM 7 . The method of claim 1 wherein deriving the first and second statistical descriptions of behavior includes deriving at least statistical means and standard deviation (match percentage) s of at least a subset of data elements within the acquired time-series data . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (expected behavior) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20050278703A1 CLAIM 1 . A method of monitoring a release of executing software applications or execution infrastructure to detect deviations in performance , said method comprising : acquiring a first set of time-series data from executing software applications and execution infrastructure ; deriving a first statistical description of expected behavior (match servers) from said first set of acquired data ; acquiring a second set of time-series data from the monitored release of executing software applications and execution infrastructure ; deriving a second statistical description of behavior from said second set of acquired data ; comparing the first and second statistical descriptions to identify instances where the first and second statistical descriptions deviate sufficiently to indicate a statistically significant probability that an operating anomaly exists within the monitored release of executing software applications and execution infrastructure . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (expected behavior) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20050278703A1 CLAIM 1 . A method of monitoring a release of executing software applications or execution infrastructure to detect deviations in performance , said method comprising : acquiring a first set of time-series data from executing software applications and execution infrastructure ; deriving a first statistical description of expected behavior (match servers) from said first set of acquired data ; acquiring a second set of time-series data from the monitored release of executing software applications and execution infrastructure ; deriving a second statistical description of behavior from said second set of acquired data ; comparing the first and second statistical descriptions to identify instances where the first and second statistical descriptions deviate sufficiently to indicate a statistically significant probability that an operating anomaly exists within the monitored release of executing software applications and execution infrastructure . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage (standard deviation) . |
US20050278703A1 CLAIM 7 . The method of claim 1 wherein deriving the first and second statistical descriptions of behavior includes deriving at least statistical means and standard deviation (match percentage) s of at least a subset of data elements within the acquired time-series data . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage (standard deviation) between the user and the selected other user . |
US20050278703A1 CLAIM 7 . The method of claim 1 wherein deriving the first and second statistical descriptions of behavior includes deriving at least statistical means and standard deviation (match percentage) s of at least a subset of data elements within the acquired time-series data . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (standard deviation) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20050278703A1 CLAIM 7 . The method of claim 1 wherein deriving the first and second statistical descriptions of behavior includes deriving at least statistical means and standard deviation (match percentage) s of at least a subset of data elements within the acquired time-series data . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (expected behavior) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20050278703A1 CLAIM 1 . A method of monitoring a release of executing software applications or execution infrastructure to detect deviations in performance , said method comprising : acquiring a first set of time-series data from executing software applications and execution infrastructure ; deriving a first statistical description of expected behavior (match servers) from said first set of acquired data ; acquiring a second set of time-series data from the monitored release of executing software applications and execution infrastructure ; deriving a second statistical description of behavior from said second set of acquired data ; comparing the first and second statistical descriptions to identify instances where the first and second statistical descriptions deviate sufficiently to indicate a statistically significant probability that an operating anomaly exists within the monitored release of executing software applications and execution infrastructure . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (expected behavior) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20050278703A1 CLAIM 1 . A method of monitoring a release of executing software applications or execution infrastructure to detect deviations in performance , said method comprising : acquiring a first set of time-series data from executing software applications and execution infrastructure ; deriving a first statistical description of expected behavior (match servers) from said first set of acquired data ; acquiring a second set of time-series data from the monitored release of executing software applications and execution infrastructure ; deriving a second statistical description of behavior from said second set of acquired data ; comparing the first and second statistical descriptions to identify instances where the first and second statistical descriptions deviate sufficiently to indicate a statistically significant probability that an operating anomaly exists within the monitored release of executing software applications and execution infrastructure . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20060256074A1 Filed: 2005-05-13 Issued: 2006-11-16 Sensor-initiated exchange of information between devices (Original Assignee) Robert Bosch GmbH (Current Assignee) Robert Bosch GmbH David Krum, Hauke Schmidt |
|---|---|
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (executable instruction) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20060256074A1 CLAIM 25 . A machine-readable medium that includes executable instruction (executable instruction) s , which when executed in a processing system , initiates an automatic exchange of data between two devices by : identifying motion signatures of devices as associated with at least one gesture performed with the device ; exchanging the identified motion signatures among the devices and identifying two or more of the devices with matching motion signatures ; and selecting data in accordance with the identified gesture and automatically initiating exchange of the selected data between the two or more devices . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US7647312B2 Filed: 2005-05-12 Issued: 2010-01-12 System and method for automatic generation of suggested inline search terms (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC James Dai |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (real time) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profile, usage data) of other users that have a likelihood of match within a predetermined threshold . |
US7647312B2 CLAIM 1 . A computer system for automatically generating a set of suggested search terms , comprising : a user-interface (UI) input on a lightweight communication device to receive a search input on a character-by-character basis , wherein the lightweight communication device having minimal computational resources , and wherein the minimal computation resources being configured to communicate an inputted portion of the search input on a character-by-character basis to a computing device without performing operations that generate the set of suggested search terms ; the computing device configured to execute arbitration logic , the arbitration logic configured to communicate with the lightweight communication device and process the inputted portion of the search input upon receiving the communication of each character of the search input on the character-by-character basis from the lightweight communication device , to recursively generate a set of suggested search terms in real time (data processing system) coincident with user entry of each character of the search input by repeatedly accessing a query history data store , and to communicate the set of suggested search terms to the lightweight communication device coincident with the entry of each character , wherein the computing device is part of a search service having sufficient computational resources to perform the operations that generate the set of suggested search terms in real time ; the query history data store to monitor and maintain prior search inputs ; and a user-interface output on the lightweight communication device for automatically presenting the set of suggested search terms , wherein presenting comprises : (a) rendering the set of suggested search terms via a selectable format at a UI display , wherein the set of suggested search terms is updated upon the computing device generating the set of search terms in real time coincident with the entry of each character at the UI input ; and (b) rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the arbitration logic that incorporates those modifications in subsequent sets of suggested search terms . US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile, usage data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (search service) of members that fall within the maximum and minimum match percentage . |
US7647312B2 CLAIM 1 . A computer system for automatically generating a set of suggested search terms , comprising : a user-interface (UI) input on a lightweight communication device to receive a search input on a character-by-character basis , wherein the lightweight communication device having minimal computational resources , and wherein the minimal computation resources being configured to communicate an inputted portion of the search input on a character-by-character basis to a computing device without performing operations that generate the set of suggested search terms ; the computing device configured to execute arbitration logic , the arbitration logic configured to communicate with the lightweight communication device and process the inputted portion of the search input upon receiving the communication of each character of the search input on the character-by-character basis from the lightweight communication device , to recursively generate a set of suggested search terms in real time coincident with user entry of each character of the search input by repeatedly accessing a query history data store , and to communicate the set of suggested search terms to the lightweight communication device coincident with the entry of each character , wherein the computing device is part of a search service (maximum number) having sufficient computational resources to perform the operations that generate the set of suggested search terms in real time ; the query history data store to monitor and maintain prior search inputs ; and a user-interface output on the lightweight communication device for automatically presenting the set of suggested search terms , wherein presenting comprises : (a) rendering the set of suggested search terms via a selectable format at a UI display , wherein the set of suggested search terms is updated upon the computing device generating the set of search terms in real time coincident with the entry of each character at the UI input ; and (b) rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the arbitration logic that incorporates those modifications in subsequent sets of suggested search terms . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (user profile, usage data) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (user profile, usage data) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (user profile, usage data) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (user profile, usage data) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means (computational resources) to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profile, usage data) of other users that have a likelihood of match within a predetermined threshold . |
US7647312B2 CLAIM 1 . A computer system for automatically generating a set of suggested search terms , comprising : a user-interface (UI) input on a lightweight communication device to receive a search input on a character-by-character basis , wherein the lightweight communication device having minimal computational resources (instruction means) , and wherein the minimal computation resources being configured to communicate an inputted portion of the search input on a character-by-character basis to a computing device without performing operations that generate the set of suggested search terms ; the computing device configured to execute arbitration logic , the arbitration logic configured to communicate with the lightweight communication device and process the inputted portion of the search input upon receiving the communication of each character of the search input on the character-by-character basis from the lightweight communication device , to recursively generate a set of suggested search terms in real time coincident with user entry of each character of the search input by repeatedly accessing a query history data store , and to communicate the set of suggested search terms to the lightweight communication device coincident with the entry of each character , wherein the computing device is part of a search service having sufficient computational resources to perform the operations that generate the set of suggested search terms in real time ; the query history data store to monitor and maintain prior search inputs ; and a user-interface output on the lightweight communication device for automatically presenting the set of suggested search terms , wherein presenting comprises : (a) rendering the set of suggested search terms via a selectable format at a UI display , wherein the set of suggested search terms is updated upon the computing device generating the set of search terms in real time coincident with the entry of each character at the UI input ; and (b) rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the arbitration logic that incorporates those modifications in subsequent sets of suggested search terms . US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile, usage data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (search service) of members that fall within the maximum and minimum match percentage . |
US7647312B2 CLAIM 1 . A computer system for automatically generating a set of suggested search terms , comprising : a user-interface (UI) input on a lightweight communication device to receive a search input on a character-by-character basis , wherein the lightweight communication device having minimal computational resources , and wherein the minimal computation resources being configured to communicate an inputted portion of the search input on a character-by-character basis to a computing device without performing operations that generate the set of suggested search terms ; the computing device configured to execute arbitration logic , the arbitration logic configured to communicate with the lightweight communication device and process the inputted portion of the search input upon receiving the communication of each character of the search input on the character-by-character basis from the lightweight communication device , to recursively generate a set of suggested search terms in real time coincident with user entry of each character of the search input by repeatedly accessing a query history data store , and to communicate the set of suggested search terms to the lightweight communication device coincident with the entry of each character , wherein the computing device is part of a search service (maximum number) having sufficient computational resources to perform the operations that generate the set of suggested search terms in real time ; the query history data store to monitor and maintain prior search inputs ; and a user-interface output on the lightweight communication device for automatically presenting the set of suggested search terms , wherein presenting comprises : (a) rendering the set of suggested search terms via a selectable format at a UI display , wherein the set of suggested search terms is updated upon the computing device generating the set of search terms in real time coincident with the entry of each character at the UI input ; and (b) rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the arbitration logic that incorporates those modifications in subsequent sets of suggested search terms . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (user profile, usage data) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (user profile, usage data) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (user profile, usage data) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (user profile, usage data) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means (computational resources) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profile, usage data) of other users that have a likelihood of match within a predetermined threshold . |
US7647312B2 CLAIM 1 . A computer system for automatically generating a set of suggested search terms , comprising : a user-interface (UI) input on a lightweight communication device to receive a search input on a character-by-character basis , wherein the lightweight communication device having minimal computational resources (instruction means) , and wherein the minimal computation resources being configured to communicate an inputted portion of the search input on a character-by-character basis to a computing device without performing operations that generate the set of suggested search terms ; the computing device configured to execute arbitration logic , the arbitration logic configured to communicate with the lightweight communication device and process the inputted portion of the search input upon receiving the communication of each character of the search input on the character-by-character basis from the lightweight communication device , to recursively generate a set of suggested search terms in real time coincident with user entry of each character of the search input by repeatedly accessing a query history data store , and to communicate the set of suggested search terms to the lightweight communication device coincident with the entry of each character , wherein the computing device is part of a search service having sufficient computational resources to perform the operations that generate the set of suggested search terms in real time ; the query history data store to monitor and maintain prior search inputs ; and a user-interface output on the lightweight communication device for automatically presenting the set of suggested search terms , wherein presenting comprises : (a) rendering the set of suggested search terms via a selectable format at a UI display , wherein the set of suggested search terms is updated upon the computing device generating the set of search terms in real time coincident with the entry of each character at the UI input ; and (b) rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the arbitration logic that incorporates those modifications in subsequent sets of suggested search terms . US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means (computational resources) for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile, usage data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7647312B2 CLAIM 1 . A computer system for automatically generating a set of suggested search terms , comprising : a user-interface (UI) input on a lightweight communication device to receive a search input on a character-by-character basis , wherein the lightweight communication device having minimal computational resources (instruction means) , and wherein the minimal computation resources being configured to communicate an inputted portion of the search input on a character-by-character basis to a computing device without performing operations that generate the set of suggested search terms ; the computing device configured to execute arbitration logic , the arbitration logic configured to communicate with the lightweight communication device and process the inputted portion of the search input upon receiving the communication of each character of the search input on the character-by-character basis from the lightweight communication device , to recursively generate a set of suggested search terms in real time coincident with user entry of each character of the search input by repeatedly accessing a query history data store , and to communicate the set of suggested search terms to the lightweight communication device coincident with the entry of each character , wherein the computing device is part of a search service having sufficient computational resources to perform the operations that generate the set of suggested search terms in real time ; the query history data store to monitor and maintain prior search inputs ; and a user-interface output on the lightweight communication device for automatically presenting the set of suggested search terms , wherein presenting comprises : (a) rendering the set of suggested search terms via a selectable format at a UI display , wherein the set of suggested search terms is updated upon the computing device generating the set of search terms in real time coincident with the entry of each character at the UI input ; and (b) rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the arbitration logic that incorporates those modifications in subsequent sets of suggested search terms . US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means (computational resources) for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US7647312B2 CLAIM 1 . A computer system for automatically generating a set of suggested search terms , comprising : a user-interface (UI) input on a lightweight communication device to receive a search input on a character-by-character basis , wherein the lightweight communication device having minimal computational resources (instruction means) , and wherein the minimal computation resources being configured to communicate an inputted portion of the search input on a character-by-character basis to a computing device without performing operations that generate the set of suggested search terms ; the computing device configured to execute arbitration logic , the arbitration logic configured to communicate with the lightweight communication device and process the inputted portion of the search input upon receiving the communication of each character of the search input on the character-by-character basis from the lightweight communication device , to recursively generate a set of suggested search terms in real time coincident with user entry of each character of the search input by repeatedly accessing a query history data store , and to communicate the set of suggested search terms to the lightweight communication device coincident with the entry of each character , wherein the computing device is part of a search service having sufficient computational resources to perform the operations that generate the set of suggested search terms in real time ; the query history data store to monitor and maintain prior search inputs ; and a user-interface output on the lightweight communication device for automatically presenting the set of suggested search terms , wherein presenting comprises : (a) rendering the set of suggested search terms via a selectable format at a UI display , wherein the set of suggested search terms is updated upon the computing device generating the set of search terms in real time coincident with the entry of each character at the UI input ; and (b) rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the arbitration logic that incorporates those modifications in subsequent sets of suggested search terms . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means (computational resources) for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US7647312B2 CLAIM 1 . A computer system for automatically generating a set of suggested search terms , comprising : a user-interface (UI) input on a lightweight communication device to receive a search input on a character-by-character basis , wherein the lightweight communication device having minimal computational resources (instruction means) , and wherein the minimal computation resources being configured to communicate an inputted portion of the search input on a character-by-character basis to a computing device without performing operations that generate the set of suggested search terms ; the computing device configured to execute arbitration logic , the arbitration logic configured to communicate with the lightweight communication device and process the inputted portion of the search input upon receiving the communication of each character of the search input on the character-by-character basis from the lightweight communication device , to recursively generate a set of suggested search terms in real time coincident with user entry of each character of the search input by repeatedly accessing a query history data store , and to communicate the set of suggested search terms to the lightweight communication device coincident with the entry of each character , wherein the computing device is part of a search service having sufficient computational resources to perform the operations that generate the set of suggested search terms in real time ; the query history data store to monitor and maintain prior search inputs ; and a user-interface output on the lightweight communication device for automatically presenting the set of suggested search terms , wherein presenting comprises : (a) rendering the set of suggested search terms via a selectable format at a UI display , wherein the set of suggested search terms is updated upon the computing device generating the set of search terms in real time coincident with the entry of each character at the UI input ; and (b) rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the arbitration logic that incorporates those modifications in subsequent sets of suggested search terms . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means (computational resources) for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (search service) of members that fall within the maximum and minimum match percentage . |
US7647312B2 CLAIM 1 . A computer system for automatically generating a set of suggested search terms , comprising : a user-interface (UI) input on a lightweight communication device to receive a search input on a character-by-character basis , wherein the lightweight communication device having minimal computational resources (instruction means) , and wherein the minimal computation resources being configured to communicate an inputted portion of the search input on a character-by-character basis to a computing device without performing operations that generate the set of suggested search terms ; the computing device configured to execute arbitration logic , the arbitration logic configured to communicate with the lightweight communication device and process the inputted portion of the search input upon receiving the communication of each character of the search input on the character-by-character basis from the lightweight communication device , to recursively generate a set of suggested search terms in real time coincident with user entry of each character of the search input by repeatedly accessing a query history data store , and to communicate the set of suggested search terms to the lightweight communication device coincident with the entry of each character , wherein the computing device is part of a search service (maximum number) having sufficient computational resources to perform the operations that generate the set of suggested search terms in real time ; the query history data store to monitor and maintain prior search inputs ; and a user-interface output on the lightweight communication device for automatically presenting the set of suggested search terms , wherein presenting comprises : (a) rendering the set of suggested search terms via a selectable format at a UI display , wherein the set of suggested search terms is updated upon the computing device generating the set of search terms in real time coincident with the entry of each character at the UI input ; and (b) rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the arbitration logic that incorporates those modifications in subsequent sets of suggested search terms . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means (computational resources) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (user profile, usage data) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7647312B2 CLAIM 1 . A computer system for automatically generating a set of suggested search terms , comprising : a user-interface (UI) input on a lightweight communication device to receive a search input on a character-by-character basis , wherein the lightweight communication device having minimal computational resources (instruction means) , and wherein the minimal computation resources being configured to communicate an inputted portion of the search input on a character-by-character basis to a computing device without performing operations that generate the set of suggested search terms ; the computing device configured to execute arbitration logic , the arbitration logic configured to communicate with the lightweight communication device and process the inputted portion of the search input upon receiving the communication of each character of the search input on the character-by-character basis from the lightweight communication device , to recursively generate a set of suggested search terms in real time coincident with user entry of each character of the search input by repeatedly accessing a query history data store , and to communicate the set of suggested search terms to the lightweight communication device coincident with the entry of each character , wherein the computing device is part of a search service having sufficient computational resources to perform the operations that generate the set of suggested search terms in real time ; the query history data store to monitor and maintain prior search inputs ; and a user-interface output on the lightweight communication device for automatically presenting the set of suggested search terms , wherein presenting comprises : (a) rendering the set of suggested search terms via a selectable format at a UI display , wherein the set of suggested search terms is updated upon the computing device generating the set of search terms in real time coincident with the entry of each character at the UI input ; and (b) rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the arbitration logic that incorporates those modifications in subsequent sets of suggested search terms . US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (user profile, usage data) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means (computational resources) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (user profile, usage data) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (user profile, usage data) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7647312B2 CLAIM 5 . A system according to claim 1 , wherein the arbitration logic is further configured to access aggregate usage data (user profiles, match server) to generate the set of suggested search terms . US7647312B2 CLAIM 9 . A client device that performs a method for automatically generating a set of suggested search terms , the method comprising : aggregating a user' ; s search behavior ; establishing a user profile (user profiles, match server) based upon the aggregation , wherein the user profile is automatically refined upon detecting the user' ; s search behavior ; receiving a search input ; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input ; generating a set of suggested search terms by interrogating the user profile with the parsed search input ; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time ; rendering the set of suggested search terms at a UI display , wherein the set of suggested search terms is updated in real time on a character-by-character basis ; and rendering a set of selectable edit options at the UI display that , when selected , modify one or more of the rendered set of suggested search terms , wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US7593740B2 Filed: 2005-05-11 Issued: 2009-09-22 Location-based social software for mobile devices (Original Assignee) Google LLC (Current Assignee) Google LLC Dennis P. Crowley, Alexander M. Rainert |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (particular relationship) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user location) of other users that have a likelihood of match within a predetermined threshold . |
US7593740B2 CLAIM 2 . The method of claim 1 , wherein the user location (user profiles) s are determined by converting a location name to a set of corresponding location coordinates . US7593740B2 CLAIM 20 . A system for providing information about acquaintances , comprising : an interface to receive a message from a first user of the system ; means for identifying a set of users of a particular relationship (receiving user information) to the first user within a particular proximity of the first user ; and a message generator to prepare messages for the set of users , including information about the location of the first user , in response to the message from the first user , wherein the message generator is configured to prepare a first message for a first user about the location of a second user who is identified as a friend of the first user , and to prepare a message for the second user about the location of the first user . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user location) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7593740B2 CLAIM 2 . The method of claim 1 , wherein the user location (user profiles) s are determined by converting a location name to a set of corresponding location coordinates . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (particular relationship) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user location) of other users that have a likelihood of match within a predetermined threshold . |
US7593740B2 CLAIM 2 . The method of claim 1 , wherein the user location (user profiles) s are determined by converting a location name to a set of corresponding location coordinates . US7593740B2 CLAIM 20 . A system for providing information about acquaintances , comprising : an interface to receive a message from a first user of the system ; means for identifying a set of users of a particular relationship (receiving user information) to the first user within a particular proximity of the first user ; and a message generator to prepare messages for the set of users , including information about the location of the first user , in response to the message from the first user , wherein the message generator is configured to prepare a first message for a first user about the location of a second user who is identified as a friend of the first user , and to prepare a message for the second user about the location of the first user . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user location) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7593740B2 CLAIM 2 . The method of claim 1 , wherein the user location (user profiles) s are determined by converting a location name to a set of corresponding location coordinates . |
| US9087321B2 CLAIM 19 . A computer program product (location info) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations (location info) of : receiving user information (particular relationship) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user location) of other users that have a likelihood of match within a predetermined threshold . |
US7593740B2 CLAIM 2 . The method of claim 1 , wherein the user location (user profiles) s are determined by converting a location name to a set of corresponding location coordinates . US7593740B2 CLAIM 15 . A system for providing information about acquaintances , comprising : an interface to receive messages from users of the system providing information associated with their location ; a location engine configured to correlate the received location info (computer program product, computer to perform operations) rmation to a location identifier that may be compared to other location identifiers ; an acquaintance identifier configured to identify acquaintances of users who provide location information to the system ; and a message generator to prepare messages to users regarding the locations of their acquaintances if those locations are proximate to the users , wherein the message generator is configured to prepare a first message for a first user about the location of a second user who is identified as a friend of the first user , and to prepare a message for the second user about the location of the first user . US7593740B2 CLAIM 20 . A system for providing information about acquaintances , comprising : an interface to receive a message from a first user of the system ; means for identifying a set of users of a particular relationship (receiving user information) to the first user within a particular proximity of the first user ; and a message generator to prepare messages for the set of users , including information about the location of the first user , in response to the message from the first user , wherein the message generator is configured to prepare a first message for a first user about the location of a second user who is identified as a friend of the first user , and to prepare a message for the second user about the location of the first user . |
| US9087321B2 CLAIM 20 . The computer program product (location info) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations (location info) of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user location) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7593740B2 CLAIM 2 . The method of claim 1 , wherein the user location (user profiles) s are determined by converting a location name to a set of corresponding location coordinates . US7593740B2 CLAIM 15 . A system for providing information about acquaintances , comprising : an interface to receive messages from users of the system providing information associated with their location ; a location engine configured to correlate the received location info (computer program product, computer to perform operations) rmation to a location identifier that may be compared to other location identifiers ; an acquaintance identifier configured to identify acquaintances of users who provide location information to the system ; and a message generator to prepare messages to users regarding the locations of their acquaintances if those locations are proximate to the users , wherein the message generator is configured to prepare a first message for a first user about the location of a second user who is identified as a friend of the first user , and to prepare a message for the second user about the location of the first user . |
| US9087321B2 CLAIM 21 . The computer program product (location info) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations (location info) of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US7593740B2 CLAIM 15 . A system for providing information about acquaintances , comprising : an interface to receive messages from users of the system providing information associated with their location ; a location engine configured to correlate the received location info (computer program product, computer to perform operations) rmation to a location identifier that may be compared to other location identifiers ; an acquaintance identifier configured to identify acquaintances of users who provide location information to the system ; and a message generator to prepare messages to users regarding the locations of their acquaintances if those locations are proximate to the users , wherein the message generator is configured to prepare a first message for a first user about the location of a second user who is identified as a friend of the first user , and to prepare a message for the second user about the location of the first user . |
| US9087321B2 CLAIM 22 . The computer program product (location info) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations (location info) of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US7593740B2 CLAIM 15 . A system for providing information about acquaintances , comprising : an interface to receive messages from users of the system providing information associated with their location ; a location engine configured to correlate the received location info (computer program product, computer to perform operations) rmation to a location identifier that may be compared to other location identifiers ; an acquaintance identifier configured to identify acquaintances of users who provide location information to the system ; and a message generator to prepare messages to users regarding the locations of their acquaintances if those locations are proximate to the users , wherein the message generator is configured to prepare a first message for a first user about the location of a second user who is identified as a friend of the first user , and to prepare a message for the second user about the location of the first user . |
| US9087321B2 CLAIM 23 . The computer program product (location info) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations (location info) of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US7593740B2 CLAIM 15 . A system for providing information about acquaintances , comprising : an interface to receive messages from users of the system providing information associated with their location ; a location engine configured to correlate the received location info (computer program product, computer to perform operations) rmation to a location identifier that may be compared to other location identifiers ; an acquaintance identifier configured to identify acquaintances of users who provide location information to the system ; and a message generator to prepare messages to users regarding the locations of their acquaintances if those locations are proximate to the users , wherein the message generator is configured to prepare a first message for a first user about the location of a second user who is identified as a friend of the first user , and to prepare a message for the second user about the location of the first user . |
| US9087321B2 CLAIM 24 . The computer program product (location info) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations (location info) of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7593740B2 CLAIM 15 . A system for providing information about acquaintances , comprising : an interface to receive messages from users of the system providing information associated with their location ; a location engine configured to correlate the received location info (computer program product, computer to perform operations) rmation to a location identifier that may be compared to other location identifiers ; an acquaintance identifier configured to identify acquaintances of users who provide location information to the system ; and a message generator to prepare messages to users regarding the locations of their acquaintances if those locations are proximate to the users , wherein the message generator is configured to prepare a first message for a first user about the location of a second user who is identified as a friend of the first user , and to prepare a message for the second user about the location of the first user . |
| US9087321B2 CLAIM 25 . The computer program product (location info) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7593740B2 CLAIM 15 . A system for providing information about acquaintances , comprising : an interface to receive messages from users of the system providing information associated with their location ; a location engine configured to correlate the received location info (computer program product, computer to perform operations) rmation to a location identifier that may be compared to other location identifiers ; an acquaintance identifier configured to identify acquaintances of users who provide location information to the system ; and a message generator to prepare messages to users regarding the locations of their acquaintances if those locations are proximate to the users , wherein the message generator is configured to prepare a first message for a first user about the location of a second user who is identified as a friend of the first user , and to prepare a message for the second user about the location of the first user . |
| US9087321B2 CLAIM 26 . The computer program product (location info) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations (location info) of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7593740B2 CLAIM 15 . A system for providing information about acquaintances , comprising : an interface to receive messages from users of the system providing information associated with their location ; a location engine configured to correlate the received location info (computer program product, computer to perform operations) rmation to a location identifier that may be compared to other location identifiers ; an acquaintance identifier configured to identify acquaintances of users who provide location information to the system ; and a message generator to prepare messages to users regarding the locations of their acquaintances if those locations are proximate to the users , wherein the message generator is configured to prepare a first message for a first user about the location of a second user who is identified as a friend of the first user , and to prepare a message for the second user about the location of the first user . |
| US9087321B2 CLAIM 27 . The computer program product (location info) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7593740B2 CLAIM 15 . A system for providing information about acquaintances , comprising : an interface to receive messages from users of the system providing information associated with their location ; a location engine configured to correlate the received location info (computer program product, computer to perform operations) rmation to a location identifier that may be compared to other location identifiers ; an acquaintance identifier configured to identify acquaintances of users who provide location information to the system ; and a message generator to prepare messages to users regarding the locations of their acquaintances if those locations are proximate to the users , wherein the message generator is configured to prepare a first message for a first user about the location of a second user who is identified as a friend of the first user , and to prepare a message for the second user about the location of the first user . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20060242014A1 Filed: 2005-04-25 Issued: 2006-10-26 Contacts networking technology (Original Assignee) Marshall Charles T; James Fan Charles Marshall, James Fan |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system (networking system) , comprising : a data processing system (real time) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20060242014A1 CLAIM 1 . A contacts networking system (networking system) , comprising : a webserver for receiving http requests from a plurality of client browsers and for answering them with http responses ; a campaign controller for accepting incentive programs and for issuing emails to a plurality of first level of contacts inviting them to help or to supply referrals to a second level of contacts , wherein said emails include hyperlinks to connect back to the webserver for a webpage to enter said second level of contacts ; a tracking engine for responding to said hyperlinks by collecting email addresses of a plurality of second level contacts supplied by individual ones of said first level contacts , and for issuing emails to said second level of contacts inviting them to help or to supply referrals to a third level of contacts , wherein said emails include hyperlinks to connect back to the webserver , and for reporting message chains that describe which contacts have referred other contacts ; and an incentive engine for distributing incentives to particular said contacts according to parameters extracted from said incentive programs and said message chains . US20060242014A1 CLAIM 7 . A contacts networking system , comprising : a webserver for receiving http requests from a plurality of client browsers and for answering them with http responses ; a campaign controller for accepting incentive programs and for issuing emails to a plurality of first level of contacts inviting them to help or to supply referrals to a second level of contacts , wherein said emails include hyperlinks to connect back to the webserver for a webpage to enter said second level of contacts ; a tracking engine for responding to said hyperlinks by collecting email addresses of a plurality of second level contacts supplied by individual ones of said first level contacts , and for issuing emails to said second level of contacts inviting them to help or to supply referrals to a third level of contacts , wherein said emails include hyperlinks to connect back to the webserver , and for reporting message chains that describe which contacts have referred other contacts ; an incentive engine for distributing incentives to particular said contacts according to parameters extracted from said incentive programs and said message chains ; means for individual account access for each participant ; means for automated incentive creation and management ; an embedded email address manager with viral forwarding functionality and ability to automatically refer a candidate ; means for resume storage and handling ; a directory service for locating current email addresses of persons known to said contacts ; means for real time (data processing system) referral tracking for all responses ; means for multi-level organization administration ; and means for automatic non-duplicate email detection and handling . |
| US9087321B2 CLAIM 2 . The poll-based networking system (networking system) as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20060242014A1 CLAIM 1 . A contacts networking system (networking system) , comprising : a webserver for receiving http requests from a plurality of client browsers and for answering them with http responses ; a campaign controller for accepting incentive programs and for issuing emails to a plurality of first level of contacts inviting them to help or to supply referrals to a second level of contacts , wherein said emails include hyperlinks to connect back to the webserver for a webpage to enter said second level of contacts ; a tracking engine for responding to said hyperlinks by collecting email addresses of a plurality of second level contacts supplied by individual ones of said first level contacts , and for issuing emails to said second level of contacts inviting them to help or to supply referrals to a third level of contacts , wherein said emails include hyperlinks to connect back to the webserver , and for reporting message chains that describe which contacts have referred other contacts ; and an incentive engine for distributing incentives to particular said contacts according to parameters extracted from said incentive programs and said message chains . |
| US9087321B2 CLAIM 3 . The poll-based networking system (networking system) as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20060242014A1 CLAIM 1 . A contacts networking system (networking system) , comprising : a webserver for receiving http requests from a plurality of client browsers and for answering them with http responses ; a campaign controller for accepting incentive programs and for issuing emails to a plurality of first level of contacts inviting them to help or to supply referrals to a second level of contacts , wherein said emails include hyperlinks to connect back to the webserver for a webpage to enter said second level of contacts ; a tracking engine for responding to said hyperlinks by collecting email addresses of a plurality of second level contacts supplied by individual ones of said first level contacts , and for issuing emails to said second level of contacts inviting them to help or to supply referrals to a third level of contacts , wherein said emails include hyperlinks to connect back to the webserver , and for reporting message chains that describe which contacts have referred other contacts ; and an incentive engine for distributing incentives to particular said contacts according to parameters extracted from said incentive programs and said message chains . |
| US9087321B2 CLAIM 4 . The poll-based networking system (networking system) as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20060242014A1 CLAIM 1 . A contacts networking system (networking system) , comprising : a webserver for receiving http requests from a plurality of client browsers and for answering them with http responses ; a campaign controller for accepting incentive programs and for issuing emails to a plurality of first level of contacts inviting them to help or to supply referrals to a second level of contacts , wherein said emails include hyperlinks to connect back to the webserver for a webpage to enter said second level of contacts ; a tracking engine for responding to said hyperlinks by collecting email addresses of a plurality of second level contacts supplied by individual ones of said first level contacts , and for issuing emails to said second level of contacts inviting them to help or to supply referrals to a third level of contacts , wherein said emails include hyperlinks to connect back to the webserver , and for reporting message chains that describe which contacts have referred other contacts ; and an incentive engine for distributing incentives to particular said contacts according to parameters extracted from said incentive programs and said message chains . |
| US9087321B2 CLAIM 5 . The poll-based networking system (networking system) as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20060242014A1 CLAIM 1 . A contacts networking system (networking system) , comprising : a webserver for receiving http requests from a plurality of client browsers and for answering them with http responses ; a campaign controller for accepting incentive programs and for issuing emails to a plurality of first level of contacts inviting them to help or to supply referrals to a second level of contacts , wherein said emails include hyperlinks to connect back to the webserver for a webpage to enter said second level of contacts ; a tracking engine for responding to said hyperlinks by collecting email addresses of a plurality of second level contacts supplied by individual ones of said first level contacts , and for issuing emails to said second level of contacts inviting them to help or to supply referrals to a third level of contacts , wherein said emails include hyperlinks to connect back to the webserver , and for reporting message chains that describe which contacts have referred other contacts ; and an incentive engine for distributing incentives to particular said contacts according to parameters extracted from said incentive programs and said message chains . |
| US9087321B2 CLAIM 6 . The poll-based networking system (networking system) as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20060242014A1 CLAIM 1 . A contacts networking system (networking system) , comprising : a webserver for receiving http requests from a plurality of client browsers and for answering them with http responses ; a campaign controller for accepting incentive programs and for issuing emails to a plurality of first level of contacts inviting them to help or to supply referrals to a second level of contacts , wherein said emails include hyperlinks to connect back to the webserver for a webpage to enter said second level of contacts ; a tracking engine for responding to said hyperlinks by collecting email addresses of a plurality of second level contacts supplied by individual ones of said first level contacts , and for issuing emails to said second level of contacts inviting them to help or to supply referrals to a third level of contacts , wherein said emails include hyperlinks to connect back to the webserver , and for reporting message chains that describe which contacts have referred other contacts ; and an incentive engine for distributing incentives to particular said contacts according to parameters extracted from said incentive programs and said message chains . |
| US9087321B2 CLAIM 7 . The poll-based networking system (networking system) as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20060242014A1 CLAIM 1 . A contacts networking system (networking system) , comprising : a webserver for receiving http requests from a plurality of client browsers and for answering them with http responses ; a campaign controller for accepting incentive programs and for issuing emails to a plurality of first level of contacts inviting them to help or to supply referrals to a second level of contacts , wherein said emails include hyperlinks to connect back to the webserver for a webpage to enter said second level of contacts ; a tracking engine for responding to said hyperlinks by collecting email addresses of a plurality of second level contacts supplied by individual ones of said first level contacts , and for issuing emails to said second level of contacts inviting them to help or to supply referrals to a third level of contacts , wherein said emails include hyperlinks to connect back to the webserver , and for reporting message chains that describe which contacts have referred other contacts ; and an incentive engine for distributing incentives to particular said contacts according to parameters extracted from said incentive programs and said message chains . |
| US9087321B2 CLAIM 8 . The poll-based networking system (networking system) as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20060242014A1 CLAIM 1 . A contacts networking system (networking system) , comprising : a webserver for receiving http requests from a plurality of client browsers and for answering them with http responses ; a campaign controller for accepting incentive programs and for issuing emails to a plurality of first level of contacts inviting them to help or to supply referrals to a second level of contacts , wherein said emails include hyperlinks to connect back to the webserver for a webpage to enter said second level of contacts ; a tracking engine for responding to said hyperlinks by collecting email addresses of a plurality of second level contacts supplied by individual ones of said first level contacts , and for issuing emails to said second level of contacts inviting them to help or to supply referrals to a third level of contacts , wherein said emails include hyperlinks to connect back to the webserver , and for reporting message chains that describe which contacts have referred other contacts ; and an incentive engine for distributing incentives to particular said contacts according to parameters extracted from said incentive programs and said message chains . |
| US9087321B2 CLAIM 9 . The poll-based networking system (networking system) as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20060242014A1 CLAIM 1 . A contacts networking system (networking system) , comprising : a webserver for receiving http requests from a plurality of client browsers and for answering them with http responses ; a campaign controller for accepting incentive programs and for issuing emails to a plurality of first level of contacts inviting them to help or to supply referrals to a second level of contacts , wherein said emails include hyperlinks to connect back to the webserver for a webpage to enter said second level of contacts ; a tracking engine for responding to said hyperlinks by collecting email addresses of a plurality of second level contacts supplied by individual ones of said first level contacts , and for issuing emails to said second level of contacts inviting them to help or to supply referrals to a third level of contacts , wherein said emails include hyperlinks to connect back to the webserver , and for reporting message chains that describe which contacts have referred other contacts ; and an incentive engine for distributing incentives to particular said contacts according to parameters extracted from said incentive programs and said message chains . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20050278325A1 Filed: 2005-03-09 Issued: 2005-12-15 Graph-based ranking algorithms for text processing (Original Assignee) University of North Texas (Current Assignee) University of North Texas Rada Mihalcea, Paul Tarau |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (reverse order) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20050278325A1 CLAIM 44 . The method of claim 43 , wherein determining the plurality of rankings comprises sorting the sentences in reverse order (first polling, first polling question) based upon the second plurality of scores . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (reverse order) question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (visual indication) . |
US20050278325A1 CLAIM 44 . The method of claim 43 , wherein determining the plurality of rankings comprises sorting the sentences in reverse order (first polling, first polling question) based upon the second plurality of scores . US20050278325A1 CLAIM 46 . A method for graphical visualization of a natural language text , comprising : determining a plurality of text units based upon the natural language text ; associating the plurality of text units with a plurality of graph nodes ; determining at least one connecting relation between at least two of the plurality of text units ; associating the at least one connecting relation with at least one graph edge connecting at least two of the plurality of graph nodes ; determining a plurality of rankings associated with the plurality of graph nodes based upon the at least one graph edge ; and providing a visual indication (next polling questions) for each text unit based on the plurality of rankings . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (selected number) per user . |
US20050278325A1 CLAIM 45 . The method of claim 44 , wherein selecting at least one of the plurality of sentences comprises selecting a selected number (m rows) of sentences having the highest rankings . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (selected number) per user . |
US20050278325A1 CLAIM 45 . The method of claim 44 , wherein selecting at least one of the plurality of sentences comprises selecting a selected number (m rows) of sentences having the highest rankings . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (reverse order) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20050278325A1 CLAIM 44 . The method of claim 43 , wherein determining the plurality of rankings comprises sorting the sentences in reverse order (first polling, first polling question) based upon the second plurality of scores . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (reverse order) question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (visual indication) . |
US20050278325A1 CLAIM 44 . The method of claim 43 , wherein determining the plurality of rankings comprises sorting the sentences in reverse order (first polling, first polling question) based upon the second plurality of scores . US20050278325A1 CLAIM 46 . A method for graphical visualization of a natural language text , comprising : determining a plurality of text units based upon the natural language text ; associating the plurality of text units with a plurality of graph nodes ; determining at least one connecting relation between at least two of the plurality of text units ; associating the at least one connecting relation with at least one graph edge connecting at least two of the plurality of graph nodes ; determining a plurality of rankings associated with the plurality of graph nodes based upon the at least one graph edge ; and providing a visual indication (next polling questions) for each text unit based on the plurality of rankings . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (selected number) per user . |
US20050278325A1 CLAIM 45 . The method of claim 44 , wherein selecting at least one of the plurality of sentences comprises selecting a selected number (m rows) of sentences having the highest rankings . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (selected number) per user . |
US20050278325A1 CLAIM 45 . The method of claim 44 , wherein selecting at least one of the plurality of sentences comprises selecting a selected number (m rows) of sentences having the highest rankings . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (reverse order) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20050278325A1 CLAIM 44 . The method of claim 43 , wherein determining the plurality of rankings comprises sorting the sentences in reverse order (first polling, first polling question) based upon the second plurality of scores . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (reverse order) question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (visual indication) . |
US20050278325A1 CLAIM 44 . The method of claim 43 , wherein determining the plurality of rankings comprises sorting the sentences in reverse order (first polling, first polling question) based upon the second plurality of scores . US20050278325A1 CLAIM 46 . A method for graphical visualization of a natural language text , comprising : determining a plurality of text units based upon the natural language text ; associating the plurality of text units with a plurality of graph nodes ; determining at least one connecting relation between at least two of the plurality of text units ; associating the at least one connecting relation with at least one graph edge connecting at least two of the plurality of graph nodes ; determining a plurality of rankings associated with the plurality of graph nodes based upon the at least one graph edge ; and providing a visual indication (next polling questions) for each text unit based on the plurality of rankings . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (selected number) per user . |
US20050278325A1 CLAIM 45 . The method of claim 44 , wherein selecting at least one of the plurality of sentences comprises selecting a selected number (m rows) of sentences having the highest rankings . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (selected number) per user . |
US20050278325A1 CLAIM 45 . The method of claim 44 , wherein selecting at least one of the plurality of sentences comprises selecting a selected number (m rows) of sentences having the highest rankings . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20050222931A1 Filed: 2005-02-24 Issued: 2005-10-06 Real time data integration services for financial information data integration (Original Assignee) Ascential Software Corp (Current Assignee) International Business Machines Corp Jean-Claude Mamou, Lee Scheffler |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (real time) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20050222931A1 CLAIM 1 . A method , comprising : providing a code module for executing a data integration job ; providing a registry of services ; identifying the code module in the registry of services ; and facilitating access to the code module in real time (data processing system) from the registry of services via a services oriented architecture , wherein the code module enables a data integration job that is associated with a database of financial information . |
| US9087321B2 CLAIM 3 . The poll-based networking system as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage (mapping function) . |
US20050222931A1 CLAIM 7 . The method of claim 1 wherein the data integration job performs a mapping function (match percentage, minimum match percentage) . |
| US9087321B2 CLAIM 4 . The poll-based networking system as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage (mapping function) , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20050222931A1 CLAIM 7 . The method of claim 1 wherein the data integration job performs a mapping function (match percentage, minimum match percentage) . |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (mapping function) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20050222931A1 CLAIM 7 . The method of claim 1 wherein the data integration job performs a mapping function (match percentage, minimum match percentage) . |
| US9087321B2 CLAIM 12 . The computer implemented method as set forth in claim 11 , wherein , in cumulatively comparing , further comprising an act of causing the one or more processors to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage (mapping function) . |
US20050222931A1 CLAIM 7 . The method of claim 1 wherein the data integration job performs a mapping function (match percentage, minimum match percentage) . |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage (mapping function) , further comprising an act of causing the one or more processors to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20050222931A1 CLAIM 7 . The method of claim 1 wherein the data integration job performs a mapping function (match percentage, minimum match percentage) . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (mapping function) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20050222931A1 CLAIM 7 . The method of claim 1 wherein the data integration job performs a mapping function (match percentage, minimum match percentage) . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage (mapping function) . |
US20050222931A1 CLAIM 7 . The method of claim 1 wherein the data integration job performs a mapping function (match percentage, minimum match percentage) . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage (mapping function) between the user and the selected other user . |
US20050222931A1 CLAIM 7 . The method of claim 1 wherein the data integration job performs a mapping function (match percentage, minimum match percentage) . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (mapping function) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20050222931A1 CLAIM 7 . The method of claim 1 wherein the data integration job performs a mapping function (match percentage, minimum match percentage) . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2006227965A Filed: 2005-02-18 Issued: 2006-08-31 Trend prediction apparatus and trend prediction method (Original Assignee) Dainippon Printing Co Ltd; 大日本印刷株式会社 Ikumi Fukuda, Eisuke Ishikawa, Mitsuaki Morimoto, Osamu Nakagawa, Tomohiro Nihongi, 修 中川, 智洋 二本木, 光昭 森本, 英介 石川, 郁美 福田 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system (apparatus) , comprising : a data processing system (apparatus) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question (collecting step) , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2006227965A CLAIM 2 請求項１に記載のトレンド予測装置において、前記情報収集手段がアクセスする前記Ｗｅｂサイトは、ウェブログが更新されたことを示すｐｉｎｇ情報を記憶している更新通知ｐｉｎｇサーバであって、前記情報収集手段が収集する前記風評情報は、前記更新通知ｐｉｎｇサーバに記憶された前記ｐｉｎｇ情報、もしくは、前記ｐｉｎｇ情報と前記ｐｉｎｇ情報で示される前記ウェブログで公開されている情報であることを特徴とするトレンド予測装置。 The trend prediction apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein the Web site accessed by the information collection unit is an update notification ping server storing ping information indicating that a web log has been updated , and the information collection unit The reputation information collected by the means is the ping information stored in the update notification ping server , or information published in the web log indicated by the ping information and the ping information . Trend prediction device . JP2006227965A CLAIM 10 請求項９に記載のトレンド予測方法において、前記情報収集工程でアクセスする前記Ｗｅｂサイトは、ウェブログが更新されたことを示すｐｉｎｇ情報が記憶された更新通知ｐｉｎｇサーバであって、収集される前記風評情報は更新通知ｐｉｎｇサーバに記憶された前記ｐｉｎｇ情報、もしくは、前記ｐｉｎｇ情報と前記ｐｉｎｇ情報で示される前記ウェブログで公開されている情報であることを特徴とするトレンド予測方法。 10 . The trend prediction method according to claim 9 , wherein the Web site accessed in the information collecting step (first polling question) is an update notification ping server storing ping information indicating that a web log has been updated , and is collected . Reputation information is the said ping information memorize | stored in the update notification ping server , or the information currently disclosed by the said web log shown by the said ping information and the said ping information , The trend prediction method characterized by the above-mentioned . |
| US9087321B2 CLAIM 2 . The poll-based networking system (apparatus) as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question (collecting step) and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2006227965A CLAIM 2 請求項１に記載のトレンド予測装置において、前記情報収集手段がアクセスする前記Ｗｅｂサイトは、ウェブログが更新されたことを示すｐｉｎｇ情報を記憶している更新通知ｐｉｎｇサーバであって、前記情報収集手段が収集する前記風評情報は、前記更新通知ｐｉｎｇサーバに記憶された前記ｐｉｎｇ情報、もしくは、前記ｐｉｎｇ情報と前記ｐｉｎｇ情報で示される前記ウェブログで公開されている情報であることを特徴とするトレンド予測装置。 The trend prediction apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein the Web site accessed by the information collection unit is an update notification ping server storing ping information indicating that a web log has been updated , and the information collection unit The reputation information collected by the means is the ping information stored in the update notification ping server , or information published in the web log indicated by the ping information and the ping information . Trend prediction device . JP2006227965A CLAIM 10 請求項９に記載のトレンド予測方法において、前記情報収集工程でアクセスする前記Ｗｅｂサイトは、ウェブログが更新されたことを示すｐｉｎｇ情報が記憶された更新通知ｐｉｎｇサーバであって、収集される前記風評情報は更新通知ｐｉｎｇサーバに記憶された前記ｐｉｎｇ情報、もしくは、前記ｐｉｎｇ情報と前記ｐｉｎｇ情報で示される前記ウェブログで公開されている情報であることを特徴とするトレンド予測方法。 10 . The trend prediction method according to claim 9 , wherein the Web site accessed in the information collecting step (first polling question) is an update notification ping server storing ping information indicating that a web log has been updated , and is collected . Reputation information is the said ping information memorize | stored in the update notification ping server , or the information currently disclosed by the said web log shown by the said ping information and the said ping information , The trend prediction method characterized by the above-mentioned . |
| US9087321B2 CLAIM 3 . The poll-based networking system (apparatus) as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2006227965A CLAIM 2 請求項１に記載のトレンド予測装置において、前記情報収集手段がアクセスする前記Ｗｅｂサイトは、ウェブログが更新されたことを示すｐｉｎｇ情報を記憶している更新通知ｐｉｎｇサーバであって、前記情報収集手段が収集する前記風評情報は、前記更新通知ｐｉｎｇサーバに記憶された前記ｐｉｎｇ情報、もしくは、前記ｐｉｎｇ情報と前記ｐｉｎｇ情報で示される前記ウェブログで公開されている情報であることを特徴とするトレンド予測装置。 The trend prediction apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein the Web site accessed by the information collection unit is an update notification ping server storing ping information indicating that a web log has been updated , and the information collection unit The reputation information collected by the means is the ping information stored in the update notification ping server , or information published in the web log indicated by the ping information and the ping information . Trend prediction device . |
| US9087321B2 CLAIM 4 . The poll-based networking system (apparatus) as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2006227965A CLAIM 2 請求項１に記載のトレンド予測装置において、前記情報収集手段がアクセスする前記Ｗｅｂサイトは、ウェブログが更新されたことを示すｐｉｎｇ情報を記憶している更新通知ｐｉｎｇサーバであって、前記情報収集手段が収集する前記風評情報は、前記更新通知ｐｉｎｇサーバに記憶された前記ｐｉｎｇ情報、もしくは、前記ｐｉｎｇ情報と前記ｐｉｎｇ情報で示される前記ウェブログで公開されている情報であることを特徴とするトレンド予測装置。 The trend prediction apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein the Web site accessed by the information collection unit is an update notification ping server storing ping information indicating that a web log has been updated , and the information collection unit The reputation information collected by the means is the ping information stored in the update notification ping server , or information published in the web log indicated by the ping information and the ping information . Trend prediction device . |
| US9087321B2 CLAIM 5 . The poll-based networking system (apparatus) as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2006227965A CLAIM 2 請求項１に記載のトレンド予測装置において、前記情報収集手段がアクセスする前記Ｗｅｂサイトは、ウェブログが更新されたことを示すｐｉｎｇ情報を記憶している更新通知ｐｉｎｇサーバであって、前記情報収集手段が収集する前記風評情報は、前記更新通知ｐｉｎｇサーバに記憶された前記ｐｉｎｇ情報、もしくは、前記ｐｉｎｇ情報と前記ｐｉｎｇ情報で示される前記ウェブログで公開されている情報であることを特徴とするトレンド予測装置。 The trend prediction apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein the Web site accessed by the information collection unit is an update notification ping server storing ping information indicating that a web log has been updated , and the information collection unit The reputation information collected by the means is the ping information stored in the update notification ping server , or information published in the web log indicated by the ping information and the ping information . Trend prediction device . |
| US9087321B2 CLAIM 6 . The poll-based networking system (apparatus) as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2006227965A CLAIM 2 請求項１に記載のトレンド予測装置において、前記情報収集手段がアクセスする前記Ｗｅｂサイトは、ウェブログが更新されたことを示すｐｉｎｇ情報を記憶している更新通知ｐｉｎｇサーバであって、前記情報収集手段が収集する前記風評情報は、前記更新通知ｐｉｎｇサーバに記憶された前記ｐｉｎｇ情報、もしくは、前記ｐｉｎｇ情報と前記ｐｉｎｇ情報で示される前記ウェブログで公開されている情報であることを特徴とするトレンド予測装置。 The trend prediction apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein the Web site accessed by the information collection unit is an update notification ping server storing ping information indicating that a web log has been updated , and the information collection unit The reputation information collected by the means is the ping information stored in the update notification ping server , or information published in the web log indicated by the ping information and the ping information . Trend prediction device . |
| US9087321B2 CLAIM 7 . The poll-based networking system (apparatus) as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2006227965A CLAIM 2 請求項１に記載のトレンド予測装置において、前記情報収集手段がアクセスする前記Ｗｅｂサイトは、ウェブログが更新されたことを示すｐｉｎｇ情報を記憶している更新通知ｐｉｎｇサーバであって、前記情報収集手段が収集する前記風評情報は、前記更新通知ｐｉｎｇサーバに記憶された前記ｐｉｎｇ情報、もしくは、前記ｐｉｎｇ情報と前記ｐｉｎｇ情報で示される前記ウェブログで公開されている情報であることを特徴とするトレンド予測装置。 The trend prediction apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein the Web site accessed by the information collection unit is an update notification ping server storing ping information indicating that a web log has been updated , and the information collection unit The reputation information collected by the means is the ping information stored in the update notification ping server , or information published in the web log indicated by the ping information and the ping information . Trend prediction device . |
| US9087321B2 CLAIM 8 . The poll-based networking system (apparatus) as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2006227965A CLAIM 2 請求項１に記載のトレンド予測装置において、前記情報収集手段がアクセスする前記Ｗｅｂサイトは、ウェブログが更新されたことを示すｐｉｎｇ情報を記憶している更新通知ｐｉｎｇサーバであって、前記情報収集手段が収集する前記風評情報は、前記更新通知ｐｉｎｇサーバに記憶された前記ｐｉｎｇ情報、もしくは、前記ｐｉｎｇ情報と前記ｐｉｎｇ情報で示される前記ウェブログで公開されている情報であることを特徴とするトレンド予測装置。 The trend prediction apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein the Web site accessed by the information collection unit is an update notification ping server storing ping information indicating that a web log has been updated , and the information collection unit The reputation information collected by the means is the ping information stored in the update notification ping server , or information published in the web log indicated by the ping information and the ping information . Trend prediction device . |
| US9087321B2 CLAIM 9 . The poll-based networking system (apparatus) as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2006227965A CLAIM 2 請求項１に記載のトレンド予測装置において、前記情報収集手段がアクセスする前記Ｗｅｂサイトは、ウェブログが更新されたことを示すｐｉｎｇ情報を記憶している更新通知ｐｉｎｇサーバであって、前記情報収集手段が収集する前記風評情報は、前記更新通知ｐｉｎｇサーバに記憶された前記ｐｉｎｇ情報、もしくは、前記ｐｉｎｇ情報と前記ｐｉｎｇ情報で示される前記ウェブログで公開されている情報であることを特徴とするトレンド予測装置。 The trend prediction apparatus (networking system, data processing system, data processing system having one) according to claim 1 , wherein the Web site accessed by the information collection unit is an update notification ping server storing ping information indicating that a web log has been updated , and the information collection unit The reputation information collected by the means is the ping information stored in the update notification ping server , or information published in the web log indicated by the ping information and the ping information . Trend prediction device . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question (collecting step) , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2006227965A CLAIM 10 請求項９に記載のトレンド予測方法において、前記情報収集工程でアクセスする前記Ｗｅｂサイトは、ウェブログが更新されたことを示すｐｉｎｇ情報が記憶された更新通知ｐｉｎｇサーバであって、収集される前記風評情報は更新通知ｐｉｎｇサーバに記憶された前記ｐｉｎｇ情報、もしくは、前記ｐｉｎｇ情報と前記ｐｉｎｇ情報で示される前記ウェブログで公開されている情報であることを特徴とするトレンド予測方法。 10 . The trend prediction method according to claim 9 , wherein the Web site accessed in the information collecting step (first polling question) is an update notification ping server storing ping information indicating that a web log has been updated , and is collected . Reputation information is the said ping information memorize | stored in the update notification ping server , or the information currently disclosed by the said web log shown by the said ping information and the said ping information , The trend prediction method characterized by the above-mentioned . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question (collecting step) and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2006227965A CLAIM 10 請求項９に記載のトレンド予測方法において、前記情報収集工程でアクセスする前記Ｗｅｂサイトは、ウェブログが更新されたことを示すｐｉｎｇ情報が記憶された更新通知ｐｉｎｇサーバであって、収集される前記風評情報は更新通知ｐｉｎｇサーバに記憶された前記ｐｉｎｇ情報、もしくは、前記ｐｉｎｇ情報と前記ｐｉｎｇ情報で示される前記ウェブログで公開されている情報であることを特徴とするトレンド予測方法。 10 . The trend prediction method according to claim 9 , wherein the Web site accessed in the information collecting step (first polling question) is an update notification ping server storing ping information indicating that a web log has been updated , and is collected . Reputation information is the said ping information memorize | stored in the update notification ping server , or the information currently disclosed by the said web log shown by the said ping information and the said ping information , The trend prediction method characterized by the above-mentioned . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question (collecting step) , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2006227965A CLAIM 10 請求項９に記載のトレンド予測方法において、前記情報収集工程でアクセスする前記Ｗｅｂサイトは、ウェブログが更新されたことを示すｐｉｎｇ情報が記憶された更新通知ｐｉｎｇサーバであって、収集される前記風評情報は更新通知ｐｉｎｇサーバに記憶された前記ｐｉｎｇ情報、もしくは、前記ｐｉｎｇ情報と前記ｐｉｎｇ情報で示される前記ウェブログで公開されている情報であることを特徴とするトレンド予測方法。 10 . The trend prediction method according to claim 9 , wherein the Web site accessed in the information collecting step (first polling question) is an update notification ping server storing ping information indicating that a web log has been updated , and is collected . Reputation information is the said ping information memorize | stored in the update notification ping server , or the information currently disclosed by the said web log shown by the said ping information and the said ping information , The trend prediction method characterized by the above-mentioned . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question (collecting step) and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2006227965A CLAIM 10 請求項９に記載のトレンド予測方法において、前記情報収集工程でアクセスする前記Ｗｅｂサイトは、ウェブログが更新されたことを示すｐｉｎｇ情報が記憶された更新通知ｐｉｎｇサーバであって、収集される前記風評情報は更新通知ｐｉｎｇサーバに記憶された前記ｐｉｎｇ情報、もしくは、前記ｐｉｎｇ情報と前記ｐｉｎｇ情報で示される前記ウェブログで公開されている情報であることを特徴とするトレンド予測方法。 10 . The trend prediction method according to claim 9 , wherein the Web site accessed in the information collecting step (first polling question) is an update notification ping server storing ping information indicating that a web log has been updated , and is collected . Reputation information is the said ping information memorize | stored in the update notification ping server , or the information currently disclosed by the said web log shown by the said ping information and the said ping information , The trend prediction method characterized by the above-mentioned . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US7310676B2 Filed: 2005-02-08 Issued: 2007-12-18 Method and computer system for matching mobile device users for business and social networking (Original Assignee) Proxpro Inc (Current Assignee) OL Security LLC Julian J. Bourne |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (profile data) of other users that have a likelihood of match within a predetermined threshold . |
US7310676B2 CLAIM 1 . Apparatus for identifying and introducing mobile device users to one another , wherein a given mobile device user has been registered by submitting given profile data (user profiles) , comprising : at least one processor ; code executable on the processor (a) for receiving a message from a first mobile device user that the first mobile device user desires to be introduced at least one other mobile device user ; (b) for initiating a request to identify a current location of the first mobile device user , (c) for receiving data identifying the location of the first mobile device user ; (d) for determining , based on the given profile data , whether a second mobile device user is within intellectual proximity to the first mobile device user , wherein intellectual proximity is determined at least in part by relative management stratum of the first and second mobile device users , wherein management stratum is afforded a first weight when each of the first and second mobile device users expresses a specific business networking intent objective , and a second weight , less than the first weight , when each of the first and second mobile device users expresses a non-specific business networking intent objective , (e) when the first and second mobile device users are in intellectual proximity , for issuing a mutual collaboration opportunity message to each the first and second mobile device users to determine whether the first and second mobile device users desire to be introduced to one another , the mutual collaboration opportunity message masking personally identifying information , and (f) upon the first and second mobile device users agreeing to be introduced , for establishing a direct private messaging session between the first and second mobile device users . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question (time window) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7310676B2 CLAIM 1 . Apparatus for identifying and introducing mobile device users to one another , wherein a given mobile device user has been registered by submitting given profile data (user profiles) , comprising : at least one processor ; code executable on the processor (a) for receiving a message from a first mobile device user that the first mobile device user desires to be introduced at least one other mobile device user ; (b) for initiating a request to identify a current location of the first mobile device user , (c) for receiving data identifying the location of the first mobile device user ; (d) for determining , based on the given profile data , whether a second mobile device user is within intellectual proximity to the first mobile device user , wherein intellectual proximity is determined at least in part by relative management stratum of the first and second mobile device users , wherein management stratum is afforded a first weight when each of the first and second mobile device users expresses a specific business networking intent objective , and a second weight , less than the first weight , when each of the first and second mobile device users expresses a non-specific business networking intent objective , (e) when the first and second mobile device users are in intellectual proximity , for issuing a mutual collaboration opportunity message to each the first and second mobile device users to determine whether the first and second mobile device users desire to be introduced to one another , the mutual collaboration opportunity message masking personally identifying information , and (f) upon the first and second mobile device users agreeing to be introduced , for establishing a direct private messaging session between the first and second mobile device users . US7310676B2 CLAIM 7 . A method , operating in a server , for enabling mobile device users to meet one another , the mobile device users being within a given physical proximity during an overlapping time window (next polling question) , comprising : based on given profile data provided by each of first and second mobile device users , determining whether the first and second mobile devices users are within a given intellectual proximity , wherein intellectual proximity is determined by relative management stratum of the first and second mobile device users and how much time has elapsed since the respective first or second mobile device user first provides an indication that such mobile device user is available to receive a prospective introduction ; when the first and second mobile device users are within a given intellectual proximity , issuing a mutual collaboration opportunity message to each the first and second mobile device users to determine whether the first and second mobile device users desire to be introduced to one another , the mutual collaboration opportunity message masking personally identifying information ; and upon the first and second mobile device users agreeing to be introduced , establishing a direct private messaging session between the first and second mobile device users . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7310676B2 CLAIM 12 . The method as described in claim 11 wherein the publicly available data is searched using the World Wide Web (web server) . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7310676B2 CLAIM 12 . The method as described in claim 11 wherein the publicly available data is searched using the World Wide Web (web server) . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (profile data) of other users that have a likelihood of match within a predetermined threshold . |
US7310676B2 CLAIM 1 . Apparatus for identifying and introducing mobile device users to one another , wherein a given mobile device user has been registered by submitting given profile data (user profiles) , comprising : at least one processor ; code executable on the processor (a) for receiving a message from a first mobile device user that the first mobile device user desires to be introduced at least one other mobile device user ; (b) for initiating a request to identify a current location of the first mobile device user , (c) for receiving data identifying the location of the first mobile device user ; (d) for determining , based on the given profile data , whether a second mobile device user is within intellectual proximity to the first mobile device user , wherein intellectual proximity is determined at least in part by relative management stratum of the first and second mobile device users , wherein management stratum is afforded a first weight when each of the first and second mobile device users expresses a specific business networking intent objective , and a second weight , less than the first weight , when each of the first and second mobile device users expresses a non-specific business networking intent objective , (e) when the first and second mobile device users are in intellectual proximity , for issuing a mutual collaboration opportunity message to each the first and second mobile device users to determine whether the first and second mobile device users desire to be introduced to one another , the mutual collaboration opportunity message masking personally identifying information , and (f) upon the first and second mobile device users agreeing to be introduced , for establishing a direct private messaging session between the first and second mobile device users . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question (time window) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7310676B2 CLAIM 1 . Apparatus for identifying and introducing mobile device users to one another , wherein a given mobile device user has been registered by submitting given profile data (user profiles) , comprising : at least one processor ; code executable on the processor (a) for receiving a message from a first mobile device user that the first mobile device user desires to be introduced at least one other mobile device user ; (b) for initiating a request to identify a current location of the first mobile device user , (c) for receiving data identifying the location of the first mobile device user ; (d) for determining , based on the given profile data , whether a second mobile device user is within intellectual proximity to the first mobile device user , wherein intellectual proximity is determined at least in part by relative management stratum of the first and second mobile device users , wherein management stratum is afforded a first weight when each of the first and second mobile device users expresses a specific business networking intent objective , and a second weight , less than the first weight , when each of the first and second mobile device users expresses a non-specific business networking intent objective , (e) when the first and second mobile device users are in intellectual proximity , for issuing a mutual collaboration opportunity message to each the first and second mobile device users to determine whether the first and second mobile device users desire to be introduced to one another , the mutual collaboration opportunity message masking personally identifying information , and (f) upon the first and second mobile device users agreeing to be introduced , for establishing a direct private messaging session between the first and second mobile device users . US7310676B2 CLAIM 7 . A method , operating in a server , for enabling mobile device users to meet one another , the mobile device users being within a given physical proximity during an overlapping time window (next polling question) , comprising : based on given profile data provided by each of first and second mobile device users , determining whether the first and second mobile devices users are within a given intellectual proximity , wherein intellectual proximity is determined by relative management stratum of the first and second mobile device users and how much time has elapsed since the respective first or second mobile device user first provides an indication that such mobile device user is available to receive a prospective introduction ; when the first and second mobile device users are within a given intellectual proximity , issuing a mutual collaboration opportunity message to each the first and second mobile device users to determine whether the first and second mobile device users desire to be introduced to one another , the mutual collaboration opportunity message masking personally identifying information ; and upon the first and second mobile device users agreeing to be introduced , establishing a direct private messaging session between the first and second mobile device users . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7310676B2 CLAIM 12 . The method as described in claim 11 wherein the publicly available data is searched using the World Wide Web (web server) . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7310676B2 CLAIM 12 . The method as described in claim 11 wherein the publicly available data is searched using the World Wide Web (web server) . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (profile data) of other users that have a likelihood of match within a predetermined threshold . |
US7310676B2 CLAIM 1 . Apparatus for identifying and introducing mobile device users to one another , wherein a given mobile device user has been registered by submitting given profile data (user profiles) , comprising : at least one processor ; code executable on the processor (a) for receiving a message from a first mobile device user that the first mobile device user desires to be introduced at least one other mobile device user ; (b) for initiating a request to identify a current location of the first mobile device user , (c) for receiving data identifying the location of the first mobile device user ; (d) for determining , based on the given profile data , whether a second mobile device user is within intellectual proximity to the first mobile device user , wherein intellectual proximity is determined at least in part by relative management stratum of the first and second mobile device users , wherein management stratum is afforded a first weight when each of the first and second mobile device users expresses a specific business networking intent objective , and a second weight , less than the first weight , when each of the first and second mobile device users expresses a non-specific business networking intent objective , (e) when the first and second mobile device users are in intellectual proximity , for issuing a mutual collaboration opportunity message to each the first and second mobile device users to determine whether the first and second mobile device users desire to be introduced to one another , the mutual collaboration opportunity message masking personally identifying information , and (f) upon the first and second mobile device users agreeing to be introduced , for establishing a direct private messaging session between the first and second mobile device users . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question (time window) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question (identifying information) against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7310676B2 CLAIM 1 . Apparatus for identifying and introducing mobile device users to one another , wherein a given mobile device user has been registered by submitting given profile data (user profiles) , comprising : at least one processor ; code executable on the processor (a) for receiving a message from a first mobile device user that the first mobile device user desires to be introduced at least one other mobile device user ; (b) for initiating a request to identify a current location of the first mobile device user , (c) for receiving data identifying the location of the first mobile device user ; (d) for determining , based on the given profile data , whether a second mobile device user is within intellectual proximity to the first mobile device user , wherein intellectual proximity is determined at least in part by relative management stratum of the first and second mobile device users , wherein management stratum is afforded a first weight when each of the first and second mobile device users expresses a specific business networking intent objective , and a second weight , less than the first weight , when each of the first and second mobile device users expresses a non-specific business networking intent objective , (e) when the first and second mobile device users are in intellectual proximity , for issuing a mutual collaboration opportunity message to each the first and second mobile device users to determine whether the first and second mobile device users desire to be introduced to one another , the mutual collaboration opportunity message masking personally identifying information (net polling question) , and (f) upon the first and second mobile device users agreeing to be introduced , for establishing a direct private messaging session between the first and second mobile device users . US7310676B2 CLAIM 7 . A method , operating in a server , for enabling mobile device users to meet one another , the mobile device users being within a given physical proximity during an overlapping time window (next polling question) , comprising : based on given profile data provided by each of first and second mobile device users , determining whether the first and second mobile devices users are within a given intellectual proximity , wherein intellectual proximity is determined by relative management stratum of the first and second mobile device users and how much time has elapsed since the respective first or second mobile device user first provides an indication that such mobile device user is available to receive a prospective introduction ; when the first and second mobile device users are within a given intellectual proximity , issuing a mutual collaboration opportunity message to each the first and second mobile device users to determine whether the first and second mobile device users desire to be introduced to one another , the mutual collaboration opportunity message masking personally identifying information ; and upon the first and second mobile device users agreeing to be introduced , establishing a direct private messaging session between the first and second mobile device users . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7310676B2 CLAIM 12 . The method as described in claim 11 wherein the publicly available data is searched using the World Wide Web (web server) . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7310676B2 CLAIM 12 . The method as described in claim 11 wherein the publicly available data is searched using the World Wide Web (web server) . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2006107385A Filed: 2004-10-08 Issued: 2006-04-20 Posted article extraction method, apparatus, and program (Original Assignee) Nippon Telegr & Teleph Corp <Ntt>; 日本電信電話株式会社 Shinji Abe, Shinji Miyahara, Masakatsu Okubo, Yoshinobu Tonomura, 佳伸 外村, 雅且 大久保, 伸治 安部, 伸二 宮原 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system (コンピュ, apparatus) , comprising : a data processing system (コンピュ, apparatus) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (２次元, ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . JP2006107385A CLAIM 4 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する際に、吹き出し表示する投稿記事を抽出する投稿記事抽出装置であって、 掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を蓄積するユーザ投稿記事記憶手段と、 前記ユーザ投稿記事記憶手段から前記投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出手段と、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択手段と、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示制御手段と、 を有することを特徴とする投稿記事抽出装置。 The content is arranged as a representative image on a two-dimensional map , and each content has a bulletin board . When the posted article on the bulletin board is displayed in a balloon from the representative image , the posted article to be extracted in a balloon is extracted . An article extraction device , User-posted article storage means for storing a group of posted articles on the same topic called a bulletin board thread ; The posted article group is read from the user posted article storage unit , and the posted article is retrieved from the posted article group based on the reply time interval for the previously posted article that is the closest in time to the previously posted article from a certain posted article . Posting article extraction means to extract , A posted article group selecting means for selecting a posted article group having a high posting frequency around the extracted posted article ; Display control means for displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; A posted article extracting apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) characterized by comprising : JP2006107385A CLAIM 7 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出プログラムであって、 請求項１乃至３記載の投稿記事抽出方法を実現するための処理をコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータに実行させることを特徴とする投稿記事抽出プログラム。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . An article extraction program , A posted article extraction program that causes a computer to execute processing for realizing the posted article extraction method according to claim 1 . |
| US9087321B2 CLAIM 2 . The poll-based networking system (コンピュ, apparatus) as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (コンピュ, apparatus) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers (２次元, ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . JP2006107385A CLAIM 4 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する際に、吹き出し表示する投稿記事を抽出する投稿記事抽出装置であって、 掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を蓄積するユーザ投稿記事記憶手段と、 前記ユーザ投稿記事記憶手段から前記投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出手段と、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択手段と、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示制御手段と、 を有することを特徴とする投稿記事抽出装置。 The content is arranged as a representative image on a two-dimensional map , and each content has a bulletin board . When the posted article on the bulletin board is displayed in a balloon from the representative image , the posted article to be extracted in a balloon is extracted . An article extraction device , User-posted article storage means for storing a group of posted articles on the same topic called a bulletin board thread ; The posted article group is read from the user posted article storage unit , and the posted article is retrieved from the posted article group based on the reply time interval for the previously posted article that is the closest in time to the previously posted article from a certain posted article . Posting article extraction means to extract , A posted article group selecting means for selecting a posted article group having a high posting frequency around the extracted posted article ; Display control means for displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; A posted article extracting apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) characterized by comprising : JP2006107385A CLAIM 7 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出プログラムであって、 請求項１乃至３記載の投稿記事抽出方法を実現するための処理をコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータに実行させることを特徴とする投稿記事抽出プログラム。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . An article extraction program , A posted article extraction program that causes a computer to execute processing for realizing the posted article extraction method according to claim 1 . |
| US9087321B2 CLAIM 3 . The poll-based networking system (コンピュ, apparatus) as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers (２次元, ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . JP2006107385A CLAIM 4 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する際に、吹き出し表示する投稿記事を抽出する投稿記事抽出装置であって、 掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を蓄積するユーザ投稿記事記憶手段と、 前記ユーザ投稿記事記憶手段から前記投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出手段と、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択手段と、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示制御手段と、 を有することを特徴とする投稿記事抽出装置。 The content is arranged as a representative image on a two-dimensional map , and each content has a bulletin board . When the posted article on the bulletin board is displayed in a balloon from the representative image , the posted article to be extracted in a balloon is extracted . An article extraction device , User-posted article storage means for storing a group of posted articles on the same topic called a bulletin board thread ; The posted article group is read from the user posted article storage unit , and the posted article is retrieved from the posted article group based on the reply time interval for the previously posted article that is the closest in time to the previously posted article from a certain posted article . Posting article extraction means to extract , A posted article group selecting means for selecting a posted article group having a high posting frequency around the extracted posted article ; Display control means for displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; A posted article extracting apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) characterized by comprising : JP2006107385A CLAIM 7 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出プログラムであって、 請求項１乃至３記載の投稿記事抽出方法を実現するための処理をコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータに実行させることを特徴とする投稿記事抽出プログラム。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . An article extraction program , A posted article extraction program that causes a computer to execute processing for realizing the posted article extraction method according to claim 1 . |
| US9087321B2 CLAIM 4 . The poll-based networking system (コンピュ, apparatus) as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number (total number) of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (２次元, ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number (total number) of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . JP2006107385A CLAIM 4 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する際に、吹き出し表示する投稿記事を抽出する投稿記事抽出装置であって、 掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を蓄積するユーザ投稿記事記憶手段と、 前記ユーザ投稿記事記憶手段から前記投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出手段と、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択手段と、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示制御手段と、 を有することを特徴とする投稿記事抽出装置。 The content is arranged as a representative image on a two-dimensional map , and each content has a bulletin board . When the posted article on the bulletin board is displayed in a balloon from the representative image , the posted article to be extracted in a balloon is extracted . An article extraction device , User-posted article storage means for storing a group of posted articles on the same topic called a bulletin board thread ; The posted article group is read from the user posted article storage unit , and the posted article is retrieved from the posted article group based on the reply time interval for the previously posted article that is the closest in time to the previously posted article from a certain posted article . Posting article extraction means to extract , A posted article group selecting means for selecting a posted article group having a high posting frequency around the extracted posted article ; Display control means for displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; A posted article extracting apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) characterized by comprising : JP2006107385A CLAIM 7 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出プログラムであって、 請求項１乃至３記載の投稿記事抽出方法を実現するための処理をコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータに実行させることを特徴とする投稿記事抽出プログラム。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . An article extraction program , A posted article extraction program that causes a computer to execute processing for realizing the posted article extraction method according to claim 1 . |
| US9087321B2 CLAIM 5 . The poll-based networking system (コンピュ, apparatus) as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2006107385A CLAIM 4 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する際に、吹き出し表示する投稿記事を抽出する投稿記事抽出装置であって、 掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を蓄積するユーザ投稿記事記憶手段と、 前記ユーザ投稿記事記憶手段から前記投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出手段と、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択手段と、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示制御手段と、 を有することを特徴とする投稿記事抽出装置。 The content is arranged as a representative image on a two-dimensional map , and each content has a bulletin board . When the posted article on the bulletin board is displayed in a balloon from the representative image , the posted article to be extracted in a balloon is extracted . An article extraction device , User-posted article storage means for storing a group of posted articles on the same topic called a bulletin board thread ; The posted article group is read from the user posted article storage unit , and the posted article is retrieved from the posted article group based on the reply time interval for the previously posted article that is the closest in time to the previously posted article from a certain posted article . Posting article extraction means to extract , A posted article group selecting means for selecting a posted article group having a high posting frequency around the extracted posted article ; Display control means for displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; A posted article extracting apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) characterized by comprising : JP2006107385A CLAIM 7 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出プログラムであって、 請求項１乃至３記載の投稿記事抽出方法を実現するための処理をコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータに実行させることを特徴とする投稿記事抽出プログラム。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . An article extraction program , A posted article extraction program that causes a computer to execute processing for realizing the posted article extraction method according to claim 1 . |
| US9087321B2 CLAIM 6 . The poll-based networking system (コンピュ, apparatus) as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers (２次元, ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . JP2006107385A CLAIM 4 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する際に、吹き出し表示する投稿記事を抽出する投稿記事抽出装置であって、 掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を蓄積するユーザ投稿記事記憶手段と、 前記ユーザ投稿記事記憶手段から前記投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出手段と、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択手段と、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示制御手段と、 を有することを特徴とする投稿記事抽出装置。 The content is arranged as a representative image on a two-dimensional map , and each content has a bulletin board . When the posted article on the bulletin board is displayed in a balloon from the representative image , the posted article to be extracted in a balloon is extracted . An article extraction device , User-posted article storage means for storing a group of posted articles on the same topic called a bulletin board thread ; The posted article group is read from the user posted article storage unit , and the posted article is retrieved from the posted article group based on the reply time interval for the previously posted article that is the closest in time to the previously posted article from a certain posted article . Posting article extraction means to extract , A posted article group selecting means for selecting a posted article group having a high posting frequency around the extracted posted article ; Display control means for displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; A posted article extracting apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) characterized by comprising : JP2006107385A CLAIM 7 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出プログラムであって、 請求項１乃至３記載の投稿記事抽出方法を実現するための処理をコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータに実行させることを特徴とする投稿記事抽出プログラム。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . An article extraction program , A posted article extraction program that causes a computer to execute processing for realizing the posted article extraction method according to claim 1 . |
| US9087321B2 CLAIM 7 . The poll-based networking system (コンピュ, apparatus) as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers (２次元, ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . JP2006107385A CLAIM 4 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する際に、吹き出し表示する投稿記事を抽出する投稿記事抽出装置であって、 掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を蓄積するユーザ投稿記事記憶手段と、 前記ユーザ投稿記事記憶手段から前記投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出手段と、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択手段と、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示制御手段と、 を有することを特徴とする投稿記事抽出装置。 The content is arranged as a representative image on a two-dimensional map , and each content has a bulletin board . When the posted article on the bulletin board is displayed in a balloon from the representative image , the posted article to be extracted in a balloon is extracted . An article extraction device , User-posted article storage means for storing a group of posted articles on the same topic called a bulletin board thread ; The posted article group is read from the user posted article storage unit , and the posted article is retrieved from the posted article group based on the reply time interval for the previously posted article that is the closest in time to the previously posted article from a certain posted article . Posting article extraction means to extract , A posted article group selecting means for selecting a posted article group having a high posting frequency around the extracted posted article ; Display control means for displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; A posted article extracting apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) characterized by comprising : JP2006107385A CLAIM 7 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出プログラムであって、 請求項１乃至３記載の投稿記事抽出方法を実現するための処理をコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータに実行させることを特徴とする投稿記事抽出プログラム。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . An article extraction program , A posted article extraction program that causes a computer to execute processing for realizing the posted article extraction method according to claim 1 . |
| US9087321B2 CLAIM 8 . The poll-based networking system (コンピュ, apparatus) as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers (２次元, ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . JP2006107385A CLAIM 4 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する際に、吹き出し表示する投稿記事を抽出する投稿記事抽出装置であって、 掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を蓄積するユーザ投稿記事記憶手段と、 前記ユーザ投稿記事記憶手段から前記投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出手段と、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択手段と、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示制御手段と、 を有することを特徴とする投稿記事抽出装置。 The content is arranged as a representative image on a two-dimensional map , and each content has a bulletin board . When the posted article on the bulletin board is displayed in a balloon from the representative image , the posted article to be extracted in a balloon is extracted . An article extraction device , User-posted article storage means for storing a group of posted articles on the same topic called a bulletin board thread ; The posted article group is read from the user posted article storage unit , and the posted article is retrieved from the posted article group based on the reply time interval for the previously posted article that is the closest in time to the previously posted article from a certain posted article . Posting article extraction means to extract , A posted article group selecting means for selecting a posted article group having a high posting frequency around the extracted posted article ; Display control means for displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; A posted article extracting apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) characterized by comprising : JP2006107385A CLAIM 7 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出プログラムであって、 請求項１乃至３記載の投稿記事抽出方法を実現するための処理をコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータに実行させることを特徴とする投稿記事抽出プログラム。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . An article extraction program , A posted article extraction program that causes a computer to execute processing for realizing the posted article extraction method according to claim 1 . |
| US9087321B2 CLAIM 9 . The poll-based networking system (コンピュ, apparatus) as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers (２次元, ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . JP2006107385A CLAIM 4 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する際に、吹き出し表示する投稿記事を抽出する投稿記事抽出装置であって、 掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を蓄積するユーザ投稿記事記憶手段と、 前記ユーザ投稿記事記憶手段から前記投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出手段と、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択手段と、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示制御手段と、 を有することを特徴とする投稿記事抽出装置。 The content is arranged as a representative image on a two-dimensional map , and each content has a bulletin board . When the posted article on the bulletin board is displayed in a balloon from the representative image , the posted article to be extracted in a balloon is extracted . An article extraction device , User-posted article storage means for storing a group of posted articles on the same topic called a bulletin board thread ; The posted article group is read from the user posted article storage unit , and the posted article is retrieved from the posted article group based on the reply time interval for the previously posted article that is the closest in time to the previously posted article from a certain posted article . Posting article extraction means to extract , A posted article group selecting means for selecting a posted article group having a high posting frequency around the extracted posted article ; Display control means for displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; A posted article extracting apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) characterized by comprising : JP2006107385A CLAIM 7 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出プログラムであって、 請求項１乃至３記載の投稿記事抽出方法を実現するための処理をコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータに実行させることを特徴とする投稿記事抽出プログラム。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . An article extraction program , A posted article extraction program that causes a computer to execute processing for realizing the posted article extraction method according to claim 1 . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (２次元, ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (コンピュ, apparatus) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers (２次元, ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . JP2006107385A CLAIM 4 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する際に、吹き出し表示する投稿記事を抽出する投稿記事抽出装置であって、 掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を蓄積するユーザ投稿記事記憶手段と、 前記ユーザ投稿記事記憶手段から前記投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出手段と、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択手段と、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示制御手段と、 を有することを特徴とする投稿記事抽出装置。 The content is arranged as a representative image on a two-dimensional map , and each content has a bulletin board . When the posted article on the bulletin board is displayed in a balloon from the representative image , the posted article to be extracted in a balloon is extracted . An article extraction device , User-posted article storage means for storing a group of posted articles on the same topic called a bulletin board thread ; The posted article group is read from the user posted article storage unit , and the posted article is retrieved from the posted article group based on the reply time interval for the previously posted article that is the closest in time to the previously posted article from a certain posted article . Posting article extraction means to extract , A posted article group selecting means for selecting a posted article group having a high posting frequency around the extracted posted article ; Display control means for displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; A posted article extracting apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) characterized by comprising : JP2006107385A CLAIM 7 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出プログラムであって、 請求項１乃至３記載の投稿記事抽出方法を実現するための処理をコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータに実行させることを特徴とする投稿記事抽出プログラム。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . An article extraction program , A posted article extraction program that causes a computer to execute processing for realizing the posted article extraction method according to claim 1 . |
| US9087321B2 CLAIM 12 . The computer implemented method as set forth in claim 11 , wherein , in cumulatively comparing , further comprising an act of causing the one or more processors to perform operations of : matching the user to other users based upon all of the selected answers (２次元, ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , further comprising an act of causing the one or more processors to perform operations of : determining a total number (total number) of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (２次元, ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number (total number) of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers (２次元, ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers (２次元, ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers (２次元, ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers (２次元, ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (２次元, ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling (コンピュ, apparatus) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers (２次元, ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . JP2006107385A CLAIM 4 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する際に、吹き出し表示する投稿記事を抽出する投稿記事抽出装置であって、 掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を蓄積するユーザ投稿記事記憶手段と、 前記ユーザ投稿記事記憶手段から前記投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出手段と、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択手段と、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示制御手段と、 を有することを特徴とする投稿記事抽出装置。 The content is arranged as a representative image on a two-dimensional map , and each content has a bulletin board . When the posted article on the bulletin board is displayed in a balloon from the representative image , the posted article to be extracted in a balloon is extracted . An article extraction device , User-posted article storage means for storing a group of posted articles on the same topic called a bulletin board thread ; The posted article group is read from the user posted article storage unit , and the posted article is retrieved from the posted article group based on the reply time interval for the previously posted article that is the closest in time to the previously posted article from a certain posted article . Posting article extraction means to extract , A posted article group selecting means for selecting a posted article group having a high posting frequency around the extracted posted article ; Display control means for displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; A posted article extracting apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) characterized by comprising : JP2006107385A CLAIM 7 ２次元の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出プログラムであって、 請求項１乃至３記載の投稿記事抽出方法を実現するための処理をコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータに実行させることを特徴とする投稿記事抽出プログラム。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . An article extraction program , A posted article extraction program that causes a computer to execute processing for realizing the posted article extraction method according to claim 1 . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers (２次元, ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number (total number) of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (２次元, ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number (total number) of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers (２次元, ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers (２次元, ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers (２次元, ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers (２次元, ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2006107385A CLAIM 1 ２次元 (selected answers) の地図上にコンテンツを代表画像で配置し、また、それぞれのコンテンツは掲示板を有し、該代表画像から該掲示板の投稿記事を吹き出し表示する装置において、吹き出し表示する投稿記事を抽出する投稿記事抽出方法において、 記憶手段に蓄積されている掲示板のスレッドと呼ばれる同じ話題に関する投稿記事群を読み出し、ある投稿記事から前に投稿された投稿記事で最も時間的に近い前投稿記事に対する返信時間間隔に基づいて、該投稿記事群から投稿記事を抽出する投稿記事抽出ステップと、 抽出された前記投稿記事を中心として投稿頻度の高い投稿記事群を選択する投稿記事群選択ステップと、 選択された前記投稿記事群を総合評価関数に基づく表示順序ルールに基づいて、表示手段に表示する表示ステップと、 を行うことを特徴とする投稿記事抽出方法。 Posts for extracting posted articles to be displayed in a balloon on a device that arranges the contents as representative images on a two-dimensional map , and each content has a bulletin board and displays posted articles on the bulletin board from the representative images . In the article extraction method , Read a group of posted articles related to the same topic , called a bulletin board thread , stored in the storage means , and based on the reply time interval for the previous posted article closest in time to a previously posted article from one posted article , A posted article extraction step for extracting a posted article from a group of posted articles ; A posted article group selection step for selecting a posted article group with a high posting frequency around the extracted posted article ; A display step of displaying the selected posted article group on a display means based on a display order rule based on a comprehensive evaluation function ; Article extraction method characterized by performing . JP2006107385A CLAIM 3 前記表示ステップにおいて、 投稿記事に対する平均投稿時間間隔、投稿記事の総数、投稿ユーザ (selected answers) 数、最新投稿記事日時、最古投稿日時に関する評価関数と重みにより評価された表示順序を規定した前記表示順序ルールを用いて、前記投稿記事群を表示する表示順序を決定する請求項1記載の投稿記事抽出方法。 In the displaying step , Using the display order rule that defines the display order evaluated by the evaluation function and the weight related to the average posting time interval for the posted article , the total number of posted articles , the number of posted users , the latest posted article date and time , the oldest posted date and time 2 . The posted article extraction method according to claim 1 , wherein a display order for displaying the article group is determined . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2006092074A Filed: 2004-09-22 Issued: 2006-04-06 Attached document processing computer program and attached document processing apparatus and method (Original Assignee) Fuji Xerox Co Ltd; 富士ゼロックス株式会社 Takaaki Kashiwagi, Akifumi Sekijima, 崇明 柏木, 章文 関島 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system (コンピュ, apparatus) , comprising : a data processing system (コンピュ, apparatus) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users (Web browser) , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2006092074A CLAIM 1 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを実現するためにコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータで実行されることを特徴とする添付文書処理用コンピュータプログラム。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; A computer program for processing an attached document , which is executed by a computer to realize a document registration unit for registering a document in which the attached document is integrated as a version in the document management unit . JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザでの作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . JP2006092074A CLAIM 8 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを有することを特徴とする添付文書処理装置。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; An attached document processing apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) comprising : a document registration unit that registers a document in which the attached document is integrated as a version in the document management unit . JP2006092074A CLAIM 9 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段を具備するデータ (user information) 管理システムにおける添付文書処理方法において、 関連添付文書抽出手段により、関連のある複数のメッセージにそれぞれ添付された添付文書を抽出するステップと、 リスト表示手段により、抽出された添付文書のリストを表示するステップと、 バージョン化手段により、リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるステップと、 文書登録手段により、バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録するステップとを有することを特徴とする添付文書処理装置。 An attached document processing method in a data management system comprising a document management means for managing a plurality of versions of a document under a document entry . A step of extracting attachments each attached to a plurality of related messages by a related attachment extraction means ; A step of displaying a list of extracted attached documents by a list display means ; Combining the attached documents selected on the display of the list as different versions of one document by versioning means ; An attached document processing apparatus comprising : a step of registering a document in which the attached document is integrated as a version in the document managing unit by a document registering unit . |
| US9087321B2 CLAIM 2 . The poll-based networking system (コンピュ, apparatus) as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (コンピュ, apparatus) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users (Web browser) to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2006092074A CLAIM 1 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを実現するためにコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータで実行されることを特徴とする添付文書処理用コンピュータプログラム。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; A computer program for processing an attached document , which is executed by a computer to realize a document registration unit for registering a document in which the attached document is integrated as a version in the document management unit . JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザでの作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . JP2006092074A CLAIM 8 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを有することを特徴とする添付文書処理装置。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; An attached document processing apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) comprising : a document registration unit that registers a document in which the attached document is integrated as a version in the document management unit . |
| US9087321B2 CLAIM 3 . The poll-based networking system (コンピュ, apparatus) as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users (Web browser) based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2006092074A CLAIM 1 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを実現するためにコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータで実行されることを特徴とする添付文書処理用コンピュータプログラム。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; A computer program for processing an attached document , which is executed by a computer to realize a document registration unit for registering a document in which the attached document is integrated as a version in the document management unit . JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザでの作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . JP2006092074A CLAIM 8 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを有することを特徴とする添付文書処理装置。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; An attached document processing apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) comprising : a document registration unit that registers a document in which the attached document is integrated as a version in the document management unit . |
| US9087321B2 CLAIM 4 . The poll-based networking system (コンピュ, apparatus) as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users (Web browser) as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2006092074A CLAIM 1 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを実現するためにコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータで実行されることを特徴とする添付文書処理用コンピュータプログラム。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; A computer program for processing an attached document , which is executed by a computer to realize a document registration unit for registering a document in which the attached document is integrated as a version in the document management unit . JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザでの作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . JP2006092074A CLAIM 8 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを有することを特徴とする添付文書処理装置。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; An attached document processing apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) comprising : a document registration unit that registers a document in which the attached document is integrated as a version in the document management unit . |
| US9087321B2 CLAIM 5 . The poll-based networking system (コンピュ, apparatus) as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users (Web browser) ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2006092074A CLAIM 1 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを実現するためにコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータで実行されることを特徴とする添付文書処理用コンピュータプログラム。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; A computer program for processing an attached document , which is executed by a computer to realize a document registration unit for registering a document in which the attached document is integrated as a version in the document management unit . JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザでの作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . JP2006092074A CLAIM 8 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを有することを特徴とする添付文書処理装置。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; An attached document processing apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) comprising : a document registration unit that registers a document in which the attached document is integrated as a version in the document management unit . |
| US9087321B2 CLAIM 6 . The poll-based networking system (コンピュ, apparatus) as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (ブラウザ) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users (Web browser) , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2006092074A CLAIM 1 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを実現するためにコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータで実行されることを特徴とする添付文書処理用コンピュータプログラム。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; A computer program for processing an attached document , which is executed by a computer to realize a document registration unit for registering a document in which the attached document is integrated as a version in the document management unit . JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザ (web server) での作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . JP2006092074A CLAIM 8 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを有することを特徴とする添付文書処理装置。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; An attached document processing apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) comprising : a document registration unit that registers a document in which the attached document is integrated as a version in the document management unit . |
| US9087321B2 CLAIM 7 . The poll-based networking system (コンピュ, apparatus) as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2006092074A CLAIM 1 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを実現するためにコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータで実行されることを特徴とする添付文書処理用コンピュータプログラム。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; A computer program for processing an attached document , which is executed by a computer to realize a document registration unit for registering a document in which the attached document is integrated as a version in the document management unit . JP2006092074A CLAIM 8 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを有することを特徴とする添付文書処理装置。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; An attached document processing apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) comprising : a document registration unit that registers a document in which the attached document is integrated as a version in the document management unit . |
| US9087321B2 CLAIM 8 . The poll-based networking system (コンピュ, apparatus) as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (ブラウザ) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users (Web browser) , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2006092074A CLAIM 1 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを実現するためにコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータで実行されることを特徴とする添付文書処理用コンピュータプログラム。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; A computer program for processing an attached document , which is executed by a computer to realize a document registration unit for registering a document in which the attached document is integrated as a version in the document management unit . JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザ (web server) での作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . JP2006092074A CLAIM 8 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを有することを特徴とする添付文書処理装置。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; An attached document processing apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) comprising : a document registration unit that registers a document in which the attached document is integrated as a version in the document management unit . |
| US9087321B2 CLAIM 9 . The poll-based networking system (コンピュ, apparatus) as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2006092074A CLAIM 1 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを実現するためにコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータで実行されることを特徴とする添付文書処理用コンピュータプログラム。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; A computer program for processing an attached document , which is executed by a computer to realize a document registration unit for registering a document in which the attached document is integrated as a version in the document management unit . JP2006092074A CLAIM 8 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを有することを特徴とする添付文書処理装置。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; An attached document processing apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) comprising : a document registration unit that registers a document in which the attached document is integrated as a version in the document management unit . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users (Web browser) , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザでの作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . JP2006092074A CLAIM 9 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段を具備するデータ (user information) 管理システムにおける添付文書処理方法において、 関連添付文書抽出手段により、関連のある複数のメッセージにそれぞれ添付された添付文書を抽出するステップと、 リスト表示手段により、抽出された添付文書のリストを表示するステップと、 バージョン化手段により、リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるステップと、 文書登録手段により、バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録するステップとを有することを特徴とする添付文書処理装置。 An attached document processing method in a data management system comprising a document management means for managing a plurality of versions of a document under a document entry . A step of extracting attachments each attached to a plurality of related messages by a related attachment extraction means ; A step of displaying a list of extracted attached documents by a list display means ; Combining the attached documents selected on the display of the list as different versions of one document by versioning means ; An attached document processing apparatus comprising : a step of registering a document in which the attached document is integrated as a version in the document managing unit by a document registering unit . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (コンピュ, apparatus) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users (Web browser) to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2006092074A CLAIM 1 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを実現するためにコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータで実行されることを特徴とする添付文書処理用コンピュータプログラム。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; A computer program for processing an attached document , which is executed by a computer to realize a document registration unit for registering a document in which the attached document is integrated as a version in the document management unit . JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザでの作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . JP2006092074A CLAIM 8 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを有することを特徴とする添付文書処理装置。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; An attached document processing apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) comprising : a document registration unit that registers a document in which the attached document is integrated as a version in the document management unit . |
| US9087321B2 CLAIM 12 . The computer implemented method as set forth in claim 11 , wherein , in cumulatively comparing , further comprising an act of causing the one or more processors to perform operations of : matching the user to other users (Web browser) based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザでの作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users (Web browser) as a match percentage , further comprising an act of causing the one or more processors to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザでの作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users (Web browser) ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザでの作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (ブラウザ) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users (Web browser) , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザ (web server) での作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (ブラウザ) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users (Web browser) , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザ (web server) での作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users (Web browser) , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザでの作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . JP2006092074A CLAIM 9 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段を具備するデータ (user information) 管理システムにおける添付文書処理方法において、 関連添付文書抽出手段により、関連のある複数のメッセージにそれぞれ添付された添付文書を抽出するステップと、 リスト表示手段により、抽出された添付文書のリストを表示するステップと、 バージョン化手段により、リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるステップと、 文書登録手段により、バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録するステップとを有することを特徴とする添付文書処理装置。 An attached document processing method in a data management system comprising a document management means for managing a plurality of versions of a document under a document entry . A step of extracting attachments each attached to a plurality of related messages by a related attachment extraction means ; A step of displaying a list of extracted attached documents by a list display means ; Combining the attached documents selected on the display of the list as different versions of one document by versioning means ; An attached document processing apparatus comprising : a step of registering a document in which the attached document is integrated as a version in the document managing unit by a document registering unit . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling (コンピュ, apparatus) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users (Web browser) to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2006092074A CLAIM 1 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを実現するためにコンピュ (next polling, data processing system, next polling questions, networking system, data processing system having one) ータで実行されることを特徴とする添付文書処理用コンピュータプログラム。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; A computer program for processing an attached document , which is executed by a computer to realize a document registration unit for registering a document in which the attached document is integrated as a version in the document management unit . JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザでの作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . JP2006092074A CLAIM 8 １の文書エントリのもと１の文書の複数のバージョンを管理する文書管理手段と、 関連のある複数のメッセージにそれぞれ添付された添付文書を抽出する関連添付文書抽出手段と、 抽出された添付文書のリストを表示するリスト表示手段と、 リストの表示上で選択された添付文書を１の文書の異なるバージョンとしてまとめるバージョン化手段と、 バージョンとして上記添付文書を統合した文書を上記文書管理手段に登録する文書登録手段とを有することを特徴とする添付文書処理装置。 Document management means for managing a plurality of versions of one document under one document entry ; A related attachment extraction means for extracting attachments attached to a plurality of related messages , A list display means for displaying a list of extracted attached documents ; Versioning means for collecting attached documents selected on the display of the list as different versions of one document ; An attached document processing apparatus (next polling, data processing system, next polling questions, networking system, data processing system having one) comprising : a document registration unit that registers a document in which the attached document is integrated as a version in the document management unit . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users (Web browser) based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザでの作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users (Web browser) ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザでの作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (ブラウザ) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users (Web browser) , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザ (web server) での作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (ブラウザ) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users (Web browser) , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2006092074A CLAIM 3 上記電子掲示板の記事はＷｅｂブラウザ (web server) での作成が可能である請求項１記載の添付文書処理用コンピュータプログラム。 The computer program for attached document processing according to claim 1 , wherein the article on the electronic bulletin board can be created by a Web browser (other users) . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20050159970A1 Filed: 2004-08-26 Issued: 2005-07-21 Methods and systems for the display and navigation of a social network (Original Assignee) Google LLC (Current Assignee) Google LLC Orkut Buyukkokten, Adam Smith |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (first profile, user profile) of other users that have a likelihood of match within a predetermined threshold . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (first profile, user profile) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match (popularity data) percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20050159970A1 CLAIM 6 . The method of claim 1 , wherein the ranking is based at least in part on popularity data (minimum match) . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (shortest path) , to a plurality of match servers , each match server (first profile, user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . US20050159970A1 CLAIM 17 . The method of claim 16 , wherein the association path comprises a shortest path (match aggregator) . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (first profile, user profile) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (shortest path) , to a plurality of match servers , each match server (first profile, user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . US20050159970A1 CLAIM 17 . The method of claim 16 , wherein the association path comprises a shortest path (match aggregator) . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (first profile, user profile) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (first profile, user profile) of other users that have a likelihood of match within a predetermined threshold . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (first profile, user profile) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match (popularity data) percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20050159970A1 CLAIM 6 . The method of claim 1 , wherein the ranking is based at least in part on popularity data (minimum match) . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (shortest path) , to a plurality of match servers , each match server (first profile, user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . US20050159970A1 CLAIM 17 . The method of claim 16 , wherein the association path comprises a shortest path (match aggregator) . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (first profile, user profile) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (shortest path) , to a plurality of match servers , each match server (first profile, user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . US20050159970A1 CLAIM 17 . The method of claim 16 , wherein the association path comprises a shortest path (match aggregator) . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (first profile, user profile) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (first profile, user profile) of other users that have a likelihood of match within a predetermined threshold . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (first profile, user profile) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match (popularity data) percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20050159970A1 CLAIM 6 . The method of claim 1 , wherein the ranking is based at least in part on popularity data (minimum match) . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (shortest path) , to a plurality of match servers , each match server (first profile, user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . US20050159970A1 CLAIM 17 . The method of claim 16 , wherein the association path comprises a shortest path (match aggregator) . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (first profile, user profile) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (shortest path) , to a plurality of match servers , each match server (first profile, user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . US20050159970A1 CLAIM 17 . The method of claim 16 , wherein the association path comprises a shortest path (match aggregator) . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (first profile, user profile) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20050159970A1 CLAIM 1 . A method , comprising : identifying a first profile (user profiles, match server) in a social network ; identifying associated profiles associated with the first profile ; ranking the associated profiles , wherein ranking is not based exclusively on a degree of separation ; and outputting the associated profiles based at least in part on the ranking . US20050159970A1 CLAIM 11 . The method of claim 1 , further comprising identifying an association between a user profile (user profiles, match server) and the associated profiles . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20060010467A1 Filed: 2004-07-12 Issued: 2006-01-12 Personalized video entertainment system (Original Assignee) Alcatel SA (Current Assignee) Alcatel Lucent SAS Jonathan Segel |
|---|---|
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (selection button) . |
US20060010467A1 CLAIM 12 . The program controller of claim 11 , wherein said interactive user interface comprises : an alphanumeric keypad for generating and transmitting alphanumeric messages to said video server ; a plurality of basic functions control buttons for controlling operational parameters of said video terminal ; and a first set of content selection button (next polling questions) s for selecting a preferred video content item and controlling delivery of said preferred video content item . |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (controlling delivery) of members that fall within the maximum and minimum match percentage . |
US20060010467A1 CLAIM 11 . A program controller for controlling access of a video terminal to a video server , comprising : an interactive user interface for selecting a preferred video content item from a preferred content sequence and controlling delivery (maximum number) of said preferred video content item on said video terminal ; and an interface to said video terminal for enabling transmission and reception of commands and preference messages between said video terminal and said program controller . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (genetic algorithm) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20060010467A1 CLAIM 41 . The method of claim 40 , wherein said selection algorithm includes is one of the group of machine learning algorithms , pattern matching algorithms , fuzzy retrieval algorithms , genetic algorithm (match servers) s , collaborative filtering algorithms , Bayesian categorization algorithms , Pareto accumulation of preferences algorithms , Lexicographical prioritization algorithms , and weighted attribute ranking algorithm . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (genetic algorithm) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20060010467A1 CLAIM 41 . The method of claim 40 , wherein said selection algorithm includes is one of the group of machine learning algorithms , pattern matching algorithms , fuzzy retrieval algorithms , genetic algorithm (match servers) s , collaborative filtering algorithms , Bayesian categorization algorithms , Pareto accumulation of preferences algorithms , Lexicographical prioritization algorithms , and weighted attribute ranking algorithm . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means (local data) to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20060010467A1 CLAIM 27 . A video system for provisioning personalized entertainment on a video terminal , comprising : a video storage for storing a plurality of video content items received from one or more video service providers and a content descriptor file associated with each said video content item ; a video server for creating a personalized content sequence from said video content items , controlling access of said video terminal to said content sequence , and controlling storage and retrieval of said plurality of video content items to/from said video storage ; and an access multiplexer with multiple ports , a port for connecting said video terminal to said video server over a local data (instruction means) network . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (selection button) . |
US20060010467A1 CLAIM 12 . The program controller of claim 11 , wherein said interactive user interface comprises : an alphanumeric keypad for generating and transmitting alphanumeric messages to said video server ; a plurality of basic functions control buttons for controlling operational parameters of said video terminal ; and a first set of content selection button (next polling questions) s for selecting a preferred video content item and controlling delivery of said preferred video content item . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (controlling delivery) of members that fall within the maximum and minimum match percentage . |
US20060010467A1 CLAIM 11 . A program controller for controlling access of a video terminal to a video server , comprising : an interactive user interface for selecting a preferred video content item from a preferred content sequence and controlling delivery (maximum number) of said preferred video content item on said video terminal ; and an interface to said video terminal for enabling transmission and reception of commands and preference messages between said video terminal and said program controller . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (genetic algorithm) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20060010467A1 CLAIM 41 . The method of claim 40 , wherein said selection algorithm includes is one of the group of machine learning algorithms , pattern matching algorithms , fuzzy retrieval algorithms , genetic algorithm (match servers) s , collaborative filtering algorithms , Bayesian categorization algorithms , Pareto accumulation of preferences algorithms , Lexicographical prioritization algorithms , and weighted attribute ranking algorithm . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (genetic algorithm) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20060010467A1 CLAIM 41 . The method of claim 40 , wherein said selection algorithm includes is one of the group of machine learning algorithms , pattern matching algorithms , fuzzy retrieval algorithms , genetic algorithm (match servers) s , collaborative filtering algorithms , Bayesian categorization algorithms , Pareto accumulation of preferences algorithms , Lexicographical prioritization algorithms , and weighted attribute ranking algorithm . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means (local data) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20060010467A1 CLAIM 27 . A video system for provisioning personalized entertainment on a video terminal , comprising : a video storage for storing a plurality of video content items received from one or more video service providers and a content descriptor file associated with each said video content item ; a video server for creating a personalized content sequence from said video content items , controlling access of said video terminal to said content sequence , and controlling storage and retrieval of said plurality of video content items to/from said video storage ; and an access multiplexer with multiple ports , a port for connecting said video terminal to said video server over a local data (instruction means) network . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means (local data) for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (selection button) . |
US20060010467A1 CLAIM 12 . The program controller of claim 11 , wherein said interactive user interface comprises : an alphanumeric keypad for generating and transmitting alphanumeric messages to said video server ; a plurality of basic functions control buttons for controlling operational parameters of said video terminal ; and a first set of content selection button (next polling questions) s for selecting a preferred video content item and controlling delivery of said preferred video content item . US20060010467A1 CLAIM 27 . A video system for provisioning personalized entertainment on a video terminal , comprising : a video storage for storing a plurality of video content items received from one or more video service providers and a content descriptor file associated with each said video content item ; a video server for creating a personalized content sequence from said video content items , controlling access of said video terminal to said content sequence , and controlling storage and retrieval of said plurality of video content items to/from said video storage ; and an access multiplexer with multiple ports , a port for connecting said video terminal to said video server over a local data (instruction means) network . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means (local data) for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20060010467A1 CLAIM 27 . A video system for provisioning personalized entertainment on a video terminal , comprising : a video storage for storing a plurality of video content items received from one or more video service providers and a content descriptor file associated with each said video content item ; a video server for creating a personalized content sequence from said video content items , controlling access of said video terminal to said content sequence , and controlling storage and retrieval of said plurality of video content items to/from said video storage ; and an access multiplexer with multiple ports , a port for connecting said video terminal to said video server over a local data (instruction means) network . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means (local data) for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20060010467A1 CLAIM 27 . A video system for provisioning personalized entertainment on a video terminal , comprising : a video storage for storing a plurality of video content items received from one or more video service providers and a content descriptor file associated with each said video content item ; a video server for creating a personalized content sequence from said video content items , controlling access of said video terminal to said content sequence , and controlling storage and retrieval of said plurality of video content items to/from said video storage ; and an access multiplexer with multiple ports , a port for connecting said video terminal to said video server over a local data (instruction means) network . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means (local data) for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (controlling delivery) of members that fall within the maximum and minimum match percentage . |
US20060010467A1 CLAIM 11 . A program controller for controlling access of a video terminal to a video server , comprising : an interactive user interface for selecting a preferred video content item from a preferred content sequence and controlling delivery (maximum number) of said preferred video content item on said video terminal ; and an interface to said video terminal for enabling transmission and reception of commands and preference messages between said video terminal and said program controller . US20060010467A1 CLAIM 27 . A video system for provisioning personalized entertainment on a video terminal , comprising : a video storage for storing a plurality of video content items received from one or more video service providers and a content descriptor file associated with each said video content item ; a video server for creating a personalized content sequence from said video content items , controlling access of said video terminal to said content sequence , and controlling storage and retrieval of said plurality of video content items to/from said video storage ; and an access multiplexer with multiple ports , a port for connecting said video terminal to said video server over a local data (instruction means) network . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means (local data) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (genetic algorithm) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20060010467A1 CLAIM 27 . A video system for provisioning personalized entertainment on a video terminal , comprising : a video storage for storing a plurality of video content items received from one or more video service providers and a content descriptor file associated with each said video content item ; a video server for creating a personalized content sequence from said video content items , controlling access of said video terminal to said content sequence , and controlling storage and retrieval of said plurality of video content items to/from said video storage ; and an access multiplexer with multiple ports , a port for connecting said video terminal to said video server over a local data (instruction means) network . US20060010467A1 CLAIM 41 . The method of claim 40 , wherein said selection algorithm includes is one of the group of machine learning algorithms , pattern matching algorithms , fuzzy retrieval algorithms , genetic algorithm (match servers) s , collaborative filtering algorithms , Bayesian categorization algorithms , Pareto accumulation of preferences algorithms , Lexicographical prioritization algorithms , and weighted attribute ranking algorithm . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means (local data) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (genetic algorithm) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20060010467A1 CLAIM 27 . A video system for provisioning personalized entertainment on a video terminal , comprising : a video storage for storing a plurality of video content items received from one or more video service providers and a content descriptor file associated with each said video content item ; a video server for creating a personalized content sequence from said video content items , controlling access of said video terminal to said content sequence , and controlling storage and retrieval of said plurality of video content items to/from said video storage ; and an access multiplexer with multiple ports , a port for connecting said video terminal to said video server over a local data (instruction means) network . US20060010467A1 CLAIM 41 . The method of claim 40 , wherein said selection algorithm includes is one of the group of machine learning algorithms , pattern matching algorithms , fuzzy retrieval algorithms , genetic algorithm (match servers) s , collaborative filtering algorithms , Bayesian categorization algorithms , Pareto accumulation of preferences algorithms , Lexicographical prioritization algorithms , and weighted attribute ranking algorithm . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20060009994A1 Filed: 2004-07-07 Issued: 2006-01-12 System and method for reputation rating (Original Assignee) Hewlett Packard Development Co LP (Current Assignee) Hewlett Packard Development Co LP Tad Hogg, Lada Adamic |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (line network) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20060009994A1 CLAIM 12 . The method of claim 4 : wherein assigning includes classifying a particular reputation rating entity based on whether the particular reputation rating entity is a member of one or more predefined sub-sets of the online network (user information) . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (line network) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20060009994A1 CLAIM 12 . The method of claim 4 : wherein assigning includes classifying a particular reputation rating entity based on whether the particular reputation rating entity is a member of one or more predefined sub-sets of the online network (user information) . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (line network) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20060009994A1 CLAIM 12 . The method of claim 4 : wherein assigning includes classifying a particular reputation rating entity based on whether the particular reputation rating entity is a member of one or more predefined sub-sets of the online network (user information) . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20040243640A1 Filed: 2004-07-02 Issued: 2004-12-02 System and method for providing selective data access and workflow in a network environment (Original Assignee) MICRANAS SEMICONDUCTORS Inc; Micronas Semiconductors Inc (Current Assignee) MICRANAS SEMICONDUCTORS Inc ; Micronas Semiconductors Inc Mark Bostleman, Jeffrey Pappas, Mallikarjun Nallamothu, Nathan Buzdor |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (desired amount) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20040243640A1 CLAIM 60 . A method for managing and selectively sharing multiple sets of information to be used in a plurality of projects , each set of information being created , revised and controlled by separate entities , the method executed in a computer system , said method comprising receiving , storing , and analyzing in one instance of a database at least one first set of information from at least a first entity , the first set of information capable of being retrievable , usable and revisable by the first entity ; allowing the first entity to control whether at least one second entity can access the first set of information , and allowing the first entity to control whether the second entity can retrieve , use and/or revise the first set of information ; receiving , storing , and analyzing in the database at least one second set of information from the first entity , the second set of information capable of being retrieved , used and revised only by the first entity ; receiving , storing , and analyzing in the database at least one third set of information from the second entity ; the third set of information capable of being retrieved , used and revised by the second entity ; allowing the second entity to control whether at least the first entity can access the third set of information and allowing the second entity to control whether the first entity can retrieve , use and/or revise the second set of information ; and receiving , storing and analyzing in the database at least one fourth set of information capable of being retrieved , used and revised only by the second entity , wherein the method supports the ability for all entities to co-exist on the single instance of the database such that each entity owns and controls only their set of information within the database ; in which multiple sets of information are received , stored and analyzed from multiple entities , and allowing each entity to control whether the other entities can retrieve , use and/or revise the stored sets of information , and in which analyzing of the information further includes updating a status of each set of information , and sending the status of , each updated set of information to each entity that is capable of retrieving , using and/or revising the updated set of information ; the method further comprising distributing a software program for which controls access to the sets of information for use in a plurality of projects , each set of information being created , revised and controlled by separate entities , allowing distribution of the software program to separate entities as a subscription service , and operating the software program on one central server (receiving user information) from which any number of the separate entities can log in and use the software program . US20040243640A1 CLAIM 62 . The method of claim 61 , in which at least two or more self-hosted servers communicate with the central server , and further comprising making the central server aware of the self-hosted server' ; s location as well as providing the central server with an index of information and security permissions that are on the self-hosted server ; the index of information and security permissions allowing the central server to know about the information and security permissions available on any given self-hosted server without actually storing the information and security permissions itself , thereby allowing each entity' ; s accounts operating on the central server to share any desired amount (user information) of information with any number of desired entity' ; s accounts on any self-hosted server and vice versa . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (executable instruction) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (desired amount) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20040243640A1 CLAIM 59 . A computer-readable medium having computer-executable instruction (executable instruction) s for performing the system recited in claim 51 . US20040243640A1 CLAIM 60 . A method for managing and selectively sharing multiple sets of information to be used in a plurality of projects , each set of information being created , revised and controlled by separate entities , the method executed in a computer system , said method comprising receiving , storing , and analyzing in one instance of a database at least one first set of information from at least a first entity , the first set of information capable of being retrievable , usable and revisable by the first entity ; allowing the first entity to control whether at least one second entity can access the first set of information , and allowing the first entity to control whether the second entity can retrieve , use and/or revise the first set of information ; receiving , storing , and analyzing in the database at least one second set of information from the first entity , the second set of information capable of being retrieved , used and revised only by the first entity ; receiving , storing , and analyzing in the database at least one third set of information from the second entity ; the third set of information capable of being retrieved , used and revised by the second entity ; allowing the second entity to control whether at least the first entity can access the third set of information and allowing the second entity to control whether the first entity can retrieve , use and/or revise the second set of information ; and receiving , storing and analyzing in the database at least one fourth set of information capable of being retrieved , used and revised only by the second entity , wherein the method supports the ability for all entities to co-exist on the single instance of the database such that each entity owns and controls only their set of information within the database ; in which multiple sets of information are received , stored and analyzed from multiple entities , and allowing each entity to control whether the other entities can retrieve , use and/or revise the stored sets of information , and in which analyzing of the information further includes updating a status of each set of information , and sending the status of , each updated set of information to each entity that is capable of retrieving , using and/or revising the updated set of information ; the method further comprising distributing a software program for which controls access to the sets of information for use in a plurality of projects , each set of information being created , revised and controlled by separate entities , allowing distribution of the software program to separate entities as a subscription service , and operating the software program on one central server (receiving user information) from which any number of the separate entities can log in and use the software program . US20040243640A1 CLAIM 62 . The method of claim 61 , in which at least two or more self-hosted servers communicate with the central server , and further comprising making the central server aware of the self-hosted server' ; s location as well as providing the central server with an index of information and security permissions that are on the self-hosted server ; the index of information and security permissions allowing the central server to know about the information and security permissions available on any given self-hosted server without actually storing the information and security permissions itself , thereby allowing each entity' ; s accounts operating on the central server to share any desired amount (user information) of information with any number of desired entity' ; s accounts on any self-hosted server and vice versa . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (desired amount) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20040243640A1 CLAIM 60 . A method for managing and selectively sharing multiple sets of information to be used in a plurality of projects , each set of information being created , revised and controlled by separate entities , the method executed in a computer system , said method comprising receiving , storing , and analyzing in one instance of a database at least one first set of information from at least a first entity , the first set of information capable of being retrievable , usable and revisable by the first entity ; allowing the first entity to control whether at least one second entity can access the first set of information , and allowing the first entity to control whether the second entity can retrieve , use and/or revise the first set of information ; receiving , storing , and analyzing in the database at least one second set of information from the first entity , the second set of information capable of being retrieved , used and revised only by the first entity ; receiving , storing , and analyzing in the database at least one third set of information from the second entity ; the third set of information capable of being retrieved , used and revised by the second entity ; allowing the second entity to control whether at least the first entity can access the third set of information and allowing the second entity to control whether the first entity can retrieve , use and/or revise the second set of information ; and receiving , storing and analyzing in the database at least one fourth set of information capable of being retrieved , used and revised only by the second entity , wherein the method supports the ability for all entities to co-exist on the single instance of the database such that each entity owns and controls only their set of information within the database ; in which multiple sets of information are received , stored and analyzed from multiple entities , and allowing each entity to control whether the other entities can retrieve , use and/or revise the stored sets of information , and in which analyzing of the information further includes updating a status of each set of information , and sending the status of , each updated set of information to each entity that is capable of retrieving , using and/or revising the updated set of information ; the method further comprising distributing a software program for which controls access to the sets of information for use in a plurality of projects , each set of information being created , revised and controlled by separate entities , allowing distribution of the software program to separate entities as a subscription service , and operating the software program on one central server (receiving user information) from which any number of the separate entities can log in and use the software program . US20040243640A1 CLAIM 62 . The method of claim 61 , in which at least two or more self-hosted servers communicate with the central server , and further comprising making the central server aware of the self-hosted server' ; s location as well as providing the central server with an index of information and security permissions that are on the self-hosted server ; the index of information and security permissions allowing the central server to know about the information and security permissions available on any given self-hosted server without actually storing the information and security permissions itself , thereby allowing each entity' ; s accounts operating on the central server to share any desired amount (user information) of information with any number of desired entity' ; s accounts on any self-hosted server and vice versa . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20040243607A1 Filed: 2004-06-18 Issued: 2004-12-02 Multidimensional repositories for problem discovery and capacity planning of database applications (Original Assignee) Tummalapalli Venkat Ranga Reddy Venkat Tummalapalli |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040243607A1 CLAIM 7 . A computer readable medium (match server) , carrying one or more sequences of instructions for problem discovery and capacity planning of database applications , which instructions , when executed by one or more processors , cause the one or more processors to carry out the steps of : sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component ; storing the data into a storage according to an organization including at least a time dimension and a component dimension ; and drawing inferences based upon results of operations conducted on the data in the storage . US20040243607A1 CLAIM 20 . An system , comprising : an application server system (match servers) that includes a set of application server components that host at least one application ; data collection components operatively coupled to the set of application server components , wherein the data collection components sample operational characteristics of at least one application server component to obtain data reflecting performance of the component , and wherein the performance data includes at least one measure that reflects performance of the application server components ; data storage components for storing the data according to an organization including at least a time dimension and a component dimension ; and data access components operatively coupled to the data storage components for retrieving the data and drawing inferences based upon results of operations conducted on the data in the storage . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20040243607A1 CLAIM 7 . A computer readable medium (match server) , carrying one or more sequences of instructions for problem discovery and capacity planning of database applications , which instructions , when executed by one or more processors , cause the one or more processors to carry out the steps of : sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component ; storing the data into a storage according to an organization including at least a time dimension and a component dimension ; and drawing inferences based upon results of operations conducted on the data in the storage . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040243607A1 CLAIM 7 . A computer readable medium (match server) , carrying one or more sequences of instructions for problem discovery and capacity planning of database applications , which instructions , when executed by one or more processors , cause the one or more processors to carry out the steps of : sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component ; storing the data into a storage according to an organization including at least a time dimension and a component dimension ; and drawing inferences based upon results of operations conducted on the data in the storage . US20040243607A1 CLAIM 20 . An system , comprising : an application server system (match servers) that includes a set of application server components that host at least one application ; data collection components operatively coupled to the set of application server components , wherein the data collection components sample operational characteristics of at least one application server component to obtain data reflecting performance of the component , and wherein the performance data includes at least one measure that reflects performance of the application server components ; data storage components for storing the data according to an organization including at least a time dimension and a component dimension ; and data access components operatively coupled to the data storage components for retrieving the data and drawing inferences based upon results of operations conducted on the data in the storage . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20040243607A1 CLAIM 7 . A computer readable medium (match server) , carrying one or more sequences of instructions for problem discovery and capacity planning of database applications , which instructions , when executed by one or more processors , cause the one or more processors to carry out the steps of : sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component ; storing the data into a storage according to an organization including at least a time dimension and a component dimension ; and drawing inferences based upon results of operations conducted on the data in the storage . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means (comprises instructions) to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20040243607A1 CLAIM 5 . A computer implemented method as recited in claim 1 , further comprising the step of : dynamically generating a web page comprising a particular view (executable instruction) of performance data responsive to a request . US20040243607A1 CLAIM 8 . A computer readable medium as recited in claim 7 , wherein the instructions for carrying out the step of sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component further comprises instructions (instruction means) for carrying out the step of : making a measurement dataspace sample at a time t 1 . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040243607A1 CLAIM 7 . A computer readable medium (match server) , carrying one or more sequences of instructions for problem discovery and capacity planning of database applications , which instructions , when executed by one or more processors , cause the one or more processors to carry out the steps of : sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component ; storing the data into a storage according to an organization including at least a time dimension and a component dimension ; and drawing inferences based upon results of operations conducted on the data in the storage . US20040243607A1 CLAIM 20 . An system , comprising : an application server system (match servers) that includes a set of application server components that host at least one application ; data collection components operatively coupled to the set of application server components , wherein the data collection components sample operational characteristics of at least one application server component to obtain data reflecting performance of the component , and wherein the performance data includes at least one measure that reflects performance of the application server components ; data storage components for storing the data according to an organization including at least a time dimension and a component dimension ; and data access components operatively coupled to the data storage components for retrieving the data and drawing inferences based upon results of operations conducted on the data in the storage . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20040243607A1 CLAIM 7 . A computer readable medium (match server) , carrying one or more sequences of instructions for problem discovery and capacity planning of database applications , which instructions , when executed by one or more processors , cause the one or more processors to carry out the steps of : sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component ; storing the data into a storage according to an organization including at least a time dimension and a component dimension ; and drawing inferences based upon results of operations conducted on the data in the storage . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040243607A1 CLAIM 7 . A computer readable medium (match server) , carrying one or more sequences of instructions for problem discovery and capacity planning of database applications , which instructions , when executed by one or more processors , cause the one or more processors to carry out the steps of : sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component ; storing the data into a storage according to an organization including at least a time dimension and a component dimension ; and drawing inferences based upon results of operations conducted on the data in the storage . US20040243607A1 CLAIM 20 . An system , comprising : an application server system (match servers) that includes a set of application server components that host at least one application ; data collection components operatively coupled to the set of application server components , wherein the data collection components sample operational characteristics of at least one application server component to obtain data reflecting performance of the component , and wherein the performance data includes at least one measure that reflects performance of the application server components ; data storage components for storing the data according to an organization including at least a time dimension and a component dimension ; and data access components operatively coupled to the data storage components for retrieving the data and drawing inferences based upon results of operations conducted on the data in the storage . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20040243607A1 CLAIM 7 . A computer readable medium (match server) , carrying one or more sequences of instructions for problem discovery and capacity planning of database applications , which instructions , when executed by one or more processors , cause the one or more processors to carry out the steps of : sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component ; storing the data into a storage according to an organization including at least a time dimension and a component dimension ; and drawing inferences based upon results of operations conducted on the data in the storage . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means (comprises instructions) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20040243607A1 CLAIM 8 . A computer readable medium as recited in claim 7 , wherein the instructions for carrying out the step of sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component further comprises instructions (instruction means) for carrying out the step of : making a measurement dataspace sample at a time t 1 . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means (comprises instructions) for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20040243607A1 CLAIM 8 . A computer readable medium as recited in claim 7 , wherein the instructions for carrying out the step of sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component further comprises instructions (instruction means) for carrying out the step of : making a measurement dataspace sample at a time t 1 . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means (comprises instructions) for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20040243607A1 CLAIM 8 . A computer readable medium as recited in claim 7 , wherein the instructions for carrying out the step of sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component further comprises instructions (instruction means) for carrying out the step of : making a measurement dataspace sample at a time t 1 . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means (comprises instructions) for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20040243607A1 CLAIM 8 . A computer readable medium as recited in claim 7 , wherein the instructions for carrying out the step of sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component further comprises instructions (instruction means) for carrying out the step of : making a measurement dataspace sample at a time t 1 . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means (comprises instructions) for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20040243607A1 CLAIM 8 . A computer readable medium as recited in claim 7 , wherein the instructions for carrying out the step of sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component further comprises instructions (instruction means) for carrying out the step of : making a measurement dataspace sample at a time t 1 . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means (comprises instructions) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040243607A1 CLAIM 7 . A computer readable medium (match server) , carrying one or more sequences of instructions for problem discovery and capacity planning of database applications , which instructions , when executed by one or more processors , cause the one or more processors to carry out the steps of : sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component ; storing the data into a storage according to an organization including at least a time dimension and a component dimension ; and drawing inferences based upon results of operations conducted on the data in the storage . US20040243607A1 CLAIM 8 . A computer readable medium as recited in claim 7 , wherein the instructions for carrying out the step of sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component further comprises instructions (instruction means) for carrying out the step of : making a measurement dataspace sample at a time t 1 . US20040243607A1 CLAIM 20 . An system , comprising : an application server system (match servers) that includes a set of application server components that host at least one application ; data collection components operatively coupled to the set of application server components , wherein the data collection components sample operational characteristics of at least one application server component to obtain data reflecting performance of the component , and wherein the performance data includes at least one measure that reflects performance of the application server components ; data storage components for storing the data according to an organization including at least a time dimension and a component dimension ; and data access components operatively coupled to the data storage components for retrieving the data and drawing inferences based upon results of operations conducted on the data in the storage . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20040243607A1 CLAIM 7 . A computer readable medium (match server) , carrying one or more sequences of instructions for problem discovery and capacity planning of database applications , which instructions , when executed by one or more processors , cause the one or more processors to carry out the steps of : sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component ; storing the data into a storage according to an organization including at least a time dimension and a component dimension ; and drawing inferences based upon results of operations conducted on the data in the storage . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means (comprises instructions) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040243607A1 CLAIM 7 . A computer readable medium (match server) , carrying one or more sequences of instructions for problem discovery and capacity planning of database applications , which instructions , when executed by one or more processors , cause the one or more processors to carry out the steps of : sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component ; storing the data into a storage according to an organization including at least a time dimension and a component dimension ; and drawing inferences based upon results of operations conducted on the data in the storage . US20040243607A1 CLAIM 8 . A computer readable medium as recited in claim 7 , wherein the instructions for carrying out the step of sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component further comprises instructions (instruction means) for carrying out the step of : making a measurement dataspace sample at a time t 1 . US20040243607A1 CLAIM 20 . An system , comprising : an application server system (match servers) that includes a set of application server components that host at least one application ; data collection components operatively coupled to the set of application server components , wherein the data collection components sample operational characteristics of at least one application server component to obtain data reflecting performance of the component , and wherein the performance data includes at least one measure that reflects performance of the application server components ; data storage components for storing the data according to an organization including at least a time dimension and a component dimension ; and data access components operatively coupled to the data storage components for retrieving the data and drawing inferences based upon results of operations conducted on the data in the storage . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20040243607A1 CLAIM 7 . A computer readable medium (match server) , carrying one or more sequences of instructions for problem discovery and capacity planning of database applications , which instructions , when executed by one or more processors , cause the one or more processors to carry out the steps of : sampling operational characteristics of at least one component hosting at least one application to obtain data reflecting performance of the component ; storing the data into a storage according to an organization including at least a time dimension and a component dimension ; and drawing inferences based upon results of operations conducted on the data in the storage . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2005338979A Filed: 2004-05-25 Issued: 2005-12-08 ライセンス発行管理方法、装置、プログラムおよび同プログラムを記録した記録媒体 (Original Assignee) Nippon Telegr & Teleph Corp <Ntt>; 日本電信電話株式会社 Satoru Chikaraishi, Atsushi Hirai, Hiroshi Imamura, Hiroaki Mikami, Takeru Miura, Koji Nada, Shinichiro Seo, 博昭 三上, 長 三浦, 浩士 今村, 悟 力石, 幸司 名田, 淳 平井, 紳一郎 瀬尾 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (コンピュ) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2005338979A CLAIM 10 請求項９に記載のライセンス発行管理プログラムを記録したコンピュ (next polling, data processing system, next polling questions) ータ読取可能な記録媒体。 |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2005338979A CLAIM 10 請求項９に記載のライセンス発行管理プログラムを記録したコンピュ (next polling, data processing system, next polling questions) ータ読取可能な記録媒体。 |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (サーバ装置) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (サーバ装置) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2005338979A CLAIM 1 利用者へコンテンツの配信を提供するコンテンツ配信サービスにおけるライセンス発行管理サーバ装置 (web server, match server) のライセンス発行管理方法であって、 各コンテンツを販売するコンテンツ登録事業者による各コンテンツの登録処理の際に各コンテンツ毎のライセンスの発行回数を設定するステップと、 利用者装置に前記ライセンスの発行回数の範囲でライセンスを発行するステップと、 を有することを特徴とするライセンス発行管理方法。 |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (サーバ装置) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2005338979A CLAIM 1 利用者へコンテンツの配信を提供するコンテンツ配信サービスにおけるライセンス発行管理サーバ装置 (web server, match server) のライセンス発行管理方法であって、 各コンテンツを販売するコンテンツ登録事業者による各コンテンツの登録処理の際に各コンテンツ毎のライセンスの発行回数を設定するステップと、 利用者装置に前記ライセンスの発行回数の範囲でライセンスを発行するステップと、 を有することを特徴とするライセンス発行管理方法。 |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (サーバ装置) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (サーバ装置) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2005338979A CLAIM 1 利用者へコンテンツの配信を提供するコンテンツ配信サービスにおけるライセンス発行管理サーバ装置 (web server, match server) のライセンス発行管理方法であって、 各コンテンツを販売するコンテンツ登録事業者による各コンテンツの登録処理の際に各コンテンツ毎のライセンスの発行回数を設定するステップと、 利用者装置に前記ライセンスの発行回数の範囲でライセンスを発行するステップと、 を有することを特徴とするライセンス発行管理方法。 |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (サーバ装置) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2005338979A CLAIM 1 利用者へコンテンツの配信を提供するコンテンツ配信サービスにおけるライセンス発行管理サーバ装置 (web server, match server) のライセンス発行管理方法であって、 各コンテンツを販売するコンテンツ登録事業者による各コンテンツの登録処理の際に各コンテンツ毎のライセンスの発行回数を設定するステップと、 利用者装置に前記ライセンスの発行回数の範囲でライセンスを発行するステップと、 を有することを特徴とするライセンス発行管理方法。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2005338979A CLAIM 10 請求項９に記載のライセンス発行管理プログラムを記録したコンピュ (next polling, data processing system, next polling questions) ータ読取可能な記録媒体。 |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (サーバ装置) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (サーバ装置) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2005338979A CLAIM 1 利用者へコンテンツの配信を提供するコンテンツ配信サービスにおけるライセンス発行管理サーバ装置 (web server, match server) のライセンス発行管理方法であって、 各コンテンツを販売するコンテンツ登録事業者による各コンテンツの登録処理の際に各コンテンツ毎のライセンスの発行回数を設定するステップと、 利用者装置に前記ライセンスの発行回数の範囲でライセンスを発行するステップと、 を有することを特徴とするライセンス発行管理方法。 |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (サーバ装置) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2005338979A CLAIM 1 利用者へコンテンツの配信を提供するコンテンツ配信サービスにおけるライセンス発行管理サーバ装置 (web server, match server) のライセンス発行管理方法であって、 各コンテンツを販売するコンテンツ登録事業者による各コンテンツの登録処理の際に各コンテンツ毎のライセンスの発行回数を設定するステップと、 利用者装置に前記ライセンスの発行回数の範囲でライセンスを発行するステップと、 を有することを特徴とするライセンス発行管理方法。 |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (サーバ装置) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (サーバ装置) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2005338979A CLAIM 1 利用者へコンテンツの配信を提供するコンテンツ配信サービスにおけるライセンス発行管理サーバ装置 (web server, match server) のライセンス発行管理方法であって、 各コンテンツを販売するコンテンツ登録事業者による各コンテンツの登録処理の際に各コンテンツ毎のライセンスの発行回数を設定するステップと、 利用者装置に前記ライセンスの発行回数の範囲でライセンスを発行するステップと、 を有することを特徴とするライセンス発行管理方法。 |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (サーバ装置) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2005338979A CLAIM 1 利用者へコンテンツの配信を提供するコンテンツ配信サービスにおけるライセンス発行管理サーバ装置 (web server, match server) のライセンス発行管理方法であって、 各コンテンツを販売するコンテンツ登録事業者による各コンテンツの登録処理の際に各コンテンツ毎のライセンスの発行回数を設定するステップと、 利用者装置に前記ライセンスの発行回数の範囲でライセンスを発行するステップと、 を有することを特徴とするライセンス発行管理方法。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2005338979A CLAIM 10 請求項９に記載のライセンス発行管理プログラムを記録したコンピュ (next polling, data processing system, next polling questions) ータ読取可能な記録媒体。 |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (サーバ装置) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (サーバ装置) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2005338979A CLAIM 1 利用者へコンテンツの配信を提供するコンテンツ配信サービスにおけるライセンス発行管理サーバ装置 (web server, match server) のライセンス発行管理方法であって、 各コンテンツを販売するコンテンツ登録事業者による各コンテンツの登録処理の際に各コンテンツ毎のライセンスの発行回数を設定するステップと、 利用者装置に前記ライセンスの発行回数の範囲でライセンスを発行するステップと、 を有することを特徴とするライセンス発行管理方法。 |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (サーバ装置) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2005338979A CLAIM 1 利用者へコンテンツの配信を提供するコンテンツ配信サービスにおけるライセンス発行管理サーバ装置 (web server, match server) のライセンス発行管理方法であって、 各コンテンツを販売するコンテンツ登録事業者による各コンテンツの登録処理の際に各コンテンツ毎のライセンスの発行回数を設定するステップと、 利用者装置に前記ライセンスの発行回数の範囲でライセンスを発行するステップと、 を有することを特徴とするライセンス発行管理方法。 |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (サーバ装置) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (サーバ装置) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2005338979A CLAIM 1 利用者へコンテンツの配信を提供するコンテンツ配信サービスにおけるライセンス発行管理サーバ装置 (web server, match server) のライセンス発行管理方法であって、 各コンテンツを販売するコンテンツ登録事業者による各コンテンツの登録処理の際に各コンテンツ毎のライセンスの発行回数を設定するステップと、 利用者装置に前記ライセンスの発行回数の範囲でライセンスを発行するステップと、 を有することを特徴とするライセンス発行管理方法。 |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (サーバ装置) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2005338979A CLAIM 1 利用者へコンテンツの配信を提供するコンテンツ配信サービスにおけるライセンス発行管理サーバ装置 (web server, match server) のライセンス発行管理方法であって、 各コンテンツを販売するコンテンツ登録事業者による各コンテンツの登録処理の際に各コンテンツ毎のライセンスの発行回数を設定するステップと、 利用者装置に前記ライセンスの発行回数の範囲でライセンスを発行するステップと、 を有することを特徴とするライセンス発行管理方法。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20050015432A1 Filed: 2004-05-13 Issued: 2005-01-20 Deriving contact information from emails (Original Assignee) Cohen Hunter C. Hunter Cohen |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (said database) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20050015432A1 CLAIM 14 . The method of claims 1 , 2 , 9 , 10 or 11 further comprising : combining said database (user information) of relationships with data related to the skills and experience of third parties to identify paths between said user and third parties having selected skills and experience . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question (said users) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20050015432A1 CLAIM 1 . A method for developing contact information from correspondence such as emails , comprising : processing a set of correspondence to develop a database of relationships between directly and indirectly addressed parties provided by one or more users . maintaining the database , on a network in which addressed parties from a plurality of users are combined , by further processing later received correspondence ; and utilizing the database of relationships to provide relationship information between at least one of said users (next polling question) and the addressed parties . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (said database) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20050015432A1 CLAIM 14 . The method of claims 1 , 2 , 9 , 10 or 11 further comprising : combining said database (user information) of relationships with data related to the skills and experience of third parties to identify paths between said user and third parties having selected skills and experience . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question (said users) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20050015432A1 CLAIM 1 . A method for developing contact information from correspondence such as emails , comprising : processing a set of correspondence to develop a database of relationships between directly and indirectly addressed parties provided by one or more users . maintaining the database , on a network in which addressed parties from a plurality of users are combined , by further processing later received correspondence ; and utilizing the database of relationships to provide relationship information between at least one of said users (next polling question) and the addressed parties . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (said database) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20050015432A1 CLAIM 14 . The method of claims 1 , 2 , 9 , 10 or 11 further comprising : combining said database (user information) of relationships with data related to the skills and experience of third parties to identify paths between said user and third parties having selected skills and experience . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question (said users) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20050015432A1 CLAIM 1 . A method for developing contact information from correspondence such as emails , comprising : processing a set of correspondence to develop a database of relationships between directly and indirectly addressed parties provided by one or more users . maintaining the database , on a network in which addressed parties from a plurality of users are combined , by further processing later received correspondence ; and utilizing the database of relationships to provide relationship information between at least one of said users (next polling question) and the addressed parties . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US7624160B2 Filed: 2004-05-04 Issued: 2009-11-24 Methods, systems, and computer program products for client side prefetching and caching of portlets (Original Assignee) International Business Machines Corp (Current Assignee) Snap Inc Roderick Charles Henderson, Yongcheng Li, Thomas Francis McElroy |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (other port) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US7624160B2 CLAIM 1 . A method for performing caching operations in a client application in a logically separated client/server computing environment , the method comprising : determining for a plurality of portlets in a portal which portlet information is to be prefetched for each of the portlets , the determining comprising : composing a portal link structure , the portal link structure comprising a hierarchical arrangement of a plurality of portlet link entries , each portlet link entry containing data describing a corresponding portlet view ; tracking a current portlet link entry as an entry whose corresponding portlet view is currently being displayed ; and determining a distance between the current portlet link entry and another port (data processing system) let link entry in the plurality of portlet link entries using the hierarchical arrangement of the plurality of portlet link entries to determine which corresponding portlet views should be prefetched ; prefetching based on the determining a distance , on a client of the logically separated client/server computing environment , the portlet information from a server for the plurality of portlets in the portal , the prefetching being done before the portlet information is requested ; storing the prefetched portlet information on a client computer ; and displaying the prefetched portlet information upon request of a user . |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands (HTML page) to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US7624160B2 CLAIM 6 . The method of claim 1 wherein the prefetched portlet information is less than an entire amount of information in an HTML page (match commands) . US7624160B2 CLAIM 11 . The computer program product of claim 8 wherein the computer readable program code configured to store (receiving match commands to identify users) the prefetched portlet information further comprises : store the prefetched portlet information to a cache . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (web browser) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US7624160B2 CLAIM 3 . The method of claim 1 wherein the displaying step further comprises : displaying the prefetched portlet information through a web browser (executable instruction, computer executable instruction) . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands (HTML page) to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US7624160B2 CLAIM 6 . The method of claim 1 wherein the prefetched portlet information is less than an entire amount of information in an HTML page (match commands) . US7624160B2 CLAIM 11 . The computer program product of claim 8 wherein the computer readable program code configured to store (receiving match commands to identify users) the prefetched portlet information further comprises : store the prefetched portlet information to a cache . |
| US9087321B2 CLAIM 19 . A computer program product (computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US7624160B2 CLAIM 8 . A computer program product (computer program product) for performing caching operations in a client application in a logically separated client/server computing environment , comprising : a computer readable storage medium having computer readable program code embodied therein , the computer readable program product further comprising : a computer readable program code configured to determine for a plurality of portlets in a portal which portlet information is to be prefetched for each of the portlets , the computer readable program code configured to : compose a portal link structure , the portal link structure comprising a hierarchical arrangement of a plurality of portlet link entries , each portlet link entry containing data describing a corresponding port let view ; track a current portlet link entry as an entry whose corresponding portlet view is currently being displayed ; determine a distance between the current portlet link entry and another portlet link entry in the plurality of portlet link entries to determine which corresponding portlet views should be prefetched ; prefetch , on a client of the logically separated client/server computing environment , the portlet information from the server for the plurality of portlets in a portal , the prefetching being done before the portlet information is requested ; store the prefetched portlet information on a client computer ; and display the prefetched portlet information upon request of the user . |
| US9087321B2 CLAIM 20 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7624160B2 CLAIM 8 . A computer program product (computer program product) for performing caching operations in a client application in a logically separated client/server computing environment , comprising : a computer readable storage medium having computer readable program code embodied therein , the computer readable program product further comprising : a computer readable program code configured to determine for a plurality of portlets in a portal which portlet information is to be prefetched for each of the portlets , the computer readable program code configured to : compose a portal link structure , the portal link structure comprising a hierarchical arrangement of a plurality of portlet link entries , each portlet link entry containing data describing a corresponding port let view ; track a current portlet link entry as an entry whose corresponding portlet view is currently being displayed ; determine a distance between the current portlet link entry and another portlet link entry in the plurality of portlet link entries to determine which corresponding portlet views should be prefetched ; prefetch , on a client of the logically separated client/server computing environment , the portlet information from the server for the plurality of portlets in a portal , the prefetching being done before the portlet information is requested ; store the prefetched portlet information on a client computer ; and display the prefetched portlet information upon request of the user . |
| US9087321B2 CLAIM 21 . The computer program product (computer program product) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US7624160B2 CLAIM 8 . A computer program product (computer program product) for performing caching operations in a client application in a logically separated client/server computing environment , comprising : a computer readable storage medium having computer readable program code embodied therein , the computer readable program product further comprising : a computer readable program code configured to determine for a plurality of portlets in a portal which portlet information is to be prefetched for each of the portlets , the computer readable program code configured to : compose a portal link structure , the portal link structure comprising a hierarchical arrangement of a plurality of portlet link entries , each portlet link entry containing data describing a corresponding port let view ; track a current portlet link entry as an entry whose corresponding portlet view is currently being displayed ; determine a distance between the current portlet link entry and another portlet link entry in the plurality of portlet link entries to determine which corresponding portlet views should be prefetched ; prefetch , on a client of the logically separated client/server computing environment , the portlet information from the server for the plurality of portlets in a portal , the prefetching being done before the portlet information is requested ; store the prefetched portlet information on a client computer ; and display the prefetched portlet information upon request of the user . |
| US9087321B2 CLAIM 22 . The computer program product (computer program product) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US7624160B2 CLAIM 8 . A computer program product (computer program product) for performing caching operations in a client application in a logically separated client/server computing environment , comprising : a computer readable storage medium having computer readable program code embodied therein , the computer readable program product further comprising : a computer readable program code configured to determine for a plurality of portlets in a portal which portlet information is to be prefetched for each of the portlets , the computer readable program code configured to : compose a portal link structure , the portal link structure comprising a hierarchical arrangement of a plurality of portlet link entries , each portlet link entry containing data describing a corresponding port let view ; track a current portlet link entry as an entry whose corresponding portlet view is currently being displayed ; determine a distance between the current portlet link entry and another portlet link entry in the plurality of portlet link entries to determine which corresponding portlet views should be prefetched ; prefetch , on a client of the logically separated client/server computing environment , the portlet information from the server for the plurality of portlets in a portal , the prefetching being done before the portlet information is requested ; store the prefetched portlet information on a client computer ; and display the prefetched portlet information upon request of the user . |
| US9087321B2 CLAIM 23 . The computer program product (computer program product) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands (HTML page) to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US7624160B2 CLAIM 6 . The method of claim 1 wherein the prefetched portlet information is less than an entire amount of information in an HTML page (match commands) . US7624160B2 CLAIM 8 . A computer program product (computer program product) for performing caching operations in a client application in a logically separated client/server computing environment , comprising : a computer readable storage medium having computer readable program code embodied therein , the computer readable program product further comprising : a computer readable program code configured to determine for a plurality of portlets in a portal which portlet information is to be prefetched for each of the portlets , the computer readable program code configured to : compose a portal link structure , the portal link structure comprising a hierarchical arrangement of a plurality of portlet link entries , each portlet link entry containing data describing a corresponding port let view ; track a current portlet link entry as an entry whose corresponding portlet view is currently being displayed ; determine a distance between the current portlet link entry and another portlet link entry in the plurality of portlet link entries to determine which corresponding portlet views should be prefetched ; prefetch , on a client of the logically separated client/server computing environment , the portlet information from the server for the plurality of portlets in a portal , the prefetching being done before the portlet information is requested ; store the prefetched portlet information on a client computer ; and display the prefetched portlet information upon request of the user . US7624160B2 CLAIM 11 . The computer program product of claim 8 wherein the computer readable program code configured to store (receiving match commands to identify users) the prefetched portlet information further comprises : store the prefetched portlet information to a cache . |
| US9087321B2 CLAIM 24 . The computer program product (computer program product) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7624160B2 CLAIM 8 . A computer program product (computer program product) for performing caching operations in a client application in a logically separated client/server computing environment , comprising : a computer readable storage medium having computer readable program code embodied therein , the computer readable program product further comprising : a computer readable program code configured to determine for a plurality of portlets in a portal which portlet information is to be prefetched for each of the portlets , the computer readable program code configured to : compose a portal link structure , the portal link structure comprising a hierarchical arrangement of a plurality of portlet link entries , each portlet link entry containing data describing a corresponding port let view ; track a current portlet link entry as an entry whose corresponding portlet view is currently being displayed ; determine a distance between the current portlet link entry and another portlet link entry in the plurality of portlet link entries to determine which corresponding portlet views should be prefetched ; prefetch , on a client of the logically separated client/server computing environment , the portlet information from the server for the plurality of portlets in a portal , the prefetching being done before the portlet information is requested ; store the prefetched portlet information on a client computer ; and display the prefetched portlet information upon request of the user . |
| US9087321B2 CLAIM 25 . The computer program product (computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7624160B2 CLAIM 8 . A computer program product (computer program product) for performing caching operations in a client application in a logically separated client/server computing environment , comprising : a computer readable storage medium having computer readable program code embodied therein , the computer readable program product further comprising : a computer readable program code configured to determine for a plurality of portlets in a portal which portlet information is to be prefetched for each of the portlets , the computer readable program code configured to : compose a portal link structure , the portal link structure comprising a hierarchical arrangement of a plurality of portlet link entries , each portlet link entry containing data describing a corresponding port let view ; track a current portlet link entry as an entry whose corresponding portlet view is currently being displayed ; determine a distance between the current portlet link entry and another portlet link entry in the plurality of portlet link entries to determine which corresponding portlet views should be prefetched ; prefetch , on a client of the logically separated client/server computing environment , the portlet information from the server for the plurality of portlets in a portal , the prefetching being done before the portlet information is requested ; store the prefetched portlet information on a client computer ; and display the prefetched portlet information upon request of the user . |
| US9087321B2 CLAIM 26 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7624160B2 CLAIM 8 . A computer program product (computer program product) for performing caching operations in a client application in a logically separated client/server computing environment , comprising : a computer readable storage medium having computer readable program code embodied therein , the computer readable program product further comprising : a computer readable program code configured to determine for a plurality of portlets in a portal which portlet information is to be prefetched for each of the portlets , the computer readable program code configured to : compose a portal link structure , the portal link structure comprising a hierarchical arrangement of a plurality of portlet link entries , each portlet link entry containing data describing a corresponding port let view ; track a current portlet link entry as an entry whose corresponding portlet view is currently being displayed ; determine a distance between the current portlet link entry and another portlet link entry in the plurality of portlet link entries to determine which corresponding portlet views should be prefetched ; prefetch , on a client of the logically separated client/server computing environment , the portlet information from the server for the plurality of portlets in a portal , the prefetching being done before the portlet information is requested ; store the prefetched portlet information on a client computer ; and display the prefetched portlet information upon request of the user . |
| US9087321B2 CLAIM 27 . The computer program product (computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7624160B2 CLAIM 8 . A computer program product (computer program product) for performing caching operations in a client application in a logically separated client/server computing environment , comprising : a computer readable storage medium having computer readable program code embodied therein , the computer readable program product further comprising : a computer readable program code configured to determine for a plurality of portlets in a portal which portlet information is to be prefetched for each of the portlets , the computer readable program code configured to : compose a portal link structure , the portal link structure comprising a hierarchical arrangement of a plurality of portlet link entries , each portlet link entry containing data describing a corresponding port let view ; track a current portlet link entry as an entry whose corresponding portlet view is currently being displayed ; determine a distance between the current portlet link entry and another portlet link entry in the plurality of portlet link entries to determine which corresponding portlet views should be prefetched ; prefetch , on a client of the logically separated client/server computing environment , the portlet information from the server for the plurality of portlets in a portal , the prefetching being done before the portlet information is requested ; store the prefetched portlet information on a client computer ; and display the prefetched portlet information upon request of the user . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20040167984A1 Filed: 2004-03-17 Issued: 2004-08-26 System Providing Methodology for Access Control with Cooperative Enforcement (Original Assignee) Zone Labs Inc (Current Assignee) Check Point Software Technologies Inc Conrad Herrmann |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (collecting step) , to a plurality of match servers (collecting step) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040167984A1 CLAIM 51 . The method of claim 42 , wherein said collecting step (match aggregator, match servers) includes requesting attribute information from the client . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (collecting step) , to a plurality of match servers (collecting step) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040167984A1 CLAIM 51 . The method of claim 42 , wherein said collecting step (match aggregator, match servers) includes requesting attribute information from the client . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one (security engine) or more processors and a memory specifically encoded with computer executable instruction (executable instruction) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20040167984A1 CLAIM 20 . A computer-readable medium having processor-executable instruction (executable instruction) s for performing the method of claim 1 . US20040167984A1 CLAIM 41 . The system of claim 22 , wherein the supplemental authentication module comprises a selected one of an anti-virus engine , a configuration checker , and a security engine (computer having one) . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (collecting step) , to a plurality of match servers (collecting step) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040167984A1 CLAIM 51 . The method of claim 42 , wherein said collecting step (match aggregator, match servers) includes requesting attribute information from the client . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (collecting step) , to a plurality of match servers (collecting step) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040167984A1 CLAIM 51 . The method of claim 42 , wherein said collecting step (match aggregator, match servers) includes requesting attribute information from the client . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (collecting step) , to a plurality of match servers (collecting step) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040167984A1 CLAIM 51 . The method of claim 42 , wherein said collecting step (match aggregator, match servers) includes requesting attribute information from the client . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (collecting step) , to a plurality of match servers (collecting step) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040167984A1 CLAIM 51 . The method of claim 42 , wherein said collecting step (match aggregator, match servers) includes requesting attribute information from the client . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20040162901A1 Filed: 2004-02-19 Issued: 2004-08-19 Method and apparatus for policy based class service and adaptive service level management within the context of an internet and intranet (Original Assignee) Krishna Mangipudi; Vijay Basani Krishna Mangipudi, Vijay Basani |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (collect information) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040162901A1 CLAIM 7 . The method of claim 5 in which the step of running a load balancing algorithm further comprises the steps of : deploying an intelligent agent on at least one of said plurality of back-end servers ; using said intelligent agent to collect information (match aggregator) in the form of selected server attributes ; transmitting said collected information to an adaptive policy engine ; and selecting a back-end server according to the collected server attributes . US20040162901A1 CLAIM 9 . A method for implementing collection of information for monitoring the performance in a cluster of web server (web server) s , comprising the steps of : providing an adaptive policy engine ; deploying an intelligent agent on at least one of said plurality of web servers ; using said intelligent agent to collect information in the form of selected server attributes ; transmitting said collected information to said adaptive policy engine for use in dynamically allocate requests to selected web servers in said cluster of web servers to meet pre-defined Service Level Agreements (SLA) . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (collect information) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040162901A1 CLAIM 7 . The method of claim 5 in which the step of running a load balancing algorithm further comprises the steps of : deploying an intelligent agent on at least one of said plurality of back-end servers ; using said intelligent agent to collect information (match aggregator) in the form of selected server attributes ; transmitting said collected information to an adaptive policy engine ; and selecting a back-end server according to the collected server attributes . US20040162901A1 CLAIM 9 . A method for implementing collection of information for monitoring the performance in a cluster of web server (web server) s , comprising the steps of : providing an adaptive policy engine ; deploying an intelligent agent on at least one of said plurality of web servers ; using said intelligent agent to collect information in the form of selected server attributes ; transmitting said collected information to said adaptive policy engine for use in dynamically allocate requests to selected web servers in said cluster of web servers to meet pre-defined Service Level Agreements (SLA) . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (collect information) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040162901A1 CLAIM 7 . The method of claim 5 in which the step of running a load balancing algorithm further comprises the steps of : deploying an intelligent agent on at least one of said plurality of back-end servers ; using said intelligent agent to collect information (match aggregator) in the form of selected server attributes ; transmitting said collected information to an adaptive policy engine ; and selecting a back-end server according to the collected server attributes . US20040162901A1 CLAIM 9 . A method for implementing collection of information for monitoring the performance in a cluster of web server (web server) s , comprising the steps of : providing an adaptive policy engine ; deploying an intelligent agent on at least one of said plurality of web servers ; using said intelligent agent to collect information in the form of selected server attributes ; transmitting said collected information to said adaptive policy engine for use in dynamically allocate requests to selected web servers in said cluster of web servers to meet pre-defined Service Level Agreements (SLA) . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (collect information) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040162901A1 CLAIM 7 . The method of claim 5 in which the step of running a load balancing algorithm further comprises the steps of : deploying an intelligent agent on at least one of said plurality of back-end servers ; using said intelligent agent to collect information (match aggregator) in the form of selected server attributes ; transmitting said collected information to an adaptive policy engine ; and selecting a back-end server according to the collected server attributes . US20040162901A1 CLAIM 9 . A method for implementing collection of information for monitoring the performance in a cluster of web server (web server) s , comprising the steps of : providing an adaptive policy engine ; deploying an intelligent agent on at least one of said plurality of web servers ; using said intelligent agent to collect information in the form of selected server attributes ; transmitting said collected information to said adaptive policy engine for use in dynamically allocate requests to selected web servers in said cluster of web servers to meet pre-defined Service Level Agreements (SLA) . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (collect information) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040162901A1 CLAIM 7 . The method of claim 5 in which the step of running a load balancing algorithm further comprises the steps of : deploying an intelligent agent on at least one of said plurality of back-end servers ; using said intelligent agent to collect information (match aggregator) in the form of selected server attributes ; transmitting said collected information to an adaptive policy engine ; and selecting a back-end server according to the collected server attributes . US20040162901A1 CLAIM 9 . A method for implementing collection of information for monitoring the performance in a cluster of web server (web server) s , comprising the steps of : providing an adaptive policy engine ; deploying an intelligent agent on at least one of said plurality of web servers ; using said intelligent agent to collect information in the form of selected server attributes ; transmitting said collected information to said adaptive policy engine for use in dynamically allocate requests to selected web servers in said cluster of web servers to meet pre-defined Service Level Agreements (SLA) . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (collect information) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20040162901A1 CLAIM 7 . The method of claim 5 in which the step of running a load balancing algorithm further comprises the steps of : deploying an intelligent agent on at least one of said plurality of back-end servers ; using said intelligent agent to collect information (match aggregator) in the form of selected server attributes ; transmitting said collected information to an adaptive policy engine ; and selecting a back-end server according to the collected server attributes . US20040162901A1 CLAIM 9 . A method for implementing collection of information for monitoring the performance in a cluster of web server (web server) s , comprising the steps of : providing an adaptive policy engine ; deploying an intelligent agent on at least one of said plurality of web servers ; using said intelligent agent to collect information in the form of selected server attributes ; transmitting said collected information to said adaptive policy engine for use in dynamically allocate requests to selected web servers in said cluster of web servers to meet pre-defined Service Level Agreements (SLA) . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US7340477B1 Filed: 2003-12-16 Issued: 2008-03-04 Method and system for a telemetry warehouse for storing, retrieving and analyzing data (Original Assignee) Unisys Corp (Current Assignee) Unisys Corp Douglas Marshall Tolbert, Sandra Motter Hickoff, James Albert Fontana |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (multiple dimension) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7340477B1 CLAIM 1 . In a network of local and remote server machines , incorporated as software on a computer medium , which supports a multi-function , multi-partitioned series of operating systems , a method for establishing an original warehouse database of performance data , usable by clients , comprising the steps of : (a) collecting performance data directly from said local and remote server machines including the step of : (a1) interfacing a collection manager API for allowing clients direct access to a data collection system to initiate collection of performance data ; said interfacing including the steps of : (a1a) defining and managing groups of performance counters ; (a1b) initiating the start of data collection ; (a1c) stopping the cycle of data collection ; (a1d) checking the status of a data collection cycle ; (b) organizing and storing said performance data in a relational database and including the steps of : (b1) developing said original warehouse database having a multidimensional data store as a star schema , and which includes the step of : (b1a) establishing a star schema of tables wherein a fact table , having rows each containing (i) a single measured numeric value ; (ii) an optional text string : and (iii) cross references to other tables , is surrounded by and interconnected to multiple dimension (match server) tables which provide various metric attributes for each row in said fact table ; and (b1b) providing information from said series of operating systems directly to said star schema without need to reconfigure said original database ; (b2) storing collected performance data in cube formats in said multidimensional data store , arranged as a star schema said collected performance data being capable of storing various kinds of performance data at various times without requiring schema changes ; (b3) accessing said collected performance data for analysis of server operations . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (multiple dimension) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7340477B1 CLAIM 1 . In a network of local and remote server machines , incorporated as software on a computer medium , which supports a multi-function , multi-partitioned series of operating systems , a method for establishing an original warehouse database of performance data , usable by clients , comprising the steps of : (a) collecting performance data directly from said local and remote server machines including the step of : (a1) interfacing a collection manager API for allowing clients direct access to a data collection system to initiate collection of performance data ; said interfacing including the steps of : (a1a) defining and managing groups of performance counters ; (a1b) initiating the start of data collection ; (a1c) stopping the cycle of data collection ; (a1d) checking the status of a data collection cycle ; (b) organizing and storing said performance data in a relational database and including the steps of : (b1) developing said original warehouse database having a multidimensional data store as a star schema , and which includes the step of : (b1a) establishing a star schema of tables wherein a fact table , having rows each containing (i) a single measured numeric value ; (ii) an optional text string : and (iii) cross references to other tables , is surrounded by and interconnected to multiple dimension (match server) tables which provide various metric attributes for each row in said fact table ; and (b1b) providing information from said series of operating systems directly to said star schema without need to reconfigure said original database ; (b2) storing collected performance data in cube formats in said multidimensional data store , arranged as a star schema said collected performance data being capable of storing various kinds of performance data at various times without requiring schema changes ; (b3) accessing said collected performance data for analysis of server operations . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (multiple dimension) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7340477B1 CLAIM 1 . In a network of local and remote server machines , incorporated as software on a computer medium , which supports a multi-function , multi-partitioned series of operating systems , a method for establishing an original warehouse database of performance data , usable by clients , comprising the steps of : (a) collecting performance data directly from said local and remote server machines including the step of : (a1) interfacing a collection manager API for allowing clients direct access to a data collection system to initiate collection of performance data ; said interfacing including the steps of : (a1a) defining and managing groups of performance counters ; (a1b) initiating the start of data collection ; (a1c) stopping the cycle of data collection ; (a1d) checking the status of a data collection cycle ; (b) organizing and storing said performance data in a relational database and including the steps of : (b1) developing said original warehouse database having a multidimensional data store as a star schema , and which includes the step of : (b1a) establishing a star schema of tables wherein a fact table , having rows each containing (i) a single measured numeric value ; (ii) an optional text string : and (iii) cross references to other tables , is surrounded by and interconnected to multiple dimension (match server) tables which provide various metric attributes for each row in said fact table ; and (b1b) providing information from said series of operating systems directly to said star schema without need to reconfigure said original database ; (b2) storing collected performance data in cube formats in said multidimensional data store , arranged as a star schema said collected performance data being capable of storing various kinds of performance data at various times without requiring schema changes ; (b3) accessing said collected performance data for analysis of server operations . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (multiple dimension) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7340477B1 CLAIM 1 . In a network of local and remote server machines , incorporated as software on a computer medium , which supports a multi-function , multi-partitioned series of operating systems , a method for establishing an original warehouse database of performance data , usable by clients , comprising the steps of : (a) collecting performance data directly from said local and remote server machines including the step of : (a1) interfacing a collection manager API for allowing clients direct access to a data collection system to initiate collection of performance data ; said interfacing including the steps of : (a1a) defining and managing groups of performance counters ; (a1b) initiating the start of data collection ; (a1c) stopping the cycle of data collection ; (a1d) checking the status of a data collection cycle ; (b) organizing and storing said performance data in a relational database and including the steps of : (b1) developing said original warehouse database having a multidimensional data store as a star schema , and which includes the step of : (b1a) establishing a star schema of tables wherein a fact table , having rows each containing (i) a single measured numeric value ; (ii) an optional text string : and (iii) cross references to other tables , is surrounded by and interconnected to multiple dimension (match server) tables which provide various metric attributes for each row in said fact table ; and (b1b) providing information from said series of operating systems directly to said star schema without need to reconfigure said original database ; (b2) storing collected performance data in cube formats in said multidimensional data store , arranged as a star schema said collected performance data being capable of storing various kinds of performance data at various times without requiring schema changes ; (b3) accessing said collected performance data for analysis of server operations . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one (storing computer program) or more processors and a memory specifically encoded with computer executable instruction (storing computer program) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US7340477B1 CLAIM 2 . A computer readable storage medium storing computer program (computer executable instruction, computer program product, computer having one, computer program product comprising computer) including instructions , executed by a computing system , causes the computing system to implement the method of claim 1 . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (multiple dimension) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7340477B1 CLAIM 1 . In a network of local and remote server machines , incorporated as software on a computer medium , which supports a multi-function , multi-partitioned series of operating systems , a method for establishing an original warehouse database of performance data , usable by clients , comprising the steps of : (a) collecting performance data directly from said local and remote server machines including the step of : (a1) interfacing a collection manager API for allowing clients direct access to a data collection system to initiate collection of performance data ; said interfacing including the steps of : (a1a) defining and managing groups of performance counters ; (a1b) initiating the start of data collection ; (a1c) stopping the cycle of data collection ; (a1d) checking the status of a data collection cycle ; (b) organizing and storing said performance data in a relational database and including the steps of : (b1) developing said original warehouse database having a multidimensional data store as a star schema , and which includes the step of : (b1a) establishing a star schema of tables wherein a fact table , having rows each containing (i) a single measured numeric value ; (ii) an optional text string : and (iii) cross references to other tables , is surrounded by and interconnected to multiple dimension (match server) tables which provide various metric attributes for each row in said fact table ; and (b1b) providing information from said series of operating systems directly to said star schema without need to reconfigure said original database ; (b2) storing collected performance data in cube formats in said multidimensional data store , arranged as a star schema said collected performance data being capable of storing various kinds of performance data at various times without requiring schema changes ; (b3) accessing said collected performance data for analysis of server operations . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (multiple dimension) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7340477B1 CLAIM 1 . In a network of local and remote server machines , incorporated as software on a computer medium , which supports a multi-function , multi-partitioned series of operating systems , a method for establishing an original warehouse database of performance data , usable by clients , comprising the steps of : (a) collecting performance data directly from said local and remote server machines including the step of : (a1) interfacing a collection manager API for allowing clients direct access to a data collection system to initiate collection of performance data ; said interfacing including the steps of : (a1a) defining and managing groups of performance counters ; (a1b) initiating the start of data collection ; (a1c) stopping the cycle of data collection ; (a1d) checking the status of a data collection cycle ; (b) organizing and storing said performance data in a relational database and including the steps of : (b1) developing said original warehouse database having a multidimensional data store as a star schema , and which includes the step of : (b1a) establishing a star schema of tables wherein a fact table , having rows each containing (i) a single measured numeric value ; (ii) an optional text string : and (iii) cross references to other tables , is surrounded by and interconnected to multiple dimension (match server) tables which provide various metric attributes for each row in said fact table ; and (b1b) providing information from said series of operating systems directly to said star schema without need to reconfigure said original database ; (b2) storing collected performance data in cube formats in said multidimensional data store , arranged as a star schema said collected performance data being capable of storing various kinds of performance data at various times without requiring schema changes ; (b3) accessing said collected performance data for analysis of server operations . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (multiple dimension) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7340477B1 CLAIM 1 . In a network of local and remote server machines , incorporated as software on a computer medium , which supports a multi-function , multi-partitioned series of operating systems , a method for establishing an original warehouse database of performance data , usable by clients , comprising the steps of : (a) collecting performance data directly from said local and remote server machines including the step of : (a1) interfacing a collection manager API for allowing clients direct access to a data collection system to initiate collection of performance data ; said interfacing including the steps of : (a1a) defining and managing groups of performance counters ; (a1b) initiating the start of data collection ; (a1c) stopping the cycle of data collection ; (a1d) checking the status of a data collection cycle ; (b) organizing and storing said performance data in a relational database and including the steps of : (b1) developing said original warehouse database having a multidimensional data store as a star schema , and which includes the step of : (b1a) establishing a star schema of tables wherein a fact table , having rows each containing (i) a single measured numeric value ; (ii) an optional text string : and (iii) cross references to other tables , is surrounded by and interconnected to multiple dimension (match server) tables which provide various metric attributes for each row in said fact table ; and (b1b) providing information from said series of operating systems directly to said star schema without need to reconfigure said original database ; (b2) storing collected performance data in cube formats in said multidimensional data store , arranged as a star schema said collected performance data being capable of storing various kinds of performance data at various times without requiring schema changes ; (b3) accessing said collected performance data for analysis of server operations . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (multiple dimension) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7340477B1 CLAIM 1 . In a network of local and remote server machines , incorporated as software on a computer medium , which supports a multi-function , multi-partitioned series of operating systems , a method for establishing an original warehouse database of performance data , usable by clients , comprising the steps of : (a) collecting performance data directly from said local and remote server machines including the step of : (a1) interfacing a collection manager API for allowing clients direct access to a data collection system to initiate collection of performance data ; said interfacing including the steps of : (a1a) defining and managing groups of performance counters ; (a1b) initiating the start of data collection ; (a1c) stopping the cycle of data collection ; (a1d) checking the status of a data collection cycle ; (b) organizing and storing said performance data in a relational database and including the steps of : (b1) developing said original warehouse database having a multidimensional data store as a star schema , and which includes the step of : (b1a) establishing a star schema of tables wherein a fact table , having rows each containing (i) a single measured numeric value ; (ii) an optional text string : and (iii) cross references to other tables , is surrounded by and interconnected to multiple dimension (match server) tables which provide various metric attributes for each row in said fact table ; and (b1b) providing information from said series of operating systems directly to said star schema without need to reconfigure said original database ; (b2) storing collected performance data in cube formats in said multidimensional data store , arranged as a star schema said collected performance data being capable of storing various kinds of performance data at various times without requiring schema changes ; (b3) accessing said collected performance data for analysis of server operations . |
| US9087321B2 CLAIM 19 . A computer program product (storing computer program) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US7340477B1 CLAIM 2 . A computer readable storage medium storing computer program (computer executable instruction, computer program product, computer having one, computer program product comprising computer) including instructions , executed by a computing system , causes the computing system to implement the method of claim 1 . |
| US9087321B2 CLAIM 20 . The computer program product (storing computer program) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7340477B1 CLAIM 2 . A computer readable storage medium storing computer program (computer executable instruction, computer program product, computer having one, computer program product comprising computer) including instructions , executed by a computing system , causes the computing system to implement the method of claim 1 . |
| US9087321B2 CLAIM 21 . The computer program product (storing computer program) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US7340477B1 CLAIM 2 . A computer readable storage medium storing computer program (computer executable instruction, computer program product, computer having one, computer program product comprising computer) including instructions , executed by a computing system , causes the computing system to implement the method of claim 1 . |
| US9087321B2 CLAIM 22 . The computer program product (storing computer program) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US7340477B1 CLAIM 2 . A computer readable storage medium storing computer program (computer executable instruction, computer program product, computer having one, computer program product comprising computer) including instructions , executed by a computing system , causes the computing system to implement the method of claim 1 . |
| US9087321B2 CLAIM 23 . The computer program product (storing computer program) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US7340477B1 CLAIM 2 . A computer readable storage medium storing computer program (computer executable instruction, computer program product, computer having one, computer program product comprising computer) including instructions , executed by a computing system , causes the computing system to implement the method of claim 1 . |
| US9087321B2 CLAIM 24 . The computer program product (storing computer program) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (multiple dimension) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7340477B1 CLAIM 1 . In a network of local and remote server machines , incorporated as software on a computer medium , which supports a multi-function , multi-partitioned series of operating systems , a method for establishing an original warehouse database of performance data , usable by clients , comprising the steps of : (a) collecting performance data directly from said local and remote server machines including the step of : (a1) interfacing a collection manager API for allowing clients direct access to a data collection system to initiate collection of performance data ; said interfacing including the steps of : (a1a) defining and managing groups of performance counters ; (a1b) initiating the start of data collection ; (a1c) stopping the cycle of data collection ; (a1d) checking the status of a data collection cycle ; (b) organizing and storing said performance data in a relational database and including the steps of : (b1) developing said original warehouse database having a multidimensional data store as a star schema , and which includes the step of : (b1a) establishing a star schema of tables wherein a fact table , having rows each containing (i) a single measured numeric value ; (ii) an optional text string : and (iii) cross references to other tables , is surrounded by and interconnected to multiple dimension (match server) tables which provide various metric attributes for each row in said fact table ; and (b1b) providing information from said series of operating systems directly to said star schema without need to reconfigure said original database ; (b2) storing collected performance data in cube formats in said multidimensional data store , arranged as a star schema said collected performance data being capable of storing various kinds of performance data at various times without requiring schema changes ; (b3) accessing said collected performance data for analysis of server operations . US7340477B1 CLAIM 2 . A computer readable storage medium storing computer program (computer executable instruction, computer program product, computer having one, computer program product comprising computer) including instructions , executed by a computing system , causes the computing system to implement the method of claim 1 . |
| US9087321B2 CLAIM 25 . The computer program product (storing computer program) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (multiple dimension) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7340477B1 CLAIM 1 . In a network of local and remote server machines , incorporated as software on a computer medium , which supports a multi-function , multi-partitioned series of operating systems , a method for establishing an original warehouse database of performance data , usable by clients , comprising the steps of : (a) collecting performance data directly from said local and remote server machines including the step of : (a1) interfacing a collection manager API for allowing clients direct access to a data collection system to initiate collection of performance data ; said interfacing including the steps of : (a1a) defining and managing groups of performance counters ; (a1b) initiating the start of data collection ; (a1c) stopping the cycle of data collection ; (a1d) checking the status of a data collection cycle ; (b) organizing and storing said performance data in a relational database and including the steps of : (b1) developing said original warehouse database having a multidimensional data store as a star schema , and which includes the step of : (b1a) establishing a star schema of tables wherein a fact table , having rows each containing (i) a single measured numeric value ; (ii) an optional text string : and (iii) cross references to other tables , is surrounded by and interconnected to multiple dimension (match server) tables which provide various metric attributes for each row in said fact table ; and (b1b) providing information from said series of operating systems directly to said star schema without need to reconfigure said original database ; (b2) storing collected performance data in cube formats in said multidimensional data store , arranged as a star schema said collected performance data being capable of storing various kinds of performance data at various times without requiring schema changes ; (b3) accessing said collected performance data for analysis of server operations . US7340477B1 CLAIM 2 . A computer readable storage medium storing computer program (computer executable instruction, computer program product, computer having one, computer program product comprising computer) including instructions , executed by a computing system , causes the computing system to implement the method of claim 1 . |
| US9087321B2 CLAIM 26 . The computer program product (storing computer program) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (multiple dimension) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7340477B1 CLAIM 1 . In a network of local and remote server machines , incorporated as software on a computer medium , which supports a multi-function , multi-partitioned series of operating systems , a method for establishing an original warehouse database of performance data , usable by clients , comprising the steps of : (a) collecting performance data directly from said local and remote server machines including the step of : (a1) interfacing a collection manager API for allowing clients direct access to a data collection system to initiate collection of performance data ; said interfacing including the steps of : (a1a) defining and managing groups of performance counters ; (a1b) initiating the start of data collection ; (a1c) stopping the cycle of data collection ; (a1d) checking the status of a data collection cycle ; (b) organizing and storing said performance data in a relational database and including the steps of : (b1) developing said original warehouse database having a multidimensional data store as a star schema , and which includes the step of : (b1a) establishing a star schema of tables wherein a fact table , having rows each containing (i) a single measured numeric value ; (ii) an optional text string : and (iii) cross references to other tables , is surrounded by and interconnected to multiple dimension (match server) tables which provide various metric attributes for each row in said fact table ; and (b1b) providing information from said series of operating systems directly to said star schema without need to reconfigure said original database ; (b2) storing collected performance data in cube formats in said multidimensional data store , arranged as a star schema said collected performance data being capable of storing various kinds of performance data at various times without requiring schema changes ; (b3) accessing said collected performance data for analysis of server operations . US7340477B1 CLAIM 2 . A computer readable storage medium storing computer program (computer executable instruction, computer program product, computer having one, computer program product comprising computer) including instructions , executed by a computing system , causes the computing system to implement the method of claim 1 . |
| US9087321B2 CLAIM 27 . The computer program product (storing computer program) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (multiple dimension) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7340477B1 CLAIM 1 . In a network of local and remote server machines , incorporated as software on a computer medium , which supports a multi-function , multi-partitioned series of operating systems , a method for establishing an original warehouse database of performance data , usable by clients , comprising the steps of : (a) collecting performance data directly from said local and remote server machines including the step of : (a1) interfacing a collection manager API for allowing clients direct access to a data collection system to initiate collection of performance data ; said interfacing including the steps of : (a1a) defining and managing groups of performance counters ; (a1b) initiating the start of data collection ; (a1c) stopping the cycle of data collection ; (a1d) checking the status of a data collection cycle ; (b) organizing and storing said performance data in a relational database and including the steps of : (b1) developing said original warehouse database having a multidimensional data store as a star schema , and which includes the step of : (b1a) establishing a star schema of tables wherein a fact table , having rows each containing (i) a single measured numeric value ; (ii) an optional text string : and (iii) cross references to other tables , is surrounded by and interconnected to multiple dimension (match server) tables which provide various metric attributes for each row in said fact table ; and (b1b) providing information from said series of operating systems directly to said star schema without need to reconfigure said original database ; (b2) storing collected performance data in cube formats in said multidimensional data store , arranged as a star schema said collected performance data being capable of storing various kinds of performance data at various times without requiring schema changes ; (b3) accessing said collected performance data for analysis of server operations . US7340477B1 CLAIM 2 . A computer readable storage medium storing computer program (computer executable instruction, computer program product, computer having one, computer program product comprising computer) including instructions , executed by a computing system , causes the computing system to implement the method of claim 1 . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20050022207A1 Filed: 2003-07-25 Issued: 2005-01-27 Methods and apparatus for creation of parsing rules (Original Assignee) International Business Machines Corp (Current Assignee) Facebook Inc Genady Grabarnik, Sheng Ma, Chang-shing Perng, Abdolreza Salahshour, David Thoenen |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (more gene) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20050022207A1 CLAIM 13 . The method of claim 1 , wherein each of the one or more gene (first polling, first polling question) rated parsing rules comprises a regular expression of a portion of a message . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (more gene) question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20050022207A1 CLAIM 13 . The method of claim 1 , wherein each of the one or more gene (first polling, first polling question) rated parsing rules comprises a regular expression of a portion of a message . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (more gene) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20050022207A1 CLAIM 13 . The method of claim 1 , wherein each of the one or more gene (first polling, first polling question) rated parsing rules comprises a regular expression of a portion of a message . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (more gene) question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20050022207A1 CLAIM 13 . The method of claim 1 , wherein each of the one or more gene (first polling, first polling question) rated parsing rules comprises a regular expression of a portion of a message . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (more gene) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20050022207A1 CLAIM 13 . The method of claim 1 , wherein each of the one or more gene (first polling, first polling question) rated parsing rules comprises a regular expression of a portion of a message . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (more gene) question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20050022207A1 CLAIM 13 . The method of claim 1 , wherein each of the one or more gene (first polling, first polling question) rated parsing rules comprises a regular expression of a portion of a message . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2004362118A Filed: 2003-06-03 Issued: 2004-12-24 電子掲示板機能を備えたサーバ装置 (Original Assignee) Murata Mach Ltd; 村田機械株式会社 Masafumi Eguchi, Yoshifumi Tanimoto, 政史 江口, 好史 谷本 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2004362118A CLAIM 1 画像データ (user information) 及びテキストデータを掲載文書として扱うことができ、コメントに対する返信機能としてコメントの返信、画像の返信及び画像編集の返信が可能な電子掲示板機能を備えたサーバ装置において、画像データを格納する画像格納手段と、テキストデータを格納するコメント格納手段と、画像編集のみあるいは新規画像登録のみの返信があったとき、画像編集あるいは新規画像登録の返信があったことを示すコメントを作成する手段と、上記作成したコメント及び編集画像あるいは新規登録画像又はそれらの画像へのショートカット情報を含む電子掲示板情報を作成する手段とを備えたことを特徴とする電子掲示板機能を備えたサーバ装置。 |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (サーバ装置) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (サーバ装置) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2004362118A CLAIM 1 画像データ及びテキストデータを掲載文書として扱うことができ、コメントに対する返信機能としてコメントの返信、画像の返信及び画像編集の返信が可能な電子掲示板機能を備えたサーバ装置 (web server, match server) において、画像データを格納する画像格納手段と、テキストデータを格納するコメント格納手段と、画像編集のみあるいは新規画像登録のみの返信があったとき、画像編集あるいは新規画像登録の返信があったことを示すコメントを作成する手段と、上記作成したコメント及び編集画像あるいは新規登録画像又はそれらの画像へのショートカット情報を含む電子掲示板情報を作成する手段とを備えたことを特徴とする電子掲示板機能を備えたサーバ装置。 |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (サーバ装置) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2004362118A CLAIM 1 画像データ及びテキストデータを掲載文書として扱うことができ、コメントに対する返信機能としてコメントの返信、画像の返信及び画像編集の返信が可能な電子掲示板機能を備えたサーバ装置 (web server, match server) において、画像データを格納する画像格納手段と、テキストデータを格納するコメント格納手段と、画像編集のみあるいは新規画像登録のみの返信があったとき、画像編集あるいは新規画像登録の返信があったことを示すコメントを作成する手段と、上記作成したコメント及び編集画像あるいは新規登録画像又はそれらの画像へのショートカット情報を含む電子掲示板情報を作成する手段とを備えたことを特徴とする電子掲示板機能を備えたサーバ装置。 |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (サーバ装置) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (サーバ装置) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2004362118A CLAIM 1 画像データ及びテキストデータを掲載文書として扱うことができ、コメントに対する返信機能としてコメントの返信、画像の返信及び画像編集の返信が可能な電子掲示板機能を備えたサーバ装置 (web server, match server) において、画像データを格納する画像格納手段と、テキストデータを格納するコメント格納手段と、画像編集のみあるいは新規画像登録のみの返信があったとき、画像編集あるいは新規画像登録の返信があったことを示すコメントを作成する手段と、上記作成したコメント及び編集画像あるいは新規登録画像又はそれらの画像へのショートカット情報を含む電子掲示板情報を作成する手段とを備えたことを特徴とする電子掲示板機能を備えたサーバ装置。 |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (サーバ装置) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2004362118A CLAIM 1 画像データ及びテキストデータを掲載文書として扱うことができ、コメントに対する返信機能としてコメントの返信、画像の返信及び画像編集の返信が可能な電子掲示板機能を備えたサーバ装置 (web server, match server) において、画像データを格納する画像格納手段と、テキストデータを格納するコメント格納手段と、画像編集のみあるいは新規画像登録のみの返信があったとき、画像編集あるいは新規画像登録の返信があったことを示すコメントを作成する手段と、上記作成したコメント及び編集画像あるいは新規登録画像又はそれらの画像へのショートカット情報を含む電子掲示板情報を作成する手段とを備えたことを特徴とする電子掲示板機能を備えたサーバ装置。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2004362118A CLAIM 1 画像データ (user information) 及びテキストデータを掲載文書として扱うことができ、コメントに対する返信機能としてコメントの返信、画像の返信及び画像編集の返信が可能な電子掲示板機能を備えたサーバ装置において、画像データを格納する画像格納手段と、テキストデータを格納するコメント格納手段と、画像編集のみあるいは新規画像登録のみの返信があったとき、画像編集あるいは新規画像登録の返信があったことを示すコメントを作成する手段と、上記作成したコメント及び編集画像あるいは新規登録画像又はそれらの画像へのショートカット情報を含む電子掲示板情報を作成する手段とを備えたことを特徴とする電子掲示板機能を備えたサーバ装置。 |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (サーバ装置) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (サーバ装置) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2004362118A CLAIM 1 画像データ及びテキストデータを掲載文書として扱うことができ、コメントに対する返信機能としてコメントの返信、画像の返信及び画像編集の返信が可能な電子掲示板機能を備えたサーバ装置 (web server, match server) において、画像データを格納する画像格納手段と、テキストデータを格納するコメント格納手段と、画像編集のみあるいは新規画像登録のみの返信があったとき、画像編集あるいは新規画像登録の返信があったことを示すコメントを作成する手段と、上記作成したコメント及び編集画像あるいは新規登録画像又はそれらの画像へのショートカット情報を含む電子掲示板情報を作成する手段とを備えたことを特徴とする電子掲示板機能を備えたサーバ装置。 |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (サーバ装置) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2004362118A CLAIM 1 画像データ及びテキストデータを掲載文書として扱うことができ、コメントに対する返信機能としてコメントの返信、画像の返信及び画像編集の返信が可能な電子掲示板機能を備えたサーバ装置 (web server, match server) において、画像データを格納する画像格納手段と、テキストデータを格納するコメント格納手段と、画像編集のみあるいは新規画像登録のみの返信があったとき、画像編集あるいは新規画像登録の返信があったことを示すコメントを作成する手段と、上記作成したコメント及び編集画像あるいは新規登録画像又はそれらの画像へのショートカット情報を含む電子掲示板情報を作成する手段とを備えたことを特徴とする電子掲示板機能を備えたサーバ装置。 |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (サーバ装置) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (サーバ装置) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2004362118A CLAIM 1 画像データ及びテキストデータを掲載文書として扱うことができ、コメントに対する返信機能としてコメントの返信、画像の返信及び画像編集の返信が可能な電子掲示板機能を備えたサーバ装置 (web server, match server) において、画像データを格納する画像格納手段と、テキストデータを格納するコメント格納手段と、画像編集のみあるいは新規画像登録のみの返信があったとき、画像編集あるいは新規画像登録の返信があったことを示すコメントを作成する手段と、上記作成したコメント及び編集画像あるいは新規登録画像又はそれらの画像へのショートカット情報を含む電子掲示板情報を作成する手段とを備えたことを特徴とする電子掲示板機能を備えたサーバ装置。 |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (サーバ装置) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2004362118A CLAIM 1 画像データ及びテキストデータを掲載文書として扱うことができ、コメントに対する返信機能としてコメントの返信、画像の返信及び画像編集の返信が可能な電子掲示板機能を備えたサーバ装置 (web server, match server) において、画像データを格納する画像格納手段と、テキストデータを格納するコメント格納手段と、画像編集のみあるいは新規画像登録のみの返信があったとき、画像編集あるいは新規画像登録の返信があったことを示すコメントを作成する手段と、上記作成したコメント及び編集画像あるいは新規登録画像又はそれらの画像へのショートカット情報を含む電子掲示板情報を作成する手段とを備えたことを特徴とする電子掲示板機能を備えたサーバ装置。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2004362118A CLAIM 1 画像データ (user information) 及びテキストデータを掲載文書として扱うことができ、コメントに対する返信機能としてコメントの返信、画像の返信及び画像編集の返信が可能な電子掲示板機能を備えたサーバ装置において、画像データを格納する画像格納手段と、テキストデータを格納するコメント格納手段と、画像編集のみあるいは新規画像登録のみの返信があったとき、画像編集あるいは新規画像登録の返信があったことを示すコメントを作成する手段と、上記作成したコメント及び編集画像あるいは新規登録画像又はそれらの画像へのショートカット情報を含む電子掲示板情報を作成する手段とを備えたことを特徴とする電子掲示板機能を備えたサーバ装置。 |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (サーバ装置) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (サーバ装置) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2004362118A CLAIM 1 画像データ及びテキストデータを掲載文書として扱うことができ、コメントに対する返信機能としてコメントの返信、画像の返信及び画像編集の返信が可能な電子掲示板機能を備えたサーバ装置 (web server, match server) において、画像データを格納する画像格納手段と、テキストデータを格納するコメント格納手段と、画像編集のみあるいは新規画像登録のみの返信があったとき、画像編集あるいは新規画像登録の返信があったことを示すコメントを作成する手段と、上記作成したコメント及び編集画像あるいは新規登録画像又はそれらの画像へのショートカット情報を含む電子掲示板情報を作成する手段とを備えたことを特徴とする電子掲示板機能を備えたサーバ装置。 |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (サーバ装置) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2004362118A CLAIM 1 画像データ及びテキストデータを掲載文書として扱うことができ、コメントに対する返信機能としてコメントの返信、画像の返信及び画像編集の返信が可能な電子掲示板機能を備えたサーバ装置 (web server, match server) において、画像データを格納する画像格納手段と、テキストデータを格納するコメント格納手段と、画像編集のみあるいは新規画像登録のみの返信があったとき、画像編集あるいは新規画像登録の返信があったことを示すコメントを作成する手段と、上記作成したコメント及び編集画像あるいは新規登録画像又はそれらの画像へのショートカット情報を含む電子掲示板情報を作成する手段とを備えたことを特徴とする電子掲示板機能を備えたサーバ装置。 |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (サーバ装置) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (サーバ装置) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2004362118A CLAIM 1 画像データ及びテキストデータを掲載文書として扱うことができ、コメントに対する返信機能としてコメントの返信、画像の返信及び画像編集の返信が可能な電子掲示板機能を備えたサーバ装置 (web server, match server) において、画像データを格納する画像格納手段と、テキストデータを格納するコメント格納手段と、画像編集のみあるいは新規画像登録のみの返信があったとき、画像編集あるいは新規画像登録の返信があったことを示すコメントを作成する手段と、上記作成したコメント及び編集画像あるいは新規登録画像又はそれらの画像へのショートカット情報を含む電子掲示板情報を作成する手段とを備えたことを特徴とする電子掲示板機能を備えたサーバ装置。 |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (サーバ装置) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2004362118A CLAIM 1 画像データ及びテキストデータを掲載文書として扱うことができ、コメントに対する返信機能としてコメントの返信、画像の返信及び画像編集の返信が可能な電子掲示板機能を備えたサーバ装置 (web server, match server) において、画像データを格納する画像格納手段と、テキストデータを格納するコメント格納手段と、画像編集のみあるいは新規画像登録のみの返信があったとき、画像編集あるいは新規画像登録の返信があったことを示すコメントを作成する手段と、上記作成したコメント及び編集画像あるいは新規登録画像又はそれらの画像へのショートカット情報を含む電子掲示板情報を作成する手段とを備えたことを特徴とする電子掲示板機能を備えたサーバ装置。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2004318404A Filed: 2003-04-15 Issued: 2004-11-11 記事配信方法／プログラム／記録媒体／サーバ／端末／システム (Original Assignee) Nec Corp; 日本電気株式会社 Takao Miura, 高生 三浦 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (コンピュ, 有する方) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2004318404A CLAIM 1 ネットワークを介して利用者端末と接続された記事配信サーバが、投稿者によって操作される利用者端末から記事の投稿を受け付け、購読者によって操作される利用者端末へ投稿された記事を配信する方法であって、 記事の配信を受けた利用者端末が、該記事の投稿者に対する評価を前記記事配信サーバに送信する第１のステップと、 前記記事配信サーバが、該投稿者に対して割り当てる配信許容数に、該評価を反映させる第２のステップを有する方 (next polling, data processing system, next polling questions) 法。 JP2004318404A CLAIM 16 コンピュ (next polling, data processing system, next polling questions) ータに、ネットワークを介して利用者端末と接続し、投稿者によって操作される利用者端末から記事の投稿を受け付け、購読者によって操作される利用者端末へ投稿された記事を配信させるプログラムであって、 請求項１から３および請求項７から１５のいずれか１項に記載の前記第２のステップをコンピュータに実行させるプログラム。 |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (コンピュ, 有する方) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2004318404A CLAIM 1 ネットワークを介して利用者端末と接続された記事配信サーバが、投稿者によって操作される利用者端末から記事の投稿を受け付け、購読者によって操作される利用者端末へ投稿された記事を配信する方法であって、 記事の配信を受けた利用者端末が、該記事の投稿者に対する評価を前記記事配信サーバに送信する第１のステップと、 前記記事配信サーバが、該投稿者に対して割り当てる配信許容数に、該評価を反映させる第２のステップを有する方 (next polling, data processing system, next polling questions) 法。 JP2004318404A CLAIM 16 コンピュ (next polling, data processing system, next polling questions) ータに、ネットワークを介して利用者端末と接続し、投稿者によって操作される利用者端末から記事の投稿を受け付け、購読者によって操作される利用者端末へ投稿された記事を配信させるプログラムであって、 請求項１から３および請求項７から１５のいずれか１項に記載の前記第２のステップをコンピュータに実行させるプログラム。 |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2004318404A CLAIM 3 前記第１ (minimum match percentage) のステップは、記事の配信を受けた利用者端末が、前記記事配信サーバによって複数のページに分割されて配信された該記事の最後のページに進むと、該記事を閲覧した旨の通知を前記記事配信サーバに送信することを含む、請求項２に記載の方法。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (読み取り) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2004318404A CLAIM 20 請求項１６から１８のいずれか１項に記載のプログラムを記録した、コンピュータ読み取り (computer executable instruction) が可能な記録媒体。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (コンピュ, 有する方) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2004318404A CLAIM 1 ネットワークを介して利用者端末と接続された記事配信サーバが、投稿者によって操作される利用者端末から記事の投稿を受け付け、購読者によって操作される利用者端末へ投稿された記事を配信する方法であって、 記事の配信を受けた利用者端末が、該記事の投稿者に対する評価を前記記事配信サーバに送信する第１のステップと、 前記記事配信サーバが、該投稿者に対して割り当てる配信許容数に、該評価を反映させる第２のステップを有する方 (next polling, data processing system, next polling questions) 法。 JP2004318404A CLAIM 16 コンピュ (next polling, data processing system, next polling questions) ータに、ネットワークを介して利用者端末と接続し、投稿者によって操作される利用者端末から記事の投稿を受け付け、購読者によって操作される利用者端末へ投稿された記事を配信させるプログラムであって、 請求項１から３および請求項７から１５のいずれか１項に記載の前記第２のステップをコンピュータに実行させるプログラム。 |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2004318404A CLAIM 3 前記第１ (minimum match percentage) のステップは、記事の配信を受けた利用者端末が、前記記事配信サーバによって複数のページに分割されて配信された該記事の最後のページに進むと、該記事を閲覧した旨の通知を前記記事配信サーバに送信することを含む、請求項２に記載の方法。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations (該端末) of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2004318404A CLAIM 37 前記評価は、前記評価は、当該端末 (computer to perform operations) が配信された記事を閲覧したかどうかを含む、請求項３６に記載の端末。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations (該端末) of : providing the user with a next polling (コンピュ, 有する方) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2004318404A CLAIM 1 ネットワークを介して利用者端末と接続された記事配信サーバが、投稿者によって操作される利用者端末から記事の投稿を受け付け、購読者によって操作される利用者端末へ投稿された記事を配信する方法であって、 記事の配信を受けた利用者端末が、該記事の投稿者に対する評価を前記記事配信サーバに送信する第１のステップと、 前記記事配信サーバが、該投稿者に対して割り当てる配信許容数に、該評価を反映させる第２のステップを有する方 (next polling, data processing system, next polling questions) 法。 JP2004318404A CLAIM 16 コンピュ (next polling, data processing system, next polling questions) ータに、ネットワークを介して利用者端末と接続し、投稿者によって操作される利用者端末から記事の投稿を受け付け、購読者によって操作される利用者端末へ投稿された記事を配信させるプログラムであって、 請求項１から３および請求項７から１５のいずれか１項に記載の前記第２のステップをコンピュータに実行させるプログラム。 JP2004318404A CLAIM 37 前記評価は、前記評価は、当該端末 (computer to perform operations) が配信された記事を閲覧したかどうかを含む、請求項３６に記載の端末。 |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations (該端末) of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2004318404A CLAIM 37 前記評価は、前記評価は、当該端末 (computer to perform operations) が配信された記事を閲覧したかどうかを含む、請求項３６に記載の端末。 |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations (該端末) of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2004318404A CLAIM 37 前記評価は、前記評価は、当該端末 (computer to perform operations) が配信された記事を閲覧したかどうかを含む、請求項３６に記載の端末。 |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations (該端末) of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2004318404A CLAIM 3 前記第１ (minimum match percentage) のステップは、記事の配信を受けた利用者端末が、前記記事配信サーバによって複数のページに分割されて配信された該記事の最後のページに進むと、該記事を閲覧した旨の通知を前記記事配信サーバに送信することを含む、請求項２に記載の方法。 JP2004318404A CLAIM 37 前記評価は、前記評価は、当該端末 (computer to perform operations) が配信された記事を閲覧したかどうかを含む、請求項３６に記載の端末。 |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations (該端末) of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2004318404A CLAIM 37 前記評価は、前記評価は、当該端末 (computer to perform operations) が配信された記事を閲覧したかどうかを含む、請求項３６に記載の端末。 |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations (該端末) of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2004318404A CLAIM 37 前記評価は、前記評価は、当該端末 (computer to perform operations) が配信された記事を閲覧したかどうかを含む、請求項３６に記載の端末。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20030192031A1 Filed: 2003-01-14 Issued: 2003-10-09 Systems and methods for application deployment (Original Assignee) BEA Systems Inc (Current Assignee) Oracle International Corp Sriram Srinivasan, Mark Spotswood |
|---|---|
| US9087321B2 CLAIM 19 . A computer program product (computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20030192031A1 CLAIM 26 . A computer program product (computer program product) for execution by a server computer for deploying an application , comprising : computer code for invoking a preparation operation on an application container for at least one node on which the application is to be deployed ; computer code for activating the deployed application on any node for which the invoked preparation operation is successful ; and computer code for canceling the deployment on any node for which the invoked preparation operation is not successful . |
| US9087321B2 CLAIM 20 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20030192031A1 CLAIM 26 . A computer program product (computer program product) for execution by a server computer for deploying an application , comprising : computer code for invoking a preparation operation on an application container for at least one node on which the application is to be deployed ; computer code for activating the deployed application on any node for which the invoked preparation operation is successful ; and computer code for canceling the deployment on any node for which the invoked preparation operation is not successful . |
| US9087321B2 CLAIM 21 . The computer program product (computer program product) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20030192031A1 CLAIM 26 . A computer program product (computer program product) for execution by a server computer for deploying an application , comprising : computer code for invoking a preparation operation on an application container for at least one node on which the application is to be deployed ; computer code for activating the deployed application on any node for which the invoked preparation operation is successful ; and computer code for canceling the deployment on any node for which the invoked preparation operation is not successful . |
| US9087321B2 CLAIM 22 . The computer program product (computer program product) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20030192031A1 CLAIM 26 . A computer program product (computer program product) for execution by a server computer for deploying an application , comprising : computer code for invoking a preparation operation on an application container for at least one node on which the application is to be deployed ; computer code for activating the deployed application on any node for which the invoked preparation operation is successful ; and computer code for canceling the deployment on any node for which the invoked preparation operation is not successful . |
| US9087321B2 CLAIM 23 . The computer program product (computer program product) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20030192031A1 CLAIM 26 . A computer program product (computer program product) for execution by a server computer for deploying an application , comprising : computer code for invoking a preparation operation on an application container for at least one node on which the application is to be deployed ; computer code for activating the deployed application on any node for which the invoked preparation operation is successful ; and computer code for canceling the deployment on any node for which the invoked preparation operation is not successful . |
| US9087321B2 CLAIM 24 . The computer program product (computer program product) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030192031A1 CLAIM 26 . A computer program product (computer program product) for execution by a server computer for deploying an application , comprising : computer code for invoking a preparation operation on an application container for at least one node on which the application is to be deployed ; computer code for activating the deployed application on any node for which the invoked preparation operation is successful ; and computer code for canceling the deployment on any node for which the invoked preparation operation is not successful . |
| US9087321B2 CLAIM 25 . The computer program product (computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030192031A1 CLAIM 26 . A computer program product (computer program product) for execution by a server computer for deploying an application , comprising : computer code for invoking a preparation operation on an application container for at least one node on which the application is to be deployed ; computer code for activating the deployed application on any node for which the invoked preparation operation is successful ; and computer code for canceling the deployment on any node for which the invoked preparation operation is not successful . |
| US9087321B2 CLAIM 26 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030192031A1 CLAIM 26 . A computer program product (computer program product) for execution by a server computer for deploying an application , comprising : computer code for invoking a preparation operation on an application container for at least one node on which the application is to be deployed ; computer code for activating the deployed application on any node for which the invoked preparation operation is successful ; and computer code for canceling the deployment on any node for which the invoked preparation operation is not successful . |
| US9087321B2 CLAIM 27 . The computer program product (computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030192031A1 CLAIM 26 . A computer program product (computer program product) for execution by a server computer for deploying an application , comprising : computer code for invoking a preparation operation on an application container for at least one node on which the application is to be deployed ; computer code for activating the deployed application on any node for which the invoked preparation operation is successful ; and computer code for canceling the deployment on any node for which the invoked preparation operation is not successful . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US7539697B1 Filed: 2002-12-13 Issued: 2009-05-26 Creation and maintenance of social relationship network graphs (Original Assignee) Spoke Software (Current Assignee) Spoke Software Prasad N. Akella, Timothy J. Connors, James Kelly, Christopher J. Roon, Andrew M. Rosenbaum, Ben T. Smith, IV, Christopher S. Tolles |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (electronic document) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (usage data) of other users that have a likelihood of match within a predetermined threshold . |
US7539697B1 CLAIM 5 . The computerized method of claim 4 , wherein deriving the strength of relationship value comprises : factoring in usage data (user profiles) of the relationship graph by the entity . US7539697B1 CLAIM 17 . The computerized method of claim 16 , wherein the data source is selected from the group consisting of an electronic document (first polling) and metadata associated with electronic communications . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (electronic document) question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (usage data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7539697B1 CLAIM 5 . The computerized method of claim 4 , wherein deriving the strength of relationship value comprises : factoring in usage data (user profiles) of the relationship graph by the entity . US7539697B1 CLAIM 17 . The computerized method of claim 16 , wherein the data source is selected from the group consisting of an electronic document (first polling) and metadata associated with electronic communications . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (executable instruction) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (electronic document) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (usage data) of other users that have a likelihood of match within a predetermined threshold . |
US7539697B1 CLAIM 5 . The computerized method of claim 4 , wherein deriving the strength of relationship value comprises : factoring in usage data (user profiles) of the relationship graph by the entity . US7539697B1 CLAIM 17 . The computerized method of claim 16 , wherein the data source is selected from the group consisting of an electronic document (first polling) and metadata associated with electronic communications . US7539697B1 CLAIM 20 . An article of manufacture comprising a machine-readable storage medium having stored thereon executable instruction (executable instruction) s to cause a machine to perform a method comprising : receiving data extracted from a private data source on a client device by a data extractor module , the received data being associated with a new entity and being in accordance with privacy criteria specified by a user , the privacy criteria prohibiting an extraction of at least one pre-defined type of data from the private data source on the client device , the at least one pre-defined type of data relating to a type of contact information ; adding a new node created from the received data to the relationship graph for the new entity ; calculating a strength of relationship value for each relationship between the new entity and an existing entity represented by an existing node in the relationship graph , the strength of relationship value being calculated based on a calculated quality of contact between the new entity and the existing entity and a frequency of contact between the new entity and the existing entity , wherein the quality of contact is calculated automatically based , at least in part , on what contact information is possessed by the new entity for the existing entity , without requiring a user to specify a quality of contact value ; creating an edge to represent the relationship in the relationship graph ; assigning the corresponding strength of relationship value to the edge linking the new node and the existing node ; automatically comparing the received data to existing data in any existing node to determine if any conflicts exist between the received data and the existing data , the existing data pertaining to the new entity or the existing entity ; and automatically reconciling , without user input , the received data with the existing data if a conflict is detected between the received data and the existing data , wherein reconciling includes updating at least one of the received data and the existing data based on the accuracy of the received data and the accuracy of the existing data . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (electronic document) question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (usage data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7539697B1 CLAIM 5 . The computerized method of claim 4 , wherein deriving the strength of relationship value comprises : factoring in usage data (user profiles) of the relationship graph by the entity . US7539697B1 CLAIM 17 . The computerized method of claim 16 , wherein the data source is selected from the group consisting of an electronic document (first polling) and metadata associated with electronic communications . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (electronic document) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (usage data) of other users that have a likelihood of match within a predetermined threshold . |
US7539697B1 CLAIM 5 . The computerized method of claim 4 , wherein deriving the strength of relationship value comprises : factoring in usage data (user profiles) of the relationship graph by the entity . US7539697B1 CLAIM 17 . The computerized method of claim 16 , wherein the data source is selected from the group consisting of an electronic document (first polling) and metadata associated with electronic communications . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (electronic document) question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (usage data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7539697B1 CLAIM 5 . The computerized method of claim 4 , wherein deriving the strength of relationship value comprises : factoring in usage data (user profiles) of the relationship graph by the entity . US7539697B1 CLAIM 17 . The computerized method of claim 16 , wherein the data source is selected from the group consisting of an electronic document (first polling) and metadata associated with electronic communications . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2004178072A Filed: 2002-11-25 Issued: 2004-06-24 Web page update notification method and apparatus (Original Assignee) Oki Electric Ind Co Ltd; 沖電気工業株式会社 Takashi Nishi, Makoto Torigoe, 敬 西, 真 鳥越 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system (apparatus) , comprising : a data processing system (apparatus) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2004178072A CLAIM 4 前記更新内容抽出手段は、前記差分情報片の大きさが所定の閾値以上の場合に、前記更新内容を主要文に変換する手段を更に含むことを特徴とする請求項２又は３記載の更新通知装置。 4 . The update notification according to claim 2 , wherein the update content extracting unit further includes a unit that converts the update content into a main sentence when the size of the difference information piece is equal to or larger than a predetermined threshold . apparatus (networking system, data processing system, data processing system having one) . |
| US9087321B2 CLAIM 2 . The poll-based networking system (apparatus) as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2004178072A CLAIM 4 前記更新内容抽出手段は、前記差分情報片の大きさが所定の閾値以上の場合に、前記更新内容を主要文に変換する手段を更に含むことを特徴とする請求項２又は３記載の更新通知装置。 4 . The update notification according to claim 2 , wherein the update content extracting unit further includes a unit that converts the update content into a main sentence when the size of the difference information piece is equal to or larger than a predetermined threshold . apparatus (networking system, data processing system, data processing system having one) . |
| US9087321B2 CLAIM 3 . The poll-based networking system (apparatus) as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2004178072A CLAIM 4 前記更新内容抽出手段は、前記差分情報片の大きさが所定の閾値以上の場合に、前記更新内容を主要文に変換する手段を更に含むことを特徴とする請求項２又は３記載の更新通知装置。 4 . The update notification according to claim 2 , wherein the update content extracting unit further includes a unit that converts the update content into a main sentence when the size of the difference information piece is equal to or larger than a predetermined threshold . apparatus (networking system, data processing system, data processing system having one) . |
| US9087321B2 CLAIM 4 . The poll-based networking system (apparatus) as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2004178072A CLAIM 4 前記更新内容抽出手段は、前記差分情報片の大きさが所定の閾値以上の場合に、前記更新内容を主要文に変換する手段を更に含むことを特徴とする請求項２又は３記載の更新通知装置。 4 . The update notification according to claim 2 , wherein the update content extracting unit further includes a unit that converts the update content into a main sentence when the size of the difference information piece is equal to or larger than a predetermined threshold . apparatus (networking system, data processing system, data processing system having one) . |
| US9087321B2 CLAIM 5 . The poll-based networking system (apparatus) as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2004178072A CLAIM 4 前記更新内容抽出手段は、前記差分情報片の大きさが所定の閾値以上の場合に、前記更新内容を主要文に変換する手段を更に含むことを特徴とする請求項２又は３記載の更新通知装置。 4 . The update notification according to claim 2 , wherein the update content extracting unit further includes a unit that converts the update content into a main sentence when the size of the difference information piece is equal to or larger than a predetermined threshold . apparatus (networking system, data processing system, data processing system having one) . |
| US9087321B2 CLAIM 6 . The poll-based networking system (apparatus) as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2004178072A CLAIM 4 前記更新内容抽出手段は、前記差分情報片の大きさが所定の閾値以上の場合に、前記更新内容を主要文に変換する手段を更に含むことを特徴とする請求項２又は３記載の更新通知装置。 4 . The update notification according to claim 2 , wherein the update content extracting unit further includes a unit that converts the update content into a main sentence when the size of the difference information piece is equal to or larger than a predetermined threshold . apparatus (networking system, data processing system, data processing system having one) . |
| US9087321B2 CLAIM 7 . The poll-based networking system (apparatus) as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2004178072A CLAIM 4 前記更新内容抽出手段は、前記差分情報片の大きさが所定の閾値以上の場合に、前記更新内容を主要文に変換する手段を更に含むことを特徴とする請求項２又は３記載の更新通知装置。 4 . The update notification according to claim 2 , wherein the update content extracting unit further includes a unit that converts the update content into a main sentence when the size of the difference information piece is equal to or larger than a predetermined threshold . apparatus (networking system, data processing system, data processing system having one) . |
| US9087321B2 CLAIM 8 . The poll-based networking system (apparatus) as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2004178072A CLAIM 4 前記更新内容抽出手段は、前記差分情報片の大きさが所定の閾値以上の場合に、前記更新内容を主要文に変換する手段を更に含むことを特徴とする請求項２又は３記載の更新通知装置。 4 . The update notification according to claim 2 , wherein the update content extracting unit further includes a unit that converts the update content into a main sentence when the size of the difference information piece is equal to or larger than a predetermined threshold . apparatus (networking system, data processing system, data processing system having one) . |
| US9087321B2 CLAIM 9 . The poll-based networking system (apparatus) as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2004178072A CLAIM 4 前記更新内容抽出手段は、前記差分情報片の大きさが所定の閾値以上の場合に、前記更新内容を主要文に変換する手段を更に含むことを特徴とする請求項２又は３記載の更新通知装置。 4 . The update notification according to claim 2 , wherein the update content extracting unit further includes a unit that converts the update content into a main sentence when the size of the difference information piece is equal to or larger than a predetermined threshold . apparatus (networking system, data processing system, data processing system having one) . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one (includes means) or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2004178072A CLAIM 6 前記通知先アドレス保持手段は、前記利用者端末のアドレスに対応して更に少なくとも１つのキーワードを保持する手段を更に含み、前記更新内容抽出手段は、前記差分情報片が前記保持されるキーワードを含まない場合、前記差分情報片を当該更新内容から除外する手段を更に含むことを特徴とする請求項５記載の更新通知装置。 The notification destination address holding means further includes means (computer having one) for holding at least one keyword corresponding to the address of the user terminal , and the update content extracting means includes a keyword in which the difference information piece is held . 6 . The update notification device according to claim 5 , further comprising a unit that excludes the difference information piece from the update content when there is no difference information piece . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US7013290B2 Filed: 2002-07-26 Issued: 2006-03-14 Personalized interactive digital catalog profiling (Original Assignee) Haven Networks Inc (Current Assignee) Havenomics LLC John Allen Ananian |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (RFID signals) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profile) of other users that have a likelihood of match within a predetermined threshold . |
US7013290B2 CLAIM 12 . The method of claim 5 , wherein said end user communication device is configured to receive said multi-channel affiliate reference identifiers via RFID signals (data processing system, data processing system having one) . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (reference set) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7013290B2 CLAIM 2 . The method of claim 1 , further comprising , an option by said end user , adjusting a preference set (next polling) ting associated with said end user account , to enable one or more of said plurality of different vendor organizations to send information to said end user account in which a personalized profile instance of a product is stored . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (end users) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (demographic information) , each match server (user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7013290B2 CLAIM 18 . The method of claim 1 , further comprising : providing information regarding stored personalized profile instances and non-personally identifiable demographic information (match servers) of said end user to at least one of said plurality of different vendor organizations , in an anonymous manner and without revealing the identity of said end user . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (end users) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (demographic information) , each match server (user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7013290B2 CLAIM 18 . The method of claim 1 , further comprising : providing information regarding stored personalized profile instances and non-personally identifiable demographic information (match servers) of said end user to at least one of said plurality of different vendor organizations , in an anonymous manner and without revealing the identity of said end user . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (reference set) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7013290B2 CLAIM 2 . The method of claim 1 , further comprising , an option by said end user , adjusting a preference set (next polling) ting associated with said end user account , to enable one or more of said plurality of different vendor organizations to send information to said end user account in which a personalized profile instance of a product is stored . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (end users) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (demographic information) , each match server (user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7013290B2 CLAIM 18 . The method of claim 1 , further comprising : providing information regarding stored personalized profile instances and non-personally identifiable demographic information (match servers) of said end user to at least one of said plurality of different vendor organizations , in an anonymous manner and without revealing the identity of said end user . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (end users) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (demographic information) , each match server (user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7013290B2 CLAIM 18 . The method of claim 1 , further comprising : providing information regarding stored personalized profile instances and non-personally identifiable demographic information (match servers) of said end user to at least one of said plurality of different vendor organizations , in an anonymous manner and without revealing the identity of said end user . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling (reference set) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7013290B2 CLAIM 2 . The method of claim 1 , further comprising , an option by said end user , adjusting a preference set (next polling) ting associated with said end user account , to enable one or more of said plurality of different vendor organizations to send information to said end user account in which a personalized profile instance of a product is stored . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (end users) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (demographic information) , each match server (user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7013290B2 CLAIM 18 . The method of claim 1 , further comprising : providing information regarding stored personalized profile instances and non-personally identifiable demographic information (match servers) of said end user to at least one of said plurality of different vendor organizations , in an anonymous manner and without revealing the identity of said end user . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (end users) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (demographic information) , each match server (user profile) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7013290B2 CLAIM 18 . The method of claim 1 , further comprising : providing information regarding stored personalized profile instances and non-personally identifiable demographic information (match servers) of said end user to at least one of said plurality of different vendor organizations , in an anonymous manner and without revealing the identity of said end user . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20030034905A1 Filed: 2002-05-17 Issued: 2003-02-20 System and method for encoding and decoding data files (Original Assignee) Cyber Operations LLC (Current Assignee) Cyber Operations Inc Richard Anton, James Etheridge, Dustin Sias, Robert Newland |
|---|---|
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question (second compression) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20030034905A1 CLAIM 4 . The method according to claim 1 , wherein said first compressing step comprises using a first compression algorithm to compress the first data block , and wherein said second compressing step comprises using a second compression (next polling question) algorithm to compress the second data block . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (executable instruction, web browser) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20030034905A1 CLAIM 10 . A computer-readable medium having computer-executable instruction (executable instruction, computer executable instruction) s for performing the steps recited in claim 1 . US20030034905A1 CLAIM 24 . The system according to claim 23 , further comprising a user interface , wherein said client further comprises a web browser (executable instruction, computer executable instruction) module operable for receiving the web archive from said server module , decompressing the web archive to produce the root document and the dependent document , and rendering the root document and the dependent document on said user interface . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question (second compression) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20030034905A1 CLAIM 4 . The method according to claim 1 , wherein said first compressing step comprises using a first compression algorithm to compress the first data block , and wherein said second compressing step comprises using a second compression (next polling question) algorithm to compress the second data block . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question (second compression) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20030034905A1 CLAIM 4 . The method according to claim 1 , wherein said first compressing step comprises using a first compression algorithm to compress the first data block , and wherein said second compressing step comprises using a second compression (next polling question) algorithm to compress the second data block . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20030187813A1 Filed: 2002-03-26 Issued: 2003-10-02 System and method for identifying relationship paths to a target entity (Original Assignee) Capital IQ Inc (Current Assignee) Capital IQ Inc Neal Goldman, William Murphy |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (shortest path) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030187813A1 CLAIM 8 . A method according to claim 1 where more than one relationship path exists , and the shortest relationship path is determined using a shortest path (match aggregator) algorithm . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (said platform) per user . |
US20030187813A1 CLAIM 41 . A method of identifying a relationship path from a user or starting entity to a target entity comprising the steps of establishing a computer platform which includes an algorithm for determining the shortest path between a user or starting entity and target entity : (a) establishing a central database of combined public and private information comprising a plurality of items of contact information ; (b) assigning a unique , relational identifier to each item of contact information in said central database ; (c) obtaining at least one client database of contact information comprising a plurality of items of contact information ; (d) assigning a unique , relational identifier to each item of contact information in said client database ; (e) loading said client database into said central database ; (j) integrating said central database with said client database ; (k) providing a user interface to said platform (m rows, computer program product, computer program product comprising computer) which allows a user to input the identities of the user or starting entity and the target entity ; (l) determining whether relationship paths exist from said user or starting entity to said target entity ; and (m) identifying said relationship paths . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (shortest path) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030187813A1 CLAIM 8 . A method according to claim 1 where more than one relationship path exists , and the shortest relationship path is determined using a shortest path (match aggregator) algorithm . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (said platform) per user . |
US20030187813A1 CLAIM 41 . A method of identifying a relationship path from a user or starting entity to a target entity comprising the steps of establishing a computer platform which includes an algorithm for determining the shortest path between a user or starting entity and target entity : (a) establishing a central database of combined public and private information comprising a plurality of items of contact information ; (b) assigning a unique , relational identifier to each item of contact information in said central database ; (c) obtaining at least one client database of contact information comprising a plurality of items of contact information ; (d) assigning a unique , relational identifier to each item of contact information in said client database ; (e) loading said client database into said central database ; (j) integrating said central database with said client database ; (k) providing a user interface to said platform (m rows, computer program product, computer program product comprising computer) which allows a user to input the identities of the user or starting entity and the target entity ; (l) determining whether relationship paths exist from said user or starting entity to said target entity ; and (m) identifying said relationship paths . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (shortest path) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030187813A1 CLAIM 8 . A method according to claim 1 where more than one relationship path exists , and the shortest relationship path is determined using a shortest path (match aggregator) algorithm . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (said platform) per user . |
US20030187813A1 CLAIM 41 . A method of identifying a relationship path from a user or starting entity to a target entity comprising the steps of establishing a computer platform which includes an algorithm for determining the shortest path between a user or starting entity and target entity : (a) establishing a central database of combined public and private information comprising a plurality of items of contact information ; (b) assigning a unique , relational identifier to each item of contact information in said central database ; (c) obtaining at least one client database of contact information comprising a plurality of items of contact information ; (d) assigning a unique , relational identifier to each item of contact information in said client database ; (e) loading said client database into said central database ; (j) integrating said central database with said client database ; (k) providing a user interface to said platform (m rows, computer program product, computer program product comprising computer) which allows a user to input the identities of the user or starting entity and the target entity ; (l) determining whether relationship paths exist from said user or starting entity to said target entity ; and (m) identifying said relationship paths . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (shortest path) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030187813A1 CLAIM 8 . A method according to claim 1 where more than one relationship path exists , and the shortest relationship path is determined using a shortest path (match aggregator) algorithm . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (said platform) per user . |
US20030187813A1 CLAIM 41 . A method of identifying a relationship path from a user or starting entity to a target entity comprising the steps of establishing a computer platform which includes an algorithm for determining the shortest path between a user or starting entity and target entity : (a) establishing a central database of combined public and private information comprising a plurality of items of contact information ; (b) assigning a unique , relational identifier to each item of contact information in said central database ; (c) obtaining at least one client database of contact information comprising a plurality of items of contact information ; (d) assigning a unique , relational identifier to each item of contact information in said client database ; (e) loading said client database into said central database ; (j) integrating said central database with said client database ; (k) providing a user interface to said platform (m rows, computer program product, computer program product comprising computer) which allows a user to input the identities of the user or starting entity and the target entity ; (l) determining whether relationship paths exist from said user or starting entity to said target entity ; and (m) identifying said relationship paths . |
| US9087321B2 CLAIM 19 . A computer program product (said platform) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20030187813A1 CLAIM 41 . A method of identifying a relationship path from a user or starting entity to a target entity comprising the steps of establishing a computer platform which includes an algorithm for determining the shortest path between a user or starting entity and target entity : (a) establishing a central database of combined public and private information comprising a plurality of items of contact information ; (b) assigning a unique , relational identifier to each item of contact information in said central database ; (c) obtaining at least one client database of contact information comprising a plurality of items of contact information ; (d) assigning a unique , relational identifier to each item of contact information in said client database ; (e) loading said client database into said central database ; (j) integrating said central database with said client database ; (k) providing a user interface to said platform (m rows, computer program product, computer program product comprising computer) which allows a user to input the identities of the user or starting entity and the target entity ; (l) determining whether relationship paths exist from said user or starting entity to said target entity ; and (m) identifying said relationship paths . |
| US9087321B2 CLAIM 20 . The computer program product (said platform) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20030187813A1 CLAIM 41 . A method of identifying a relationship path from a user or starting entity to a target entity comprising the steps of establishing a computer platform which includes an algorithm for determining the shortest path between a user or starting entity and target entity : (a) establishing a central database of combined public and private information comprising a plurality of items of contact information ; (b) assigning a unique , relational identifier to each item of contact information in said central database ; (c) obtaining at least one client database of contact information comprising a plurality of items of contact information ; (d) assigning a unique , relational identifier to each item of contact information in said client database ; (e) loading said client database into said central database ; (j) integrating said central database with said client database ; (k) providing a user interface to said platform (m rows, computer program product, computer program product comprising computer) which allows a user to input the identities of the user or starting entity and the target entity ; (l) determining whether relationship paths exist from said user or starting entity to said target entity ; and (m) identifying said relationship paths . |
| US9087321B2 CLAIM 21 . The computer program product (said platform) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20030187813A1 CLAIM 41 . A method of identifying a relationship path from a user or starting entity to a target entity comprising the steps of establishing a computer platform which includes an algorithm for determining the shortest path between a user or starting entity and target entity : (a) establishing a central database of combined public and private information comprising a plurality of items of contact information ; (b) assigning a unique , relational identifier to each item of contact information in said central database ; (c) obtaining at least one client database of contact information comprising a plurality of items of contact information ; (d) assigning a unique , relational identifier to each item of contact information in said client database ; (e) loading said client database into said central database ; (j) integrating said central database with said client database ; (k) providing a user interface to said platform (m rows, computer program product, computer program product comprising computer) which allows a user to input the identities of the user or starting entity and the target entity ; (l) determining whether relationship paths exist from said user or starting entity to said target entity ; and (m) identifying said relationship paths . |
| US9087321B2 CLAIM 22 . The computer program product (said platform) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20030187813A1 CLAIM 41 . A method of identifying a relationship path from a user or starting entity to a target entity comprising the steps of establishing a computer platform which includes an algorithm for determining the shortest path between a user or starting entity and target entity : (a) establishing a central database of combined public and private information comprising a plurality of items of contact information ; (b) assigning a unique , relational identifier to each item of contact information in said central database ; (c) obtaining at least one client database of contact information comprising a plurality of items of contact information ; (d) assigning a unique , relational identifier to each item of contact information in said client database ; (e) loading said client database into said central database ; (j) integrating said central database with said client database ; (k) providing a user interface to said platform (m rows, computer program product, computer program product comprising computer) which allows a user to input the identities of the user or starting entity and the target entity ; (l) determining whether relationship paths exist from said user or starting entity to said target entity ; and (m) identifying said relationship paths . |
| US9087321B2 CLAIM 23 . The computer program product (said platform) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20030187813A1 CLAIM 41 . A method of identifying a relationship path from a user or starting entity to a target entity comprising the steps of establishing a computer platform which includes an algorithm for determining the shortest path between a user or starting entity and target entity : (a) establishing a central database of combined public and private information comprising a plurality of items of contact information ; (b) assigning a unique , relational identifier to each item of contact information in said central database ; (c) obtaining at least one client database of contact information comprising a plurality of items of contact information ; (d) assigning a unique , relational identifier to each item of contact information in said client database ; (e) loading said client database into said central database ; (j) integrating said central database with said client database ; (k) providing a user interface to said platform (m rows, computer program product, computer program product comprising computer) which allows a user to input the identities of the user or starting entity and the target entity ; (l) determining whether relationship paths exist from said user or starting entity to said target entity ; and (m) identifying said relationship paths . |
| US9087321B2 CLAIM 24 . The computer program product (said platform) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (shortest path) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030187813A1 CLAIM 8 . A method according to claim 1 where more than one relationship path exists , and the shortest relationship path is determined using a shortest path (match aggregator) algorithm . US20030187813A1 CLAIM 41 . A method of identifying a relationship path from a user or starting entity to a target entity comprising the steps of establishing a computer platform which includes an algorithm for determining the shortest path between a user or starting entity and target entity : (a) establishing a central database of combined public and private information comprising a plurality of items of contact information ; (b) assigning a unique , relational identifier to each item of contact information in said central database ; (c) obtaining at least one client database of contact information comprising a plurality of items of contact information ; (d) assigning a unique , relational identifier to each item of contact information in said client database ; (e) loading said client database into said central database ; (j) integrating said central database with said client database ; (k) providing a user interface to said platform (m rows, computer program product, computer program product comprising computer) which allows a user to input the identities of the user or starting entity and the target entity ; (l) determining whether relationship paths exist from said user or starting entity to said target entity ; and (m) identifying said relationship paths . |
| US9087321B2 CLAIM 25 . The computer program product (said platform) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (said platform) per user . |
US20030187813A1 CLAIM 41 . A method of identifying a relationship path from a user or starting entity to a target entity comprising the steps of establishing a computer platform which includes an algorithm for determining the shortest path between a user or starting entity and target entity : (a) establishing a central database of combined public and private information comprising a plurality of items of contact information ; (b) assigning a unique , relational identifier to each item of contact information in said central database ; (c) obtaining at least one client database of contact information comprising a plurality of items of contact information ; (d) assigning a unique , relational identifier to each item of contact information in said client database ; (e) loading said client database into said central database ; (j) integrating said central database with said client database ; (k) providing a user interface to said platform (m rows, computer program product, computer program product comprising computer) which allows a user to input the identities of the user or starting entity and the target entity ; (l) determining whether relationship paths exist from said user or starting entity to said target entity ; and (m) identifying said relationship paths . |
| US9087321B2 CLAIM 26 . The computer program product (said platform) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (shortest path) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030187813A1 CLAIM 8 . A method according to claim 1 where more than one relationship path exists , and the shortest relationship path is determined using a shortest path (match aggregator) algorithm . US20030187813A1 CLAIM 41 . A method of identifying a relationship path from a user or starting entity to a target entity comprising the steps of establishing a computer platform which includes an algorithm for determining the shortest path between a user or starting entity and target entity : (a) establishing a central database of combined public and private information comprising a plurality of items of contact information ; (b) assigning a unique , relational identifier to each item of contact information in said central database ; (c) obtaining at least one client database of contact information comprising a plurality of items of contact information ; (d) assigning a unique , relational identifier to each item of contact information in said client database ; (e) loading said client database into said central database ; (j) integrating said central database with said client database ; (k) providing a user interface to said platform (m rows, computer program product, computer program product comprising computer) which allows a user to input the identities of the user or starting entity and the target entity ; (l) determining whether relationship paths exist from said user or starting entity to said target entity ; and (m) identifying said relationship paths . |
| US9087321B2 CLAIM 27 . The computer program product (said platform) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows (said platform) per user . |
US20030187813A1 CLAIM 41 . A method of identifying a relationship path from a user or starting entity to a target entity comprising the steps of establishing a computer platform which includes an algorithm for determining the shortest path between a user or starting entity and target entity : (a) establishing a central database of combined public and private information comprising a plurality of items of contact information ; (b) assigning a unique , relational identifier to each item of contact information in said central database ; (c) obtaining at least one client database of contact information comprising a plurality of items of contact information ; (d) assigning a unique , relational identifier to each item of contact information in said client database ; (e) loading said client database into said central database ; (j) integrating said central database with said client database ; (k) providing a user interface to said platform (m rows, computer program product, computer program product comprising computer) which allows a user to input the identities of the user or starting entity and the target entity ; (l) determining whether relationship paths exist from said user or starting entity to said target entity ; and (m) identifying said relationship paths . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20030135565A1 Filed: 2002-03-11 Issued: 2003-07-17 Electronic mail application with integrated collaborative space management (Original Assignee) KUBI SOFTWARE Inc (Current Assignee) KUBI SOFTWARE Inc Julio Estrada |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (central server) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20030135565A1 CLAIM 103 . The system of claim 97 , wherein a collaborative workspace folder is stored on a central server (receiving user information) . |
| US9087321B2 CLAIM 4 . The poll-based networking system as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number (task list) of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20030135565A1 CLAIM 87 . The system of claim 85 , wherein when a new task is added to a task list (total number, maximum number) , electronic mail only participants are sent a message containing the task and the applicable task list related information . |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (task list) of members that fall within the maximum and minimum match percentage . |
US20030135565A1 CLAIM 87 . The system of claim 85 , wherein when a new task is added to a task list (total number, maximum number) , electronic mail only participants are sent a message containing the task and the applicable task list related information . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (client terminals) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030135565A1 CLAIM 102 . The system of claim 97 , wherein a collaborative workspace folder is stored on participants' ; client terminals (web server) . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (mail server) per selected answer and m rows per user . |
US20030135565A1 CLAIM 53 . The system of claim 52 , wherein the relay box is used when a participants own electronic mail server (n bytes) does not support POP3 access . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (client terminals) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030135565A1 CLAIM 102 . The system of claim 97 , wherein a collaborative workspace folder is stored on participants' ; client terminals (web server) . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (mail server) per selected answer and m rows per user . |
US20030135565A1 CLAIM 53 . The system of claim 52 , wherein the relay box is used when a participants own electronic mail server (n bytes) does not support POP3 access . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (textual information, data contents) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (central server) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20030135565A1 CLAIM 85 . The system of claim 81 , wherein electronic mail only participants receive changes to a collaborative workspace optionally formatted in HTML with contextual information (executable instruction, readable instruction, computer executable instruction, readable instruction means) . US20030135565A1 CLAIM 94 . The system of claim 93 , wherein the collaborative workspace module uses public/private key technology to sign the collaborative workspace message part to guarantee its integrity and reliably determine the participant who originated it and optionally encrypt the data contents (executable instruction, readable instruction, computer executable instruction, readable instruction means) of the message depending on the security setting of the collaborative workspace . US20030135565A1 CLAIM 103 . The system of claim 97 , wherein a collaborative workspace folder is stored on a central server (receiving user information) . |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , further comprising an act of causing the one or more processors to perform operations of : determining a total number (task list) of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20030135565A1 CLAIM 87 . The system of claim 85 , wherein when a new task is added to a task list (total number, maximum number) , electronic mail only participants are sent a message containing the task and the applicable task list related information . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (task list) of members that fall within the maximum and minimum match percentage . |
US20030135565A1 CLAIM 87 . The system of claim 85 , wherein when a new task is added to a task list (total number, maximum number) , electronic mail only participants are sent a message containing the task and the applicable task list related information . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (client terminals) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030135565A1 CLAIM 102 . The system of claim 97 , wherein a collaborative workspace folder is stored on participants' ; client terminals (web server) . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes (mail server) per selected answer and m rows per user . |
US20030135565A1 CLAIM 53 . The system of claim 52 , wherein the relay box is used when a participants own electronic mail server (n bytes) does not support POP3 access . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (client terminals) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030135565A1 CLAIM 102 . The system of claim 97 , wherein a collaborative workspace folder is stored on participants' ; client terminals (web server) . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (mail server) per selected answer and m rows per user . |
US20030135565A1 CLAIM 53 . The system of claim 52 , wherein the relay box is used when a participants own electronic mail server (n bytes) does not support POP3 access . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (central server) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20030135565A1 CLAIM 103 . The system of claim 97 , wherein a collaborative workspace folder is stored on a central server (receiving user information) . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number (task list) of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20030135565A1 CLAIM 87 . The system of claim 85 , wherein when a new task is added to a task list (total number, maximum number) , electronic mail only participants are sent a message containing the task and the applicable task list related information . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (task list) of members that fall within the maximum and minimum match percentage . |
US20030135565A1 CLAIM 87 . The system of claim 85 , wherein when a new task is added to a task list (total number, maximum number) , electronic mail only participants are sent a message containing the task and the applicable task list related information . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (client terminals) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030135565A1 CLAIM 102 . The system of claim 97 , wherein a collaborative workspace folder is stored on participants' ; client terminals (web server) . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (mail server) per selected answer and m rows per user . |
US20030135565A1 CLAIM 53 . The system of claim 52 , wherein the relay box is used when a participants own electronic mail server (n bytes) does not support POP3 access . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (client terminals) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030135565A1 CLAIM 102 . The system of claim 97 , wherein a collaborative workspace folder is stored on participants' ; client terminals (web server) . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (mail server) per selected answer and m rows per user . |
US20030135565A1 CLAIM 53 . The system of claim 52 , wherein the relay box is used when a participants own electronic mail server (n bytes) does not support POP3 access . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2003256323A Filed: 2002-02-27 Issued: 2003-09-12 サービス統合システム、サービス統合装置、およびサービス統合プログラム (Original Assignee) Fujitsu Ltd; 富士通株式会社 Takao Mori, Satoru Yamamoto, 哲 山本, 隆夫 毛利 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (コンピュ) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2003256323A CLAIM 1 【請求項１】 コミュニケーションツール及び／又はリ ソースのうちの１つ以上のサービスを共有する場のサー ビスの情報を複数の場にわたって統合するサービス統合 システムであって、 複数の場を、これら複数の場のうちの統合側の場に対応 する、統合の対象となる複数の場の統合の対象となる複 数のサービスを定義した対象サービス定義を含んで定義 した場の情報データ (user information) ベースを管理する場の情報管理部 と、 前記対象サービス定義により定義された複数の場の複数 のサービスの情報を、該対象サービス定義に対応する１ つの統合側の場に表示するサービス表示部とを有するこ とを特徴とするサービス統合システム。 JP2003256323A CLAIM 4 【請求項４】 １台もしくは通信回線を介して相互に接 続された複数台のコンピュ (next polling, data processing system, next polling questions) ータからなるコンピュータシ ステム内で実行され、該コンピュータシステムを、コミ ュニケーションツール及び／又はリソースのうちの１つ 以上のサービスを共有する場のサービスの情報を複数の 場にわたって統合するサービス統合システムとして動作 させるサービス統合プログラムであって、 複数の場を、これら複数の場のうちの統合側の場に対応 する、統合の対象となる複数の場の統合の対象となる複 数のサービスを定義した各対象サービス定義を含んで定 義した場の情報データベースを管理する場の情報管理部 と、 前記対象サービス定義により定義された複数の場の複数 のサービスの情報を、該対象サービス定義に対応する１ つの統合側の場に表示するサービス表示部とを有するこ とを特徴とするサービス統合プログラム。 |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2003256323A CLAIM 4 【請求項４】 １台もしくは通信回線を介して相互に接 続された複数台のコンピュ (next polling, data processing system, next polling questions) ータからなるコンピュータシ ステム内で実行され、該コンピュータシステムを、コミ ュニケーションツール及び／又はリソースのうちの１つ 以上のサービスを共有する場のサービスの情報を複数の 場にわたって統合するサービス統合システムとして動作 させるサービス統合プログラムであって、 複数の場を、これら複数の場のうちの統合側の場に対応 する、統合の対象となる複数の場の統合の対象となる複 数のサービスを定義した各対象サービス定義を含んで定 義した場の情報データベースを管理する場の情報管理部 と、 前記対象サービス定義により定義された複数の場の複数 のサービスの情報を、該対象サービス定義に対応する１ つの統合側の場に表示するサービス表示部とを有するこ とを特徴とするサービス統合プログラム。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2003256323A CLAIM 1 【請求項１】 コミュニケーションツール及び／又はリ ソースのうちの１つ以上のサービスを共有する場のサー ビスの情報を複数の場にわたって統合するサービス統合 システムであって、 複数の場を、これら複数の場のうちの統合側の場に対応 する、統合の対象となる複数の場の統合の対象となる複 数のサービスを定義した対象サービス定義を含んで定義 した場の情報データ (user information) ベースを管理する場の情報管理部 と、 前記対象サービス定義により定義された複数の場の複数 のサービスの情報を、該対象サービス定義に対応する１ つの統合側の場に表示するサービス表示部とを有するこ とを特徴とするサービス統合システム。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2003256323A CLAIM 4 【請求項４】 １台もしくは通信回線を介して相互に接 続された複数台のコンピュ (next polling, data processing system, next polling questions) ータからなるコンピュータシ ステム内で実行され、該コンピュータシステムを、コミ ュニケーションツール及び／又はリソースのうちの１つ 以上のサービスを共有する場のサービスの情報を複数の 場にわたって統合するサービス統合システムとして動作 させるサービス統合プログラムであって、 複数の場を、これら複数の場のうちの統合側の場に対応 する、統合の対象となる複数の場の統合の対象となる複 数のサービスを定義した各対象サービス定義を含んで定 義した場の情報データベースを管理する場の情報管理部 と、 前記対象サービス定義により定義された複数の場の複数 のサービスの情報を、該対象サービス定義に対応する１ つの統合側の場に表示するサービス表示部とを有するこ とを特徴とするサービス統合プログラム。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2003256323A CLAIM 1 【請求項１】 コミュニケーションツール及び／又はリ ソースのうちの１つ以上のサービスを共有する場のサー ビスの情報を複数の場にわたって統合するサービス統合 システムであって、 複数の場を、これら複数の場のうちの統合側の場に対応 する、統合の対象となる複数の場の統合の対象となる複 数のサービスを定義した対象サービス定義を含んで定義 した場の情報データ (user information) ベースを管理する場の情報管理部 と、 前記対象サービス定義により定義された複数の場の複数 のサービスの情報を、該対象サービス定義に対応する１ つの統合側の場に表示するサービス表示部とを有するこ とを特徴とするサービス統合システム。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2003256323A CLAIM 4 【請求項４】 １台もしくは通信回線を介して相互に接 続された複数台のコンピュ (next polling, data processing system, next polling questions) ータからなるコンピュータシ ステム内で実行され、該コンピュータシステムを、コミ ュニケーションツール及び／又はリソースのうちの１つ 以上のサービスを共有する場のサービスの情報を複数の 場にわたって統合するサービス統合システムとして動作 させるサービス統合プログラムであって、 複数の場を、これら複数の場のうちの統合側の場に対応 する、統合の対象となる複数の場の統合の対象となる複 数のサービスを定義した各対象サービス定義を含んで定 義した場の情報データベースを管理する場の情報管理部 と、 前記対象サービス定義により定義された複数の場の複数 のサービスの情報を、該対象サービス定義に対応する１ つの統合側の場に表示するサービス表示部とを有するこ とを特徴とするサービス統合プログラム。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20020156756A1 Filed: 2001-12-06 Issued: 2002-10-24 Intelligent molecular object data structure and method for application in heterogeneous data environments with high data density and dynamic application needs (Original Assignee) BIOSENTIENTS Inc (Current Assignee) BIOSENTIENTS Inc Robert Stanley, Erich Gombocz |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system (local computing environment) , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20020156756A1 CLAIM 7 . The creation method of said data structure , which comprises methods and processes not limited to a) automated detection of data content newly available locally and/or over networks that correspond to actions including user initiated and/or automated queries , user initiated and/or automated data acquisition activities and/or data import requests b) invocation of a new unique object identifier property pane via a component comprised within an external object handler , c) assignation of a globally unique identifier , d) generation of functionally integrated property panes within the Intelligent Object ; e) identification of all user-defined and content attribute based connections to the data structure ; and f) listing within the unique object identifier property pane of information comprising the Intelligent Object' ; s creator , network and/or local routing information , content attribute information , information on connected users , access permissions , authentication information such as globally unique identification and public key encryption status , and current session information ; and g) state history recordation of all Intelligent Object activity over networks and/or within local computing environment (networking system) s . |
| US9087321B2 CLAIM 2 . The poll-based networking system (local computing environment) as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question (on technology) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20020156756A1 CLAIM 6 . A data structure as in claim 1 , further comprised as a core element within an information technology (next polling question) platform architecture (“Sentient Platform”) advantageously enabled in software , comprising methods for : a) functional data integration , multidimensional data accessing and routing , viewing , querying , analyzing and other data-enabling operations i . utilizing single data content files and/or high numbers of complex , heterogeneous and/or interdependent data content files which are functionally unified , although utilizing diverse and/or distributed data content resources ; and ii . capable of simultaneously utilizing data content stored in diverse and distributed database and/or data storage resources , diverse computational hardware and network environments with diverse and dynamic application needs . US20020156756A1 CLAIM 7 . The creation method of said data structure , which comprises methods and processes not limited to a) automated detection of data content newly available locally and/or over networks that correspond to actions including user initiated and/or automated queries , user initiated and/or automated data acquisition activities and/or data import requests b) invocation of a new unique object identifier property pane via a component comprised within an external object handler , c) assignation of a globally unique identifier , d) generation of functionally integrated property panes within the Intelligent Object ; e) identification of all user-defined and content attribute based connections to the data structure ; and f) listing within the unique object identifier property pane of information comprising the Intelligent Object' ; s creator , network and/or local routing information , content attribute information , information on connected users , access permissions , authentication information such as globally unique identification and public key encryption status , and current session information ; and g) state history recordation of all Intelligent Object activity over networks and/or within local computing environment (networking system) s . |
| US9087321B2 CLAIM 3 . The poll-based networking system (local computing environment) as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20020156756A1 CLAIM 7 . The creation method of said data structure , which comprises methods and processes not limited to a) automated detection of data content newly available locally and/or over networks that correspond to actions including user initiated and/or automated queries , user initiated and/or automated data acquisition activities and/or data import requests b) invocation of a new unique object identifier property pane via a component comprised within an external object handler , c) assignation of a globally unique identifier , d) generation of functionally integrated property panes within the Intelligent Object ; e) identification of all user-defined and content attribute based connections to the data structure ; and f) listing within the unique object identifier property pane of information comprising the Intelligent Object' ; s creator , network and/or local routing information , content attribute information , information on connected users , access permissions , authentication information such as globally unique identification and public key encryption status , and current session information ; and g) state history recordation of all Intelligent Object activity over networks and/or within local computing environment (networking system) s . |
| US9087321B2 CLAIM 4 . The poll-based networking system (local computing environment) as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number (Management System) of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20020156756A1 CLAIM 7 . The creation method of said data structure , which comprises methods and processes not limited to a) automated detection of data content newly available locally and/or over networks that correspond to actions including user initiated and/or automated queries , user initiated and/or automated data acquisition activities and/or data import requests b) invocation of a new unique object identifier property pane via a component comprised within an external object handler , c) assignation of a globally unique identifier , d) generation of functionally integrated property panes within the Intelligent Object ; e) identification of all user-defined and content attribute based connections to the data structure ; and f) listing within the unique object identifier property pane of information comprising the Intelligent Object' ; s creator , network and/or local routing information , content attribute information , information on connected users , access permissions , authentication information such as globally unique identification and public key encryption status , and current session information ; and g) state history recordation of all Intelligent Object activity over networks and/or within local computing environment (networking system) s . US20020156756A1 CLAIM 19 . An always-on status management component as in claim 18 , further comprising methods for a) communication with an external object state engine to enable monitoring of data integrity , command history and regulatory validation states ; b) communication with an external object state engine to enable viewing of instrument parameters related to acquisition of data content and/or other instrument activities c) communication with said object state engine to provide automated validation status verification according industry-specific validation requirements not limited to Good Practice (G*P)-compliance including GLP Laboratory Information Management System (total number) s (LIMS) ; U . S . Food and Drug Administration Center for Drug Evaluation and Research (FDA CDER) ; Codebook for Forensic Investigation Requirements (CFIR) ; and International Organization for Standardization (ISO 9000) ; and d) provision of information including data acquisition state ; calibration information ; applied transformation or analysis processes ; and validation state (Object State List—Table 1) to the object state engine property pane ; e) utilization of comprised state history information and non-destructive overlay processing techniques for data integrity protection and verification ; auditing ; logging ; and detailed rollback to previous Intelligent Object data states ; and f) functional integration of data and applications via interactive information exchange with external components that provide processes including data type translation and applications integration . |
| US9087321B2 CLAIM 5 . The poll-based networking system (local computing environment) as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20020156756A1 CLAIM 7 . The creation method of said data structure , which comprises methods and processes not limited to a) automated detection of data content newly available locally and/or over networks that correspond to actions including user initiated and/or automated queries , user initiated and/or automated data acquisition activities and/or data import requests b) invocation of a new unique object identifier property pane via a component comprised within an external object handler , c) assignation of a globally unique identifier , d) generation of functionally integrated property panes within the Intelligent Object ; e) identification of all user-defined and content attribute based connections to the data structure ; and f) listing within the unique object identifier property pane of information comprising the Intelligent Object' ; s creator , network and/or local routing information , content attribute information , information on connected users , access permissions , authentication information such as globally unique identification and public key encryption status , and current session information ; and g) state history recordation of all Intelligent Object activity over networks and/or within local computing environment (networking system) s . |
| US9087321B2 CLAIM 6 . The poll-based networking system (local computing environment) as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020156756A1 CLAIM 7 . The creation method of said data structure , which comprises methods and processes not limited to a) automated detection of data content newly available locally and/or over networks that correspond to actions including user initiated and/or automated queries , user initiated and/or automated data acquisition activities and/or data import requests b) invocation of a new unique object identifier property pane via a component comprised within an external object handler , c) assignation of a globally unique identifier , d) generation of functionally integrated property panes within the Intelligent Object ; e) identification of all user-defined and content attribute based connections to the data structure ; and f) listing within the unique object identifier property pane of information comprising the Intelligent Object' ; s creator , network and/or local routing information , content attribute information , information on connected users , access permissions , authentication information such as globally unique identification and public key encryption status , and current session information ; and g) state history recordation of all Intelligent Object activity over networks and/or within local computing environment (networking system) s . |
| US9087321B2 CLAIM 7 . The poll-based networking system (local computing environment) as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (entire data) per selected answer and m rows (n layers) per user . |
US20020156756A1 CLAIM 4 . An Intelligent Object as in claim 1 , wherein said interface procedures for direct data content addressing , definition , presentation and functional integration further comprise methods for : a) vectorized access , routing , translation , linking and comparison of data content information such as data content and data content subsets (“workspaces”) defined to granularity from entire data (n bytes) content files to data content subsets as small as single byte workspaces ; b) and direct interchange of information not limited to said not limited to processing information , commands , queries , meta-data , data content and said defined workspace subsets ; i . between said data objects ; and ii . between said data objects , heterogeneous applications and a variety of components , access interfaces , and presentation layers (m rows) . US20020156756A1 CLAIM 7 . The creation method of said data structure , which comprises methods and processes not limited to a) automated detection of data content newly available locally and/or over networks that correspond to actions including user initiated and/or automated queries , user initiated and/or automated data acquisition activities and/or data import requests b) invocation of a new unique object identifier property pane via a component comprised within an external object handler , c) assignation of a globally unique identifier , d) generation of functionally integrated property panes within the Intelligent Object ; e) identification of all user-defined and content attribute based connections to the data structure ; and f) listing within the unique object identifier property pane of information comprising the Intelligent Object' ; s creator , network and/or local routing information , content attribute information , information on connected users , access permissions , authentication information such as globally unique identification and public key encryption status , and current session information ; and g) state history recordation of all Intelligent Object activity over networks and/or within local computing environment (networking system) s . |
| US9087321B2 CLAIM 8 . The poll-based networking system (local computing environment) as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020156756A1 CLAIM 7 . The creation method of said data structure , which comprises methods and processes not limited to a) automated detection of data content newly available locally and/or over networks that correspond to actions including user initiated and/or automated queries , user initiated and/or automated data acquisition activities and/or data import requests b) invocation of a new unique object identifier property pane via a component comprised within an external object handler , c) assignation of a globally unique identifier , d) generation of functionally integrated property panes within the Intelligent Object ; e) identification of all user-defined and content attribute based connections to the data structure ; and f) listing within the unique object identifier property pane of information comprising the Intelligent Object' ; s creator , network and/or local routing information , content attribute information , information on connected users , access permissions , authentication information such as globally unique identification and public key encryption status , and current session information ; and g) state history recordation of all Intelligent Object activity over networks and/or within local computing environment (networking system) s . |
| US9087321B2 CLAIM 9 . The poll-based networking system (local computing environment) as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (entire data) per selected answer and m rows (n layers) per user . |
US20020156756A1 CLAIM 4 . An Intelligent Object as in claim 1 , wherein said interface procedures for direct data content addressing , definition , presentation and functional integration further comprise methods for : a) vectorized access , routing , translation , linking and comparison of data content information such as data content and data content subsets (“workspaces”) defined to granularity from entire data (n bytes) content files to data content subsets as small as single byte workspaces ; b) and direct interchange of information not limited to said not limited to processing information , commands , queries , meta-data , data content and said defined workspace subsets ; i . between said data objects ; and ii . between said data objects , heterogeneous applications and a variety of components , access interfaces , and presentation layers (m rows) . US20020156756A1 CLAIM 7 . The creation method of said data structure , which comprises methods and processes not limited to a) automated detection of data content newly available locally and/or over networks that correspond to actions including user initiated and/or automated queries , user initiated and/or automated data acquisition activities and/or data import requests b) invocation of a new unique object identifier property pane via a component comprised within an external object handler , c) assignation of a globally unique identifier , d) generation of functionally integrated property panes within the Intelligent Object ; e) identification of all user-defined and content attribute based connections to the data structure ; and f) listing within the unique object identifier property pane of information comprising the Intelligent Object' ; s creator , network and/or local routing information , content attribute information , information on connected users , access permissions , authentication information such as globally unique identification and public key encryption status , and current session information ; and g) state history recordation of all Intelligent Object activity over networks and/or within local computing environment (networking system) s . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question (on technology) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20020156756A1 CLAIM 6 . A data structure as in claim 1 , further comprised as a core element within an information technology (next polling question) platform architecture (“Sentient Platform”) advantageously enabled in software , comprising methods for : a) functional data integration , multidimensional data accessing and routing , viewing , querying , analyzing and other data-enabling operations i . utilizing single data content files and/or high numbers of complex , heterogeneous and/or interdependent data content files which are functionally unified , although utilizing diverse and/or distributed data content resources ; and ii . capable of simultaneously utilizing data content stored in diverse and distributed database and/or data storage resources , diverse computational hardware and network environments with diverse and dynamic application needs . |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , further comprising an act of causing the one or more processors to perform operations of : determining a total number (Management System) of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20020156756A1 CLAIM 19 . An always-on status management component as in claim 18 , further comprising methods for a) communication with an external object state engine to enable monitoring of data integrity , command history and regulatory validation states ; b) communication with an external object state engine to enable viewing of instrument parameters related to acquisition of data content and/or other instrument activities c) communication with said object state engine to provide automated validation status verification according industry-specific validation requirements not limited to Good Practice (G*P)-compliance including GLP Laboratory Information Management System (total number) s (LIMS) ; U . S . Food and Drug Administration Center for Drug Evaluation and Research (FDA CDER) ; Codebook for Forensic Investigation Requirements (CFIR) ; and International Organization for Standardization (ISO 9000) ; and d) provision of information including data acquisition state ; calibration information ; applied transformation or analysis processes ; and validation state (Object State List—Table 1) to the object state engine property pane ; e) utilization of comprised state history information and non-destructive overlay processing techniques for data integrity protection and verification ; auditing ; logging ; and detailed rollback to previous Intelligent Object data states ; and f) functional integration of data and applications via interactive information exchange with external components that provide processes including data type translation and applications integration . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes (entire data) per selected answer and m rows (n layers) per user . |
US20020156756A1 CLAIM 4 . An Intelligent Object as in claim 1 , wherein said interface procedures for direct data content addressing , definition , presentation and functional integration further comprise methods for : a) vectorized access , routing , translation , linking and comparison of data content information such as data content and data content subsets (“workspaces”) defined to granularity from entire data (n bytes) content files to data content subsets as small as single byte workspaces ; b) and direct interchange of information not limited to said not limited to processing information , commands , queries , meta-data , data content and said defined workspace subsets ; i . between said data objects ; and ii . between said data objects , heterogeneous applications and a variety of components , access interfaces , and presentation layers (m rows) . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (entire data) per selected answer and m rows (n layers) per user . |
US20020156756A1 CLAIM 4 . An Intelligent Object as in claim 1 , wherein said interface procedures for direct data content addressing , definition , presentation and functional integration further comprise methods for : a) vectorized access , routing , translation , linking and comparison of data content information such as data content and data content subsets (“workspaces”) defined to granularity from entire data (n bytes) content files to data content subsets as small as single byte workspaces ; b) and direct interchange of information not limited to said not limited to processing information , commands , queries , meta-data , data content and said defined workspace subsets ; i . between said data objects ; and ii . between said data objects , heterogeneous applications and a variety of components , access interfaces , and presentation layers (m rows) . |
| US9087321B2 CLAIM 19 . A computer program product (location info, analysis process) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations (location info, analysis process) of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20020156756A1 CLAIM 9 . A unique object identifier property pane as in claim 8 , wherein the procedures for identification further comprise methods for : a) provision of additional identification information including ; i . data creation information , comprising time , date and machine identification information ; ii . ownership information , comprising unique identification information for the object creator ; iii . security setting information , comprising access permissions , read-only permission , write permission ; iv . routing information , comprising raw data content addressing information and Intelligent Object data addressing information ; and v . real-time information about locally or remotely connected users , comprising user' ; s unique identification information ; computer name ; login time ; network address or location info (computer program product, computer to perform operations) rmation ; and session identification information ; and b) at least one rule or policy for object data security which either permits or denies access for information interchange between data objects , data content , users and applications , based on comprised criteria for session , user and data authentication . US20020156756A1 CLAIM 19 . An always-on status management component as in claim 18 , further comprising methods for a) communication with an external object state engine to enable monitoring of data integrity , command history and regulatory validation states ; b) communication with an external object state engine to enable viewing of instrument parameters related to acquisition of data content and/or other instrument activities c) communication with said object state engine to provide automated validation status verification according industry-specific validation requirements not limited to Good Practice (G*P)-compliance including GLP Laboratory Information Management Systems (LIMS) ; U . S . Food and Drug Administration Center for Drug Evaluation and Research (FDA CDER) ; Codebook for Forensic Investigation Requirements (CFIR) ; and International Organization for Standardization (ISO 9000) ; and d) provision of information including data acquisition state ; calibration information ; applied transformation or analysis process (computer program product, computer to perform operations) es ; and validation state (Object State List—Table 1) to the object state engine property pane ; e) utilization of comprised state history information and non-destructive overlay processing techniques for data integrity protection and verification ; auditing ; logging ; and detailed rollback to previous Intelligent Object data states ; and f) functional integration of data and applications via interactive information exchange with external components that provide processes including data type translation and applications integration . |
| US9087321B2 CLAIM 20 . The computer program product (location info, analysis process) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations (location info, analysis process) of : providing the user with a next polling question (on technology) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20020156756A1 CLAIM 6 . A data structure as in claim 1 , further comprised as a core element within an information technology (next polling question) platform architecture (“Sentient Platform”) advantageously enabled in software , comprising methods for : a) functional data integration , multidimensional data accessing and routing , viewing , querying , analyzing and other data-enabling operations i . utilizing single data content files and/or high numbers of complex , heterogeneous and/or interdependent data content files which are functionally unified , although utilizing diverse and/or distributed data content resources ; and ii . capable of simultaneously utilizing data content stored in diverse and distributed database and/or data storage resources , diverse computational hardware and network environments with diverse and dynamic application needs . US20020156756A1 CLAIM 9 . A unique object identifier property pane as in claim 8 , wherein the procedures for identification further comprise methods for : a) provision of additional identification information including ; i . data creation information , comprising time , date and machine identification information ; ii . ownership information , comprising unique identification information for the object creator ; iii . security setting information , comprising access permissions , read-only permission , write permission ; iv . routing information , comprising raw data content addressing information and Intelligent Object data addressing information ; and v . real-time information about locally or remotely connected users , comprising user' ; s unique identification information ; computer name ; login time ; network address or location info (computer program product, computer to perform operations) rmation ; and session identification information ; and b) at least one rule or policy for object data security which either permits or denies access for information interchange between data objects , data content , users and applications , based on comprised criteria for session , user and data authentication . US20020156756A1 CLAIM 19 . An always-on status management component as in claim 18 , further comprising methods for a) communication with an external object state engine to enable monitoring of data integrity , command history and regulatory validation states ; b) communication with an external object state engine to enable viewing of instrument parameters related to acquisition of data content and/or other instrument activities c) communication with said object state engine to provide automated validation status verification according industry-specific validation requirements not limited to Good Practice (G*P)-compliance including GLP Laboratory Information Management Systems (LIMS) ; U . S . Food and Drug Administration Center for Drug Evaluation and Research (FDA CDER) ; Codebook for Forensic Investigation Requirements (CFIR) ; and International Organization for Standardization (ISO 9000) ; and d) provision of information including data acquisition state ; calibration information ; applied transformation or analysis process (computer program product, computer to perform operations) es ; and validation state (Object State List—Table 1) to the object state engine property pane ; e) utilization of comprised state history information and non-destructive overlay processing techniques for data integrity protection and verification ; auditing ; logging ; and detailed rollback to previous Intelligent Object data states ; and f) functional integration of data and applications via interactive information exchange with external components that provide processes including data type translation and applications integration . |
| US9087321B2 CLAIM 21 . The computer program product (location info, analysis process) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations (location info, analysis process) of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20020156756A1 CLAIM 9 . A unique object identifier property pane as in claim 8 , wherein the procedures for identification further comprise methods for : a) provision of additional identification information including ; i . data creation information , comprising time , date and machine identification information ; ii . ownership information , comprising unique identification information for the object creator ; iii . security setting information , comprising access permissions , read-only permission , write permission ; iv . routing information , comprising raw data content addressing information and Intelligent Object data addressing information ; and v . real-time information about locally or remotely connected users , comprising user' ; s unique identification information ; computer name ; login time ; network address or location info (computer program product, computer to perform operations) rmation ; and session identification information ; and b) at least one rule or policy for object data security which either permits or denies access for information interchange between data objects , data content , users and applications , based on comprised criteria for session , user and data authentication . US20020156756A1 CLAIM 19 . An always-on status management component as in claim 18 , further comprising methods for a) communication with an external object state engine to enable monitoring of data integrity , command history and regulatory validation states ; b) communication with an external object state engine to enable viewing of instrument parameters related to acquisition of data content and/or other instrument activities c) communication with said object state engine to provide automated validation status verification according industry-specific validation requirements not limited to Good Practice (G*P)-compliance including GLP Laboratory Information Management Systems (LIMS) ; U . S . Food and Drug Administration Center for Drug Evaluation and Research (FDA CDER) ; Codebook for Forensic Investigation Requirements (CFIR) ; and International Organization for Standardization (ISO 9000) ; and d) provision of information including data acquisition state ; calibration information ; applied transformation or analysis process (computer program product, computer to perform operations) es ; and validation state (Object State List—Table 1) to the object state engine property pane ; e) utilization of comprised state history information and non-destructive overlay processing techniques for data integrity protection and verification ; auditing ; logging ; and detailed rollback to previous Intelligent Object data states ; and f) functional integration of data and applications via interactive information exchange with external components that provide processes including data type translation and applications integration . |
| US9087321B2 CLAIM 22 . The computer program product (location info, analysis process) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations (location info, analysis process) of : determining a total number (Management System) of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20020156756A1 CLAIM 9 . A unique object identifier property pane as in claim 8 , wherein the procedures for identification further comprise methods for : a) provision of additional identification information including ; i . data creation information , comprising time , date and machine identification information ; ii . ownership information , comprising unique identification information for the object creator ; iii . security setting information , comprising access permissions , read-only permission , write permission ; iv . routing information , comprising raw data content addressing information and Intelligent Object data addressing information ; and v . real-time information about locally or remotely connected users , comprising user' ; s unique identification information ; computer name ; login time ; network address or location info (computer program product, computer to perform operations) rmation ; and session identification information ; and b) at least one rule or policy for object data security which either permits or denies access for information interchange between data objects , data content , users and applications , based on comprised criteria for session , user and data authentication . US20020156756A1 CLAIM 19 . An always-on status management component as in claim 18 , further comprising methods for a) communication with an external object state engine to enable monitoring of data integrity , command history and regulatory validation states ; b) communication with an external object state engine to enable viewing of instrument parameters related to acquisition of data content and/or other instrument activities c) communication with said object state engine to provide automated validation status verification according industry-specific validation requirements not limited to Good Practice (G*P)-compliance including GLP Laboratory Information Management System (total number) s (LIMS) ; U . S . Food and Drug Administration Center for Drug Evaluation and Research (FDA CDER) ; Codebook for Forensic Investigation Requirements (CFIR) ; and International Organization for Standardization (ISO 9000) ; and d) provision of information including data acquisition state ; calibration information ; applied transformation or analysis process (computer program product, computer to perform operations) es ; and validation state (Object State List—Table 1) to the object state engine property pane ; e) utilization of comprised state history information and non-destructive overlay processing techniques for data integrity protection and verification ; auditing ; logging ; and detailed rollback to previous Intelligent Object data states ; and f) functional integration of data and applications via interactive information exchange with external components that provide processes including data type translation and applications integration . |
| US9087321B2 CLAIM 23 . The computer program product (location info, analysis process) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations (location info, analysis process) of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20020156756A1 CLAIM 9 . A unique object identifier property pane as in claim 8 , wherein the procedures for identification further comprise methods for : a) provision of additional identification information including ; i . data creation information , comprising time , date and machine identification information ; ii . ownership information , comprising unique identification information for the object creator ; iii . security setting information , comprising access permissions , read-only permission , write permission ; iv . routing information , comprising raw data content addressing information and Intelligent Object data addressing information ; and v . real-time information about locally or remotely connected users , comprising user' ; s unique identification information ; computer name ; login time ; network address or location info (computer program product, computer to perform operations) rmation ; and session identification information ; and b) at least one rule or policy for object data security which either permits or denies access for information interchange between data objects , data content , users and applications , based on comprised criteria for session , user and data authentication . US20020156756A1 CLAIM 19 . An always-on status management component as in claim 18 , further comprising methods for a) communication with an external object state engine to enable monitoring of data integrity , command history and regulatory validation states ; b) communication with an external object state engine to enable viewing of instrument parameters related to acquisition of data content and/or other instrument activities c) communication with said object state engine to provide automated validation status verification according industry-specific validation requirements not limited to Good Practice (G*P)-compliance including GLP Laboratory Information Management Systems (LIMS) ; U . S . Food and Drug Administration Center for Drug Evaluation and Research (FDA CDER) ; Codebook for Forensic Investigation Requirements (CFIR) ; and International Organization for Standardization (ISO 9000) ; and d) provision of information including data acquisition state ; calibration information ; applied transformation or analysis process (computer program product, computer to perform operations) es ; and validation state (Object State List—Table 1) to the object state engine property pane ; e) utilization of comprised state history information and non-destructive overlay processing techniques for data integrity protection and verification ; auditing ; logging ; and detailed rollback to previous Intelligent Object data states ; and f) functional integration of data and applications via interactive information exchange with external components that provide processes including data type translation and applications integration . |
| US9087321B2 CLAIM 24 . The computer program product (location info, analysis process) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations (location info, analysis process) of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020156756A1 CLAIM 9 . A unique object identifier property pane as in claim 8 , wherein the procedures for identification further comprise methods for : a) provision of additional identification information including ; i . data creation information , comprising time , date and machine identification information ; ii . ownership information , comprising unique identification information for the object creator ; iii . security setting information , comprising access permissions , read-only permission , write permission ; iv . routing information , comprising raw data content addressing information and Intelligent Object data addressing information ; and v . real-time information about locally or remotely connected users , comprising user' ; s unique identification information ; computer name ; login time ; network address or location info (computer program product, computer to perform operations) rmation ; and session identification information ; and b) at least one rule or policy for object data security which either permits or denies access for information interchange between data objects , data content , users and applications , based on comprised criteria for session , user and data authentication . US20020156756A1 CLAIM 19 . An always-on status management component as in claim 18 , further comprising methods for a) communication with an external object state engine to enable monitoring of data integrity , command history and regulatory validation states ; b) communication with an external object state engine to enable viewing of instrument parameters related to acquisition of data content and/or other instrument activities c) communication with said object state engine to provide automated validation status verification according industry-specific validation requirements not limited to Good Practice (G*P)-compliance including GLP Laboratory Information Management Systems (LIMS) ; U . S . Food and Drug Administration Center for Drug Evaluation and Research (FDA CDER) ; Codebook for Forensic Investigation Requirements (CFIR) ; and International Organization for Standardization (ISO 9000) ; and d) provision of information including data acquisition state ; calibration information ; applied transformation or analysis process (computer program product, computer to perform operations) es ; and validation state (Object State List—Table 1) to the object state engine property pane ; e) utilization of comprised state history information and non-destructive overlay processing techniques for data integrity protection and verification ; auditing ; logging ; and detailed rollback to previous Intelligent Object data states ; and f) functional integration of data and applications via interactive information exchange with external components that provide processes including data type translation and applications integration . |
| US9087321B2 CLAIM 25 . The computer program product (location info, analysis process) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (entire data) per selected answer and m rows (n layers) per user . |
US20020156756A1 CLAIM 4 . An Intelligent Object as in claim 1 , wherein said interface procedures for direct data content addressing , definition , presentation and functional integration further comprise methods for : a) vectorized access , routing , translation , linking and comparison of data content information such as data content and data content subsets (“workspaces”) defined to granularity from entire data (n bytes) content files to data content subsets as small as single byte workspaces ; b) and direct interchange of information not limited to said not limited to processing information , commands , queries , meta-data , data content and said defined workspace subsets ; i . between said data objects ; and ii . between said data objects , heterogeneous applications and a variety of components , access interfaces , and presentation layers (m rows) . US20020156756A1 CLAIM 9 . A unique object identifier property pane as in claim 8 , wherein the procedures for identification further comprise methods for : a) provision of additional identification information including ; i . data creation information , comprising time , date and machine identification information ; ii . ownership information , comprising unique identification information for the object creator ; iii . security setting information , comprising access permissions , read-only permission , write permission ; iv . routing information , comprising raw data content addressing information and Intelligent Object data addressing information ; and v . real-time information about locally or remotely connected users , comprising user' ; s unique identification information ; computer name ; login time ; network address or location info (computer program product, computer to perform operations) rmation ; and session identification information ; and b) at least one rule or policy for object data security which either permits or denies access for information interchange between data objects , data content , users and applications , based on comprised criteria for session , user and data authentication . US20020156756A1 CLAIM 19 . An always-on status management component as in claim 18 , further comprising methods for a) communication with an external object state engine to enable monitoring of data integrity , command history and regulatory validation states ; b) communication with an external object state engine to enable viewing of instrument parameters related to acquisition of data content and/or other instrument activities c) communication with said object state engine to provide automated validation status verification according industry-specific validation requirements not limited to Good Practice (G*P)-compliance including GLP Laboratory Information Management Systems (LIMS) ; U . S . Food and Drug Administration Center for Drug Evaluation and Research (FDA CDER) ; Codebook for Forensic Investigation Requirements (CFIR) ; and International Organization for Standardization (ISO 9000) ; and d) provision of information including data acquisition state ; calibration information ; applied transformation or analysis process (computer program product, computer to perform operations) es ; and validation state (Object State List—Table 1) to the object state engine property pane ; e) utilization of comprised state history information and non-destructive overlay processing techniques for data integrity protection and verification ; auditing ; logging ; and detailed rollback to previous Intelligent Object data states ; and f) functional integration of data and applications via interactive information exchange with external components that provide processes including data type translation and applications integration . |
| US9087321B2 CLAIM 26 . The computer program product (location info, analysis process) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations (location info, analysis process) of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020156756A1 CLAIM 9 . A unique object identifier property pane as in claim 8 , wherein the procedures for identification further comprise methods for : a) provision of additional identification information including ; i . data creation information , comprising time , date and machine identification information ; ii . ownership information , comprising unique identification information for the object creator ; iii . security setting information , comprising access permissions , read-only permission , write permission ; iv . routing information , comprising raw data content addressing information and Intelligent Object data addressing information ; and v . real-time information about locally or remotely connected users , comprising user' ; s unique identification information ; computer name ; login time ; network address or location info (computer program product, computer to perform operations) rmation ; and session identification information ; and b) at least one rule or policy for object data security which either permits or denies access for information interchange between data objects , data content , users and applications , based on comprised criteria for session , user and data authentication . US20020156756A1 CLAIM 19 . An always-on status management component as in claim 18 , further comprising methods for a) communication with an external object state engine to enable monitoring of data integrity , command history and regulatory validation states ; b) communication with an external object state engine to enable viewing of instrument parameters related to acquisition of data content and/or other instrument activities c) communication with said object state engine to provide automated validation status verification according industry-specific validation requirements not limited to Good Practice (G*P)-compliance including GLP Laboratory Information Management Systems (LIMS) ; U . S . Food and Drug Administration Center for Drug Evaluation and Research (FDA CDER) ; Codebook for Forensic Investigation Requirements (CFIR) ; and International Organization for Standardization (ISO 9000) ; and d) provision of information including data acquisition state ; calibration information ; applied transformation or analysis process (computer program product, computer to perform operations) es ; and validation state (Object State List—Table 1) to the object state engine property pane ; e) utilization of comprised state history information and non-destructive overlay processing techniques for data integrity protection and verification ; auditing ; logging ; and detailed rollback to previous Intelligent Object data states ; and f) functional integration of data and applications via interactive information exchange with external components that provide processes including data type translation and applications integration . |
| US9087321B2 CLAIM 27 . The computer program product (location info, analysis process) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (entire data) per selected answer and m rows (n layers) per user . |
US20020156756A1 CLAIM 4 . An Intelligent Object as in claim 1 , wherein said interface procedures for direct data content addressing , definition , presentation and functional integration further comprise methods for : a) vectorized access , routing , translation , linking and comparison of data content information such as data content and data content subsets (“workspaces”) defined to granularity from entire data (n bytes) content files to data content subsets as small as single byte workspaces ; b) and direct interchange of information not limited to said not limited to processing information , commands , queries , meta-data , data content and said defined workspace subsets ; i . between said data objects ; and ii . between said data objects , heterogeneous applications and a variety of components , access interfaces , and presentation layers (m rows) . US20020156756A1 CLAIM 9 . A unique object identifier property pane as in claim 8 , wherein the procedures for identification further comprise methods for : a) provision of additional identification information including ; i . data creation information , comprising time , date and machine identification information ; ii . ownership information , comprising unique identification information for the object creator ; iii . security setting information , comprising access permissions , read-only permission , write permission ; iv . routing information , comprising raw data content addressing information and Intelligent Object data addressing information ; and v . real-time information about locally or remotely connected users , comprising user' ; s unique identification information ; computer name ; login time ; network address or location info (computer program product, computer to perform operations) rmation ; and session identification information ; and b) at least one rule or policy for object data security which either permits or denies access for information interchange between data objects , data content , users and applications , based on comprised criteria for session , user and data authentication . US20020156756A1 CLAIM 19 . An always-on status management component as in claim 18 , further comprising methods for a) communication with an external object state engine to enable monitoring of data integrity , command history and regulatory validation states ; b) communication with an external object state engine to enable viewing of instrument parameters related to acquisition of data content and/or other instrument activities c) communication with said object state engine to provide automated validation status verification according industry-specific validation requirements not limited to Good Practice (G*P)-compliance including GLP Laboratory Information Management Systems (LIMS) ; U . S . Food and Drug Administration Center for Drug Evaluation and Research (FDA CDER) ; Codebook for Forensic Investigation Requirements (CFIR) ; and International Organization for Standardization (ISO 9000) ; and d) provision of information including data acquisition state ; calibration information ; applied transformation or analysis process (computer program product, computer to perform operations) es ; and validation state (Object State List—Table 1) to the object state engine property pane ; e) utilization of comprised state history information and non-destructive overlay processing techniques for data integrity protection and verification ; auditing ; logging ; and detailed rollback to previous Intelligent Object data states ; and f) functional integration of data and applications via interactive information exchange with external components that provide processes including data type translation and applications integration . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2003141152A Filed: 2001-11-02 Issued: 2003-05-16 Information distribution server, information distribution method (Original Assignee) Ntt Data Corp; 株式会社エヌ・ティ・ティ・データ Yoshihiro Ishihara, 吉浩 石原 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データ (user information) ベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers (ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 3 . The poll-based networking system as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers (ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 4 . The poll-based networking system as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2003141152A CLAIM 2 【請求項２】 端末から送信される書き込み情報を電子 掲示板上に公開する情報配信サーバであって、 前記書き込み情報を構成する要素を抽出する第１のテキ ストマイニング処理手段と、 前記第１ (minimum match percentage) のテキストマイニング処理手段によって抽出さ れる要素と前記書き込み情報とを事例情報として記憶す る掲示板情報データベースと、 新たに端末から送信される書き込み情報から前記書き込 み情報を構成する要素を抽出する第２のテキストマイニ ング処理手段と、 前記第２のテキストマイニング処理手段の検出結果に基 づいて、前記第２のテキストマイニング処理手段によっ て前記新たに端末から送信された書き込み情報から抽出 された要素と前記掲示板情報データベースに記憶された 事例情報の要素とを比較し、比較結果に基づいて、前記 新たに送信された書き込み情報に応じた事例情報を送信 対象の端末に送信する情報配信制御手段と、 を有することを特徴とする情報配信サーバ。 2 . An information distribution server that publishes write information transmitted from a terminal on an electronic bulletin board , comprising : first text mining processing means for extracting elements constituting the write information ; and the first text . A bulletin board information database that stores the elements extracted by the mining processing means and the writing information as case information , and a second text mining processing that extracts the elements forming the writing information from the writing information newly transmitted from the terminal . And an element extracted from the writing information newly transmitted from the terminal by the second text mining processing means based on the detection result of the second text mining processing means and stored in the bulletin board information database . Compared with the elements of the case information , the new Information distribution server and having a an information distribution control means for transmitting the case information corresponding to the transmitted write information to the transmission target terminal . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データ (user information) ベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers (ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 12 . The computer implemented method as set forth in claim 11 , wherein , in cumulatively comparing , further comprising an act of causing the one or more processors to perform operations of : matching the user to other users based upon all of the selected answers (ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , further comprising an act of causing the one or more processors to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2003141152A CLAIM 2 【請求項２】 端末から送信される書き込み情報を電子 掲示板上に公開する情報配信サーバであって、 前記書き込み情報を構成する要素を抽出する第１のテキ ストマイニング処理手段と、 前記第１ (minimum match percentage) のテキストマイニング処理手段によって抽出さ れる要素と前記書き込み情報とを事例情報として記憶す る掲示板情報データベースと、 新たに端末から送信される書き込み情報から前記書き込 み情報を構成する要素を抽出する第２のテキストマイニ ング処理手段と、 前記第２のテキストマイニング処理手段の検出結果に基 づいて、前記第２のテキストマイニング処理手段によっ て前記新たに端末から送信された書き込み情報から抽出 された要素と前記掲示板情報データベースに記憶された 事例情報の要素とを比較し、比較結果に基づいて、前記 新たに送信された書き込み情報に応じた事例情報を送信 対象の端末に送信する情報配信制御手段と、 を有することを特徴とする情報配信サーバ。 2 . An information distribution server that publishes write information transmitted from a terminal on an electronic bulletin board , comprising : first text mining processing means for extracting elements constituting the write information ; and the first text . A bulletin board information database that stores the elements extracted by the mining processing means and the writing information as case information , and a second text mining processing that extracts the elements forming the writing information from the writing information newly transmitted from the terminal . And an element extracted from the writing information newly transmitted from the terminal by the second text mining processing means based on the detection result of the second text mining processing means and stored in the bulletin board information database . Compared with the elements of the case information , the new Information distribution server and having a an information distribution control means for transmitting the case information corresponding to the transmitted write information to the transmission target terminal . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データ (user information) ベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers (ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers (ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (前記第１) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2003141152A CLAIM 2 【請求項２】 端末から送信される書き込み情報を電子 掲示板上に公開する情報配信サーバであって、 前記書き込み情報を構成する要素を抽出する第１のテキ ストマイニング処理手段と、 前記第１ (minimum match percentage) のテキストマイニング処理手段によって抽出さ れる要素と前記書き込み情報とを事例情報として記憶す る掲示板情報データベースと、 新たに端末から送信される書き込み情報から前記書き込 み情報を構成する要素を抽出する第２のテキストマイニ ング処理手段と、 前記第２のテキストマイニング処理手段の検出結果に基 づいて、前記第２のテキストマイニング処理手段によっ て前記新たに端末から送信された書き込み情報から抽出 された要素と前記掲示板情報データベースに記憶された 事例情報の要素とを比較し、比較結果に基づいて、前記 新たに送信された書き込み情報に応じた事例情報を送信 対象の端末に送信する情報配信制御手段と、 を有することを特徴とする情報配信サーバ。 2 . An information distribution server that publishes write information transmitted from a terminal on an electronic bulletin board , comprising : first text mining processing means for extracting elements constituting the write information ; and the first text . A bulletin board information database that stores the elements extracted by the mining processing means and the writing information as case information , and a second text mining processing that extracts the elements forming the writing information from the writing information newly transmitted from the terminal . And an element extracted from the writing information newly transmitted from the terminal by the second text mining processing means based on the detection result of the second text mining processing means and stored in the bulletin board information database . Compared with the elements of the case information , the new Information distribution server and having a an information distribution control means for transmitting the case information corresponding to the transmitted write information to the transmission target terminal . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2003141152A CLAIM 1 【請求項１】 端末から送信されネットワーク上の電子 掲示板に登録される書き込み情報から前記書き込み情報 を構成する要素を抽出するテキストマイニング処理手段 と、 前記ユーザ (selected answers) に送信するための送信情報とキー情報とを対 応づけて記憶する送信情報データベースと、 前記テキストマイニング処理手段によって抽出される要 素と前記送信情報データベースに記憶されるキー情報と を比較する比較手段と、 前記比較手段の比較結果に基づいて、前記キー情報に対 応する送信情報を前記端末に送信する情報配信制御手段 と、 を有することを特徴とする情報配信サーバ。 1 . A text mining processing means for extracting elements constituting the writing information from writing information transmitted from a terminal and registered in an electronic bulletin board on a network , and transmission information and key information for transmitting to the user . A transmission information database that stores the data in association with each other , comparison means that compares the key information stored in the transmission information database with the element extracted by the text mining processing means , and based on the comparison result of the comparison means , An information distribution control means for transmitting the transmission information corresponding to the key information to the terminal , the information distribution server . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20030182656A1 Filed: 2001-09-06 Issued: 2003-09-25 Deployment manager for organizing and deploying an application in a distributed computing environment (Original Assignee) Cognos Inc (Current Assignee) International Business Machines Corp Burton Leathers, Christian Legault |
|---|---|
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands (HTML page) to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20030182656A1 CLAIM 13 . A method according to claim 9 , wherein the application definition may include a list of word processor documents , files , folders , and HTML page (match commands) s . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (existing application) (specifying information) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20030182656A1 CLAIM 31 . A method according to claim 1 , wherein the application package may be updated from an existing application (executable instruction) package . US20030182656A1 CLAIM 36 . A method of creating and deploying an application , the method comprising steps of : (a) determining application components which are available from a source environment ; (b) creating an application definition ; (c) defining a package according to the application definition for creating a package definition ; (d) creating a packlet associated with each application entity in accordance with the package definition ; (e) singling out a fix-up which is to be resolved on the target environment ; (f) creating an application package containing all the information required to install an application ; and (g) specifying information (computer executable instruction) to be required for installing ; and (h) placing the application package content into the target environment . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands (HTML page) to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20030182656A1 CLAIM 13 . A method according to claim 9 , wherein the application definition may include a list of word processor documents , files , folders , and HTML page (match commands) s . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands (HTML page) to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20030182656A1 CLAIM 13 . A method according to claim 9 , wherein the application definition may include a list of word processor documents , files , folders , and HTML page (match commands) s . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20030041198A1 Filed: 2001-08-23 Issued: 2003-02-27 Authorization model for administration (Original Assignee) International Business Machines Corp (Current Assignee) International Business Machines Corp Scott Exton, Michael Powell, Brian Turner |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030041198A1 CLAIM 33 . A computer program product , in a computer readable medium (match server) , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030041198A1 CLAIM 33 . A computer program product , in a computer readable medium (match server) , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030041198A1 CLAIM 33 . A computer program product , in a computer readable medium (match server) , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030041198A1 CLAIM 33 . A computer program product , in a computer readable medium (match server) , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means (first permission) to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20030041198A1 CLAIM 13 . The method of claim 11 , wherein the step of finding an access control list comprises finding a first access control list that assigns a first permission (instruction means) for the user and a second access control list that assigns a second permission for the user . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030041198A1 CLAIM 33 . A computer program product , in a computer readable medium (match server) , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030041198A1 CLAIM 33 . A computer program product , in a computer readable medium (match server) , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030041198A1 CLAIM 33 . A computer program product , in a computer readable medium (match server) , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030041198A1 CLAIM 33 . A computer program product , in a computer readable medium (match server) , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 CLAIM 19 . A computer program product (computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means (first permission) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20030041198A1 CLAIM 13 . The method of claim 11 , wherein the step of finding an access control list comprises finding a first access control list that assigns a first permission (instruction means) for the user and a second access control list that assigns a second permission for the user . US20030041198A1 CLAIM 33 . A computer program product (computer program product) , in a computer readable medium , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 CLAIM 20 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means (first permission) for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20030041198A1 CLAIM 13 . The method of claim 11 , wherein the step of finding an access control list comprises finding a first access control list that assigns a first permission (instruction means) for the user and a second access control list that assigns a second permission for the user . US20030041198A1 CLAIM 33 . A computer program product (computer program product) , in a computer readable medium , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 CLAIM 21 . The computer program product (computer program product) as set forth in claim 20 , further comprising instruction means (first permission) for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20030041198A1 CLAIM 13 . The method of claim 11 , wherein the step of finding an access control list comprises finding a first access control list that assigns a first permission (instruction means) for the user and a second access control list that assigns a second permission for the user . US20030041198A1 CLAIM 33 . A computer program product (computer program product) , in a computer readable medium , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 CLAIM 22 . The computer program product (computer program product) as set forth in claim 21 , further comprising instruction means (first permission) for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20030041198A1 CLAIM 13 . The method of claim 11 , wherein the step of finding an access control list comprises finding a first access control list that assigns a first permission (instruction means) for the user and a second access control list that assigns a second permission for the user . US20030041198A1 CLAIM 33 . A computer program product (computer program product) , in a computer readable medium , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 CLAIM 23 . The computer program product (computer program product) as set forth in claim 22 , further comprising instruction means (first permission) for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20030041198A1 CLAIM 13 . The method of claim 11 , wherein the step of finding an access control list comprises finding a first access control list that assigns a first permission (instruction means) for the user and a second access control list that assigns a second permission for the user . US20030041198A1 CLAIM 33 . A computer program product (computer program product) , in a computer readable medium , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 CLAIM 24 . The computer program product (computer program product) as set forth in claim 23 , further comprising instruction means (first permission) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030041198A1 CLAIM 13 . The method of claim 11 , wherein the step of finding an access control list comprises finding a first access control list that assigns a first permission (instruction means) for the user and a second access control list that assigns a second permission for the user . US20030041198A1 CLAIM 33 . A computer program product (computer program product) , in a computer readable medium (match server) , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 CLAIM 25 . The computer program product (computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030041198A1 CLAIM 33 . A computer program product (computer program product) , in a computer readable medium (match server) , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 CLAIM 26 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means (first permission) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030041198A1 CLAIM 13 . The method of claim 11 , wherein the step of finding an access control list comprises finding a first access control list that assigns a first permission (instruction means) for the user and a second access control list that assigns a second permission for the user . US20030041198A1 CLAIM 33 . A computer program product (computer program product) , in a computer readable medium (match server) , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 CLAIM 27 . The computer program product (computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030041198A1 CLAIM 33 . A computer program product (computer program product) , in a computer readable medium (match server) , for administering managed resources , comprising : instructions for defining a set of privileges for a managed resource ; and instructions for attaching an access control list to an object that represents the managed resource , wherein the access control list assigns at least one privilege from the set of privileges to an entity . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20020029296A1 Filed: 2001-08-15 Issued: 2002-03-07 Portal server that provides a customizable user interface for access to computer networks (Original Assignee) Ed Anuff; Taylor John Dean; Miles Chaston; Macleod David; Peter Leiser; Oliver Muoto; Seth Ladygo; Brian Slesinsky; Terry Joyce (Current Assignee) Vignette Corp Ed Anuff, John Taylor, Miles Chaston, David MacLeod, Peter Leiser, Oliver Muoto, Seth Ladygo, Brian Slesinsky, Terry Joyce |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (end users) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020029296A1 CLAIM 46 . The portal server framework of claim 26 , wherein specific modules can be “required” , so they cannot be removed from the page by end users (web server) . US20020029296A1 CLAIM 51 . A portal server system (match servers) that displays portal pages that each comprise a plurality of modules , where each module includes a first view that displays to users information about a particular type of resource on a computer network , and at least one other view that provides capabilities relating to the use and/or operation of the module . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (end users) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020029296A1 CLAIM 46 . The portal server framework of claim 26 , wherein specific modules can be “required” , so they cannot be removed from the page by end users (web server) . US20020029296A1 CLAIM 51 . A portal server system (match servers) that displays portal pages that each comprise a plurality of modules , where each module includes a first view that displays to users information about a particular type of resource on a computer network , and at least one other view that provides capabilities relating to the use and/or operation of the module . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (end users) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020029296A1 CLAIM 46 . The portal server framework of claim 26 , wherein specific modules can be “required” , so they cannot be removed from the page by end users (web server) . US20020029296A1 CLAIM 51 . A portal server system (match servers) that displays portal pages that each comprise a plurality of modules , where each module includes a first view that displays to users information about a particular type of resource on a computer network , and at least one other view that provides capabilities relating to the use and/or operation of the module . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (end users) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020029296A1 CLAIM 46 . The portal server framework of claim 26 , wherein specific modules can be “required” , so they cannot be removed from the page by end users (web server) . US20020029296A1 CLAIM 51 . A portal server system (match servers) that displays portal pages that each comprise a plurality of modules , where each module includes a first view that displays to users information about a particular type of resource on a computer network , and at least one other view that provides capabilities relating to the use and/or operation of the module . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (end users) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020029296A1 CLAIM 46 . The portal server framework of claim 26 , wherein specific modules can be “required” , so they cannot be removed from the page by end users (web server) . US20020029296A1 CLAIM 51 . A portal server system (match servers) that displays portal pages that each comprise a plurality of modules , where each module includes a first view that displays to users information about a particular type of resource on a computer network , and at least one other view that provides capabilities relating to the use and/or operation of the module . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (end users) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020029296A1 CLAIM 46 . The portal server framework of claim 26 , wherein specific modules can be “required” , so they cannot be removed from the page by end users (web server) . US20020029296A1 CLAIM 51 . A portal server system (match servers) that displays portal pages that each comprise a plurality of modules , where each module includes a first view that displays to users information about a particular type of resource on a computer network , and at least one other view that provides capabilities relating to the use and/or operation of the module . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20030018964A1 Filed: 2001-07-19 Issued: 2003-01-23 Object model and framework for installation of software packages using a distributed directory (Original Assignee) International Business Machines Corp (Current Assignee) International Business Machines Corp James Fox, Robert Leah, John McGarvey |
|---|---|
| US9087321B2 CLAIM 19 . A computer program product (computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20030018964A1 CLAIM 10 . A computer program product (computer program product) for improving installation of software packages , the computer program product embodied on one or more computer-readable media and comprising : computer-readable program code means for defining an object model representing a plurality of components of a software installation package , wherein each component comprises a plurality of objects ; computer-readable program code means for instantiating at least one version of each of the objects , wherein a plurality of versions of selected ones of the objects may be instantiated to reflect differing access rights which are appropriate for potential requesters of the package ; and computer-readable program code means for storing the instantiated objects in a directory , wherein the versions of the objects are associated with the differing access rights . |
| US9087321B2 CLAIM 20 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20030018964A1 CLAIM 10 . A computer program product (computer program product) for improving installation of software packages , the computer program product embodied on one or more computer-readable media and comprising : computer-readable program code means for defining an object model representing a plurality of components of a software installation package , wherein each component comprises a plurality of objects ; computer-readable program code means for instantiating at least one version of each of the objects , wherein a plurality of versions of selected ones of the objects may be instantiated to reflect differing access rights which are appropriate for potential requesters of the package ; and computer-readable program code means for storing the instantiated objects in a directory , wherein the versions of the objects are associated with the differing access rights . |
| US9087321B2 CLAIM 21 . The computer program product (computer program product) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20030018964A1 CLAIM 10 . A computer program product (computer program product) for improving installation of software packages , the computer program product embodied on one or more computer-readable media and comprising : computer-readable program code means for defining an object model representing a plurality of components of a software installation package , wherein each component comprises a plurality of objects ; computer-readable program code means for instantiating at least one version of each of the objects , wherein a plurality of versions of selected ones of the objects may be instantiated to reflect differing access rights which are appropriate for potential requesters of the package ; and computer-readable program code means for storing the instantiated objects in a directory , wherein the versions of the objects are associated with the differing access rights . |
| US9087321B2 CLAIM 22 . The computer program product (computer program product) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20030018964A1 CLAIM 10 . A computer program product (computer program product) for improving installation of software packages , the computer program product embodied on one or more computer-readable media and comprising : computer-readable program code means for defining an object model representing a plurality of components of a software installation package , wherein each component comprises a plurality of objects ; computer-readable program code means for instantiating at least one version of each of the objects , wherein a plurality of versions of selected ones of the objects may be instantiated to reflect differing access rights which are appropriate for potential requesters of the package ; and computer-readable program code means for storing the instantiated objects in a directory , wherein the versions of the objects are associated with the differing access rights . |
| US9087321B2 CLAIM 23 . The computer program product (computer program product) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20030018964A1 CLAIM 10 . A computer program product (computer program product) for improving installation of software packages , the computer program product embodied on one or more computer-readable media and comprising : computer-readable program code means for defining an object model representing a plurality of components of a software installation package , wherein each component comprises a plurality of objects ; computer-readable program code means for instantiating at least one version of each of the objects , wherein a plurality of versions of selected ones of the objects may be instantiated to reflect differing access rights which are appropriate for potential requesters of the package ; and computer-readable program code means for storing the instantiated objects in a directory , wherein the versions of the objects are associated with the differing access rights . |
| US9087321B2 CLAIM 24 . The computer program product (computer program product) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030018964A1 CLAIM 10 . A computer program product (computer program product) for improving installation of software packages , the computer program product embodied on one or more computer-readable media and comprising : computer-readable program code means for defining an object model representing a plurality of components of a software installation package , wherein each component comprises a plurality of objects ; computer-readable program code means for instantiating at least one version of each of the objects , wherein a plurality of versions of selected ones of the objects may be instantiated to reflect differing access rights which are appropriate for potential requesters of the package ; and computer-readable program code means for storing the instantiated objects in a directory , wherein the versions of the objects are associated with the differing access rights . |
| US9087321B2 CLAIM 25 . The computer program product (computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030018964A1 CLAIM 10 . A computer program product (computer program product) for improving installation of software packages , the computer program product embodied on one or more computer-readable media and comprising : computer-readable program code means for defining an object model representing a plurality of components of a software installation package , wherein each component comprises a plurality of objects ; computer-readable program code means for instantiating at least one version of each of the objects , wherein a plurality of versions of selected ones of the objects may be instantiated to reflect differing access rights which are appropriate for potential requesters of the package ; and computer-readable program code means for storing the instantiated objects in a directory , wherein the versions of the objects are associated with the differing access rights . |
| US9087321B2 CLAIM 26 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030018964A1 CLAIM 10 . A computer program product (computer program product) for improving installation of software packages , the computer program product embodied on one or more computer-readable media and comprising : computer-readable program code means for defining an object model representing a plurality of components of a software installation package , wherein each component comprises a plurality of objects ; computer-readable program code means for instantiating at least one version of each of the objects , wherein a plurality of versions of selected ones of the objects may be instantiated to reflect differing access rights which are appropriate for potential requesters of the package ; and computer-readable program code means for storing the instantiated objects in a directory , wherein the versions of the objects are associated with the differing access rights . |
| US9087321B2 CLAIM 27 . The computer program product (computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030018964A1 CLAIM 10 . A computer program product (computer program product) for improving installation of software packages , the computer program product embodied on one or more computer-readable media and comprising : computer-readable program code means for defining an object model representing a plurality of components of a software installation package , wherein each component comprises a plurality of objects ; computer-readable program code means for instantiating at least one version of each of the objects , wherein a plurality of versions of selected ones of the objects may be instantiated to reflect differing access rights which are appropriate for potential requesters of the package ; and computer-readable program code means for storing the instantiated objects in a directory , wherein the versions of the objects are associated with the differing access rights . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20020194267A1 Filed: 2001-06-22 Issued: 2002-12-19 Portal server that provides modification of user interfaces for access to computer networks (Original Assignee) Vignette Corp (Current Assignee) Vignette Corp Daniel Flesner, Seth Ladygo |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020194267A1 CLAIM 19 . A computer program product for modifying modules within a portal on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020194267A1 CLAIM 19 . A computer program product for modifying modules within a portal on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020194267A1 CLAIM 19 . A computer program product for modifying modules within a portal on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020194267A1 CLAIM 19 . A computer program product for modifying modules within a portal on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020194267A1 CLAIM 19 . A computer program product for modifying modules within a portal on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020194267A1 CLAIM 19 . A computer program product for modifying modules within a portal on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020194267A1 CLAIM 19 . A computer program product for modifying modules within a portal on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020194267A1 CLAIM 19 . A computer program product for modifying modules within a portal on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 CLAIM 19 . A computer program product (computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20020194267A1 CLAIM 19 . A computer program product (computer program product) for modifying modules within a portal on a computer network , comprising : a computer readable medium ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 CLAIM 20 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20020194267A1 CLAIM 19 . A computer program product (computer program product) for modifying modules within a portal on a computer network , comprising : a computer readable medium ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 CLAIM 21 . The computer program product (computer program product) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20020194267A1 CLAIM 19 . A computer program product (computer program product) for modifying modules within a portal on a computer network , comprising : a computer readable medium ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 CLAIM 22 . The computer program product (computer program product) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20020194267A1 CLAIM 19 . A computer program product (computer program product) for modifying modules within a portal on a computer network , comprising : a computer readable medium ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 CLAIM 23 . The computer program product (computer program product) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20020194267A1 CLAIM 19 . A computer program product (computer program product) for modifying modules within a portal on a computer network , comprising : a computer readable medium ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 CLAIM 24 . The computer program product (computer program product) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020194267A1 CLAIM 19 . A computer program product (computer program product) for modifying modules within a portal on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 CLAIM 25 . The computer program product (computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020194267A1 CLAIM 19 . A computer program product (computer program product) for modifying modules within a portal on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 CLAIM 26 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020194267A1 CLAIM 19 . A computer program product (computer program product) for modifying modules within a portal on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 CLAIM 27 . The computer program product (computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020194267A1 CLAIM 19 . A computer program product (computer program product) for modifying modules within a portal on a computer network , comprising : a computer readable medium (match server) ; and computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an intermediate object , the intermediate object operable to hold a reference to a current implementation of an instantiated object , the instantiated object encapsulating information of a particular type on the computer network ; and instantiating an update subsystem object , the update subsystem object operable to select an updated implementation of the instantiated object from a set of update servers ; whereby , an appropriate update server in the set of update servers from which to select the updated implementation of the instantiated object is based on host identification information of a site hosting the portal . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20020181685A1 Filed: 2001-06-05 Issued: 2002-12-05 Method and system for facilitating telecommunications service provisioning and service assurance (Original Assignee) Bell Canada Inc (Current Assignee) Bell Canada Inc Alan Doherty, Neil Rieck, Stephen Kennel, Terry Shannon, Robert Yip |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (content provider) of other users that have a likelihood of match within a predetermined threshold . |
US20020181685A1 CLAIM 14 . A method as claimed in claim 13 wherein if a match is found the method further comprises a step of formulating a service enable message and forwarding the service enable message to a broadcast management system , which on receipt of the service enable message sends a barker channel signal to the CPE to verify to the technician that the CPE is correctly configured and connected to receive content from a video content provider (user profiles) . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (content provider) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20020181685A1 CLAIM 14 . A method as claimed in claim 13 wherein if a match is found the method further comprises a step of formulating a service enable message and forwarding the service enable message to a broadcast management system , which on receipt of the service enable message sends a barker channel signal to the CPE to verify to the technician that the CPE is correctly configured and connected to receive content from a video content provider (user profiles) . |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (order n) of members that fall within the maximum and minimum match percentage . |
US20020181685A1 CLAIM 10 . The method as claimed in claim 8 wherein the step of formulating the alphanumeric message comprises a step of formulating a message containing a service order n (maximum number) umber ; customer name ; customer phone number ; and a date on which the technician is to perform the installation . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (electronic mail) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020181685A1 CLAIM 23 . The system as claimed in claim 21 wherein the server is adapted to advise the technician using an electronic mail (web server) message sent to the technician via an electronic mail system . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (electronic mail) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020181685A1 CLAIM 23 . The system as claimed in claim 21 wherein the server is adapted to advise the technician using an electronic mail (web server) message sent to the technician via an electronic mail system . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one (management system) or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (content provider) of other users that have a likelihood of match within a predetermined threshold . |
US20020181685A1 CLAIM 14 . A method as claimed in claim 13 wherein if a match is found the method further comprises a step of formulating a service enable message and forwarding the service enable message to a broadcast management system (computer having one) , which on receipt of the service enable message sends a barker channel signal to the CPE to verify to the technician that the CPE is correctly configured and connected to receive content from a video content provider (user profiles) . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (content provider) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20020181685A1 CLAIM 14 . A method as claimed in claim 13 wherein if a match is found the method further comprises a step of formulating a service enable message and forwarding the service enable message to a broadcast management system , which on receipt of the service enable message sends a barker channel signal to the CPE to verify to the technician that the CPE is correctly configured and connected to receive content from a video content provider (user profiles) . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (order n) of members that fall within the maximum and minimum match percentage . |
US20020181685A1 CLAIM 10 . The method as claimed in claim 8 wherein the step of formulating the alphanumeric message comprises a step of formulating a message containing a service order n (maximum number) umber ; customer name ; customer phone number ; and a date on which the technician is to perform the installation . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (electronic mail) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020181685A1 CLAIM 23 . The system as claimed in claim 21 wherein the server is adapted to advise the technician using an electronic mail (web server) message sent to the technician via an electronic mail system . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (electronic mail) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020181685A1 CLAIM 23 . The system as claimed in claim 21 wherein the server is adapted to advise the technician using an electronic mail (web server) message sent to the technician via an electronic mail system . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (content provider) of other users that have a likelihood of match within a predetermined threshold . |
US20020181685A1 CLAIM 14 . A method as claimed in claim 13 wherein if a match is found the method further comprises a step of formulating a service enable message and forwarding the service enable message to a broadcast management system , which on receipt of the service enable message sends a barker channel signal to the CPE to verify to the technician that the CPE is correctly configured and connected to receive content from a video content provider (user profiles) . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (content provider) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20020181685A1 CLAIM 14 . A method as claimed in claim 13 wherein if a match is found the method further comprises a step of formulating a service enable message and forwarding the service enable message to a broadcast management system , which on receipt of the service enable message sends a barker channel signal to the CPE to verify to the technician that the CPE is correctly configured and connected to receive content from a video content provider (user profiles) . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (order n) of members that fall within the maximum and minimum match percentage . |
US20020181685A1 CLAIM 10 . The method as claimed in claim 8 wherein the step of formulating the alphanumeric message comprises a step of formulating a message containing a service order n (maximum number) umber ; customer name ; customer phone number ; and a date on which the technician is to perform the installation . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (electronic mail) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020181685A1 CLAIM 23 . The system as claimed in claim 21 wherein the server is adapted to advise the technician using an electronic mail (web server) message sent to the technician via an electronic mail system . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (electronic mail) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020181685A1 CLAIM 23 . The system as claimed in claim 21 wherein the server is adapted to advise the technician using an electronic mail (web server) message sent to the technician via an electronic mail system . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6643653B1 Filed: 2001-06-01 Issued: 2003-11-04 Method and apparatus for identifying a data sequence related to a given data sequence (Original Assignee) Oracle International Corp (Current Assignee) Oracle International Corp Winson Chu |
|---|---|
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands (key sequence) to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6643653B1 CLAIM 1 . A method of mapping a key sequence (match commands) of data to a target sequence of data , if the target sequence is stored in a computer readable memory , the method comprising : retrieving , from a root node of the computer readable memory corresponding to the value of a first datum in said key sequence , an identifier of a first block ; for one or more blocks starting with said first block , wherein each of said blocks is one of a virtual block comprising one or more nodes and a leaf configured to store (receiving match commands to identify users) a sequence of data : determining whether said block is a virtual block or a leaf ; if said block is a virtual block : locating a node in said virtual block corresponding to the value of a next datum in said key sequence ; retrieving a home block identifier from said node ; and if said home block identifier identifies said virtual block , accessing a next block identified by a next block identifier of said node ; and if said block is a leaf : determining whether said leaf contains said target sequence of data ; if said leaf contains said target sequence of data , retrieving said target sequence ; if said leaf does not contain said target sequence , accessing a next block identified by a next block identifier of said leaf if said leaf contains a next block identifier . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (memory location) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6643653B1 CLAIM 16 . The method of claim 10 , wherein said retrieving from said node an identifier of one of a next virtual block and a leaf comprises : retrieving said identifier ; and comparing said identifier to a threshold ; wherein said threshold identifies a memory location (executable instruction) separating virtual blocks from leaves . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands (key sequence) to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6643653B1 CLAIM 1 . A method of mapping a key sequence (match commands) of data to a target sequence of data , if the target sequence is stored in a computer readable memory , the method comprising : retrieving , from a root node of the computer readable memory corresponding to the value of a first datum in said key sequence , an identifier of a first block ; for one or more blocks starting with said first block , wherein each of said blocks is one of a virtual block comprising one or more nodes and a leaf configured to store (receiving match commands to identify users) a sequence of data : determining whether said block is a virtual block or a leaf ; if said block is a virtual block : locating a node in said virtual block corresponding to the value of a next datum in said key sequence ; retrieving a home block identifier from said node ; and if said home block identifier identifies said virtual block , accessing a next block identified by a next block identifier of said node ; and if said block is a leaf : determining whether said leaf contains said target sequence of data ; if said leaf contains said target sequence of data , retrieving said target sequence ; if said leaf does not contain said target sequence , accessing a next block identified by a next block identifier of said leaf if said leaf contains a next block identifier . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands (key sequence) to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6643653B1 CLAIM 1 . A method of mapping a key sequence (match commands) of data to a target sequence of data , if the target sequence is stored in a computer readable memory , the method comprising : retrieving , from a root node of the computer readable memory corresponding to the value of a first datum in said key sequence , an identifier of a first block ; for one or more blocks starting with said first block , wherein each of said blocks is one of a virtual block comprising one or more nodes and a leaf configured to store (receiving match commands to identify users) a sequence of data : determining whether said block is a virtual block or a leaf ; if said block is a virtual block : locating a node in said virtual block corresponding to the value of a next datum in said key sequence ; retrieving a home block identifier from said node ; and if said home block identifier identifies said virtual block , accessing a next block identified by a next block identifier of said node ; and if said block is a leaf : determining whether said leaf contains said target sequence of data ; if said leaf contains said target sequence of data , retrieving said target sequence ; if said leaf does not contain said target sequence , accessing a next block identified by a next block identifier of said leaf if said leaf contains a next block identifier . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20020184165A1 Filed: 2001-05-31 Issued: 2002-12-05 Web browser-based object oriented application component test client (Original Assignee) International Business Machines Corp (Current Assignee) Twitter Inc Timothy Deboer, Timothy Francis, Lawrence Rich, Sheldon Wosnick, Siu Yuen |
|---|---|
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question (client side) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (said indication, further user) . |
US20020184165A1 CLAIM 1 . A method of facilitating testing of an object-oriented application component , said method comprising : providing a client side (next polling question) application portion for presenting a view to a user of a Web browser , said view allowing user interactions with said view , where some of said interactions specify given tests to perform on said component ; and executing a server side application portion for receiving indications of said user interactions with said client side application portion and , responsive to said indication (next polling questions) s , performing said given tests on said component . US20020184165A1 CLAIM 17 . A Web module containing a test client for Enterprise JavaBeans , said test client operable to : present a user interface over a data link , where said user interface may be displayed through the use of a browser application on a remote workstation , said user interface allowing a user at said remote workstation to : select a given object ; select a given method of said given object ; supply said given method with a parameter ; request that said given method be invoked with said parameter ; responsive to receiving said request , invoke said method with said parameter to give a result ; and present a further user (next polling questions) interface to present said result to said user . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020184165A1 CLAIM 16 . A computer readable medium (match server) containing computer-executable instructions which , when performed by a processor in an application server , cause the processor to : provide a test client user interface to a workstation over an HTTP link , where said test client user interface is viewed through the use of a Web browser run on said workstation ; receive a selection from said workstation , said selection identifying a given object , where said given object is a home interface or a remote interface of said Enterprise JavaBean ; receive a request from said workstation , where said request is a consequence of user interaction with said test client user interface and includes an indication of a test to perform on said given object ; perform said test on said given object to give a result , responsive to said request ; and send a response to said workstation over said HTTP link , said response including an indication of said result to be displayed by said user interface . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020184165A1 CLAIM 16 . A computer readable medium (match server) containing computer-executable instructions which , when performed by a processor in an application server , cause the processor to : provide a test client user interface to a workstation over an HTTP link , where said test client user interface is viewed through the use of a Web browser run on said workstation ; receive a selection from said workstation , said selection identifying a given object , where said given object is a home interface or a remote interface of said Enterprise JavaBean ; receive a request from said workstation , where said request is a consequence of user interaction with said test client user interface and includes an indication of a test to perform on said given object ; perform said test on said given object to give a result , responsive to said request ; and send a response to said workstation over said HTTP link , said response including an indication of said result to be displayed by said user interface . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020184165A1 CLAIM 16 . A computer readable medium (match server) containing computer-executable instructions which , when performed by a processor in an application server , cause the processor to : provide a test client user interface to a workstation over an HTTP link , where said test client user interface is viewed through the use of a Web browser run on said workstation ; receive a selection from said workstation , said selection identifying a given object , where said given object is a home interface or a remote interface of said Enterprise JavaBean ; receive a request from said workstation , where said request is a consequence of user interaction with said test client user interface and includes an indication of a test to perform on said given object ; perform said test on said given object to give a result , responsive to said request ; and send a response to said workstation over said HTTP link , said response including an indication of said result to be displayed by said user interface . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020184165A1 CLAIM 16 . A computer readable medium (match server) containing computer-executable instructions which , when performed by a processor in an application server , cause the processor to : provide a test client user interface to a workstation over an HTTP link , where said test client user interface is viewed through the use of a Web browser run on said workstation ; receive a selection from said workstation , said selection identifying a given object , where said given object is a home interface or a remote interface of said Enterprise JavaBean ; receive a request from said workstation , where said request is a consequence of user interaction with said test client user interface and includes an indication of a test to perform on said given object ; perform said test on said given object to give a result , responsive to said request ; and send a response to said workstation over said HTTP link , said response including an indication of said result to be displayed by said user interface . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (executable instruction) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20020184165A1 CLAIM 16 . A computer readable medium containing computer-executable instruction (executable instruction) s which , when performed by a processor in an application server , cause the processor to : provide a test client user interface to a workstation over an HTTP link , where said test client user interface is viewed through the use of a Web browser run on said workstation ; receive a selection from said workstation , said selection identifying a given object , where said given object is a home interface or a remote interface of said Enterprise JavaBean ; receive a request from said workstation , where said request is a consequence of user interaction with said test client user interface and includes an indication of a test to perform on said given object ; perform said test on said given object to give a result , responsive to said request ; and send a response to said workstation over said HTTP link , said response including an indication of said result to be displayed by said user interface . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question (client side) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (said indication, further user) . |
US20020184165A1 CLAIM 1 . A method of facilitating testing of an object-oriented application component , said method comprising : providing a client side (next polling question) application portion for presenting a view to a user of a Web browser , said view allowing user interactions with said view , where some of said interactions specify given tests to perform on said component ; and executing a server side application portion for receiving indications of said user interactions with said client side application portion and , responsive to said indication (next polling questions) s , performing said given tests on said component . US20020184165A1 CLAIM 17 . A Web module containing a test client for Enterprise JavaBeans , said test client operable to : present a user interface over a data link , where said user interface may be displayed through the use of a browser application on a remote workstation , said user interface allowing a user at said remote workstation to : select a given object ; select a given method of said given object ; supply said given method with a parameter ; request that said given method be invoked with said parameter ; responsive to receiving said request , invoke said method with said parameter to give a result ; and present a further user (next polling questions) interface to present said result to said user . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020184165A1 CLAIM 16 . A computer readable medium (match server) containing computer-executable instructions which , when performed by a processor in an application server , cause the processor to : provide a test client user interface to a workstation over an HTTP link , where said test client user interface is viewed through the use of a Web browser run on said workstation ; receive a selection from said workstation , said selection identifying a given object , where said given object is a home interface or a remote interface of said Enterprise JavaBean ; receive a request from said workstation , where said request is a consequence of user interaction with said test client user interface and includes an indication of a test to perform on said given object ; perform said test on said given object to give a result , responsive to said request ; and send a response to said workstation over said HTTP link , said response including an indication of said result to be displayed by said user interface . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020184165A1 CLAIM 16 . A computer readable medium (match server) containing computer-executable instructions which , when performed by a processor in an application server , cause the processor to : provide a test client user interface to a workstation over an HTTP link , where said test client user interface is viewed through the use of a Web browser run on said workstation ; receive a selection from said workstation , said selection identifying a given object , where said given object is a home interface or a remote interface of said Enterprise JavaBean ; receive a request from said workstation , where said request is a consequence of user interaction with said test client user interface and includes an indication of a test to perform on said given object ; perform said test on said given object to give a result , responsive to said request ; and send a response to said workstation over said HTTP link , said response including an indication of said result to be displayed by said user interface . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020184165A1 CLAIM 16 . A computer readable medium (match server) containing computer-executable instructions which , when performed by a processor in an application server , cause the processor to : provide a test client user interface to a workstation over an HTTP link , where said test client user interface is viewed through the use of a Web browser run on said workstation ; receive a selection from said workstation , said selection identifying a given object , where said given object is a home interface or a remote interface of said Enterprise JavaBean ; receive a request from said workstation , where said request is a consequence of user interaction with said test client user interface and includes an indication of a test to perform on said given object ; perform said test on said given object to give a result , responsive to said request ; and send a response to said workstation over said HTTP link , said response including an indication of said result to be displayed by said user interface . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020184165A1 CLAIM 16 . A computer readable medium (match server) containing computer-executable instructions which , when performed by a processor in an application server , cause the processor to : provide a test client user interface to a workstation over an HTTP link , where said test client user interface is viewed through the use of a Web browser run on said workstation ; receive a selection from said workstation , said selection identifying a given object , where said given object is a home interface or a remote interface of said Enterprise JavaBean ; receive a request from said workstation , where said request is a consequence of user interaction with said test client user interface and includes an indication of a test to perform on said given object ; perform said test on said given object to give a result , responsive to said request ; and send a response to said workstation over said HTTP link , said response including an indication of said result to be displayed by said user interface . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question (client side) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (said indication, further user) . |
US20020184165A1 CLAIM 1 . A method of facilitating testing of an object-oriented application component , said method comprising : providing a client side (next polling question) application portion for presenting a view to a user of a Web browser , said view allowing user interactions with said view , where some of said interactions specify given tests to perform on said component ; and executing a server side application portion for receiving indications of said user interactions with said client side application portion and , responsive to said indication (next polling questions) s , performing said given tests on said component . US20020184165A1 CLAIM 17 . A Web module containing a test client for Enterprise JavaBeans , said test client operable to : present a user interface over a data link , where said user interface may be displayed through the use of a browser application on a remote workstation , said user interface allowing a user at said remote workstation to : select a given object ; select a given method of said given object ; supply said given method with a parameter ; request that said given method be invoked with said parameter ; responsive to receiving said request , invoke said method with said parameter to give a result ; and present a further user (next polling questions) interface to present said result to said user . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020184165A1 CLAIM 16 . A computer readable medium (match server) containing computer-executable instructions which , when performed by a processor in an application server , cause the processor to : provide a test client user interface to a workstation over an HTTP link , where said test client user interface is viewed through the use of a Web browser run on said workstation ; receive a selection from said workstation , said selection identifying a given object , where said given object is a home interface or a remote interface of said Enterprise JavaBean ; receive a request from said workstation , where said request is a consequence of user interaction with said test client user interface and includes an indication of a test to perform on said given object ; perform said test on said given object to give a result , responsive to said request ; and send a response to said workstation over said HTTP link , said response including an indication of said result to be displayed by said user interface . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020184165A1 CLAIM 16 . A computer readable medium (match server) containing computer-executable instructions which , when performed by a processor in an application server , cause the processor to : provide a test client user interface to a workstation over an HTTP link , where said test client user interface is viewed through the use of a Web browser run on said workstation ; receive a selection from said workstation , said selection identifying a given object , where said given object is a home interface or a remote interface of said Enterprise JavaBean ; receive a request from said workstation , where said request is a consequence of user interaction with said test client user interface and includes an indication of a test to perform on said given object ; perform said test on said given object to give a result , responsive to said request ; and send a response to said workstation over said HTTP link , said response including an indication of said result to be displayed by said user interface . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020184165A1 CLAIM 16 . A computer readable medium (match server) containing computer-executable instructions which , when performed by a processor in an application server , cause the processor to : provide a test client user interface to a workstation over an HTTP link , where said test client user interface is viewed through the use of a Web browser run on said workstation ; receive a selection from said workstation , said selection identifying a given object , where said given object is a home interface or a remote interface of said Enterprise JavaBean ; receive a request from said workstation , where said request is a consequence of user interaction with said test client user interface and includes an indication of a test to perform on said given object ; perform said test on said given object to give a result , responsive to said request ; and send a response to said workstation over said HTTP link , said response including an indication of said result to be displayed by said user interface . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020184165A1 CLAIM 16 . A computer readable medium (match server) containing computer-executable instructions which , when performed by a processor in an application server , cause the processor to : provide a test client user interface to a workstation over an HTTP link , where said test client user interface is viewed through the use of a Web browser run on said workstation ; receive a selection from said workstation , said selection identifying a given object , where said given object is a home interface or a remote interface of said Enterprise JavaBean ; receive a request from said workstation , where said request is a consequence of user interaction with said test client user interface and includes an indication of a test to perform on said given object ; perform said test on said given object to give a result , responsive to said request ; and send a response to said workstation over said HTTP link , said response including an indication of said result to be displayed by said user interface . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6772146B2 Filed: 2001-05-09 Issued: 2004-08-03 Website for financial information (Original Assignee) JPMorgan Chase Bank NA (Current Assignee) JPMorgan Chase Bank NA ; JPMorgan Chase Bank NA Sanjeev Khemlani, Adam Singer |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (said database) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6772146B2 CLAIM 1 . An information system comprising : a communication network ; a database server operatively connected to said communication network , said database (user information) server retrievably storing a plurality of custom records , each of said custom records having a plurality of searching parameters ; a plurality of user stations operatively connected to said communication network , each of said user stations providing an authorized user with access to said database server ; at least one coordinator station operatively connected to said communication network , said at least one coordinator station providing an authorized coordinator with access to said database server ; at least one searchable information source operatively connected to said communication network , said at least one information source containing data that is searchable using at least one of said searching parameters ; wherein only a portion of said custom records may be accessed by an authorized user , said portion of custom records including custom records created and retrievably stored by said authorized user and custom records created and retrievably stored by an authorized coordinator , whereby said portion of said custom records may be created and accessed by an authorized user and an authorized coordinator on a shared basis . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question (said parameters) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6772146B2 CLAIM 13 . A system according to claim 12 , wherein said database further includes records containing parameters uniquely associated with an individual user , said parameters (next polling question) being used to customize the contents of a page for said individual user . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (said database) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6772146B2 CLAIM 1 . An information system comprising : a communication network ; a database server operatively connected to said communication network , said database (user information) server retrievably storing a plurality of custom records , each of said custom records having a plurality of searching parameters ; a plurality of user stations operatively connected to said communication network , each of said user stations providing an authorized user with access to said database server ; at least one coordinator station operatively connected to said communication network , said at least one coordinator station providing an authorized coordinator with access to said database server ; at least one searchable information source operatively connected to said communication network , said at least one information source containing data that is searchable using at least one of said searching parameters ; wherein only a portion of said custom records may be accessed by an authorized user , said portion of custom records including custom records created and retrievably stored by said authorized user and custom records created and retrievably stored by an authorized coordinator , whereby said portion of said custom records may be created and accessed by an authorized user and an authorized coordinator on a shared basis . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question (said parameters) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6772146B2 CLAIM 13 . A system according to claim 12 , wherein said database further includes records containing parameters uniquely associated with an individual user , said parameters (next polling question) being used to customize the contents of a page for said individual user . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (said database) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6772146B2 CLAIM 1 . An information system comprising : a communication network ; a database server operatively connected to said communication network , said database (user information) server retrievably storing a plurality of custom records , each of said custom records having a plurality of searching parameters ; a plurality of user stations operatively connected to said communication network , each of said user stations providing an authorized user with access to said database server ; at least one coordinator station operatively connected to said communication network , said at least one coordinator station providing an authorized coordinator with access to said database server ; at least one searchable information source operatively connected to said communication network , said at least one information source containing data that is searchable using at least one of said searching parameters ; wherein only a portion of said custom records may be accessed by an authorized user , said portion of custom records including custom records created and retrievably stored by said authorized user and custom records created and retrievably stored by an authorized coordinator , whereby said portion of said custom records may be created and accessed by an authorized user and an authorized coordinator on a shared basis . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question (said parameters) , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6772146B2 CLAIM 13 . A system according to claim 12 , wherein said database further includes records containing parameters uniquely associated with an individual user , said parameters (next polling question) being used to customize the contents of a page for said individual user . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20020059201A1 Filed: 2001-05-08 Issued: 2002-05-16 Method and apparatus for internet-based human network brokering (Original Assignee) Work James Duncan James Work |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (other port) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (using one) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (profile information, user profiles, higher levels) of other users that have a likelihood of match within a predetermined threshold . |
US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 29 . The computer-implemented method of claim 28 wherein said knowledge resources are linked to other port (data processing system) ions of said profiles . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 62 . The computer-readable instructions of claim 61 wherein said search queries are formulated using client applications and said brokering is performed using one (user information) or more server applications . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (profile information, user profiles, higher levels) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 3 . The poll-based networking system as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage (profile information, user profiles, higher levels) . |
US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 4 . The poll-based networking system as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage (profile information, user profiles, higher levels) , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (profile information, user profiles, higher levels) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (profile information, user profiles, higher levels) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (profile information, user profiles, higher levels) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means (control instructions) to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (using one) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (profile information, user profiles, higher levels) of other users that have a likelihood of match within a predetermined threshold . |
US20020059201A1 CLAIM 1 . A computer-implemented method , comprising : autonomously , through one or more software agents , brokering matches between searchers and targets , said software agents being capable of finding one or more of said matches through chains of mutually trusted connections of said searchers and said targets ; and reporting said matches according to access control instructions (instruction means) provided to said software agents by said searchers and targets concerning levels of details of personal information of said searchers and targets and contacts thereof which may be revealed to others . US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 62 . The computer-readable instructions of claim 61 wherein said search queries are formulated using client applications and said brokering is performed using one (user information) or more server applications . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (profile information, user profiles, higher levels) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 12 . The computer implemented method as set forth in claim 11 , wherein , in cumulatively comparing , further comprising an act of causing the one or more processors to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage (profile information, user profiles, higher levels) . |
US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage (profile information, user profiles, higher levels) , further comprising an act of causing the one or more processors to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (profile information, user profiles, higher levels) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (profile information, user profiles, higher levels) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (profile information, user profiles, higher levels) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means (control instructions) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (using one) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (profile information, user profiles, higher levels) of other users that have a likelihood of match within a predetermined threshold . |
US20020059201A1 CLAIM 1 . A computer-implemented method , comprising : autonomously , through one or more software agents , brokering matches between searchers and targets , said software agents being capable of finding one or more of said matches through chains of mutually trusted connections of said searchers and said targets ; and reporting said matches according to access control instructions (instruction means) provided to said software agents by said searchers and targets concerning levels of details of personal information of said searchers and targets and contacts thereof which may be revealed to others . US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 62 . The computer-readable instructions of claim 61 wherein said search queries are formulated using client applications and said brokering is performed using one (user information) or more server applications . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means (control instructions) for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question (verification information) against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (profile information, user profiles, higher levels) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20020059201A1 CLAIM 1 . A computer-implemented method , comprising : autonomously , through one or more software agents , brokering matches between searchers and targets , said software agents being capable of finding one or more of said matches through chains of mutually trusted connections of said searchers and said targets ; and reporting said matches according to access control instructions (instruction means) provided to said software agents by said searchers and targets concerning levels of details of personal information of said searchers and targets and contacts thereof which may be revealed to others . US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 55 . The computer-implemented method of claim 54 wherein said network broker is further configured to report verification information (net polling question) for said matches , said verification information being derived using verification agents located at some or all of said servers . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means (control instructions) for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage (profile information, user profiles, higher levels) . |
US20020059201A1 CLAIM 1 . A computer-implemented method , comprising : autonomously , through one or more software agents , brokering matches between searchers and targets , said software agents being capable of finding one or more of said matches through chains of mutually trusted connections of said searchers and said targets ; and reporting said matches according to access control instructions (instruction means) provided to said software agents by said searchers and targets concerning levels of details of personal information of said searchers and targets and contacts thereof which may be revealed to others . US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means (control instructions) for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage (profile information, user profiles, higher levels) between the user and the selected other user . |
US20020059201A1 CLAIM 1 . A computer-implemented method , comprising : autonomously , through one or more software agents , brokering matches between searchers and targets , said software agents being capable of finding one or more of said matches through chains of mutually trusted connections of said searchers and said targets ; and reporting said matches according to access control instructions (instruction means) provided to said software agents by said searchers and targets concerning levels of details of personal information of said searchers and targets and contacts thereof which may be revealed to others . US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means (control instructions) for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage (profile information, user profiles, higher levels) between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20020059201A1 CLAIM 1 . A computer-implemented method , comprising : autonomously , through one or more software agents , brokering matches between searchers and targets , said software agents being capable of finding one or more of said matches through chains of mutually trusted connections of said searchers and said targets ; and reporting said matches according to access control instructions (instruction means) provided to said software agents by said searchers and targets concerning levels of details of personal information of said searchers and targets and contacts thereof which may be revealed to others . US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means (control instructions) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (profile information, user profiles, higher levels) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020059201A1 CLAIM 1 . A computer-implemented method , comprising : autonomously , through one or more software agents , brokering matches between searchers and targets , said software agents being capable of finding one or more of said matches through chains of mutually trusted connections of said searchers and said targets ; and reporting said matches according to access control instructions (instruction means) provided to said software agents by said searchers and targets concerning levels of details of personal information of said searchers and targets and contacts thereof which may be revealed to others . US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means (control instructions) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (profile information, user profiles, higher levels) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020059201A1 CLAIM 1 . A computer-implemented method , comprising : autonomously , through one or more software agents , brokering matches between searchers and targets , said software agents being capable of finding one or more of said matches through chains of mutually trusted connections of said searchers and said targets ; and reporting said matches according to access control instructions (instruction means) provided to said software agents by said searchers and targets concerning levels of details of personal information of said searchers and targets and contacts thereof which may be revealed to others . US20020059201A1 CLAIM 12 . The computer-implemented method of claim 1 wherein said access controls are included within user profiles (user profiles, match percentage, minimum match percentage, match servers, minimum match) of said targets . US20020059201A1 CLAIM 36 . The computer-implemented method of claim 1 wherein said access control instructions comprise a set of default access groups that correspond to progressively higher levels (user profiles, match percentage, minimum match percentage, match servers, minimum match) of security settings associated with various profile and contact information elements which make up said personal information . US20020059201A1 CLAIM 74 . The computer-readable instructions of claim 73 wherein said connectors are automatically updated according to receipt of updated profile information (user profiles, match percentage, minimum match percentage, match servers, minimum match) regarding said connectors . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20020194262A1 Filed: 2001-04-27 Issued: 2002-12-19 System and method for controlling the interruption and resumption of access to WWW pages requiring certain prerequisites (Original Assignee) HP Inc (Current Assignee) Hewlett Packard Development Co LP D. Jorgenson |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020194262A1 CLAIM 1 . A method implemented at a Web server for controlling the interruption and resumption of access to a World Wide Web (web server) page to be supplied by the Web server and requiring at least one prerequisite , comprising : receiving and evaluating a current HTTP request from a Web client to determine whether a previously unsatisfied prerequisite has been satisfied ; retrieving from a stored location information relating to a target HTTP request previously interrupted by the prerequisite , if the receiving and evaluating step determines that a previously unsatisfied prerequisite has been satisfied ; forming an HTTP response , which response includes contents for re-requesting from the Web client the target HTTP request ; and transmitting the response to the Web client that transmitted the current HTTP request . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020194262A1 CLAIM 1 . A method implemented at a Web server for controlling the interruption and resumption of access to a World Wide Web (web server) page to be supplied by the Web server and requiring at least one prerequisite , comprising : receiving and evaluating a current HTTP request from a Web client to determine whether a previously unsatisfied prerequisite has been satisfied ; retrieving from a stored location information relating to a target HTTP request previously interrupted by the prerequisite , if the receiving and evaluating step determines that a previously unsatisfied prerequisite has been satisfied ; forming an HTTP response , which response includes contents for re-requesting from the Web client the target HTTP request ; and transmitting the response to the Web client that transmitted the current HTTP request . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020194262A1 CLAIM 1 . A method implemented at a Web server for controlling the interruption and resumption of access to a World Wide Web (web server) page to be supplied by the Web server and requiring at least one prerequisite , comprising : receiving and evaluating a current HTTP request from a Web client to determine whether a previously unsatisfied prerequisite has been satisfied ; retrieving from a stored location information relating to a target HTTP request previously interrupted by the prerequisite , if the receiving and evaluating step determines that a previously unsatisfied prerequisite has been satisfied ; forming an HTTP response , which response includes contents for re-requesting from the Web client the target HTTP request ; and transmitting the response to the Web client that transmitted the current HTTP request . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020194262A1 CLAIM 1 . A method implemented at a Web server for controlling the interruption and resumption of access to a World Wide Web (web server) page to be supplied by the Web server and requiring at least one prerequisite , comprising : receiving and evaluating a current HTTP request from a Web client to determine whether a previously unsatisfied prerequisite has been satisfied ; retrieving from a stored location information relating to a target HTTP request previously interrupted by the prerequisite , if the receiving and evaluating step determines that a previously unsatisfied prerequisite has been satisfied ; forming an HTTP response , which response includes contents for re-requesting from the Web client the target HTTP request ; and transmitting the response to the Web client that transmitted the current HTTP request . |
| US9087321B2 CLAIM 19 . A computer program product (location info) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations (location info) of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20020194262A1 CLAIM 1 . A method implemented at a Web server for controlling the interruption and resumption of access to a World Wide Web page to be supplied by the Web server and requiring at least one prerequisite , comprising : receiving and evaluating a current HTTP request from a Web client to determine whether a previously unsatisfied prerequisite has been satisfied ; retrieving from a stored location info (computer program product, computer to perform operations) rmation relating to a target HTTP request previously interrupted by the prerequisite , if the receiving and evaluating step determines that a previously unsatisfied prerequisite has been satisfied ; forming an HTTP response , which response includes contents for re-requesting from the Web client the target HTTP request ; and transmitting the response to the Web client that transmitted the current HTTP request . |
| US9087321B2 CLAIM 20 . The computer program product (location info) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations (location info) of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20020194262A1 CLAIM 1 . A method implemented at a Web server for controlling the interruption and resumption of access to a World Wide Web page to be supplied by the Web server and requiring at least one prerequisite , comprising : receiving and evaluating a current HTTP request from a Web client to determine whether a previously unsatisfied prerequisite has been satisfied ; retrieving from a stored location info (computer program product, computer to perform operations) rmation relating to a target HTTP request previously interrupted by the prerequisite , if the receiving and evaluating step determines that a previously unsatisfied prerequisite has been satisfied ; forming an HTTP response , which response includes contents for re-requesting from the Web client the target HTTP request ; and transmitting the response to the Web client that transmitted the current HTTP request . |
| US9087321B2 CLAIM 21 . The computer program product (location info) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations (location info) of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20020194262A1 CLAIM 1 . A method implemented at a Web server for controlling the interruption and resumption of access to a World Wide Web page to be supplied by the Web server and requiring at least one prerequisite , comprising : receiving and evaluating a current HTTP request from a Web client to determine whether a previously unsatisfied prerequisite has been satisfied ; retrieving from a stored location info (computer program product, computer to perform operations) rmation relating to a target HTTP request previously interrupted by the prerequisite , if the receiving and evaluating step determines that a previously unsatisfied prerequisite has been satisfied ; forming an HTTP response , which response includes contents for re-requesting from the Web client the target HTTP request ; and transmitting the response to the Web client that transmitted the current HTTP request . |
| US9087321B2 CLAIM 22 . The computer program product (location info) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations (location info) of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20020194262A1 CLAIM 1 . A method implemented at a Web server for controlling the interruption and resumption of access to a World Wide Web page to be supplied by the Web server and requiring at least one prerequisite , comprising : receiving and evaluating a current HTTP request from a Web client to determine whether a previously unsatisfied prerequisite has been satisfied ; retrieving from a stored location info (computer program product, computer to perform operations) rmation relating to a target HTTP request previously interrupted by the prerequisite , if the receiving and evaluating step determines that a previously unsatisfied prerequisite has been satisfied ; forming an HTTP response , which response includes contents for re-requesting from the Web client the target HTTP request ; and transmitting the response to the Web client that transmitted the current HTTP request . |
| US9087321B2 CLAIM 23 . The computer program product (location info) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations (location info) of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20020194262A1 CLAIM 1 . A method implemented at a Web server for controlling the interruption and resumption of access to a World Wide Web page to be supplied by the Web server and requiring at least one prerequisite , comprising : receiving and evaluating a current HTTP request from a Web client to determine whether a previously unsatisfied prerequisite has been satisfied ; retrieving from a stored location info (computer program product, computer to perform operations) rmation relating to a target HTTP request previously interrupted by the prerequisite , if the receiving and evaluating step determines that a previously unsatisfied prerequisite has been satisfied ; forming an HTTP response , which response includes contents for re-requesting from the Web client the target HTTP request ; and transmitting the response to the Web client that transmitted the current HTTP request . |
| US9087321B2 CLAIM 24 . The computer program product (location info) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations (location info) of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020194262A1 CLAIM 1 . A method implemented at a Web server for controlling the interruption and resumption of access to a World Wide Web (web server) page to be supplied by the Web server and requiring at least one prerequisite , comprising : receiving and evaluating a current HTTP request from a Web client to determine whether a previously unsatisfied prerequisite has been satisfied ; retrieving from a stored location info (computer program product, computer to perform operations) rmation relating to a target HTTP request previously interrupted by the prerequisite , if the receiving and evaluating step determines that a previously unsatisfied prerequisite has been satisfied ; forming an HTTP response , which response includes contents for re-requesting from the Web client the target HTTP request ; and transmitting the response to the Web client that transmitted the current HTTP request . |
| US9087321B2 CLAIM 25 . The computer program product (location info) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020194262A1 CLAIM 1 . A method implemented at a Web server for controlling the interruption and resumption of access to a World Wide Web page to be supplied by the Web server and requiring at least one prerequisite , comprising : receiving and evaluating a current HTTP request from a Web client to determine whether a previously unsatisfied prerequisite has been satisfied ; retrieving from a stored location info (computer program product, computer to perform operations) rmation relating to a target HTTP request previously interrupted by the prerequisite , if the receiving and evaluating step determines that a previously unsatisfied prerequisite has been satisfied ; forming an HTTP response , which response includes contents for re-requesting from the Web client the target HTTP request ; and transmitting the response to the Web client that transmitted the current HTTP request . |
| US9087321B2 CLAIM 26 . The computer program product (location info) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations (location info) of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020194262A1 CLAIM 1 . A method implemented at a Web server for controlling the interruption and resumption of access to a World Wide Web (web server) page to be supplied by the Web server and requiring at least one prerequisite , comprising : receiving and evaluating a current HTTP request from a Web client to determine whether a previously unsatisfied prerequisite has been satisfied ; retrieving from a stored location info (computer program product, computer to perform operations) rmation relating to a target HTTP request previously interrupted by the prerequisite , if the receiving and evaluating step determines that a previously unsatisfied prerequisite has been satisfied ; forming an HTTP response , which response includes contents for re-requesting from the Web client the target HTTP request ; and transmitting the response to the Web client that transmitted the current HTTP request . |
| US9087321B2 CLAIM 27 . The computer program product (location info) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020194262A1 CLAIM 1 . A method implemented at a Web server for controlling the interruption and resumption of access to a World Wide Web page to be supplied by the Web server and requiring at least one prerequisite , comprising : receiving and evaluating a current HTTP request from a Web client to determine whether a previously unsatisfied prerequisite has been satisfied ; retrieving from a stored location info (computer program product, computer to perform operations) rmation relating to a target HTTP request previously interrupted by the prerequisite , if the receiving and evaluating step determines that a previously unsatisfied prerequisite has been satisfied ; forming an HTTP response , which response includes contents for re-requesting from the Web client the target HTTP request ; and transmitting the response to the Web client that transmitted the current HTTP request . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6643661B2 Filed: 2001-04-27 Issued: 2003-11-04 Method and apparatus for implementing search and channel features in an enterprise-wide computer system (Original Assignee) Brio Software Inc (Current Assignee) Oracle International Corp Kathleen Riddell Polizzi, Gail Helen Godbeer, Gadi Yedwab, Shuhong Chen, Robert Mark Bick, Jack Norris |
|---|---|
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (generated index) . |
US6643661B2 CLAIM 26 . A method of conducting a search in a computer system comprising a service broker , a repository , and a knowledge server , wherein the knowledge server comprises a computer memory including at least one information source , a crawl server configured to manage at least one crawler , and a search server , the method comprising : associating said at least one crawler with a set of structured and unstructured data ; assigning a set of crawler properties to said at least one crawler , wherein the set of crawler properties defines how said at least one crawler will process data objects ; executing the crawler with said set of crawler properties and said set of structured and unstructured data so as to generate index data corresponding to said set of structured and unstructured data ; storing the generated index (next polling questions) data in a corresponding information source in the computer memory of the knowledge server ; receiving a search request comprising at least one query term , a corresponding set of search properties , and a list identifying at least one information source to be searched ; and processing the search request with each of the listed information sources so as to generate a search result comprising a list of objects identified during the search . |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6643661B2 CLAIM 1 . A computer system configured to search for structured and unstructured data objects , the computer system connected to a network interface that may be connected to at least one user through a computer network ; the computer system comprising : a service broker electrically connected to the network interface , the service broker adapted to control a level of access to the computer system by a user ; a repository electrically connected to the service broker , the repository comprising a computer memory encoded with a plurality of objects including structured data objects and unstructured data objects ; a knowledge server electrically connected to the service broker and to the repository , the knowledge server comprising : i) a computer memory encoded with at least one information source comprising a searchable index describing at least one set of structured and unstructured data objects ; ii) a crawl server configured to manage at least one crawler , wherein said at least one crawler is configured to process a set of structured and unstructured data objects and generate a searchable index describing the set of objects , and wherein said at least one crawler is configured to store (receiving match commands to identify users) the searchable index in a corresponding information source ; and iii) a search server configured to process a search request so as to generate a search result , wherein the search request comprises at least one query term , a corresponding set of search properties , and a list identifying at least one information source to be searched , and wherein the search result comprises a list of objects identified during the search . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (search server) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6643661B2 CLAIM 1 . A computer system configured to search for structured and unstructured data objects , the computer system connected to a network interface that may be connected to at least one user through a computer network ; the computer system comprising : a service broker electrically connected to the network interface , the service broker adapted to control a level of access to the computer system by a user ; a repository electrically connected to the service broker , the repository comprising a computer memory encoded with a plurality of objects including structured data objects and unstructured data objects ; a knowledge server electrically connected to the service broker and to the repository , the knowledge server comprising : i) a computer memory encoded with at least one information source comprising a searchable index describing at least one set of structured and unstructured data objects ; ii) a crawl server configured to manage at least one crawler , wherein said at least one crawler is configured to process a set of structured and unstructured data objects and generate a searchable index describing the set of objects , and wherein said at least one crawler is configured to store the searchable index in a corresponding information source ; and iii) a search server (match servers) configured to process a search request so as to generate a search result , wherein the search request comprises at least one query term , a corresponding set of search properties , and a list identifying at least one information source to be searched , and wherein the search result comprises a list of objects identified during the search . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (search server) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6643661B2 CLAIM 1 . A computer system configured to search for structured and unstructured data objects , the computer system connected to a network interface that may be connected to at least one user through a computer network ; the computer system comprising : a service broker electrically connected to the network interface , the service broker adapted to control a level of access to the computer system by a user ; a repository electrically connected to the service broker , the repository comprising a computer memory encoded with a plurality of objects including structured data objects and unstructured data objects ; a knowledge server electrically connected to the service broker and to the repository , the knowledge server comprising : i) a computer memory encoded with at least one information source comprising a searchable index describing at least one set of structured and unstructured data objects ; ii) a crawl server configured to manage at least one crawler , wherein said at least one crawler is configured to process a set of structured and unstructured data objects and generate a searchable index describing the set of objects , and wherein said at least one crawler is configured to store the searchable index in a corresponding information source ; and iii) a search server (match servers) configured to process a search request so as to generate a search result , wherein the search request comprises at least one query term , a corresponding set of search properties , and a list identifying at least one information source to be searched , and wherein the search result comprises a list of objects identified during the search . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (generated index) . |
US6643661B2 CLAIM 26 . A method of conducting a search in a computer system comprising a service broker , a repository , and a knowledge server , wherein the knowledge server comprises a computer memory including at least one information source , a crawl server configured to manage at least one crawler , and a search server , the method comprising : associating said at least one crawler with a set of structured and unstructured data ; assigning a set of crawler properties to said at least one crawler , wherein the set of crawler properties defines how said at least one crawler will process data objects ; executing the crawler with said set of crawler properties and said set of structured and unstructured data so as to generate index data corresponding to said set of structured and unstructured data ; storing the generated index (next polling questions) data in a corresponding information source in the computer memory of the knowledge server ; receiving a search request comprising at least one query term , a corresponding set of search properties , and a list identifying at least one information source to be searched ; and processing the search request with each of the listed information sources so as to generate a search result comprising a list of objects identified during the search . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6643661B2 CLAIM 1 . A computer system configured to search for structured and unstructured data objects , the computer system connected to a network interface that may be connected to at least one user through a computer network ; the computer system comprising : a service broker electrically connected to the network interface , the service broker adapted to control a level of access to the computer system by a user ; a repository electrically connected to the service broker , the repository comprising a computer memory encoded with a plurality of objects including structured data objects and unstructured data objects ; a knowledge server electrically connected to the service broker and to the repository , the knowledge server comprising : i) a computer memory encoded with at least one information source comprising a searchable index describing at least one set of structured and unstructured data objects ; ii) a crawl server configured to manage at least one crawler , wherein said at least one crawler is configured to process a set of structured and unstructured data objects and generate a searchable index describing the set of objects , and wherein said at least one crawler is configured to store (receiving match commands to identify users) the searchable index in a corresponding information source ; and iii) a search server configured to process a search request so as to generate a search result , wherein the search request comprises at least one query term , a corresponding set of search properties , and a list identifying at least one information source to be searched , and wherein the search result comprises a list of objects identified during the search . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (search server) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6643661B2 CLAIM 1 . A computer system configured to search for structured and unstructured data objects , the computer system connected to a network interface that may be connected to at least one user through a computer network ; the computer system comprising : a service broker electrically connected to the network interface , the service broker adapted to control a level of access to the computer system by a user ; a repository electrically connected to the service broker , the repository comprising a computer memory encoded with a plurality of objects including structured data objects and unstructured data objects ; a knowledge server electrically connected to the service broker and to the repository , the knowledge server comprising : i) a computer memory encoded with at least one information source comprising a searchable index describing at least one set of structured and unstructured data objects ; ii) a crawl server configured to manage at least one crawler , wherein said at least one crawler is configured to process a set of structured and unstructured data objects and generate a searchable index describing the set of objects , and wherein said at least one crawler is configured to store the searchable index in a corresponding information source ; and iii) a search server (match servers) configured to process a search request so as to generate a search result , wherein the search request comprises at least one query term , a corresponding set of search properties , and a list identifying at least one information source to be searched , and wherein the search result comprises a list of objects identified during the search . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (search server) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6643661B2 CLAIM 1 . A computer system configured to search for structured and unstructured data objects , the computer system connected to a network interface that may be connected to at least one user through a computer network ; the computer system comprising : a service broker electrically connected to the network interface , the service broker adapted to control a level of access to the computer system by a user ; a repository electrically connected to the service broker , the repository comprising a computer memory encoded with a plurality of objects including structured data objects and unstructured data objects ; a knowledge server electrically connected to the service broker and to the repository , the knowledge server comprising : i) a computer memory encoded with at least one information source comprising a searchable index describing at least one set of structured and unstructured data objects ; ii) a crawl server configured to manage at least one crawler , wherein said at least one crawler is configured to process a set of structured and unstructured data objects and generate a searchable index describing the set of objects , and wherein said at least one crawler is configured to store the searchable index in a corresponding information source ; and iii) a search server (match servers) configured to process a search request so as to generate a search result , wherein the search request comprises at least one query term , a corresponding set of search properties , and a list identifying at least one information source to be searched , and wherein the search result comprises a list of objects identified during the search . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (generated index) . |
US6643661B2 CLAIM 26 . A method of conducting a search in a computer system comprising a service broker , a repository , and a knowledge server , wherein the knowledge server comprises a computer memory including at least one information source , a crawl server configured to manage at least one crawler , and a search server , the method comprising : associating said at least one crawler with a set of structured and unstructured data ; assigning a set of crawler properties to said at least one crawler , wherein the set of crawler properties defines how said at least one crawler will process data objects ; executing the crawler with said set of crawler properties and said set of structured and unstructured data so as to generate index data corresponding to said set of structured and unstructured data ; storing the generated index (next polling questions) data in a corresponding information source in the computer memory of the knowledge server ; receiving a search request comprising at least one query term , a corresponding set of search properties , and a list identifying at least one information source to be searched ; and processing the search request with each of the listed information sources so as to generate a search result comprising a list of objects identified during the search . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6643661B2 CLAIM 1 . A computer system configured to search for structured and unstructured data objects , the computer system connected to a network interface that may be connected to at least one user through a computer network ; the computer system comprising : a service broker electrically connected to the network interface , the service broker adapted to control a level of access to the computer system by a user ; a repository electrically connected to the service broker , the repository comprising a computer memory encoded with a plurality of objects including structured data objects and unstructured data objects ; a knowledge server electrically connected to the service broker and to the repository , the knowledge server comprising : i) a computer memory encoded with at least one information source comprising a searchable index describing at least one set of structured and unstructured data objects ; ii) a crawl server configured to manage at least one crawler , wherein said at least one crawler is configured to process a set of structured and unstructured data objects and generate a searchable index describing the set of objects , and wherein said at least one crawler is configured to store (receiving match commands to identify users) the searchable index in a corresponding information source ; and iii) a search server configured to process a search request so as to generate a search result , wherein the search request comprises at least one query term , a corresponding set of search properties , and a list identifying at least one information source to be searched , and wherein the search result comprises a list of objects identified during the search . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (search server) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6643661B2 CLAIM 1 . A computer system configured to search for structured and unstructured data objects , the computer system connected to a network interface that may be connected to at least one user through a computer network ; the computer system comprising : a service broker electrically connected to the network interface , the service broker adapted to control a level of access to the computer system by a user ; a repository electrically connected to the service broker , the repository comprising a computer memory encoded with a plurality of objects including structured data objects and unstructured data objects ; a knowledge server electrically connected to the service broker and to the repository , the knowledge server comprising : i) a computer memory encoded with at least one information source comprising a searchable index describing at least one set of structured and unstructured data objects ; ii) a crawl server configured to manage at least one crawler , wherein said at least one crawler is configured to process a set of structured and unstructured data objects and generate a searchable index describing the set of objects , and wherein said at least one crawler is configured to store the searchable index in a corresponding information source ; and iii) a search server (match servers) configured to process a search request so as to generate a search result , wherein the search request comprises at least one query term , a corresponding set of search properties , and a list identifying at least one information source to be searched , and wherein the search result comprises a list of objects identified during the search . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (search server) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6643661B2 CLAIM 1 . A computer system configured to search for structured and unstructured data objects , the computer system connected to a network interface that may be connected to at least one user through a computer network ; the computer system comprising : a service broker electrically connected to the network interface , the service broker adapted to control a level of access to the computer system by a user ; a repository electrically connected to the service broker , the repository comprising a computer memory encoded with a plurality of objects including structured data objects and unstructured data objects ; a knowledge server electrically connected to the service broker and to the repository , the knowledge server comprising : i) a computer memory encoded with at least one information source comprising a searchable index describing at least one set of structured and unstructured data objects ; ii) a crawl server configured to manage at least one crawler , wherein said at least one crawler is configured to process a set of structured and unstructured data objects and generate a searchable index describing the set of objects , and wherein said at least one crawler is configured to store the searchable index in a corresponding information source ; and iii) a search server (match servers) configured to process a search request so as to generate a search result , wherein the search request comprises at least one query term , a corresponding set of search properties , and a list identifying at least one information source to be searched , and wherein the search result comprises a list of objects identified during the search . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2002297883A Filed: 2001-03-29 Issued: 2002-10-11 知識情報管理方法、知識情報生成方法、知識情報利用方法および知識情報管理装置 (Original Assignee) Fujitsu Ltd; 富士通株式会社 守克 ▲廣▼瀬, Morikatsu Hirose, Hisao Kadoki, Masatake Kikuchi, Hisayuki Sano, Kenji Toeda, Iwao Yamamoto, 久幸 佐野, 岩男 山本, 健司 戸枝, 正剛 菊地, 久夫 門木 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (コンピュ) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2002297883A CLAIM 1 【請求項１】 ネットワークを介して共有される知識情 報を管理するコンピュ (next polling, data processing system, next polling questions) ータの知識情報管理方法におい て、 課題の解決を目的とする業務を遂行するために、前記ネ ットワークを介して当該業務の関係者によって取り交わ される一連の発言データ (user information) を管理し、前記一連の発言デー タの内容を含む会話ストリームを蓄積するとともに、前 記課題の発生から結論に至るまでの課程で前記業務の遂 行上必要となるオブジェクトを、必要とされたときの状 態で逐次蓄積し、 関連付け要求に応答して、蓄積された会話ストリーム中 の任意の会話ストリームと、蓄積されたオブジェクト中 の任意のオブジェクトとを関連付け、 関連情報取得要求に応答して、関連付けられた前記任意 の会話ストリームと前記任意のオブジェクトとに関する 情報を出力する、 手順を有することを特徴とする知識情報管理方法。 JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers (ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2002297883A CLAIM 1 【請求項１】 ネットワークを介して共有される知識情 報を管理するコンピュ (next polling, data processing system, next polling questions) ータの知識情報管理方法におい て、 課題の解決を目的とする業務を遂行するために、前記ネ ットワークを介して当該業務の関係者によって取り交わ される一連の発言データを管理し、前記一連の発言デー タの内容を含む会話ストリームを蓄積するとともに、前 記課題の発生から結論に至るまでの課程で前記業務の遂 行上必要となるオブジェクトを、必要とされたときの状 態で逐次蓄積し、 関連付け要求に応答して、蓄積された会話ストリーム中 の任意の会話ストリームと、蓄積されたオブジェクト中 の任意のオブジェクトとを関連付け、 関連情報取得要求に応答して、関連付けられた前記任意 の会話ストリームと前記任意のオブジェクトとに関する 情報を出力する、 手順を有することを特徴とする知識情報管理方法。 JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 3 . The poll-based networking system as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers (ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 4 . The poll-based networking system as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2002297883A CLAIM 1 【請求項１】 ネットワークを介して共有される知識情 報を管理するコンピュータの知識情報管理方法におい て、 課題の解決を目的とする業務を遂行するために、前記ネ ットワークを介して当該業務の関係者によって取り交わ される一連の発言データ (user information) を管理し、前記一連の発言デー タの内容を含む会話ストリームを蓄積するとともに、前 記課題の発生から結論に至るまでの課程で前記業務の遂 行上必要となるオブジェクトを、必要とされたときの状 態で逐次蓄積し、 関連付け要求に応答して、蓄積された会話ストリーム中 の任意の会話ストリームと、蓄積されたオブジェクト中 の任意のオブジェクトとを関連付け、 関連情報取得要求に応答して、関連付けられた前記任意 の会話ストリームと前記任意のオブジェクトとに関する 情報を出力する、 手順を有することを特徴とする知識情報管理方法。 JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers (ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2002297883A CLAIM 1 【請求項１】 ネットワークを介して共有される知識情 報を管理するコンピュ (next polling, data processing system, next polling questions) ータの知識情報管理方法におい て、 課題の解決を目的とする業務を遂行するために、前記ネ ットワークを介して当該業務の関係者によって取り交わ される一連の発言データを管理し、前記一連の発言デー タの内容を含む会話ストリームを蓄積するとともに、前 記課題の発生から結論に至るまでの課程で前記業務の遂 行上必要となるオブジェクトを、必要とされたときの状 態で逐次蓄積し、 関連付け要求に応答して、蓄積された会話ストリーム中 の任意の会話ストリームと、蓄積されたオブジェクト中 の任意のオブジェクトとを関連付け、 関連情報取得要求に応答して、関連付けられた前記任意 の会話ストリームと前記任意のオブジェクトとに関する 情報を出力する、 手順を有することを特徴とする知識情報管理方法。 JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 12 . The computer implemented method as set forth in claim 11 , wherein , in cumulatively comparing , further comprising an act of causing the one or more processors to perform operations of : matching the user to other users based upon all of the selected answers (ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , further comprising an act of causing the one or more processors to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (データ) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2002297883A CLAIM 1 【請求項１】 ネットワークを介して共有される知識情 報を管理するコンピュータの知識情報管理方法におい て、 課題の解決を目的とする業務を遂行するために、前記ネ ットワークを介して当該業務の関係者によって取り交わ される一連の発言データ (user information) を管理し、前記一連の発言デー タの内容を含む会話ストリームを蓄積するとともに、前 記課題の発生から結論に至るまでの課程で前記業務の遂 行上必要となるオブジェクトを、必要とされたときの状 態で逐次蓄積し、 関連付け要求に応答して、蓄積された会話ストリーム中 の任意の会話ストリームと、蓄積されたオブジェクト中 の任意のオブジェクトとを関連付け、 関連情報取得要求に応答して、関連付けられた前記任意 の会話ストリームと前記任意のオブジェクトとに関する 情報を出力する、 手順を有することを特徴とする知識情報管理方法。 JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers (ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2002297883A CLAIM 1 【請求項１】 ネットワークを介して共有される知識情 報を管理するコンピュ (next polling, data processing system, next polling questions) ータの知識情報管理方法におい て、 課題の解決を目的とする業務を遂行するために、前記ネ ットワークを介して当該業務の関係者によって取り交わ される一連の発言データを管理し、前記一連の発言デー タの内容を含む会話ストリームを蓄積するとともに、前 記課題の発生から結論に至るまでの課程で前記業務の遂 行上必要となるオブジェクトを、必要とされたときの状 態で逐次蓄積し、 関連付け要求に応答して、蓄積された会話ストリーム中 の任意の会話ストリームと、蓄積されたオブジェクト中 の任意のオブジェクトとを関連付け、 関連情報取得要求に応答して、関連付けられた前記任意 の会話ストリームと前記任意のオブジェクトとに関する 情報を出力する、 手順を有することを特徴とする知識情報管理方法。 JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers (ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2002297883A CLAIM 3 【請求項３】 前記任意の会話ストリームと前記任意の オブジェクトとの関連付けは、ユーザ (selected answers) からの操作入力に 応答して行うことを特徴とする請求項１記載の知識情報 管理方法。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2002288187A Filed: 2001-03-23 Issued: 2002-10-04 情報蓄積システム、情報提示システム、電子メール配信システム、情報蓄積方法、情報提示方法、電子メール配信方法及び情報処理プログラムを記録した記録媒体 (Original Assignee) Sharp Corp; シャープ株式会社 Ryoichi Sato, 亮一 佐藤 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (コンピュ) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2002288187A CLAIM 8 【請求項８】 情報をメールで受け入れる過程と、 前記メールで受け入れた情報の内容を解析し、意味ベク トルデータ化する過程と、 前記情報を情報データベースに蓄積する過程と、 前記情報データベースに蓄積された情報と関連付けて前 記意味ベクトルデータ化された情報内容解析結果を意味 ベクトルデータベースに蓄積する過程とを含み、 前記メールで受け入れられた情報をもとに自動的に情報 データベース及びこれに関連付けられた意味ベクトルデ ータベースを構築することを特徴とするコンピュ (next polling, data processing system, next polling questions) ータに よる情報蓄積方法。 |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2002288187A CLAIM 8 【請求項８】 情報をメールで受け入れる過程と、 前記メールで受け入れた情報の内容を解析し、意味ベク トルデータ化する過程と、 前記情報を情報データベースに蓄積する過程と、 前記情報データベースに蓄積された情報と関連付けて前 記意味ベクトルデータ化された情報内容解析結果を意味 ベクトルデータベースに蓄積する過程とを含み、 前記メールで受け入れられた情報をもとに自動的に情報 データベース及びこれに関連付けられた意味ベクトルデ ータベースを構築することを特徴とするコンピュ (next polling, data processing system, next polling questions) ータに よる情報蓄積方法。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (読み取り, 信手段) (読み取り, 信手段) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2002288187A CLAIM 7 【請求項７】 請求項１乃至４のいずれか一項に記載の 情報蓄積システムを使って電子メールを配信する電子メ ール配信システムであって、 情報発信者からのメールを受け入れるメール受付手段 と、 前記メールで受け入れた情報の意味内容を解析し、意味 ベクトルデータ化する情報内容解析手段と、 コミュニティを形成するユーザの嗜好を示す情報をユー ザ・プロフィルとして格納するユーザ・プロフィルデー タベースと、 コミュニティを形成するユーザのメール・アドレスを格 納するメール・アドレスデータベースと、 前記情報内容解析結果をもとに前記ユーザ・プロフィル データベースを参照して前記情報に対して関心を持つと 判断されるユーザを特定し、前記メール・アドレスデー タベースから該当ユーザのメール・アドレスを抽出する 配信アドレス抽出手段と、 前記抽出されたメール・アドレス宛に前記受け入れたメ ールの内容をメールで配信するメール配信手段 (computer executable instruction, executable instruction) とを備え ることを特徴とする電子メール配信システム。 JP2002288187A CLAIM 15 【請求項１５】 コンピュータを、情報を電子メールで 受け入れるメール受付手段と、情報の意味内容を解析 し、意味ベクトルデータ化する情報内容解析手段と、情 報を蓄積する情報データベースと、意味ベクトルデータ を蓄積する意味ベクトルデータベースと、前記メール受 付手段で受け入れられた情報を前記情報データベースに 蓄積するとともに、前記情報データベースに蓄積された 情報と関連付けて意味ベクトルデータ化された前記情報 内容解析結果を前記意味ベクトルデータベースに蓄積す るデータベース管理手段とを備える情報蓄積システムと して機能させるためのプログラムを記録したことを特徴 とするコンピュータ読み取り (computer executable instruction, executable instruction) 可能な記録媒体。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2002288187A CLAIM 8 【請求項８】 情報をメールで受け入れる過程と、 前記メールで受け入れた情報の内容を解析し、意味ベク トルデータ化する過程と、 前記情報を情報データベースに蓄積する過程と、 前記情報データベースに蓄積された情報と関連付けて前 記意味ベクトルデータ化された情報内容解析結果を意味 ベクトルデータベースに蓄積する過程とを含み、 前記メールで受け入れられた情報をもとに自動的に情報 データベース及びこれに関連付けられた意味ベクトルデ ータベースを構築することを特徴とするコンピュ (next polling, data processing system, next polling questions) ータに よる情報蓄積方法。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2002288187A CLAIM 8 【請求項８】 情報をメールで受け入れる過程と、 前記メールで受け入れた情報の内容を解析し、意味ベク トルデータ化する過程と、 前記情報を情報データベースに蓄積する過程と、 前記情報データベースに蓄積された情報と関連付けて前 記意味ベクトルデータ化された情報内容解析結果を意味 ベクトルデータベースに蓄積する過程とを含み、 前記メールで受け入れられた情報をもとに自動的に情報 データベース及びこれに関連付けられた意味ベクトルデ ータベースを構築することを特徴とするコンピュ (next polling, data processing system, next polling questions) ータに よる情報蓄積方法。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | EP1139608A2 Filed: 2001-03-19 Issued: 2001-10-04 Method and system for subscriber-configurable communications service (Original Assignee) Nokia of America Corp (Current Assignee) Nokia of America Corp Erik Anderlind, Scott C. Miller, Mohamed Rahman |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (wireless data) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (data messages) of other users that have a likelihood of match within a predetermined threshold . |
EP1139608A2 CLAIM 1 A method of providing configurable data services for mobile stations , the method comprising the steps of : establishing an active profile associated with a corresponding mobile station and being variable in accordance with a triggering event ; receiving a data message at a wireless data (receiving user information) server , the data message addressed to at least one of the wireless data server and the mobile station ; accessing the active profile for the mobile station to which the received data message is addressed to determine applicable stored profile attributes ; detecting received profile attributes associated with the received data message ; filtering the received data message based on a comparison between the detected profile attributes and the stored profile attributes . EP1139608A2 CLAIM 7 The method according to claim 6 wherein the filtering step deletes data messages (user profiles) with a predefined identifier that are received during a first range of mobile station locations and transmits data messages with the predefined identifier that are received during a second range of mobile station locations . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (data messages) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
EP1139608A2 CLAIM 7 The method according to claim 6 wherein the filtering step deletes data messages (user profiles) with a predefined identifier that are received during a first range of mobile station locations and transmits data messages with the predefined identifier that are received during a second range of mobile station locations . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (wireless data) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (data messages) of other users that have a likelihood of match within a predetermined threshold . |
EP1139608A2 CLAIM 1 A method of providing configurable data services for mobile stations , the method comprising the steps of : establishing an active profile associated with a corresponding mobile station and being variable in accordance with a triggering event ; receiving a data message at a wireless data (receiving user information) server , the data message addressed to at least one of the wireless data server and the mobile station ; accessing the active profile for the mobile station to which the received data message is addressed to determine applicable stored profile attributes ; detecting received profile attributes associated with the received data message ; filtering the received data message based on a comparison between the detected profile attributes and the stored profile attributes . EP1139608A2 CLAIM 7 The method according to claim 6 wherein the filtering step deletes data messages (user profiles) with a predefined identifier that are received during a first range of mobile station locations and transmits data messages with the predefined identifier that are received during a second range of mobile station locations . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (data messages) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
EP1139608A2 CLAIM 7 The method according to claim 6 wherein the filtering step deletes data messages (user profiles) with a predefined identifier that are received during a first range of mobile station locations and transmits data messages with the predefined identifier that are received during a second range of mobile station locations . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (wireless data) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (data messages) of other users that have a likelihood of match within a predetermined threshold . |
EP1139608A2 CLAIM 1 A method of providing configurable data services for mobile stations , the method comprising the steps of : establishing an active profile associated with a corresponding mobile station and being variable in accordance with a triggering event ; receiving a data message at a wireless data (receiving user information) server , the data message addressed to at least one of the wireless data server and the mobile station ; accessing the active profile for the mobile station to which the received data message is addressed to determine applicable stored profile attributes ; detecting received profile attributes associated with the received data message ; filtering the received data message based on a comparison between the detected profile attributes and the stored profile attributes . EP1139608A2 CLAIM 7 The method according to claim 6 wherein the filtering step deletes data messages (user profiles) with a predefined identifier that are received during a first range of mobile station locations and transmits data messages with the predefined identifier that are received during a second range of mobile station locations . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (data messages) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
EP1139608A2 CLAIM 7 The method according to claim 6 wherein the filtering step deletes data messages (user profiles) with a predefined identifier that are received during a first range of mobile station locations and transmits data messages with the predefined identifier that are received during a second range of mobile station locations . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20020026359A1 Filed: 2001-02-22 Issued: 2002-02-28 Targeted advertising method and system (Original Assignee) CLICK TACTICS Inc (Current Assignee) CLICK TACTICS Inc Kenneth Long, Michael Robinson, Robert Glezen, Christopher Jenkins, Douglas Mazur |
|---|---|
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands (communication port) to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (order n) of members that fall within the maximum and minimum match percentage . |
US20020026359A1 CLAIM 11 . The method according to claim 8 , wherein the response tracking data includes data related to the order n (maximum number) ame , the particular customer' ; s name , the client' ; s name , and the order type . US20020026359A1 CLAIM 24 . A system for generating a client selected targeted advertisement , comprising : a communication port (match commands) for receiving a communication line accessed by the client ; a primary domain controller coupled to a central facility to interface the client to the central facility through software ; a relational database in communication with the primary domain controller via a bus to provide list management , client configuration and response tracking capabilities to the central facility , wherein the relational database includes at least one client data library , at least one template library , a response tracking library , and at least one customer list library ; an application server to handle application operations exchanged through the bus between the software and the relational database , wherein when the accesses the central facility , the client is provided with a set of options for the client to choose from in selecting a design of the targeted advertising and/or promotional campaign material , and wherein the client is provided with a set of options for the client to choose from in selecting intended recipients of the targeted advertising and/or promotional campaign material . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (electronic mail) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (client access) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020026359A1 CLAIM 8 . A method of generating an advertisement , comprising : providing a client access (match servers) to a central facility to create an advertising and/or promotional material ; providing a database administered by the central facility that includes an electronically storable advertising and/or promotional template from which the client selects the format and content of the advertising and/or promotional material ; providing a customer list from which the client selects targeted customers of the advertising and/or promotional material ; processing data corresponding to the selected advertising and/or promotional material and data corresponding to the selected targeted customers ; providing an order that identifies the processed advertising and/or promotional material data and targeted customer data ; communicating the order for fulfillment ; processing response tracking data that relates the client , a particular customer from the targeted customers , and the order ; and generating the advertising and/or promotional material in communicable form for receipt by the targeted customers , wherein the communicable form includes a machine readable mark or code that includes the response tracking data . US20020026359A1 CLAIM 10 . The method according to claim 8 , wherein the advertising and/or promotional material is an electronic mail (web server) (e-mail) message , and wherein the targeted e-mail message is generated and prepared to send to e-mail addresses of the targeted customers . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (electronic mail) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (client access) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020026359A1 CLAIM 8 . A method of generating an advertisement , comprising : providing a client access (match servers) to a central facility to create an advertising and/or promotional material ; providing a database administered by the central facility that includes an electronically storable advertising and/or promotional template from which the client selects the format and content of the advertising and/or promotional material ; providing a customer list from which the client selects targeted customers of the advertising and/or promotional material ; processing data corresponding to the selected advertising and/or promotional material and data corresponding to the selected targeted customers ; providing an order that identifies the processed advertising and/or promotional material data and targeted customer data ; communicating the order for fulfillment ; processing response tracking data that relates the client , a particular customer from the targeted customers , and the order ; and generating the advertising and/or promotional material in communicable form for receipt by the targeted customers , wherein the communicable form includes a machine readable mark or code that includes the response tracking data . US20020026359A1 CLAIM 10 . The method according to claim 8 , wherein the advertising and/or promotional material is an electronic mail (web server) (e-mail) message , and wherein the targeted e-mail message is generated and prepared to send to e-mail addresses of the targeted customers . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands (communication port) to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (order n) of members that fall within the maximum and minimum match percentage . |
US20020026359A1 CLAIM 11 . The method according to claim 8 , wherein the response tracking data includes data related to the order n (maximum number) ame , the particular customer' ; s name , the client' ; s name , and the order type . US20020026359A1 CLAIM 24 . A system for generating a client selected targeted advertisement , comprising : a communication port (match commands) for receiving a communication line accessed by the client ; a primary domain controller coupled to a central facility to interface the client to the central facility through software ; a relational database in communication with the primary domain controller via a bus to provide list management , client configuration and response tracking capabilities to the central facility , wherein the relational database includes at least one client data library , at least one template library , a response tracking library , and at least one customer list library ; an application server to handle application operations exchanged through the bus between the software and the relational database , wherein when the accesses the central facility , the client is provided with a set of options for the client to choose from in selecting a design of the targeted advertising and/or promotional campaign material , and wherein the client is provided with a set of options for the client to choose from in selecting intended recipients of the targeted advertising and/or promotional campaign material . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (electronic mail) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (client access) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020026359A1 CLAIM 8 . A method of generating an advertisement , comprising : providing a client access (match servers) to a central facility to create an advertising and/or promotional material ; providing a database administered by the central facility that includes an electronically storable advertising and/or promotional template from which the client selects the format and content of the advertising and/or promotional material ; providing a customer list from which the client selects targeted customers of the advertising and/or promotional material ; processing data corresponding to the selected advertising and/or promotional material and data corresponding to the selected targeted customers ; providing an order that identifies the processed advertising and/or promotional material data and targeted customer data ; communicating the order for fulfillment ; processing response tracking data that relates the client , a particular customer from the targeted customers , and the order ; and generating the advertising and/or promotional material in communicable form for receipt by the targeted customers , wherein the communicable form includes a machine readable mark or code that includes the response tracking data . US20020026359A1 CLAIM 10 . The method according to claim 8 , wherein the advertising and/or promotional material is an electronic mail (web server) (e-mail) message , and wherein the targeted e-mail message is generated and prepared to send to e-mail addresses of the targeted customers . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (electronic mail) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (client access) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020026359A1 CLAIM 8 . A method of generating an advertisement , comprising : providing a client access (match servers) to a central facility to create an advertising and/or promotional material ; providing a database administered by the central facility that includes an electronically storable advertising and/or promotional template from which the client selects the format and content of the advertising and/or promotional material ; providing a customer list from which the client selects targeted customers of the advertising and/or promotional material ; processing data corresponding to the selected advertising and/or promotional material and data corresponding to the selected targeted customers ; providing an order that identifies the processed advertising and/or promotional material data and targeted customer data ; communicating the order for fulfillment ; processing response tracking data that relates the client , a particular customer from the targeted customers , and the order ; and generating the advertising and/or promotional material in communicable form for receipt by the targeted customers , wherein the communicable form includes a machine readable mark or code that includes the response tracking data . US20020026359A1 CLAIM 10 . The method according to claim 8 , wherein the advertising and/or promotional material is an electronic mail (web server) (e-mail) message , and wherein the targeted e-mail message is generated and prepared to send to e-mail addresses of the targeted customers . |
| US9087321B2 CLAIM 19 . A computer program product (bar code) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations (bar code) of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20020026359A1 CLAIM 28 . The system according to claim 26 , wherein the machine readable mark or code is a bar code (computer program product, computer program product comprising computer, computer to perform operations) that comprises a first portion that includes the name of the client order/offer ; a second portion that includes the name of the customer that the targeted advertising and/or promotional campaign material was mailed to ; a third portion that includes the type of order ; and a fourth portion that includes the mailing date of the targeted advertising and/or promotional campaign material . |
| US9087321B2 CLAIM 20 . The computer program product (bar code) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations (bar code) of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20020026359A1 CLAIM 28 . The system according to claim 26 , wherein the machine readable mark or code is a bar code (computer program product, computer program product comprising computer, computer to perform operations) that comprises a first portion that includes the name of the client order/offer ; a second portion that includes the name of the customer that the targeted advertising and/or promotional campaign material was mailed to ; a third portion that includes the type of order ; and a fourth portion that includes the mailing date of the targeted advertising and/or promotional campaign material . |
| US9087321B2 CLAIM 21 . The computer program product (bar code) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations (bar code) of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20020026359A1 CLAIM 28 . The system according to claim 26 , wherein the machine readable mark or code is a bar code (computer program product, computer program product comprising computer, computer to perform operations) that comprises a first portion that includes the name of the client order/offer ; a second portion that includes the name of the customer that the targeted advertising and/or promotional campaign material was mailed to ; a third portion that includes the type of order ; and a fourth portion that includes the mailing date of the targeted advertising and/or promotional campaign material . |
| US9087321B2 CLAIM 22 . The computer program product (bar code) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations (bar code) of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20020026359A1 CLAIM 28 . The system according to claim 26 , wherein the machine readable mark or code is a bar code (computer program product, computer program product comprising computer, computer to perform operations) that comprises a first portion that includes the name of the client order/offer ; a second portion that includes the name of the customer that the targeted advertising and/or promotional campaign material was mailed to ; a third portion that includes the type of order ; and a fourth portion that includes the mailing date of the targeted advertising and/or promotional campaign material . |
| US9087321B2 CLAIM 23 . The computer program product (bar code) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations (bar code) of : receiving match commands (communication port) to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number (order n) of members that fall within the maximum and minimum match percentage . |
US20020026359A1 CLAIM 11 . The method according to claim 8 , wherein the response tracking data includes data related to the order n (maximum number) ame , the particular customer' ; s name , the client' ; s name , and the order type . US20020026359A1 CLAIM 24 . A system for generating a client selected targeted advertisement , comprising : a communication port (match commands) for receiving a communication line accessed by the client ; a primary domain controller coupled to a central facility to interface the client to the central facility through software ; a relational database in communication with the primary domain controller via a bus to provide list management , client configuration and response tracking capabilities to the central facility , wherein the relational database includes at least one client data library , at least one template library , a response tracking library , and at least one customer list library ; an application server to handle application operations exchanged through the bus between the software and the relational database , wherein when the accesses the central facility , the client is provided with a set of options for the client to choose from in selecting a design of the targeted advertising and/or promotional campaign material , and wherein the client is provided with a set of options for the client to choose from in selecting intended recipients of the targeted advertising and/or promotional campaign material . US20020026359A1 CLAIM 28 . The system according to claim 26 , wherein the machine readable mark or code is a bar code (computer program product, computer program product comprising computer, computer to perform operations) that comprises a first portion that includes the name of the client order/offer ; a second portion that includes the name of the customer that the targeted advertising and/or promotional campaign material was mailed to ; a third portion that includes the type of order ; and a fourth portion that includes the mailing date of the targeted advertising and/or promotional campaign material . |
| US9087321B2 CLAIM 24 . The computer program product (bar code) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations (bar code) of : collecting the selected answers with a web server (electronic mail) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (client access) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020026359A1 CLAIM 8 . A method of generating an advertisement , comprising : providing a client access (match servers) to a central facility to create an advertising and/or promotional material ; providing a database administered by the central facility that includes an electronically storable advertising and/or promotional template from which the client selects the format and content of the advertising and/or promotional material ; providing a customer list from which the client selects targeted customers of the advertising and/or promotional material ; processing data corresponding to the selected advertising and/or promotional material and data corresponding to the selected targeted customers ; providing an order that identifies the processed advertising and/or promotional material data and targeted customer data ; communicating the order for fulfillment ; processing response tracking data that relates the client , a particular customer from the targeted customers , and the order ; and generating the advertising and/or promotional material in communicable form for receipt by the targeted customers , wherein the communicable form includes a machine readable mark or code that includes the response tracking data . US20020026359A1 CLAIM 10 . The method according to claim 8 , wherein the advertising and/or promotional material is an electronic mail (web server) (e-mail) message , and wherein the targeted e-mail message is generated and prepared to send to e-mail addresses of the targeted customers . US20020026359A1 CLAIM 28 . The system according to claim 26 , wherein the machine readable mark or code is a bar code (computer program product, computer program product comprising computer, computer to perform operations) that comprises a first portion that includes the name of the client order/offer ; a second portion that includes the name of the customer that the targeted advertising and/or promotional campaign material was mailed to ; a third portion that includes the type of order ; and a fourth portion that includes the mailing date of the targeted advertising and/or promotional campaign material . |
| US9087321B2 CLAIM 25 . The computer program product (bar code) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020026359A1 CLAIM 28 . The system according to claim 26 , wherein the machine readable mark or code is a bar code (computer program product, computer program product comprising computer, computer to perform operations) that comprises a first portion that includes the name of the client order/offer ; a second portion that includes the name of the customer that the targeted advertising and/or promotional campaign material was mailed to ; a third portion that includes the type of order ; and a fourth portion that includes the mailing date of the targeted advertising and/or promotional campaign material . |
| US9087321B2 CLAIM 26 . The computer program product (bar code) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations (bar code) of : collecting the selected answers with a web server (electronic mail) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (client access) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020026359A1 CLAIM 8 . A method of generating an advertisement , comprising : providing a client access (match servers) to a central facility to create an advertising and/or promotional material ; providing a database administered by the central facility that includes an electronically storable advertising and/or promotional template from which the client selects the format and content of the advertising and/or promotional material ; providing a customer list from which the client selects targeted customers of the advertising and/or promotional material ; processing data corresponding to the selected advertising and/or promotional material and data corresponding to the selected targeted customers ; providing an order that identifies the processed advertising and/or promotional material data and targeted customer data ; communicating the order for fulfillment ; processing response tracking data that relates the client , a particular customer from the targeted customers , and the order ; and generating the advertising and/or promotional material in communicable form for receipt by the targeted customers , wherein the communicable form includes a machine readable mark or code that includes the response tracking data . US20020026359A1 CLAIM 10 . The method according to claim 8 , wherein the advertising and/or promotional material is an electronic mail (web server) (e-mail) message , and wherein the targeted e-mail message is generated and prepared to send to e-mail addresses of the targeted customers . US20020026359A1 CLAIM 28 . The system according to claim 26 , wherein the machine readable mark or code is a bar code (computer program product, computer program product comprising computer, computer to perform operations) that comprises a first portion that includes the name of the client order/offer ; a second portion that includes the name of the customer that the targeted advertising and/or promotional campaign material was mailed to ; a third portion that includes the type of order ; and a fourth portion that includes the mailing date of the targeted advertising and/or promotional campaign material . |
| US9087321B2 CLAIM 27 . The computer program product (bar code) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020026359A1 CLAIM 28 . The system according to claim 26 , wherein the machine readable mark or code is a bar code (computer program product, computer program product comprising computer, computer to perform operations) that comprises a first portion that includes the name of the client order/offer ; a second portion that includes the name of the customer that the targeted advertising and/or promotional campaign material was mailed to ; a third portion that includes the type of order ; and a fourth portion that includes the mailing date of the targeted advertising and/or promotional campaign material . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2002244988A Filed: 2001-02-16 Issued: 2002-08-30 協調作業支援システム (Original Assignee) Fuji Xerox Co Ltd; 富士ゼロックス株式会社 Yoshihiro Masuda, Hiroki Yoshimura, 宏樹 吉村, 佳弘 増田 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (インタフェース) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2002244988A CLAIM 5 【請求項５】 請求項１から４のいずれかに記載の協調 作業支援システムにおいて、 前記仮想協調作業場を前記コンピュータ装置に提供する 手段は、現実作業空間内の機器制御操作のために、各機 器ごとに事前に設定されたインタフェース (user information) のイメージを 提供することを特徴とする協調作業支援システム。 |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (の機器) . |
JP2002244988A CLAIM 1 【請求項１】 協調作業する現実空間に対して設けられ た複数のコンピュータ装置を具備し、 複数の現実作業空間をそれぞれコンピュータ上にイメー ジングし、複数の単位仮想空間を生成する手段と、 前記複数の単位仮想空間を合成して、仮想協調作業場を イメージングする手段と、 前記仮想協調作業場を前記現実空間上の対応するコンピ ュータ装置に提供する手段と、 前記仮想協調作業場内で、作業者間の相互通信を行う通 信手段と、 前記仮想協調作業場内で行われた、現実作業空間内の機 器制御操作を対応する現実作業空間内の機器 (next polling questions) に伝達する 手段と、 を備えたことを特徴とする協調作業支援システム。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (信手段) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information (インタフェース) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2002244988A CLAIM 1 【請求項１】 協調作業する現実空間に対して設けられ た複数のコンピュータ装置を具備し、 複数の現実作業空間をそれぞれコンピュータ上にイメー ジングし、複数の単位仮想空間を生成する手段と、 前記複数の単位仮想空間を合成して、仮想協調作業場を イメージングする手段と、 前記仮想協調作業場を前記現実空間上の対応するコンピ ュータ装置に提供する手段と、 前記仮想協調作業場内で、作業者間の相互通信を行う通 信手段 (executable instruction, computer executable instruction) と、 前記仮想協調作業場内で行われた、現実作業空間内の機 器制御操作を対応する現実作業空間内の機器に伝達する 手段と、 を備えたことを特徴とする協調作業支援システム。 JP2002244988A CLAIM 5 【請求項５】 請求項１から４のいずれかに記載の協調 作業支援システムにおいて、 前記仮想協調作業場を前記コンピュータ装置に提供する 手段は、現実作業空間内の機器制御操作のために、各機 器ごとに事前に設定されたインタフェース (user information) のイメージを 提供することを特徴とする協調作業支援システム。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (の機器) . |
JP2002244988A CLAIM 1 【請求項１】 協調作業する現実空間に対して設けられ た複数のコンピュータ装置を具備し、 複数の現実作業空間をそれぞれコンピュータ上にイメー ジングし、複数の単位仮想空間を生成する手段と、 前記複数の単位仮想空間を合成して、仮想協調作業場を イメージングする手段と、 前記仮想協調作業場を前記現実空間上の対応するコンピ ュータ装置に提供する手段と、 前記仮想協調作業場内で、作業者間の相互通信を行う通 信手段と、 前記仮想協調作業場内で行われた、現実作業空間内の機 器制御操作を対応する現実作業空間内の機器 (next polling questions) に伝達する 手段と、 を備えたことを特徴とする協調作業支援システム。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (インタフェース) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2002244988A CLAIM 5 【請求項５】 請求項１から４のいずれかに記載の協調 作業支援システムにおいて、 前記仮想協調作業場を前記コンピュータ装置に提供する 手段は、現実作業空間内の機器制御操作のために、各機 器ごとに事前に設定されたインタフェース (user information) のイメージを 提供することを特徴とする協調作業支援システム。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (の機器) . |
JP2002244988A CLAIM 1 【請求項１】 協調作業する現実空間に対して設けられ た複数のコンピュータ装置を具備し、 複数の現実作業空間をそれぞれコンピュータ上にイメー ジングし、複数の単位仮想空間を生成する手段と、 前記複数の単位仮想空間を合成して、仮想協調作業場を イメージングする手段と、 前記仮想協調作業場を前記現実空間上の対応するコンピ ュータ装置に提供する手段と、 前記仮想協調作業場内で、作業者間の相互通信を行う通 信手段と、 前記仮想協調作業場内で行われた、現実作業空間内の機 器制御操作を対応する現実作業空間内の機器 (next polling questions) に伝達する 手段と、 を備えたことを特徴とする協調作業支援システム。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20020078377A1 Filed: 2000-12-15 Issued: 2002-06-20 Method and apparatus in an application framework system for providing a port and network hardware resource firewall for distributed applications (Original Assignee) International Business Machines Corp (Current Assignee) Trend Micro Inc Ching-Jye Chang, Lorin Ullmann |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (data processing system) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20020078377A1 CLAIM 6 . A computer program product in a computer readable media for use in a data processing system (data processing system) for managing a distributed port firewall system , the computer program product comprising : first instructions for configuring a port for access by a specified user during a specified time interval and denying access to all other users during the specified time interval ; second instructions for deploying and starting a source endpoint firewall client ; third instructions for deploying and starting a target endpoint firewall client on the specified user' ; s endpoint ; fourth instructions for responsive to a request by the specified user for access to the port and responsive to a determination that the requested port is assigned to the user for use at the time requested , returning requested port to the specified user . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one (second mean) or more processors and a memory specifically encoded with computer executable instruction (fourth instruction) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20020078377A1 CLAIM 6 . A computer program product in a computer readable media for use in a data processing system for managing a distributed port firewall system , the computer program product comprising : first instructions for configuring a port for access by a specified user during a specified time interval and denying access to all other users during the specified time interval ; second instructions for deploying and starting a source endpoint firewall client ; third instructions for deploying and starting a target endpoint firewall client on the specified user' ; s endpoint ; fourth instruction (executable instruction) s for responsive to a request by the specified user for access to the port and responsive to a determination that the requested port is assigned to the user for use at the time requested , returning requested port to the specified user . US20020078377A1 CLAIM 11 . A system for managing a distributed port firewall system , the system comprising : first means for configuring a port for access by a specified user during a specified time interval and denying access to all other users during the specified time interval ; second mean (computer having one) s for deploying and starting a source endpoint firewall client ; third means for deploying and starting a target endpoint firewall client on the specified user' ; s endpoint ; fourth means for responsive to a request by the specified user for access to the port and responsive to a determination that the requested port is assigned to the user for use at the time requested , returning requested port to the specified user . |
| US9087321B2 CLAIM 19 . A computer program product (computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20020078377A1 CLAIM 6 . A computer program product (computer program product) in a computer readable media for use in a data processing system for managing a distributed port firewall system , the computer program product comprising : first instructions for configuring a port for access by a specified user during a specified time interval and denying access to all other users during the specified time interval ; second instructions for deploying and starting a source endpoint firewall client ; third instructions for deploying and starting a target endpoint firewall client on the specified user' ; s endpoint ; fourth instructions for responsive to a request by the specified user for access to the port and responsive to a determination that the requested port is assigned to the user for use at the time requested , returning requested port to the specified user . |
| US9087321B2 CLAIM 20 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20020078377A1 CLAIM 6 . A computer program product (computer program product) in a computer readable media for use in a data processing system for managing a distributed port firewall system , the computer program product comprising : first instructions for configuring a port for access by a specified user during a specified time interval and denying access to all other users during the specified time interval ; second instructions for deploying and starting a source endpoint firewall client ; third instructions for deploying and starting a target endpoint firewall client on the specified user' ; s endpoint ; fourth instructions for responsive to a request by the specified user for access to the port and responsive to a determination that the requested port is assigned to the user for use at the time requested , returning requested port to the specified user . |
| US9087321B2 CLAIM 21 . The computer program product (computer program product) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20020078377A1 CLAIM 6 . A computer program product (computer program product) in a computer readable media for use in a data processing system for managing a distributed port firewall system , the computer program product comprising : first instructions for configuring a port for access by a specified user during a specified time interval and denying access to all other users during the specified time interval ; second instructions for deploying and starting a source endpoint firewall client ; third instructions for deploying and starting a target endpoint firewall client on the specified user' ; s endpoint ; fourth instructions for responsive to a request by the specified user for access to the port and responsive to a determination that the requested port is assigned to the user for use at the time requested , returning requested port to the specified user . |
| US9087321B2 CLAIM 22 . The computer program product (computer program product) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20020078377A1 CLAIM 6 . A computer program product (computer program product) in a computer readable media for use in a data processing system for managing a distributed port firewall system , the computer program product comprising : first instructions for configuring a port for access by a specified user during a specified time interval and denying access to all other users during the specified time interval ; second instructions for deploying and starting a source endpoint firewall client ; third instructions for deploying and starting a target endpoint firewall client on the specified user' ; s endpoint ; fourth instructions for responsive to a request by the specified user for access to the port and responsive to a determination that the requested port is assigned to the user for use at the time requested , returning requested port to the specified user . |
| US9087321B2 CLAIM 23 . The computer program product (computer program product) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20020078377A1 CLAIM 6 . A computer program product (computer program product) in a computer readable media for use in a data processing system for managing a distributed port firewall system , the computer program product comprising : first instructions for configuring a port for access by a specified user during a specified time interval and denying access to all other users during the specified time interval ; second instructions for deploying and starting a source endpoint firewall client ; third instructions for deploying and starting a target endpoint firewall client on the specified user' ; s endpoint ; fourth instructions for responsive to a request by the specified user for access to the port and responsive to a determination that the requested port is assigned to the user for use at the time requested , returning requested port to the specified user . |
| US9087321B2 CLAIM 24 . The computer program product (computer program product) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020078377A1 CLAIM 6 . A computer program product (computer program product) in a computer readable media for use in a data processing system for managing a distributed port firewall system , the computer program product comprising : first instructions for configuring a port for access by a specified user during a specified time interval and denying access to all other users during the specified time interval ; second instructions for deploying and starting a source endpoint firewall client ; third instructions for deploying and starting a target endpoint firewall client on the specified user' ; s endpoint ; fourth instructions for responsive to a request by the specified user for access to the port and responsive to a determination that the requested port is assigned to the user for use at the time requested , returning requested port to the specified user . |
| US9087321B2 CLAIM 25 . The computer program product (computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020078377A1 CLAIM 6 . A computer program product (computer program product) in a computer readable media for use in a data processing system for managing a distributed port firewall system , the computer program product comprising : first instructions for configuring a port for access by a specified user during a specified time interval and denying access to all other users during the specified time interval ; second instructions for deploying and starting a source endpoint firewall client ; third instructions for deploying and starting a target endpoint firewall client on the specified user' ; s endpoint ; fourth instructions for responsive to a request by the specified user for access to the port and responsive to a determination that the requested port is assigned to the user for use at the time requested , returning requested port to the specified user . |
| US9087321B2 CLAIM 26 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20020078377A1 CLAIM 6 . A computer program product (computer program product) in a computer readable media for use in a data processing system for managing a distributed port firewall system , the computer program product comprising : first instructions for configuring a port for access by a specified user during a specified time interval and denying access to all other users during the specified time interval ; second instructions for deploying and starting a source endpoint firewall client ; third instructions for deploying and starting a target endpoint firewall client on the specified user' ; s endpoint ; fourth instructions for responsive to a request by the specified user for access to the port and responsive to a determination that the requested port is assigned to the user for use at the time requested , returning requested port to the specified user . |
| US9087321B2 CLAIM 27 . The computer program product (computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20020078377A1 CLAIM 6 . A computer program product (computer program product) in a computer readable media for use in a data processing system for managing a distributed port firewall system , the computer program product comprising : first instructions for configuring a port for access by a specified user during a specified time interval and denying access to all other users during the specified time interval ; second instructions for deploying and starting a source endpoint firewall client ; third instructions for deploying and starting a target endpoint firewall client on the specified user' ; s endpoint ; fourth instructions for responsive to a request by the specified user for access to the port and responsive to a determination that the requested port is assigned to the user for use at the time requested , returning requested port to the specified user . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6892179B1 Filed: 2000-11-10 Issued: 2005-05-10 System and method for ascribing a reputation to an entity (Original Assignee) Open Ratings Inc (Current Assignee) Open Ratings Inc Giorgos C. Zacharia |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6892179B1 CLAIM 9 . A computer program product comprising : a computer readable medium (match server) ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6892179B1 CLAIM 9 . A computer program product comprising : a computer readable medium (match server) ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6892179B1 CLAIM 9 . A computer program product comprising : a computer readable medium (match server) ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6892179B1 CLAIM 9 . A computer program product comprising : a computer readable medium (match server) ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6892179B1 CLAIM 9 . A computer program product comprising : a computer readable medium (match server) ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6892179B1 CLAIM 9 . A computer program product comprising : a computer readable medium (match server) ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6892179B1 CLAIM 9 . A computer program product comprising : a computer readable medium (match server) ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6892179B1 CLAIM 9 . A computer program product comprising : a computer readable medium (match server) ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 CLAIM 19 . A computer program product (computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6892179B1 CLAIM 9 . A computer program product (computer program product) comprising : a computer readable medium ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 CLAIM 20 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6892179B1 CLAIM 9 . A computer program product (computer program product) comprising : a computer readable medium ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 CLAIM 21 . The computer program product (computer program product) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US6892179B1 CLAIM 9 . A computer program product (computer program product) comprising : a computer readable medium ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 CLAIM 22 . The computer program product (computer program product) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US6892179B1 CLAIM 9 . A computer program product (computer program product) comprising : a computer readable medium ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 CLAIM 23 . The computer program product (computer program product) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6892179B1 CLAIM 9 . A computer program product (computer program product) comprising : a computer readable medium ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 CLAIM 24 . The computer program product (computer program product) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6892179B1 CLAIM 9 . A computer program product (computer program product) comprising : a computer readable medium (match server) ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 CLAIM 25 . The computer program product (computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6892179B1 CLAIM 9 . A computer program product (computer program product) comprising : a computer readable medium (match server) ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 CLAIM 26 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6892179B1 CLAIM 9 . A computer program product (computer program product) comprising : a computer readable medium (match server) ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 CLAIM 27 . The computer program product (computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6892179B1 CLAIM 9 . A computer program product (computer program product) comprising : a computer readable medium (match server) ; and computer readable signals stored on the computer readable medium that define instructions that , as a result of being executed by a computer , instruct the computer to perform a method of ascribing a ratee reputation to a first entity , the method comprising : (A) receiving a first rating of the first entity by a second entity ; (B) accessing a first rater reputation representing a reputation of the second entity as a qualitative rater of other entities ; (C) receiving an initial ratee reputation indicating a ratee reputation of the first user prior to the reception of the first rating ; and (D) generating a ratee reputation of the first entity , comprising (1) generating a ratee reputation adjustment from the first rater reputation , the first rating and the initial rater reputation ; and (2) adding the ratee reputation adjustment to the initial ratee reputation . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6675159B1 Filed: 2000-07-27 Issued: 2004-01-06 Concept-based search and retrieval system (Original Assignee) Science Applications International Corp SAIC (Current Assignee) Leidos Inc Albert Deirchow Lin, Patrick John Graydon, Justin Eliot Busch, Maureen Caudill, Nancy Ann Chinchor, Jason Chun-Ming Tseng, Lei Wang, Bryner Sabido Pancho, Kenneth Scott Klein, Yuri Adrian Tijerino |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (statistical distribution) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6675159B1 CLAIM 12 . A method of performing concept-based searching of text documents as recited in claim 5 , further comprising the step of clustering results of said search , said clustering step comprising the following steps of : forming a concept pattern vector from said document predicate structures ; providing a feature map that self-adaptively clusters said concept pattern vectors according to said concept patterns in said documents ; producing a cluster model representing documents , identified in said concept-based searching , that reflects statistical distribution (match aggregator) of said concept pattern vectors representing said documents ; and providing at least one sample from said cluster model to focus search results . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (logical structure) per selected answer and m rows per user . |
US6675159B1 CLAIM 21 . An apparatus for use in an information retrieval system for retrieving information in response to a query as recited in claim 20 , further comprising a data repository storing said ontology , results from said Bayes classifier , and said predicate structures from said document ontological structure (n bytes) . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (statistical distribution) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6675159B1 CLAIM 12 . A method of performing concept-based searching of text documents as recited in claim 5 , further comprising the step of clustering results of said search , said clustering step comprising the following steps of : forming a concept pattern vector from said document predicate structures ; providing a feature map that self-adaptively clusters said concept pattern vectors according to said concept patterns in said documents ; producing a cluster model representing documents , identified in said concept-based searching , that reflects statistical distribution (match aggregator) of said concept pattern vectors representing said documents ; and providing at least one sample from said cluster model to focus search results . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (logical structure) per selected answer and m rows per user . |
US6675159B1 CLAIM 21 . An apparatus for use in an information retrieval system for retrieving information in response to a query as recited in claim 20 , further comprising a data repository storing said ontology , results from said Bayes classifier , and said predicate structures from said document ontological structure (n bytes) . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (statistical distribution) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6675159B1 CLAIM 12 . A method of performing concept-based searching of text documents as recited in claim 5 , further comprising the step of clustering results of said search , said clustering step comprising the following steps of : forming a concept pattern vector from said document predicate structures ; providing a feature map that self-adaptively clusters said concept pattern vectors according to said concept patterns in said documents ; producing a cluster model representing documents , identified in said concept-based searching , that reflects statistical distribution (match aggregator) of said concept pattern vectors representing said documents ; and providing at least one sample from said cluster model to focus search results . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes (logical structure) per selected answer and m rows per user . |
US6675159B1 CLAIM 21 . An apparatus for use in an information retrieval system for retrieving information in response to a query as recited in claim 20 , further comprising a data repository storing said ontology , results from said Bayes classifier , and said predicate structures from said document ontological structure (n bytes) . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (statistical distribution) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6675159B1 CLAIM 12 . A method of performing concept-based searching of text documents as recited in claim 5 , further comprising the step of clustering results of said search , said clustering step comprising the following steps of : forming a concept pattern vector from said document predicate structures ; providing a feature map that self-adaptively clusters said concept pattern vectors according to said concept patterns in said documents ; producing a cluster model representing documents , identified in said concept-based searching , that reflects statistical distribution (match aggregator) of said concept pattern vectors representing said documents ; and providing at least one sample from said cluster model to focus search results . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (logical structure) per selected answer and m rows per user . |
US6675159B1 CLAIM 21 . An apparatus for use in an information retrieval system for retrieving information in response to a query as recited in claim 20 , further comprising a data repository storing said ontology , results from said Bayes classifier , and said predicate structures from said document ontological structure (n bytes) . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (statistical distribution) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6675159B1 CLAIM 12 . A method of performing concept-based searching of text documents as recited in claim 5 , further comprising the step of clustering results of said search , said clustering step comprising the following steps of : forming a concept pattern vector from said document predicate structures ; providing a feature map that self-adaptively clusters said concept pattern vectors according to said concept patterns in said documents ; producing a cluster model representing documents , identified in said concept-based searching , that reflects statistical distribution (match aggregator) of said concept pattern vectors representing said documents ; and providing at least one sample from said cluster model to focus search results . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (logical structure) per selected answer and m rows per user . |
US6675159B1 CLAIM 21 . An apparatus for use in an information retrieval system for retrieving information in response to a query as recited in claim 20 , further comprising a data repository storing said ontology , results from said Bayes classifier , and said predicate structures from said document ontological structure (n bytes) . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (statistical distribution) , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6675159B1 CLAIM 12 . A method of performing concept-based searching of text documents as recited in claim 5 , further comprising the step of clustering results of said search , said clustering step comprising the following steps of : forming a concept pattern vector from said document predicate structures ; providing a feature map that self-adaptively clusters said concept pattern vectors according to said concept patterns in said documents ; producing a cluster model representing documents , identified in said concept-based searching , that reflects statistical distribution (match aggregator) of said concept pattern vectors representing said documents ; and providing at least one sample from said cluster model to focus search results . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (logical structure) per selected answer and m rows per user . |
US6675159B1 CLAIM 21 . An apparatus for use in an information retrieval system for retrieving information in response to a query as recited in claim 20 , further comprising a data repository storing said ontology , results from said Bayes classifier , and said predicate structures from said document ontological structure (n bytes) . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6687741B1 Filed: 2000-05-24 Issued: 2004-02-03 Sending a file as a link and/or as an attachment (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Alan Ramaley, Suresh Tharamal, Sean E. McAteer, Thomas W. Olsen |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6687741B1 CLAIM 2 . A computer readable medium (match server) having stored thereon computer-executable instructions for performing the method of claim 1 . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6687741B1 CLAIM 2 . A computer readable medium (match server) having stored thereon computer-executable instructions for performing the method of claim 1 . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6687741B1 CLAIM 2 . A computer readable medium (match server) having stored thereon computer-executable instructions for performing the method of claim 1 . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6687741B1 CLAIM 2 . A computer readable medium (match server) having stored thereon computer-executable instructions for performing the method of claim 1 . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6687741B1 CLAIM 2 . A computer readable medium (match server) having stored thereon computer-executable instructions for performing the method of claim 1 . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6687741B1 CLAIM 2 . A computer readable medium (match server) having stored thereon computer-executable instructions for performing the method of claim 1 . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6687741B1 CLAIM 2 . A computer readable medium (match server) having stored thereon computer-executable instructions for performing the method of claim 1 . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6687741B1 CLAIM 2 . A computer readable medium (match server) having stored thereon computer-executable instructions for performing the method of claim 1 . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6687741B1 CLAIM 2 . A computer readable medium (match server) having stored thereon computer-executable instructions for performing the method of claim 1 . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6687741B1 CLAIM 2 . A computer readable medium (match server) having stored thereon computer-executable instructions for performing the method of claim 1 . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6687741B1 CLAIM 2 . A computer readable medium (match server) having stored thereon computer-executable instructions for performing the method of claim 1 . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6687741B1 CLAIM 2 . A computer readable medium (match server) having stored thereon computer-executable instructions for performing the method of claim 1 . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6327628B1 Filed: 2000-05-19 Issued: 2001-12-04 Portal server that provides a customizable user Interface for access to computer networks (Original Assignee) Epicentric Inc (Current Assignee) Open Text SA Ed Anuff, John Dean Taylor, Miles Chaston, David MacLeod, Peter Leiser, Oliver Muoto, Seth Ladygo, Brian Slesinsky, Terry Joyce |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6327628B1 CLAIM 9 . A computer program product for providing a portal server on a computer network , the computer program product comprising : a computer readable medium (match server) ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6327628B1 CLAIM 9 . A computer program product for providing a portal server on a computer network , the computer program product comprising : a computer readable medium (match server) ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6327628B1 CLAIM 9 . A computer program product for providing a portal server on a computer network , the computer program product comprising : a computer readable medium (match server) ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6327628B1 CLAIM 9 . A computer program product for providing a portal server on a computer network , the computer program product comprising : a computer readable medium (match server) ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means (first permission) to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6327628B1 CLAIM 1 . A portal server framework for providing a portal on a computer network , comprising : a software class configured to instantiate an information object , the information object encapsulating information ; and , a permission class configured to instantiate a first permission (instruction means) object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object ; whereby , upon installation on the network , the classes are executable by a processor on the computer network . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6327628B1 CLAIM 9 . A computer program product for providing a portal server on a computer network , the computer program product comprising : a computer readable medium (match server) ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6327628B1 CLAIM 9 . A computer program product for providing a portal server on a computer network , the computer program product comprising : a computer readable medium (match server) ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6327628B1 CLAIM 9 . A computer program product for providing a portal server on a computer network , the computer program product comprising : a computer readable medium (match server) ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6327628B1 CLAIM 9 . A computer program product for providing a portal server on a computer network , the computer program product comprising : a computer readable medium (match server) ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 CLAIM 19 . A computer program product (computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means (first permission) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6327628B1 CLAIM 1 . A portal server framework for providing a portal on a computer network , comprising : a software class configured to instantiate an information object , the information object encapsulating information ; and , a permission class configured to instantiate a first permission (instruction means) object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object ; whereby , upon installation on the network , the classes are executable by a processor on the computer network . US6327628B1 CLAIM 9 . A computer program product (computer program product) for providing a portal server on a computer network , the computer program product comprising : a computer readable medium ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 CLAIM 20 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means (first permission) for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6327628B1 CLAIM 1 . A portal server framework for providing a portal on a computer network , comprising : a software class configured to instantiate an information object , the information object encapsulating information ; and , a permission class configured to instantiate a first permission (instruction means) object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object ; whereby , upon installation on the network , the classes are executable by a processor on the computer network . US6327628B1 CLAIM 9 . A computer program product (computer program product) for providing a portal server on a computer network , the computer program product comprising : a computer readable medium ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 CLAIM 21 . The computer program product (computer program product) as set forth in claim 20 , further comprising instruction means (first permission) for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US6327628B1 CLAIM 1 . A portal server framework for providing a portal on a computer network , comprising : a software class configured to instantiate an information object , the information object encapsulating information ; and , a permission class configured to instantiate a first permission (instruction means) object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object ; whereby , upon installation on the network , the classes are executable by a processor on the computer network . US6327628B1 CLAIM 9 . A computer program product (computer program product) for providing a portal server on a computer network , the computer program product comprising : a computer readable medium ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 CLAIM 22 . The computer program product (computer program product) as set forth in claim 21 , further comprising instruction means (first permission) for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US6327628B1 CLAIM 1 . A portal server framework for providing a portal on a computer network , comprising : a software class configured to instantiate an information object , the information object encapsulating information ; and , a permission class configured to instantiate a first permission (instruction means) object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object ; whereby , upon installation on the network , the classes are executable by a processor on the computer network . US6327628B1 CLAIM 9 . A computer program product (computer program product) for providing a portal server on a computer network , the computer program product comprising : a computer readable medium ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 CLAIM 23 . The computer program product (computer program product) as set forth in claim 22 , further comprising instruction means (first permission) for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6327628B1 CLAIM 1 . A portal server framework for providing a portal on a computer network , comprising : a software class configured to instantiate an information object , the information object encapsulating information ; and , a permission class configured to instantiate a first permission (instruction means) object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object ; whereby , upon installation on the network , the classes are executable by a processor on the computer network . US6327628B1 CLAIM 9 . A computer program product (computer program product) for providing a portal server on a computer network , the computer program product comprising : a computer readable medium ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 CLAIM 24 . The computer program product (computer program product) as set forth in claim 23 , further comprising instruction means (first permission) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6327628B1 CLAIM 1 . A portal server framework for providing a portal on a computer network , comprising : a software class configured to instantiate an information object , the information object encapsulating information ; and , a permission class configured to instantiate a first permission (instruction means) object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object ; whereby , upon installation on the network , the classes are executable by a processor on the computer network . US6327628B1 CLAIM 9 . A computer program product (computer program product) for providing a portal server on a computer network , the computer program product comprising : a computer readable medium (match server) ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 CLAIM 25 . The computer program product (computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6327628B1 CLAIM 9 . A computer program product (computer program product) for providing a portal server on a computer network , the computer program product comprising : a computer readable medium (match server) ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 CLAIM 26 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means (first permission) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6327628B1 CLAIM 1 . A portal server framework for providing a portal on a computer network , comprising : a software class configured to instantiate an information object , the information object encapsulating information ; and , a permission class configured to instantiate a first permission (instruction means) object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object ; whereby , upon installation on the network , the classes are executable by a processor on the computer network . US6327628B1 CLAIM 9 . A computer program product (computer program product) for providing a portal server on a computer network , the computer program product comprising : a computer readable medium (match server) ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 CLAIM 27 . The computer program product (computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6327628B1 CLAIM 9 . A computer program product (computer program product) for providing a portal server on a computer network , the computer program product comprising : a computer readable medium (match server) ; and , computer program instructions , recorded on the computer readable medium , executable by a processor , for performing the steps of : instantiating an information object encapsulating information ; and instantiating a first permission object , the first permission object defining a first set of users having access to , and a first set of administrative privileges associated with , the information object ; wherein the first set of administrative privileges includes permission to instantiate a second permission object , the second permission object defining a second set of users having access to the information object . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6820204B1 Filed: 2000-03-31 Issued: 2004-11-16 System and method for selective information exchange (Original Assignee) Nimesh Desai; Sanjay Udani; James David Kimble, Jr.; Thomas P. Werges; David Dean Richardson; Jeffrey A. Gustafson (Current Assignee) ZKEY INVESTMENTS LLC Nimesh Desai, Sanjay Udani, James David Kimble, Jr., Thomas P. Werges, David Dean Richardson, Jeffrey A. Gustafson |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information (respective users, stored data) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profile information, user profile data) of other users that have a likelihood of match within a predetermined threshold . |
US6820204B1 CLAIM 1 . In a network including a plurality of network devices operated by a plurality of users , a real-time information exchange , system for sharing user profile information (user profiles) between respective users (user information) of the network devices , comprising : a database management system connected to the network and storing the user profile information for a plurality of registered users of the information exchange system , the user profile information including a plurality of data elements , each data element having an associated one of the plurality of registered users ; wherein each data element has an associated subset of users to whom access to the data element has been granted ; and wherein users not included in the associated subset of users are denied access to the data element . US6820204B1 CLAIM 12 . The information exchange system of claim 11 wherein each stored data (user information) element is encrypted with a secret key . US6820204B1 CLAIM 16 . In a network including a plurality of network devices operated by a plurality of users , a real-time information exchange system for sharing user profile information between respective users of the network devices , comprising : a first database management system storing a first subset of the user profile data (user profiles) for a plurality of registered users of the information exchange system , the first subset of profile information including a plurality of data elements , each data element having an associated one of the plurality of registered users ; and a first network server connected to the network and the first database management system , the first network server including : a first processor ; and a first program memory connected to the first processor and having program instructions stored therein , the first processor being operable to execute the program instructions , the program instructions including : for each registered user , selectively granting and denying access to each of the registered user' ; s associated data elements , to other users in the network . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile information, user profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6820204B1 CLAIM 1 . In a network including a plurality of network devices operated by a plurality of users , a real-time information exchange , system for sharing user profile information (user profiles) between respective users of the network devices , comprising : a database management system connected to the network and storing the user profile information for a plurality of registered users of the information exchange system , the user profile information including a plurality of data elements , each data element having an associated one of the plurality of registered users ; wherein each data element has an associated subset of users to whom access to the data element has been granted ; and wherein users not included in the associated subset of users are denied access to the data element . US6820204B1 CLAIM 16 . In a network including a plurality of network devices operated by a plurality of users , a real-time information exchange system for sharing user profile information between respective users of the network devices , comprising : a first database management system storing a first subset of the user profile data (user profiles) for a plurality of registered users of the information exchange system , the first subset of profile information including a plurality of data elements , each data element having an associated one of the plurality of registered users ; and a first network server connected to the network and the first database management system , the first network server including : a first processor ; and a first program memory connected to the first processor and having program instructions stored therein , the first processor being operable to execute the program instructions , the program instructions including : for each registered user , selectively granting and denying access to each of the registered user' ; s associated data elements , to other users in the network . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (include instructions) means to execute the instruction means (include instructions) to cause the one or more processors to perform operations of : receiving user information (respective users, stored data) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profile information, user profile data) of other users that have a likelihood of match within a predetermined threshold . |
US6820204B1 CLAIM 1 . In a network including a plurality of network devices operated by a plurality of users , a real-time information exchange , system for sharing user profile information (user profiles) between respective users (user information) of the network devices , comprising : a database management system connected to the network and storing the user profile information for a plurality of registered users of the information exchange system , the user profile information including a plurality of data elements , each data element having an associated one of the plurality of registered users ; wherein each data element has an associated subset of users to whom access to the data element has been granted ; and wherein users not included in the associated subset of users are denied access to the data element . US6820204B1 CLAIM 12 . The information exchange system of claim 11 wherein each stored data (user information) element is encrypted with a secret key . US6820204B1 CLAIM 16 . In a network including a plurality of network devices operated by a plurality of users , a real-time information exchange system for sharing user profile information between respective users of the network devices , comprising : a first database management system storing a first subset of the user profile data (user profiles) for a plurality of registered users of the information exchange system , the first subset of profile information including a plurality of data elements , each data element having an associated one of the plurality of registered users ; and a first network server connected to the network and the first database management system , the first network server including : a first processor ; and a first program memory connected to the first processor and having program instructions stored therein , the first processor being operable to execute the program instructions , the program instructions including : for each registered user , selectively granting and denying access to each of the registered user' ; s associated data elements , to other users in the network . US6820204B1 CLAIM 22 . The information exchange server of claim 21 wherein the program instructions further include instructions (executable instruction, instruction means) for selectively granting and denying access to each of its associated data elements to users of the network including : receiving at least one data element selected by a granting member ; receiving at least one member identity selected by the granting member to whom to grant access to the selected data element ; for each selected data element , retrieving from the second table of the database an encrypted secret key associated with the data element and the granting member ; decrypting the encrypted secret with the granting member' ; s private key ; and for each selected member to whom access is to be granted , encrypting the decrypted secret key with the selected member' ; s public key ; and storing the encrypted secret key and the selected member' ; s identification number in the second table of the database . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile information, user profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6820204B1 CLAIM 1 . In a network including a plurality of network devices operated by a plurality of users , a real-time information exchange , system for sharing user profile information (user profiles) between respective users of the network devices , comprising : a database management system connected to the network and storing the user profile information for a plurality of registered users of the information exchange system , the user profile information including a plurality of data elements , each data element having an associated one of the plurality of registered users ; wherein each data element has an associated subset of users to whom access to the data element has been granted ; and wherein users not included in the associated subset of users are denied access to the data element . US6820204B1 CLAIM 16 . In a network including a plurality of network devices operated by a plurality of users , a real-time information exchange system for sharing user profile information between respective users of the network devices , comprising : a first database management system storing a first subset of the user profile data (user profiles) for a plurality of registered users of the information exchange system , the first subset of profile information including a plurality of data elements , each data element having an associated one of the plurality of registered users ; and a first network server connected to the network and the first database management system , the first network server including : a first processor ; and a first program memory connected to the first processor and having program instructions stored therein , the first processor being operable to execute the program instructions , the program instructions including : for each registered user , selectively granting and denying access to each of the registered user' ; s associated data elements , to other users in the network . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means (include instructions) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information (respective users, stored data) from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profile information, user profile data) of other users that have a likelihood of match within a predetermined threshold . |
US6820204B1 CLAIM 1 . In a network including a plurality of network devices operated by a plurality of users , a real-time information exchange , system for sharing user profile information (user profiles) between respective users (user information) of the network devices , comprising : a database management system connected to the network and storing the user profile information for a plurality of registered users of the information exchange system , the user profile information including a plurality of data elements , each data element having an associated one of the plurality of registered users ; wherein each data element has an associated subset of users to whom access to the data element has been granted ; and wherein users not included in the associated subset of users are denied access to the data element . US6820204B1 CLAIM 12 . The information exchange system of claim 11 wherein each stored data (user information) element is encrypted with a secret key . US6820204B1 CLAIM 16 . In a network including a plurality of network devices operated by a plurality of users , a real-time information exchange system for sharing user profile information between respective users of the network devices , comprising : a first database management system storing a first subset of the user profile data (user profiles) for a plurality of registered users of the information exchange system , the first subset of profile information including a plurality of data elements , each data element having an associated one of the plurality of registered users ; and a first network server connected to the network and the first database management system , the first network server including : a first processor ; and a first program memory connected to the first processor and having program instructions stored therein , the first processor being operable to execute the program instructions , the program instructions including : for each registered user , selectively granting and denying access to each of the registered user' ; s associated data elements , to other users in the network . US6820204B1 CLAIM 22 . The information exchange server of claim 21 wherein the program instructions further include instructions (executable instruction, instruction means) for selectively granting and denying access to each of its associated data elements to users of the network including : receiving at least one data element selected by a granting member ; receiving at least one member identity selected by the granting member to whom to grant access to the selected data element ; for each selected data element , retrieving from the second table of the database an encrypted secret key associated with the data element and the granting member ; decrypting the encrypted secret with the granting member' ; s private key ; and for each selected member to whom access is to be granted , encrypting the decrypted secret key with the selected member' ; s public key ; and storing the encrypted secret key and the selected member' ; s identification number in the second table of the database . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means (include instructions) for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profile information, user profile data) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6820204B1 CLAIM 1 . In a network including a plurality of network devices operated by a plurality of users , a real-time information exchange , system for sharing user profile information (user profiles) between respective users of the network devices , comprising : a database management system connected to the network and storing the user profile information for a plurality of registered users of the information exchange system , the user profile information including a plurality of data elements , each data element having an associated one of the plurality of registered users ; wherein each data element has an associated subset of users to whom access to the data element has been granted ; and wherein users not included in the associated subset of users are denied access to the data element . US6820204B1 CLAIM 16 . In a network including a plurality of network devices operated by a plurality of users , a real-time information exchange system for sharing user profile information between respective users of the network devices , comprising : a first database management system storing a first subset of the user profile data (user profiles) for a plurality of registered users of the information exchange system , the first subset of profile information including a plurality of data elements , each data element having an associated one of the plurality of registered users ; and a first network server connected to the network and the first database management system , the first network server including : a first processor ; and a first program memory connected to the first processor and having program instructions stored therein , the first processor being operable to execute the program instructions , the program instructions including : for each registered user , selectively granting and denying access to each of the registered user' ; s associated data elements , to other users in the network . US6820204B1 CLAIM 22 . The information exchange server of claim 21 wherein the program instructions further include instructions (executable instruction, instruction means) for selectively granting and denying access to each of its associated data elements to users of the network including : receiving at least one data element selected by a granting member ; receiving at least one member identity selected by the granting member to whom to grant access to the selected data element ; for each selected data element , retrieving from the second table of the database an encrypted secret key associated with the data element and the granting member ; decrypting the encrypted secret with the granting member' ; s private key ; and for each selected member to whom access is to be granted , encrypting the decrypted secret key with the selected member' ; s public key ; and storing the encrypted secret key and the selected member' ; s identification number in the second table of the database . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means (include instructions) for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US6820204B1 CLAIM 22 . The information exchange server of claim 21 wherein the program instructions further include instructions (executable instruction, instruction means) for selectively granting and denying access to each of its associated data elements to users of the network including : receiving at least one data element selected by a granting member ; receiving at least one member identity selected by the granting member to whom to grant access to the selected data element ; for each selected data element , retrieving from the second table of the database an encrypted secret key associated with the data element and the granting member ; decrypting the encrypted secret with the granting member' ; s private key ; and for each selected member to whom access is to be granted , encrypting the decrypted secret key with the selected member' ; s public key ; and storing the encrypted secret key and the selected member' ; s identification number in the second table of the database . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means (include instructions) for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US6820204B1 CLAIM 22 . The information exchange server of claim 21 wherein the program instructions further include instructions (executable instruction, instruction means) for selectively granting and denying access to each of its associated data elements to users of the network including : receiving at least one data element selected by a granting member ; receiving at least one member identity selected by the granting member to whom to grant access to the selected data element ; for each selected data element , retrieving from the second table of the database an encrypted secret key associated with the data element and the granting member ; decrypting the encrypted secret with the granting member' ; s private key ; and for each selected member to whom access is to be granted , encrypting the decrypted secret key with the selected member' ; s public key ; and storing the encrypted secret key and the selected member' ; s identification number in the second table of the database . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means (include instructions) for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6820204B1 CLAIM 22 . The information exchange server of claim 21 wherein the program instructions further include instructions (executable instruction, instruction means) for selectively granting and denying access to each of its associated data elements to users of the network including : receiving at least one data element selected by a granting member ; receiving at least one member identity selected by the granting member to whom to grant access to the selected data element ; for each selected data element , retrieving from the second table of the database an encrypted secret key associated with the data element and the granting member ; decrypting the encrypted secret with the granting member' ; s private key ; and for each selected member to whom access is to be granted , encrypting the decrypted secret key with the selected member' ; s public key ; and storing the encrypted secret key and the selected member' ; s identification number in the second table of the database . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means (include instructions) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6820204B1 CLAIM 22 . The information exchange server of claim 21 wherein the program instructions further include instructions (executable instruction, instruction means) for selectively granting and denying access to each of its associated data elements to users of the network including : receiving at least one data element selected by a granting member ; receiving at least one member identity selected by the granting member to whom to grant access to the selected data element ; for each selected data element , retrieving from the second table of the database an encrypted secret key associated with the data element and the granting member ; decrypting the encrypted secret with the granting member' ; s private key ; and for each selected member to whom access is to be granted , encrypting the decrypted secret key with the selected member' ; s public key ; and storing the encrypted secret key and the selected member' ; s identification number in the second table of the database . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means (include instructions) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6820204B1 CLAIM 22 . The information exchange server of claim 21 wherein the program instructions further include instructions (executable instruction, instruction means) for selectively granting and denying access to each of its associated data elements to users of the network including : receiving at least one data element selected by a granting member ; receiving at least one member identity selected by the granting member to whom to grant access to the selected data element ; for each selected data element , retrieving from the second table of the database an encrypted secret key associated with the data element and the granting member ; decrypting the encrypted secret with the granting member' ; s private key ; and for each selected member to whom access is to be granted , encrypting the decrypted secret key with the selected member' ; s public key ; and storing the encrypted secret key and the selected member' ; s identification number in the second table of the database . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6389540B1 Filed: 2000-03-30 Issued: 2002-05-14 Stack based access control using code and executor identifiers (Original Assignee) Sun Microsystems Inc (Current Assignee) Sun Microsystems Inc Robert W. Scheifler, Li Gong |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (data processing system) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6389540B1 CLAIM 5 . In a data processing system (data processing system) , a method that regulates access to a resource requested by an operation executing on a computer , the operation invoking a plurality of functions that operate upon code during execution , the method comprising the steps of : storing permissions for each of the functions , the permissions authorizing types of access to the resource based on a source of the code and an executor of the code ; storing , as frames in a call stack , the functions and executors in an order of invocation by the operation ; dynamically determining whether the types of access authorized by the permissions of each of the functions and executors on the call stack encompass the access requested by the operation ; and granting access to the resource when the types of access authorized by the permissions of all of the functions and executors on the call stack encompass the access requested by the operation . |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands (requested action) to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6389540B1 CLAIM 8 . A computer-readable medium containing instructions for controlling a computer to perform an action requested by a program executing on the computer , the program invoking a plurality of functions that operate upon code during execution , the computer including a policy file that stores permissions for each of the functions , the permissions authorizing types of actions based on a source of the code and an executor of the code , a call stack that stores the functions and executors as frames in an order of invocation by the program , and an execution unit , the instructions causing the execution unit to perform the steps of : determining whether permissions associated with each of the frames on the call stack encompasses a type of the requested action (match commands) , wherein each of the frames includes a code identifier that identifies the source of the code for a corresponding one of the functions , and an executor identifier that identifies the executor on whose behalf the code is being executed ; denying the requested action when any of the permissions fail to encompass the type of requested action ; and performing the requested action when all of the permissions encompass the type of requested action . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands (requested action) to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6389540B1 CLAIM 8 . A computer-readable medium containing instructions for controlling a computer to perform an action requested by a program executing on the computer , the program invoking a plurality of functions that operate upon code during execution , the computer including a policy file that stores permissions for each of the functions , the permissions authorizing types of actions based on a source of the code and an executor of the code , a call stack that stores the functions and executors as frames in an order of invocation by the program , and an execution unit , the instructions causing the execution unit to perform the steps of : determining whether permissions associated with each of the frames on the call stack encompasses a type of the requested action (match commands) , wherein each of the frames includes a code identifier that identifies the source of the code for a corresponding one of the functions , and an executor identifier that identifies the executor on whose behalf the code is being executed ; denying the requested action when any of the permissions fail to encompass the type of requested action ; and performing the requested action when all of the permissions encompass the type of requested action . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands (requested action) to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6389540B1 CLAIM 8 . A computer-readable medium containing instructions for controlling a computer to perform an action requested by a program executing on the computer , the program invoking a plurality of functions that operate upon code during execution , the computer including a policy file that stores permissions for each of the functions , the permissions authorizing types of actions based on a source of the code and an executor of the code , a call stack that stores the functions and executors as frames in an order of invocation by the program , and an execution unit , the instructions causing the execution unit to perform the steps of : determining whether permissions associated with each of the frames on the call stack encompasses a type of the requested action (match commands) , wherein each of the frames includes a code identifier that identifies the source of the code for a corresponding one of the functions , and an executor identifier that identifies the executor on whose behalf the code is being executed ; denying the requested action when any of the permissions fail to encompass the type of requested action ; and performing the requested action when all of the permissions encompass the type of requested action . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JP2001202405A Filed: 2000-01-17 Issued: 2001-07-27 タスク関与者間のコミュニケーション機能を有するプロジェクト管理装置およびプロジェクト管理方法 (Original Assignee) Fuji Xerox Co Ltd; 富士ゼロックス株式会社 Shoichi Hayashi, 祥一 林 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (コンピュ) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 JP2001202405A CLAIM 11 【請求項１１】 プロジェクト管理用のプログラムを記 録したコンピュ (next polling, data processing system, next polling questions) ータ読み取り可能な記録媒体において、 ユーザの入力に基づいてプロジェクト管理におけるタス クの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とをコンピュータに実行させるために用いるコンピュー タ読み取り可能な記録媒体。 |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers (ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 JP2001202405A CLAIM 11 【請求項１１】 プロジェクト管理用のプログラムを記 録したコンピュ (next polling, data processing system, next polling questions) ータ読み取り可能な記録媒体において、 ユーザの入力に基づいてプロジェクト管理におけるタス クの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とをコンピュータに実行させるために用いるコンピュー タ読み取り可能な記録媒体。 |
| US9087321B2 CLAIM 3 . The poll-based networking system as set forth in claim 2 , wherein in cumulatively comparing , the one or more processors are further configured to perform operations of : matching the user to other users based upon all of the selected answers (ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 4 . The poll-based networking system as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match (自動生成) percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2001202405A CLAIM 1 【請求項１】 プロジェクト管理における各タスクの管 理情報を格納するタスク管理情報格納手段と、 各タスクに対応して格納されるべき情報の情報格納領域 へのポインタを格納するコミュニケーション場ポインタ 格納手段と、 新規タスクの管理情報を入力する際に、新たな情報格納 領域を自動的に生成し、前記コミュニケーション場ポイ ンタ格納手段にその新たに生成した情報格納領域へのポ インタを自動的に格納するコミュニケーション場生成手 段と、 各タスクからコミュニケーション場へのリンク情報を含 むプロジェクト管理のスケジュール表を自動生成 (minimum match) するリ ンク付きスケジュール表生成手段とを有することを特徴 とするプロジェクト管理装置。 |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (読み取り) means to execute the instruction means (の指示) to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2001202405A CLAIM 5 【請求項５】 プロジェクト管理における各タスクの管 理情報を格納するタスク管理情報格納手段と、 各タスクに対応する電子文書の格納領域を保持するタス ク文書格納手段と、 各タスクに対応するメッセージを保持する電子掲示手段 とを有するプロジェクト管理システムであって、 新規タスクの管理情報を生成する際に、タスク管理情報 格納手段への指示 (readable instruction, instruction means, readable instruction means) 入力により、該タスクに対応する、新 たなタスク文書格納領域と新たな電子掲示板の会議室を 自動的に生成し、 前記タスク管理情報格納手段に対して、新たに生成した 領域へのポインタを自動的に格納し、 各タスクの管理情報と、該タスクに対応するタスク文 書、電子掲示板の会議室のいづれかないし双方へのリン ク情報を含むプロジェクト管理のスケジュール表を自動 生成することを特徴とするプロジェクト管理装置。 JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 JP2001202405A CLAIM 11 【請求項１１】 プロジェクト管理用のプログラムを記 録したコンピュータ読み取り (computer executable instruction) 可能な記録媒体において、 ユーザの入力に基づいてプロジェクト管理におけるタス クの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とをコンピュータに実行させるために用いるコンピュー タ読み取り可能な記録媒体。 |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers (ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 JP2001202405A CLAIM 11 【請求項１１】 プロジェクト管理用のプログラムを記 録したコンピュ (next polling, data processing system, next polling questions) ータ読み取り可能な記録媒体において、 ユーザの入力に基づいてプロジェクト管理におけるタス クの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とをコンピュータに実行させるために用いるコンピュー タ読み取り可能な記録媒体。 |
| US9087321B2 CLAIM 12 . The computer implemented method as set forth in claim 11 , wherein , in cumulatively comparing , further comprising an act of causing the one or more processors to perform operations of : matching the user to other users based upon all of the selected answers (ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , further comprising an act of causing the one or more processors to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match (自動生成) percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2001202405A CLAIM 1 【請求項１】 プロジェクト管理における各タスクの管 理情報を格納するタスク管理情報格納手段と、 各タスクに対応して格納されるべき情報の情報格納領域 へのポインタを格納するコミュニケーション場ポインタ 格納手段と、 新規タスクの管理情報を入力する際に、新たな情報格納 領域を自動的に生成し、前記コミュニケーション場ポイ ンタ格納手段にその新たに生成した情報格納領域へのポ インタを自動的に格納するコミュニケーション場生成手 段と、 各タスクからコミュニケーション場へのリンク情報を含 むプロジェクト管理のスケジュール表を自動生成 (minimum match) するリ ンク付きスケジュール表生成手段とを有することを特徴 とするプロジェクト管理装置。 |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means (の指示) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers (ユーザ) of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JP2001202405A CLAIM 5 【請求項５】 プロジェクト管理における各タスクの管 理情報を格納するタスク管理情報格納手段と、 各タスクに対応する電子文書の格納領域を保持するタス ク文書格納手段と、 各タスクに対応するメッセージを保持する電子掲示手段 とを有するプロジェクト管理システムであって、 新規タスクの管理情報を生成する際に、タスク管理情報 格納手段への指示 (readable instruction, instruction means, readable instruction means) 入力により、該タスクに対応する、新 たなタスク文書格納領域と新たな電子掲示板の会議室を 自動的に生成し、 前記タスク管理情報格納手段に対して、新たに生成した 領域へのポインタを自動的に格納し、 各タスクの管理情報と、該タスクに対応するタスク文 書、電子掲示板の会議室のいづれかないし双方へのリン ク情報を含むプロジェクト管理のスケジュール表を自動 生成することを特徴とするプロジェクト管理装置。 JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means (の指示) for causing the computer to perform operations of : providing the user with a next polling (コンピュ) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers (ユーザ) of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JP2001202405A CLAIM 5 【請求項５】 プロジェクト管理における各タスクの管 理情報を格納するタスク管理情報格納手段と、 各タスクに対応する電子文書の格納領域を保持するタス ク文書格納手段と、 各タスクに対応するメッセージを保持する電子掲示手段 とを有するプロジェクト管理システムであって、 新規タスクの管理情報を生成する際に、タスク管理情報 格納手段への指示 (readable instruction, instruction means, readable instruction means) 入力により、該タスクに対応する、新 たなタスク文書格納領域と新たな電子掲示板の会議室を 自動的に生成し、 前記タスク管理情報格納手段に対して、新たに生成した 領域へのポインタを自動的に格納し、 各タスクの管理情報と、該タスクに対応するタスク文 書、電子掲示板の会議室のいづれかないし双方へのリン ク情報を含むプロジェクト管理のスケジュール表を自動 生成することを特徴とするプロジェクト管理装置。 JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 JP2001202405A CLAIM 11 【請求項１１】 プロジェクト管理用のプログラムを記 録したコンピュ (next polling, data processing system, next polling questions) ータ読み取り可能な記録媒体において、 ユーザの入力に基づいてプロジェクト管理におけるタス クの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とをコンピュータに実行させるために用いるコンピュー タ読み取り可能な記録媒体。 |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means (の指示) for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers (ユーザ) by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JP2001202405A CLAIM 5 【請求項５】 プロジェクト管理における各タスクの管 理情報を格納するタスク管理情報格納手段と、 各タスクに対応する電子文書の格納領域を保持するタス ク文書格納手段と、 各タスクに対応するメッセージを保持する電子掲示手段 とを有するプロジェクト管理システムであって、 新規タスクの管理情報を生成する際に、タスク管理情報 格納手段への指示 (readable instruction, instruction means, readable instruction means) 入力により、該タスクに対応する、新 たなタスク文書格納領域と新たな電子掲示板の会議室を 自動的に生成し、 前記タスク管理情報格納手段に対して、新たに生成した 領域へのポインタを自動的に格納し、 各タスクの管理情報と、該タスクに対応するタスク文 書、電子掲示板の会議室のいづれかないし双方へのリン ク情報を含むプロジェクト管理のスケジュール表を自動 生成することを特徴とするプロジェクト管理装置。 JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means (の指示) for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers (ユーザ) between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JP2001202405A CLAIM 5 【請求項５】 プロジェクト管理における各タスクの管 理情報を格納するタスク管理情報格納手段と、 各タスクに対応する電子文書の格納領域を保持するタス ク文書格納手段と、 各タスクに対応するメッセージを保持する電子掲示手段 とを有するプロジェクト管理システムであって、 新規タスクの管理情報を生成する際に、タスク管理情報 格納手段への指示 (readable instruction, instruction means, readable instruction means) 入力により、該タスクに対応する、新 たなタスク文書格納領域と新たな電子掲示板の会議室を 自動的に生成し、 前記タスク管理情報格納手段に対して、新たに生成した 領域へのポインタを自動的に格納し、 各タスクの管理情報と、該タスクに対応するタスク文 書、電子掲示板の会議室のいづれかないし双方へのリン ク情報を含むプロジェクト管理のスケジュール表を自動 生成することを特徴とするプロジェクト管理装置。 JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means (の指示) for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match (自動生成) percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JP2001202405A CLAIM 1 【請求項１】 プロジェクト管理における各タスクの管 理情報を格納するタスク管理情報格納手段と、 各タスクに対応して格納されるべき情報の情報格納領域 へのポインタを格納するコミュニケーション場ポインタ 格納手段と、 新規タスクの管理情報を入力する際に、新たな情報格納 領域を自動的に生成し、前記コミュニケーション場ポイ ンタ格納手段にその新たに生成した情報格納領域へのポ インタを自動的に格納するコミュニケーション場生成手 段と、 各タスクからコミュニケーション場へのリンク情報を含 むプロジェクト管理のスケジュール表を自動生成 (minimum match) するリ ンク付きスケジュール表生成手段とを有することを特徴 とするプロジェクト管理装置。 JP2001202405A CLAIM 5 【請求項５】 プロジェクト管理における各タスクの管 理情報を格納するタスク管理情報格納手段と、 各タスクに対応する電子文書の格納領域を保持するタス ク文書格納手段と、 各タスクに対応するメッセージを保持する電子掲示手段 とを有するプロジェクト管理システムであって、 新規タスクの管理情報を生成する際に、タスク管理情報 格納手段への指示 (readable instruction, instruction means, readable instruction means) 入力により、該タスクに対応する、新 たなタスク文書格納領域と新たな電子掲示板の会議室を 自動的に生成し、 前記タスク管理情報格納手段に対して、新たに生成した 領域へのポインタを自動的に格納し、 各タスクの管理情報と、該タスクに対応するタスク文 書、電子掲示板の会議室のいづれかないし双方へのリン ク情報を含むプロジェクト管理のスケジュール表を自動 生成することを特徴とするプロジェクト管理装置。 |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means (の指示) for causing the computer to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2001202405A CLAIM 5 【請求項５】 プロジェクト管理における各タスクの管 理情報を格納するタスク管理情報格納手段と、 各タスクに対応する電子文書の格納領域を保持するタス ク文書格納手段と、 各タスクに対応するメッセージを保持する電子掲示手段 とを有するプロジェクト管理システムであって、 新規タスクの管理情報を生成する際に、タスク管理情報 格納手段への指示 (readable instruction, instruction means, readable instruction means) 入力により、該タスクに対応する、新 たなタスク文書格納領域と新たな電子掲示板の会議室を 自動的に生成し、 前記タスク管理情報格納手段に対して、新たに生成した 領域へのポインタを自動的に格納し、 各タスクの管理情報と、該タスクに対応するタスク文 書、電子掲示板の会議室のいづれかないし双方へのリン ク情報を含むプロジェクト管理のスケジュール表を自動 生成することを特徴とするプロジェクト管理装置。 JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means (の指示) for causing the computer to perform operations of : collecting the selected answers (ユーザ) with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JP2001202405A CLAIM 5 【請求項５】 プロジェクト管理における各タスクの管 理情報を格納するタスク管理情報格納手段と、 各タスクに対応する電子文書の格納領域を保持するタス ク文書格納手段と、 各タスクに対応するメッセージを保持する電子掲示手段 とを有するプロジェクト管理システムであって、 新規タスクの管理情報を生成する際に、タスク管理情報 格納手段への指示 (readable instruction, instruction means, readable instruction means) 入力により、該タスクに対応する、新 たなタスク文書格納領域と新たな電子掲示板の会議室を 自動的に生成し、 前記タスク管理情報格納手段に対して、新たに生成した 領域へのポインタを自動的に格納し、 各タスクの管理情報と、該タスクに対応するタスク文 書、電子掲示板の会議室のいづれかないし双方へのリン ク情報を含むプロジェクト管理のスケジュール表を自動 生成することを特徴とするプロジェクト管理装置。 JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers (ユーザ) of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
JP2001202405A CLAIM 10 【請求項１０】 ユーザ (selected answers) の入力に基づいてプロジェクト 管理におけるタスクの管理情報を格納するステップと、 新規タスクの管理情報の少なくとも一部を入力する際 に、当該タスクに対応して格納されるべき情報の情報格 納領域を生成するステップと、 上記新規タスクの管理情報の少なくとも一部を入力する 際に、上記情報格納領域へのポインタを自動的に格納す るステップと、 上記タスクの管理情報および上記ポインタに基づいて、 当該タスクから上記情報格納領域へのリンク情報を含む プロジェクト管理のスケジュール表を生成するステップ とを有することを特徴とするプロジェクト管理方法。 |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US7035825B1 Filed: 2000-01-04 Issued: 2006-04-25 Managing relationships of parties interacting on a network (Original Assignee) E piphany Inc (Current Assignee) E piphany Inc Reed Padi Maw Sturtevant, George A. Eberstadt, Jeffrey A. Kresch |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profiles) of other users that have a likelihood of match within a predetermined threshold . |
US7035825B1 CLAIM 16 . An apparatus comprising : a source of digital facilities ; an electronic communication medium coupled between the source and users to make at least one of the digital facilities available to the users ; and storage means containing user profiles (user profiles) for each of the users , said user profiles are used to manage relationships that are defined between clients via the electronic communication medium with respect to the at least one digital facility , said user profile of each user comprising : preference information reflecting one or more preferences of the user with respect to at least one of the digital facilities ; access information regarding the power of the user to access at least one of the digital facilities ; and grant information regarding the power of the user to grant a permission to another user with respect to at least one of the digital facilities , the grant permission with respect to at least one of the digital facilities determined by a combination of an individual permission and a company permission . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profiles) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7035825B1 CLAIM 16 . An apparatus comprising : a source of digital facilities ; an electronic communication medium coupled between the source and users to make at least one of the digital facilities available to the users ; and storage means containing user profiles (user profiles) for each of the users , said user profiles are used to manage relationships that are defined between clients via the electronic communication medium with respect to the at least one digital facility , said user profile of each user comprising : preference information reflecting one or more preferences of the user with respect to at least one of the digital facilities ; access information regarding the power of the user to access at least one of the digital facilities ; and grant information regarding the power of the user to grant a permission to another user with respect to at least one of the digital facilities , the grant permission with respect to at least one of the digital facilities determined by a combination of an individual permission and a company permission . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7035825B1 CLAIM 6 . The method of claim 1 in which the source comprises a web server (web server) . US7035825B1 CLAIM 14 . A computer readable medium (match server) storing a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7035825B1 CLAIM 14 . A computer readable medium (match server) storing a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7035825B1 CLAIM 6 . The method of claim 1 in which the source comprises a web server (web server) . US7035825B1 CLAIM 14 . A computer readable medium (match server) storing a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7035825B1 CLAIM 14 . A computer readable medium (match server) storing a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means (readable medium storing) to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profiles) of other users that have a likelihood of match within a predetermined threshold . |
US7035825B1 CLAIM 7 . The method of claim 1 in which the clients comprise individuals using web browser (executable instruction, computer executable instruction) s . US7035825B1 CLAIM 14 . A computer readable medium storing (instruction means) a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . US7035825B1 CLAIM 16 . An apparatus comprising : a source of digital facilities ; an electronic communication medium coupled between the source and users to make at least one of the digital facilities available to the users ; and storage means containing user profiles (user profiles) for each of the users , said user profiles are used to manage relationships that are defined between clients via the electronic communication medium with respect to the at least one digital facility , said user profile of each user comprising : preference information reflecting one or more preferences of the user with respect to at least one of the digital facilities ; access information regarding the power of the user to access at least one of the digital facilities ; and grant information regarding the power of the user to grant a permission to another user with respect to at least one of the digital facilities , the grant permission with respect to at least one of the digital facilities determined by a combination of an individual permission and a company permission . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profiles) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7035825B1 CLAIM 16 . An apparatus comprising : a source of digital facilities ; an electronic communication medium coupled between the source and users to make at least one of the digital facilities available to the users ; and storage means containing user profiles (user profiles) for each of the users , said user profiles are used to manage relationships that are defined between clients via the electronic communication medium with respect to the at least one digital facility , said user profile of each user comprising : preference information reflecting one or more preferences of the user with respect to at least one of the digital facilities ; access information regarding the power of the user to access at least one of the digital facilities ; and grant information regarding the power of the user to grant a permission to another user with respect to at least one of the digital facilities , the grant permission with respect to at least one of the digital facilities determined by a combination of an individual permission and a company permission . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7035825B1 CLAIM 6 . The method of claim 1 in which the source comprises a web server (web server) . US7035825B1 CLAIM 14 . A computer readable medium (match server) storing a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7035825B1 CLAIM 14 . A computer readable medium (match server) storing a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7035825B1 CLAIM 6 . The method of claim 1 in which the source comprises a web server (web server) . US7035825B1 CLAIM 14 . A computer readable medium (match server) storing a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7035825B1 CLAIM 14 . A computer readable medium (match server) storing a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means (readable medium storing) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles (user profiles) of other users that have a likelihood of match within a predetermined threshold . |
US7035825B1 CLAIM 14 . A computer readable medium storing (instruction means) a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . US7035825B1 CLAIM 16 . An apparatus comprising : a source of digital facilities ; an electronic communication medium coupled between the source and users to make at least one of the digital facilities available to the users ; and storage means containing user profiles (user profiles) for each of the users , said user profiles are used to manage relationships that are defined between clients via the electronic communication medium with respect to the at least one digital facility , said user profile of each user comprising : preference information reflecting one or more preferences of the user with respect to at least one of the digital facilities ; access information regarding the power of the user to access at least one of the digital facilities ; and grant information regarding the power of the user to grant a permission to another user with respect to at least one of the digital facilities , the grant permission with respect to at least one of the digital facilities determined by a combination of an individual permission and a company permission . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means (readable medium storing) for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles (user profiles) of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US7035825B1 CLAIM 14 . A computer readable medium storing (instruction means) a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . US7035825B1 CLAIM 16 . An apparatus comprising : a source of digital facilities ; an electronic communication medium coupled between the source and users to make at least one of the digital facilities available to the users ; and storage means containing user profiles (user profiles) for each of the users , said user profiles are used to manage relationships that are defined between clients via the electronic communication medium with respect to the at least one digital facility , said user profile of each user comprising : preference information reflecting one or more preferences of the user with respect to at least one of the digital facilities ; access information regarding the power of the user to access at least one of the digital facilities ; and grant information regarding the power of the user to grant a permission to another user with respect to at least one of the digital facilities , the grant permission with respect to at least one of the digital facilities determined by a combination of an individual permission and a company permission . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means (readable medium storing) for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US7035825B1 CLAIM 14 . A computer readable medium storing (instruction means) a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means (readable medium storing) for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US7035825B1 CLAIM 14 . A computer readable medium storing (instruction means) a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means (readable medium storing) for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US7035825B1 CLAIM 14 . A computer readable medium storing (instruction means) a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means (readable medium storing) for causing the computer to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7035825B1 CLAIM 6 . The method of claim 1 in which the source comprises a web server (web server) . US7035825B1 CLAIM 14 . A computer readable medium (match server) storing a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7035825B1 CLAIM 14 . A computer readable medium (match server) storing a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means (readable medium storing) for causing the computer to perform operations of : collecting the selected answers with a web server (web server) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US7035825B1 CLAIM 6 . The method of claim 1 in which the source comprises a web server (web server) . US7035825B1 CLAIM 14 . A computer readable medium (match server) storing a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US7035825B1 CLAIM 14 . A computer readable medium (match server) storing a software program that is capable of configuring a machine to perform a process comprising : making at least one digital facility available from a source to clients via an electronic communication medium ; associating with at least one of the clients a preference information that reflects one or more preferences of the client ; associating with at least one of the clients an access permission that enables the client to access at least one of the digital facilities ; associating with at least one of the clients a grant permission that enables the client to give to another client a user permission with respect to at least one of the digital facilities , in which the user permission with respect to at least one of the digital facilities is determined by a combination of an individual permission and a company permission ; creating a client profile for each of the clients , based on the preference information and the permission information associated with the client ; and managing relationships that are defined between clients via the electronic communication medium with respect to the digital facility based on the profiles of the clients . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6950943B1 Filed: 1999-12-10 Issued: 2005-09-27 System for electronic repository of data enforcing access control on data search and retrieval (Original Assignee) International Business Machines Corp (Current Assignee) International Business Machines Corp Hamid Bacha, Robert Bruce Carroll, Lev Mirlas, Sung Wei Tchao |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (electronic document) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6950943B1 CLAIM 3 . A computer program product on a computer usable medium for maintaining a secure electronic data search system for a third party electronic data repository in which electronic data file documents are stored in encrypted form in the data repository to prevent access by the repository administrator such a system having a manifest to an electronic data document secure to the originator of the electronic document (first polling) listing document access privileges for each computer with access to the electronic data document stored in the repository , the program product comprising : software for updating the manifest for the electronic data file document stored in the repository ; software for identifying all computers with access to the electronic data file document and for changing such access in an update software for communicating the change in access to all affected computers ; software in the vault of the document originator to encrypt a document that it receives from the originator , prior to forwarding it on to the vault of the repository administrator ; software in the vault of the repository which on receipt of the encrypted document , signs the encrypted document before storing the document in the electronic repository and returning to the originator' ; s vault proof of deposition of the encrypted document ; software in the vault of a requesting user to the repository' ; s vault to request use of the requested document ; software in repository' ; s vault to retrieve a copy of the document in encrypted form which is forwarded , along with the requester' ; s identity , to the originator' ; s vault ; software in the originator' ; s vault to verify that the requester is authorized to view the document using an access control list identifying access ownership privileges for the document stored in the vault itself ; software in the originator' ; s vault when the requester has access decrypts the document and forwards the decrypted document directly to the requester' ; s vault ; and software in the requester' ; s vault to provide proof of receipt of the decrypted document . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (electronic document) question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6950943B1 CLAIM 3 . A computer program product on a computer usable medium for maintaining a secure electronic data search system for a third party electronic data repository in which electronic data file documents are stored in encrypted form in the data repository to prevent access by the repository administrator such a system having a manifest to an electronic data document secure to the originator of the electronic document (first polling) listing document access privileges for each computer with access to the electronic data document stored in the repository , the program product comprising : software for updating the manifest for the electronic data file document stored in the repository ; software for identifying all computers with access to the electronic data file document and for changing such access in an update software for communicating the change in access to all affected computers ; software in the vault of the document originator to encrypt a document that it receives from the originator , prior to forwarding it on to the vault of the repository administrator ; software in the vault of the repository which on receipt of the encrypted document , signs the encrypted document before storing the document in the electronic repository and returning to the originator' ; s vault proof of deposition of the encrypted document ; software in the vault of a requesting user to the repository' ; s vault to request use of the requested document ; software in repository' ; s vault to retrieve a copy of the document in encrypted form which is forwarded , along with the requester' ; s identity , to the originator' ; s vault ; software in the originator' ; s vault to verify that the requester is authorized to view the document using an access control list identifying access ownership privileges for the document stored in the vault itself ; software in the originator' ; s vault when the requester has access decrypts the document and forwards the decrypted document directly to the requester' ; s vault ; and software in the requester' ; s vault to provide proof of receipt of the decrypted document . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (electronic document) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6950943B1 CLAIM 3 . A computer program product on a computer usable medium for maintaining a secure electronic data search system for a third party electronic data repository in which electronic data file documents are stored in encrypted form in the data repository to prevent access by the repository administrator such a system having a manifest to an electronic data document secure to the originator of the electronic document (first polling) listing document access privileges for each computer with access to the electronic data document stored in the repository , the program product comprising : software for updating the manifest for the electronic data file document stored in the repository ; software for identifying all computers with access to the electronic data file document and for changing such access in an update software for communicating the change in access to all affected computers ; software in the vault of the document originator to encrypt a document that it receives from the originator , prior to forwarding it on to the vault of the repository administrator ; software in the vault of the repository which on receipt of the encrypted document , signs the encrypted document before storing the document in the electronic repository and returning to the originator' ; s vault proof of deposition of the encrypted document ; software in the vault of a requesting user to the repository' ; s vault to request use of the requested document ; software in repository' ; s vault to retrieve a copy of the document in encrypted form which is forwarded , along with the requester' ; s identity , to the originator' ; s vault ; software in the originator' ; s vault to verify that the requester is authorized to view the document using an access control list identifying access ownership privileges for the document stored in the vault itself ; software in the originator' ; s vault when the requester has access decrypts the document and forwards the decrypted document directly to the requester' ; s vault ; and software in the requester' ; s vault to provide proof of receipt of the decrypted document . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (electronic document) question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6950943B1 CLAIM 3 . A computer program product on a computer usable medium for maintaining a secure electronic data search system for a third party electronic data repository in which electronic data file documents are stored in encrypted form in the data repository to prevent access by the repository administrator such a system having a manifest to an electronic data document secure to the originator of the electronic document (first polling) listing document access privileges for each computer with access to the electronic data document stored in the repository , the program product comprising : software for updating the manifest for the electronic data file document stored in the repository ; software for identifying all computers with access to the electronic data file document and for changing such access in an update software for communicating the change in access to all affected computers ; software in the vault of the document originator to encrypt a document that it receives from the originator , prior to forwarding it on to the vault of the repository administrator ; software in the vault of the repository which on receipt of the encrypted document , signs the encrypted document before storing the document in the electronic repository and returning to the originator' ; s vault proof of deposition of the encrypted document ; software in the vault of a requesting user to the repository' ; s vault to request use of the requested document ; software in repository' ; s vault to retrieve a copy of the document in encrypted form which is forwarded , along with the requester' ; s identity , to the originator' ; s vault ; software in the originator' ; s vault to verify that the requester is authorized to view the document using an access control list identifying access ownership privileges for the document stored in the vault itself ; software in the originator' ; s vault when the requester has access decrypts the document and forwards the decrypted document directly to the requester' ; s vault ; and software in the requester' ; s vault to provide proof of receipt of the decrypted document . |
| US9087321B2 CLAIM 19 . A computer program product (computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (electronic document) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6950943B1 CLAIM 1 . A computer program product (computer program product) on a computer usable medium for maintaining a secure electronic data search system for a third party electronic data repository in which electronic data file documents are stored in encrypted form in the data repository to prevent access by the repository administrator such a system having a record listing document access privileges for each computer with access to electronic data stored in the repository the program product comprising : software for updating a manifest for an electronic data file document stored in the repository ; software for identifying all computers with access to the electronic data file document and for changing such access in an update software for communicating the change in access to all affected computers ; software for updating access privileges records in all affected software ; and software for communicating the access privilege records to the affected computers ; software in a vault of the document originator to encrypt a document that it receives from the originator , prior to forwarding it onto the electric data vault of the repository ; software in a vault of the repository administrator which on receipt of the encrypted document , signs the encrypted document itself before storing the document in the electronic data repository and returns to the originator' ; s vault proof of deposition of the encrypted document ; software in a vault of a requesting user to request the repository' ; s vault for use of the requested document ; software in the repository' ; s vault to retrieve a copy of the document in encrypted form which is forwarded , along with the requester' ; s identity , to the originator' ; s vault ; software in the originator' ; s vault to verify that the requester is authorized to view the document from the access control list using an access control list identifying access ownership privileges for the document stored in the vault itself ; software in the originator' ; s vault when the requester has access to decrypt the document and forward the decrypted document directly to the requester' ; s vault ; and software in the requester' ; s vault to provide proof of receipt of the decrypted document wherein the originators of the electronic data files , users of the electronic data files and the repository administrator all have vaults which are secure extensions of their respective work space . US6950943B1 CLAIM 3 . A computer program product on a computer usable medium for maintaining a secure electronic data search system for a third party electronic data repository in which electronic data file documents are stored in encrypted form in the data repository to prevent access by the repository administrator such a system having a manifest to an electronic data document secure to the originator of the electronic document (first polling) listing document access privileges for each computer with access to the electronic data document stored in the repository , the program product comprising : software for updating the manifest for the electronic data file document stored in the repository ; software for identifying all computers with access to the electronic data file document and for changing such access in an update software for communicating the change in access to all affected computers ; software in the vault of the document originator to encrypt a document that it receives from the originator , prior to forwarding it on to the vault of the repository administrator ; software in the vault of the repository which on receipt of the encrypted document , signs the encrypted document before storing the document in the electronic repository and returning to the originator' ; s vault proof of deposition of the encrypted document ; software in the vault of a requesting user to the repository' ; s vault to request use of the requested document ; software in repository' ; s vault to retrieve a copy of the document in encrypted form which is forwarded , along with the requester' ; s identity , to the originator' ; s vault ; software in the originator' ; s vault to verify that the requester is authorized to view the document using an access control list identifying access ownership privileges for the document stored in the vault itself ; software in the originator' ; s vault when the requester has access decrypts the document and forwards the decrypted document directly to the requester' ; s vault ; and software in the requester' ; s vault to provide proof of receipt of the decrypted document . |
| US9087321B2 CLAIM 20 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (electronic document) question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6950943B1 CLAIM 1 . A computer program product (computer program product) on a computer usable medium for maintaining a secure electronic data search system for a third party electronic data repository in which electronic data file documents are stored in encrypted form in the data repository to prevent access by the repository administrator such a system having a record listing document access privileges for each computer with access to electronic data stored in the repository the program product comprising : software for updating a manifest for an electronic data file document stored in the repository ; software for identifying all computers with access to the electronic data file document and for changing such access in an update software for communicating the change in access to all affected computers ; software for updating access privileges records in all affected software ; and software for communicating the access privilege records to the affected computers ; software in a vault of the document originator to encrypt a document that it receives from the originator , prior to forwarding it onto the electric data vault of the repository ; software in a vault of the repository administrator which on receipt of the encrypted document , signs the encrypted document itself before storing the document in the electronic data repository and returns to the originator' ; s vault proof of deposition of the encrypted document ; software in a vault of a requesting user to request the repository' ; s vault for use of the requested document ; software in the repository' ; s vault to retrieve a copy of the document in encrypted form which is forwarded , along with the requester' ; s identity , to the originator' ; s vault ; software in the originator' ; s vault to verify that the requester is authorized to view the document from the access control list using an access control list identifying access ownership privileges for the document stored in the vault itself ; software in the originator' ; s vault when the requester has access to decrypt the document and forward the decrypted document directly to the requester' ; s vault ; and software in the requester' ; s vault to provide proof of receipt of the decrypted document wherein the originators of the electronic data files , users of the electronic data files and the repository administrator all have vaults which are secure extensions of their respective work space . US6950943B1 CLAIM 3 . A computer program product on a computer usable medium for maintaining a secure electronic data search system for a third party electronic data repository in which electronic data file documents are stored in encrypted form in the data repository to prevent access by the repository administrator such a system having a manifest to an electronic data document secure to the originator of the electronic document (first polling) listing document access privileges for each computer with access to the electronic data document stored in the repository , the program product comprising : software for updating the manifest for the electronic data file document stored in the repository ; software for identifying all computers with access to the electronic data file document and for changing such access in an update software for communicating the change in access to all affected computers ; software in the vault of the document originator to encrypt a document that it receives from the originator , prior to forwarding it on to the vault of the repository administrator ; software in the vault of the repository which on receipt of the encrypted document , signs the encrypted document before storing the document in the electronic repository and returning to the originator' ; s vault proof of deposition of the encrypted document ; software in the vault of a requesting user to the repository' ; s vault to request use of the requested document ; software in repository' ; s vault to retrieve a copy of the document in encrypted form which is forwarded , along with the requester' ; s identity , to the originator' ; s vault ; software in the originator' ; s vault to verify that the requester is authorized to view the document using an access control list identifying access ownership privileges for the document stored in the vault itself ; software in the originator' ; s vault when the requester has access decrypts the document and forwards the decrypted document directly to the requester' ; s vault ; and software in the requester' ; s vault to provide proof of receipt of the decrypted document . |
| US9087321B2 CLAIM 21 . The computer program product (computer program product) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US6950943B1 CLAIM 1 . A computer program product (computer program product) on a computer usable medium for maintaining a secure electronic data search system for a third party electronic data repository in which electronic data file documents are stored in encrypted form in the data repository to prevent access by the repository administrator such a system having a record listing document access privileges for each computer with access to electronic data stored in the repository the program product comprising : software for updating a manifest for an electronic data file document stored in the repository ; software for identifying all computers with access to the electronic data file document and for changing such access in an update software for communicating the change in access to all affected computers ; software for updating access privileges records in all affected software ; and software for communicating the access privilege records to the affected computers ; software in a vault of the document originator to encrypt a document that it receives from the originator , prior to forwarding it onto the electric data vault of the repository ; software in a vault of the repository administrator which on receipt of the encrypted document , signs the encrypted document itself before storing the document in the electronic data repository and returns to the originator' ; s vault proof of deposition of the encrypted document ; software in a vault of a requesting user to request the repository' ; s vault for use of the requested document ; software in the repository' ; s vault to retrieve a copy of the document in encrypted form which is forwarded , along with the requester' ; s identity , to the originator' ; s vault ; software in the originator' ; s vault to verify that the requester is authorized to view the document from the access control list using an access control list identifying access ownership privileges for the document stored in the vault itself ; software in the originator' ; s vault when the requester has access to decrypt the document and forward the decrypted document directly to the requester' ; s vault ; and software in the requester' ; s vault to provide proof of receipt of the decrypted document wherein the originators of the electronic data files , users of the electronic data files and the repository administrator all have vaults which are secure extensions of their respective work space . |
| US9087321B2 CLAIM 22 . The computer program product (computer program product) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US6950943B1 CLAIM 1 . A computer program product (computer program product) on a computer usable medium for maintaining a secure electronic data search system for a third party electronic data repository in which electronic data file documents are stored in encrypted form in the data repository to prevent access by the repository administrator such a system having a record listing document access privileges for each computer with access to electronic data stored in the repository the program product comprising : software for updating a manifest for an electronic data file document stored in the repository ; software for identifying all computers with access to the electronic data file document and for changing such access in an update software for communicating the change in access to all affected computers ; software for updating access privileges records in all affected software ; and software for communicating the access privilege records to the affected computers ; software in a vault of the document originator to encrypt a document that it receives from the originator , prior to forwarding it onto the electric data vault of the repository ; software in a vault of the repository administrator which on receipt of the encrypted document , signs the encrypted document itself before storing the document in the electronic data repository and returns to the originator' ; s vault proof of deposition of the encrypted document ; software in a vault of a requesting user to request the repository' ; s vault for use of the requested document ; software in the repository' ; s vault to retrieve a copy of the document in encrypted form which is forwarded , along with the requester' ; s identity , to the originator' ; s vault ; software in the originator' ; s vault to verify that the requester is authorized to view the document from the access control list using an access control list identifying access ownership privileges for the document stored in the vault itself ; software in the originator' ; s vault when the requester has access to decrypt the document and forward the decrypted document directly to the requester' ; s vault ; and software in the requester' ; s vault to provide proof of receipt of the decrypted document wherein the originators of the electronic data files , users of the electronic data files and the repository administrator all have vaults which are secure extensions of their respective work space . |
| US9087321B2 CLAIM 23 . The computer program product (computer program product) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6950943B1 CLAIM 1 . A computer program product (computer program product) on a computer usable medium for maintaining a secure electronic data search system for a third party electronic data repository in which electronic data file documents are stored in encrypted form in the data repository to prevent access by the repository administrator such a system having a record listing document access privileges for each computer with access to electronic data stored in the repository the program product comprising : software for updating a manifest for an electronic data file document stored in the repository ; software for identifying all computers with access to the electronic data file document and for changing such access in an update software for communicating the change in access to all affected computers ; software for updating access privileges records in all affected software ; and software for communicating the access privilege records to the affected computers ; software in a vault of the document originator to encrypt a document that it receives from the originator , prior to forwarding it onto the electric data vault of the repository ; software in a vault of the repository administrator which on receipt of the encrypted document , signs the encrypted document itself before storing the document in the electronic data repository and returns to the originator' ; s vault proof of deposition of the encrypted document ; software in a vault of a requesting user to request the repository' ; s vault for use of the requested document ; software in the repository' ; s vault to retrieve a copy of the document in encrypted form which is forwarded , along with the requester' ; s identity , to the originator' ; s vault ; software in the originator' ; s vault to verify that the requester is authorized to view the document from the access control list using an access control list identifying access ownership privileges for the document stored in the vault itself ; software in the originator' ; s vault when the requester has access to decrypt the document and forward the decrypted document directly to the requester' ; s vault ; and software in the requester' ; s vault to provide proof of receipt of the decrypted document wherein the originators of the electronic data files , users of the electronic data files and the repository administrator all have vaults which are secure extensions of their respective work space . |
| US9087321B2 CLAIM 24 . The computer program product (computer program product) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6950943B1 CLAIM 1 . A computer program product (computer program product) on a computer usable medium for maintaining a secure electronic data search system for a third party electronic data repository in which electronic data file documents are stored in encrypted form in the data repository to prevent access by the repository administrator such a system having a record listing document access privileges for each computer with access to electronic data stored in the repository the program product comprising : software for updating a manifest for an electronic data file document stored in the repository ; software for identifying all computers with access to the electronic data file document and for changing such access in an update software for communicating the change in access to all affected computers ; software for updating access privileges records in all affected software ; and software for communicating the access privilege records to the affected computers ; software in a vault of the document originator to encrypt a document that it receives from the originator , prior to forwarding it onto the electric data vault of the repository ; software in a vault of the repository administrator which on receipt of the encrypted document , signs the encrypted document itself before storing the document in the electronic data repository and returns to the originator' ; s vault proof of deposition of the encrypted document ; software in a vault of a requesting user to request the repository' ; s vault for use of the requested document ; software in the repository' ; s vault to retrieve a copy of the document in encrypted form which is forwarded , along with the requester' ; s identity , to the originator' ; s vault ; software in the originator' ; s vault to verify that the requester is authorized to view the document from the access control list using an access control list identifying access ownership privileges for the document stored in the vault itself ; software in the originator' ; s vault when the requester has access to decrypt the document and forward the decrypted document directly to the requester' ; s vault ; and software in the requester' ; s vault to provide proof of receipt of the decrypted document wherein the originators of the electronic data files , users of the electronic data files and the repository administrator all have vaults which are secure extensions of their respective work space . |
| US9087321B2 CLAIM 25 . The computer program product (computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6950943B1 CLAIM 1 . A computer program product (computer program product) on a computer usable medium for maintaining a secure electronic data search system for a third party electronic data repository in which electronic data file documents are stored in encrypted form in the data repository to prevent access by the repository administrator such a system having a record listing document access privileges for each computer with access to electronic data stored in the repository the program product comprising : software for updating a manifest for an electronic data file document stored in the repository ; software for identifying all computers with access to the electronic data file document and for changing such access in an update software for communicating the change in access to all affected computers ; software for updating access privileges records in all affected software ; and software for communicating the access privilege records to the affected computers ; software in a vault of the document originator to encrypt a document that it receives from the originator , prior to forwarding it onto the electric data vault of the repository ; software in a vault of the repository administrator which on receipt of the encrypted document , signs the encrypted document itself before storing the document in the electronic data repository and returns to the originator' ; s vault proof of deposition of the encrypted document ; software in a vault of a requesting user to request the repository' ; s vault for use of the requested document ; software in the repository' ; s vault to retrieve a copy of the document in encrypted form which is forwarded , along with the requester' ; s identity , to the originator' ; s vault ; software in the originator' ; s vault to verify that the requester is authorized to view the document from the access control list using an access control list identifying access ownership privileges for the document stored in the vault itself ; software in the originator' ; s vault when the requester has access to decrypt the document and forward the decrypted document directly to the requester' ; s vault ; and software in the requester' ; s vault to provide proof of receipt of the decrypted document wherein the originators of the electronic data files , users of the electronic data files and the repository administrator all have vaults which are secure extensions of their respective work space . |
| US9087321B2 CLAIM 26 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6950943B1 CLAIM 1 . A computer program product (computer program product) on a computer usable medium for maintaining a secure electronic data search system for a third party electronic data repository in which electronic data file documents are stored in encrypted form in the data repository to prevent access by the repository administrator such a system having a record listing document access privileges for each computer with access to electronic data stored in the repository the program product comprising : software for updating a manifest for an electronic data file document stored in the repository ; software for identifying all computers with access to the electronic data file document and for changing such access in an update software for communicating the change in access to all affected computers ; software for updating access privileges records in all affected software ; and software for communicating the access privilege records to the affected computers ; software in a vault of the document originator to encrypt a document that it receives from the originator , prior to forwarding it onto the electric data vault of the repository ; software in a vault of the repository administrator which on receipt of the encrypted document , signs the encrypted document itself before storing the document in the electronic data repository and returns to the originator' ; s vault proof of deposition of the encrypted document ; software in a vault of a requesting user to request the repository' ; s vault for use of the requested document ; software in the repository' ; s vault to retrieve a copy of the document in encrypted form which is forwarded , along with the requester' ; s identity , to the originator' ; s vault ; software in the originator' ; s vault to verify that the requester is authorized to view the document from the access control list using an access control list identifying access ownership privileges for the document stored in the vault itself ; software in the originator' ; s vault when the requester has access to decrypt the document and forward the decrypted document directly to the requester' ; s vault ; and software in the requester' ; s vault to provide proof of receipt of the decrypted document wherein the originators of the electronic data files , users of the electronic data files and the repository administrator all have vaults which are secure extensions of their respective work space . |
| US9087321B2 CLAIM 27 . The computer program product (computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6950943B1 CLAIM 1 . A computer program product (computer program product) on a computer usable medium for maintaining a secure electronic data search system for a third party electronic data repository in which electronic data file documents are stored in encrypted form in the data repository to prevent access by the repository administrator such a system having a record listing document access privileges for each computer with access to electronic data stored in the repository the program product comprising : software for updating a manifest for an electronic data file document stored in the repository ; software for identifying all computers with access to the electronic data file document and for changing such access in an update software for communicating the change in access to all affected computers ; software for updating access privileges records in all affected software ; and software for communicating the access privilege records to the affected computers ; software in a vault of the document originator to encrypt a document that it receives from the originator , prior to forwarding it onto the electric data vault of the repository ; software in a vault of the repository administrator which on receipt of the encrypted document , signs the encrypted document itself before storing the document in the electronic data repository and returns to the originator' ; s vault proof of deposition of the encrypted document ; software in a vault of a requesting user to request the repository' ; s vault for use of the requested document ; software in the repository' ; s vault to retrieve a copy of the document in encrypted form which is forwarded , along with the requester' ; s identity , to the originator' ; s vault ; software in the originator' ; s vault to verify that the requester is authorized to view the document from the access control list using an access control list identifying access ownership privileges for the document stored in the vault itself ; software in the originator' ; s vault when the requester has access to decrypt the document and forward the decrypted document directly to the requester' ; s vault ; and software in the requester' ; s vault to provide proof of receipt of the decrypted document wherein the originators of the electronic data files , users of the electronic data files and the repository administrator all have vaults which are secure extensions of their respective work space . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6546397B1 Filed: 1999-12-02 Issued: 2003-04-08 Browser based web site generation tool and run time engine (Original Assignee) AKIRA TECHNOLOGIES Inc (Current Assignee) EXPRESS MOBILE Inc Steven H. Rempell |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (real time) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (more gene) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6546397B1 CLAIM 25 . The apparatus of claim 24 , wherein said run time files include a dynamic web page scaling mechanism , whereby each of said one or more gene (first polling, first polling question) rated web pages is scaled for viewing on said display . US6546397B1 CLAIM 36 . The apparatus of claim 35 , wherein the dynamic resizing apparatus can be invoked in real time (data processing system) during the build process when a new web site file is opened , when the web page size of the existing web site is changed , or when the web page is zoomed to a different size . |
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (more gene) question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6546397B1 CLAIM 25 . The apparatus of claim 24 , wherein said run time files include a dynamic web page scaling mechanism , whereby each of said one or more gene (first polling, first polling question) rated web pages is scaled for viewing on said display . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (more gene) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6546397B1 CLAIM 25 . The apparatus of claim 24 , wherein said run time files include a dynamic web page scaling mechanism , whereby each of said one or more gene (first polling, first polling question) rated web pages is scaled for viewing on said display . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (more gene) question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6546397B1 CLAIM 25 . The apparatus of claim 24 , wherein said run time files include a dynamic web page scaling mechanism , whereby each of said one or more gene (first polling, first polling question) rated web pages is scaled for viewing on said display . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling (more gene) question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6546397B1 CLAIM 25 . The apparatus of claim 24 , wherein said run time files include a dynamic web page scaling mechanism , whereby each of said one or more gene (first polling, first polling question) rated web pages is scaled for viewing on said display . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling (more gene) question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6546397B1 CLAIM 25 . The apparatus of claim 24 , wherein said run time files include a dynamic web page scaling mechanism , whereby each of said one or more gene (first polling, first polling question) rated web pages is scaled for viewing on said display . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6466983B1 Filed: 1999-09-30 Issued: 2002-10-15 Systems and methods for controlling access to data maintained in a repository (Original Assignee) Steven Paul Strazza (Current Assignee) Cuica LLC Steven Paul Strazza |
|---|---|
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (specific order) . |
US6466983B1 CLAIM 19 . The system of claim 18 , wherein the maintenance of historical information regarding previous transmissions made by the client further comprises : means for creating and maintaining a destination list , said list having elements appearing in a specific order (next polling questions, net polling question) , said elements each having a value that specifies a recognized transmission format and a position value specifying the relative position of said format within a data stream , said list being updated on demand ; means for creating and maintaining an expected forresta list , said list having elements appearing in a specific order , said elements each having a value that specifies a recognized forresta identity and a position value specifying the relative position of a transmission format within a data stream , said list being updated on demand ; and means for comparing the values of the forresta and destination fields of a transmission with the values of either of the destination and expected forresta lists , to determine whether or not said transmission should be inhibited . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (more values, page table) , to a plurality of match servers , each match server (more values, page table) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6466983B1 CLAIM 4 . The system of claim 2 , further including means for constructing a response page table (match aggregator, match server) that contains a unique entry for each fragment file list , said list to be used as the template for selecting and assembling data held by the repository into a transmission response as a result of receiving a forresta identity associated with a separate transmission ; and further including : means for constructing a reference map table for each said fragment file list contained within the response page table , said reference map table containing an entry for each placeholder found within fragment files identified by the list , said entry containing a position field whose value describes the relative offset position of the placeholder to other placeholders within the content of the fragment file , a parse index field whose value is the substitution index of the placeholder and a target field , whose value identifies the data held by the repository , said target field value representing the object of the placeholder . US6466983B1 CLAIM 14 . The system of claim 11 , wherein further including : means for determining access to said repository comprising a reference field means , a forresta identity field means , a destination field means and a supplementary items field means ; wherein said reference field means identifies the repository ; wherein said forresta identity field means conveys the privilege level and identity of the transmission ; wherein said destination field means identifies the specific data held by said repository that is to be assembled into a transmission for use by the client ; wherein said supplementary items field means contains zero or more values (match aggregator, match server) that are required to qualify the specific data being retrieved ; and the forresta identity field means is adapted to convey the privilege value and identity of the transmission of which it is a component , further comprising means for creating a forresta map table , each entry in said table containing one symbol whose appearance within said table is unique , and each said symbol being one of the upper-case characters “A” through “Z” inclusive , the lowercase characters “a” through “z” inclusive , and the character representations of the digits “1” through “9” inclusive , wherein one value of the forresta identity is created by selecting at least eight values from the forresta map table . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (more values, page table) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6466983B1 CLAIM 4 . The system of claim 2 , further including means for constructing a response page table (match aggregator, match server) that contains a unique entry for each fragment file list , said list to be used as the template for selecting and assembling data held by the repository into a transmission response as a result of receiving a forresta identity associated with a separate transmission ; and further including : means for constructing a reference map table for each said fragment file list contained within the response page table , said reference map table containing an entry for each placeholder found within fragment files identified by the list , said entry containing a position field whose value describes the relative offset position of the placeholder to other placeholders within the content of the fragment file , a parse index field whose value is the substitution index of the placeholder and a target field , whose value identifies the data held by the repository , said target field value representing the object of the placeholder . US6466983B1 CLAIM 14 . The system of claim 11 , wherein further including : means for determining access to said repository comprising a reference field means , a forresta identity field means , a destination field means and a supplementary items field means ; wherein said reference field means identifies the repository ; wherein said forresta identity field means conveys the privilege level and identity of the transmission ; wherein said destination field means identifies the specific data held by said repository that is to be assembled into a transmission for use by the client ; wherein said supplementary items field means contains zero or more values (match aggregator, match server) that are required to qualify the specific data being retrieved ; and the forresta identity field means is adapted to convey the privilege value and identity of the transmission of which it is a component , further comprising means for creating a forresta map table , each entry in said table containing one symbol whose appearance within said table is unique , and each said symbol being one of the upper-case characters “A” through “Z” inclusive , the lowercase characters “a” through “z” inclusive , and the character representations of the digits “1” through “9” inclusive , wherein one value of the forresta identity is created by selecting at least eight values from the forresta map table . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (more values, page table) , to a plurality of match servers , each match server (more values, page table) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6466983B1 CLAIM 4 . The system of claim 2 , further including means for constructing a response page table (match aggregator, match server) that contains a unique entry for each fragment file list , said list to be used as the template for selecting and assembling data held by the repository into a transmission response as a result of receiving a forresta identity associated with a separate transmission ; and further including : means for constructing a reference map table for each said fragment file list contained within the response page table , said reference map table containing an entry for each placeholder found within fragment files identified by the list , said entry containing a position field whose value describes the relative offset position of the placeholder to other placeholders within the content of the fragment file , a parse index field whose value is the substitution index of the placeholder and a target field , whose value identifies the data held by the repository , said target field value representing the object of the placeholder . US6466983B1 CLAIM 14 . The system of claim 11 , wherein further including : means for determining access to said repository comprising a reference field means , a forresta identity field means , a destination field means and a supplementary items field means ; wherein said reference field means identifies the repository ; wherein said forresta identity field means conveys the privilege level and identity of the transmission ; wherein said destination field means identifies the specific data held by said repository that is to be assembled into a transmission for use by the client ; wherein said supplementary items field means contains zero or more values (match aggregator, match server) that are required to qualify the specific data being retrieved ; and the forresta identity field means is adapted to convey the privilege value and identity of the transmission of which it is a component , further comprising means for creating a forresta map table , each entry in said table containing one symbol whose appearance within said table is unique , and each said symbol being one of the upper-case characters “A” through “Z” inclusive , the lowercase characters “a” through “z” inclusive , and the character representations of the digits “1” through “9” inclusive , wherein one value of the forresta identity is created by selecting at least eight values from the forresta map table . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (more values, page table) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6466983B1 CLAIM 4 . The system of claim 2 , further including means for constructing a response page table (match aggregator, match server) that contains a unique entry for each fragment file list , said list to be used as the template for selecting and assembling data held by the repository into a transmission response as a result of receiving a forresta identity associated with a separate transmission ; and further including : means for constructing a reference map table for each said fragment file list contained within the response page table , said reference map table containing an entry for each placeholder found within fragment files identified by the list , said entry containing a position field whose value describes the relative offset position of the placeholder to other placeholders within the content of the fragment file , a parse index field whose value is the substitution index of the placeholder and a target field , whose value identifies the data held by the repository , said target field value representing the object of the placeholder . US6466983B1 CLAIM 14 . The system of claim 11 , wherein further including : means for determining access to said repository comprising a reference field means , a forresta identity field means , a destination field means and a supplementary items field means ; wherein said reference field means identifies the repository ; wherein said forresta identity field means conveys the privilege level and identity of the transmission ; wherein said destination field means identifies the specific data held by said repository that is to be assembled into a transmission for use by the client ; wherein said supplementary items field means contains zero or more values (match aggregator, match server) that are required to qualify the specific data being retrieved ; and the forresta identity field means is adapted to convey the privilege value and identity of the transmission of which it is a component , further comprising means for creating a forresta map table , each entry in said table containing one symbol whose appearance within said table is unique , and each said symbol being one of the upper-case characters “A” through “Z” inclusive , the lowercase characters “a” through “z” inclusive , and the character representations of the digits “1” through “9” inclusive , wherein one value of the forresta identity is created by selecting at least eight values from the forresta map table . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (specific order) . |
US6466983B1 CLAIM 19 . The system of claim 18 , wherein the maintenance of historical information regarding previous transmissions made by the client further comprises : means for creating and maintaining a destination list , said list having elements appearing in a specific order (next polling questions, net polling question) , said elements each having a value that specifies a recognized transmission format and a position value specifying the relative position of said format within a data stream , said list being updated on demand ; means for creating and maintaining an expected forresta list , said list having elements appearing in a specific order , said elements each having a value that specifies a recognized forresta identity and a position value specifying the relative position of a transmission format within a data stream , said list being updated on demand ; and means for comparing the values of the forresta and destination fields of a transmission with the values of either of the destination and expected forresta lists , to determine whether or not said transmission should be inhibited . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (more values, page table) , to a plurality of match servers , each match server (more values, page table) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6466983B1 CLAIM 4 . The system of claim 2 , further including means for constructing a response page table (match aggregator, match server) that contains a unique entry for each fragment file list , said list to be used as the template for selecting and assembling data held by the repository into a transmission response as a result of receiving a forresta identity associated with a separate transmission ; and further including : means for constructing a reference map table for each said fragment file list contained within the response page table , said reference map table containing an entry for each placeholder found within fragment files identified by the list , said entry containing a position field whose value describes the relative offset position of the placeholder to other placeholders within the content of the fragment file , a parse index field whose value is the substitution index of the placeholder and a target field , whose value identifies the data held by the repository , said target field value representing the object of the placeholder . US6466983B1 CLAIM 14 . The system of claim 11 , wherein further including : means for determining access to said repository comprising a reference field means , a forresta identity field means , a destination field means and a supplementary items field means ; wherein said reference field means identifies the repository ; wherein said forresta identity field means conveys the privilege level and identity of the transmission ; wherein said destination field means identifies the specific data held by said repository that is to be assembled into a transmission for use by the client ; wherein said supplementary items field means contains zero or more values (match aggregator, match server) that are required to qualify the specific data being retrieved ; and the forresta identity field means is adapted to convey the privilege value and identity of the transmission of which it is a component , further comprising means for creating a forresta map table , each entry in said table containing one symbol whose appearance within said table is unique , and each said symbol being one of the upper-case characters “A” through “Z” inclusive , the lowercase characters “a” through “z” inclusive , and the character representations of the digits “1” through “9” inclusive , wherein one value of the forresta identity is created by selecting at least eight values from the forresta map table . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (more values, page table) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6466983B1 CLAIM 4 . The system of claim 2 , further including means for constructing a response page table (match aggregator, match server) that contains a unique entry for each fragment file list , said list to be used as the template for selecting and assembling data held by the repository into a transmission response as a result of receiving a forresta identity associated with a separate transmission ; and further including : means for constructing a reference map table for each said fragment file list contained within the response page table , said reference map table containing an entry for each placeholder found within fragment files identified by the list , said entry containing a position field whose value describes the relative offset position of the placeholder to other placeholders within the content of the fragment file , a parse index field whose value is the substitution index of the placeholder and a target field , whose value identifies the data held by the repository , said target field value representing the object of the placeholder . US6466983B1 CLAIM 14 . The system of claim 11 , wherein further including : means for determining access to said repository comprising a reference field means , a forresta identity field means , a destination field means and a supplementary items field means ; wherein said reference field means identifies the repository ; wherein said forresta identity field means conveys the privilege level and identity of the transmission ; wherein said destination field means identifies the specific data held by said repository that is to be assembled into a transmission for use by the client ; wherein said supplementary items field means contains zero or more values (match aggregator, match server) that are required to qualify the specific data being retrieved ; and the forresta identity field means is adapted to convey the privilege value and identity of the transmission of which it is a component , further comprising means for creating a forresta map table , each entry in said table containing one symbol whose appearance within said table is unique , and each said symbol being one of the upper-case characters “A” through “Z” inclusive , the lowercase characters “a” through “z” inclusive , and the character representations of the digits “1” through “9” inclusive , wherein one value of the forresta identity is created by selecting at least eight values from the forresta map table . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (more values, page table) , to a plurality of match servers , each match server (more values, page table) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6466983B1 CLAIM 4 . The system of claim 2 , further including means for constructing a response page table (match aggregator, match server) that contains a unique entry for each fragment file list , said list to be used as the template for selecting and assembling data held by the repository into a transmission response as a result of receiving a forresta identity associated with a separate transmission ; and further including : means for constructing a reference map table for each said fragment file list contained within the response page table , said reference map table containing an entry for each placeholder found within fragment files identified by the list , said entry containing a position field whose value describes the relative offset position of the placeholder to other placeholders within the content of the fragment file , a parse index field whose value is the substitution index of the placeholder and a target field , whose value identifies the data held by the repository , said target field value representing the object of the placeholder . US6466983B1 CLAIM 14 . The system of claim 11 , wherein further including : means for determining access to said repository comprising a reference field means , a forresta identity field means , a destination field means and a supplementary items field means ; wherein said reference field means identifies the repository ; wherein said forresta identity field means conveys the privilege level and identity of the transmission ; wherein said destination field means identifies the specific data held by said repository that is to be assembled into a transmission for use by the client ; wherein said supplementary items field means contains zero or more values (match aggregator, match server) that are required to qualify the specific data being retrieved ; and the forresta identity field means is adapted to convey the privilege value and identity of the transmission of which it is a component , further comprising means for creating a forresta map table , each entry in said table containing one symbol whose appearance within said table is unique , and each said symbol being one of the upper-case characters “A” through “Z” inclusive , the lowercase characters “a” through “z” inclusive , and the character representations of the digits “1” through “9” inclusive , wherein one value of the forresta identity is created by selecting at least eight values from the forresta map table . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (more values, page table) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6466983B1 CLAIM 4 . The system of claim 2 , further including means for constructing a response page table (match aggregator, match server) that contains a unique entry for each fragment file list , said list to be used as the template for selecting and assembling data held by the repository into a transmission response as a result of receiving a forresta identity associated with a separate transmission ; and further including : means for constructing a reference map table for each said fragment file list contained within the response page table , said reference map table containing an entry for each placeholder found within fragment files identified by the list , said entry containing a position field whose value describes the relative offset position of the placeholder to other placeholders within the content of the fragment file , a parse index field whose value is the substitution index of the placeholder and a target field , whose value identifies the data held by the repository , said target field value representing the object of the placeholder . US6466983B1 CLAIM 14 . The system of claim 11 , wherein further including : means for determining access to said repository comprising a reference field means , a forresta identity field means , a destination field means and a supplementary items field means ; wherein said reference field means identifies the repository ; wherein said forresta identity field means conveys the privilege level and identity of the transmission ; wherein said destination field means identifies the specific data held by said repository that is to be assembled into a transmission for use by the client ; wherein said supplementary items field means contains zero or more values (match aggregator, match server) that are required to qualify the specific data being retrieved ; and the forresta identity field means is adapted to convey the privilege value and identity of the transmission of which it is a component , further comprising means for creating a forresta map table , each entry in said table containing one symbol whose appearance within said table is unique , and each said symbol being one of the upper-case characters “A” through “Z” inclusive , the lowercase characters “a” through “z” inclusive , and the character representations of the digits “1” through “9” inclusive , wherein one value of the forresta identity is created by selecting at least eight values from the forresta map table . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question (specific order) against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (specific order) . |
US6466983B1 CLAIM 19 . The system of claim 18 , wherein the maintenance of historical information regarding previous transmissions made by the client further comprises : means for creating and maintaining a destination list , said list having elements appearing in a specific order (next polling questions, net polling question) , said elements each having a value that specifies a recognized transmission format and a position value specifying the relative position of said format within a data stream , said list being updated on demand ; means for creating and maintaining an expected forresta list , said list having elements appearing in a specific order , said elements each having a value that specifies a recognized forresta identity and a position value specifying the relative position of a transmission format within a data stream , said list being updated on demand ; and means for comparing the values of the forresta and destination fields of a transmission with the values of either of the destination and expected forresta lists , to determine whether or not said transmission should be inhibited . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (more values, page table) , to a plurality of match servers , each match server (more values, page table) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6466983B1 CLAIM 4 . The system of claim 2 , further including means for constructing a response page table (match aggregator, match server) that contains a unique entry for each fragment file list , said list to be used as the template for selecting and assembling data held by the repository into a transmission response as a result of receiving a forresta identity associated with a separate transmission ; and further including : means for constructing a reference map table for each said fragment file list contained within the response page table , said reference map table containing an entry for each placeholder found within fragment files identified by the list , said entry containing a position field whose value describes the relative offset position of the placeholder to other placeholders within the content of the fragment file , a parse index field whose value is the substitution index of the placeholder and a target field , whose value identifies the data held by the repository , said target field value representing the object of the placeholder . US6466983B1 CLAIM 14 . The system of claim 11 , wherein further including : means for determining access to said repository comprising a reference field means , a forresta identity field means , a destination field means and a supplementary items field means ; wherein said reference field means identifies the repository ; wherein said forresta identity field means conveys the privilege level and identity of the transmission ; wherein said destination field means identifies the specific data held by said repository that is to be assembled into a transmission for use by the client ; wherein said supplementary items field means contains zero or more values (match aggregator, match server) that are required to qualify the specific data being retrieved ; and the forresta identity field means is adapted to convey the privilege value and identity of the transmission of which it is a component , further comprising means for creating a forresta map table , each entry in said table containing one symbol whose appearance within said table is unique , and each said symbol being one of the upper-case characters “A” through “Z” inclusive , the lowercase characters “a” through “z” inclusive , and the character representations of the digits “1” through “9” inclusive , wherein one value of the forresta identity is created by selecting at least eight values from the forresta map table . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (more values, page table) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6466983B1 CLAIM 4 . The system of claim 2 , further including means for constructing a response page table (match aggregator, match server) that contains a unique entry for each fragment file list , said list to be used as the template for selecting and assembling data held by the repository into a transmission response as a result of receiving a forresta identity associated with a separate transmission ; and further including : means for constructing a reference map table for each said fragment file list contained within the response page table , said reference map table containing an entry for each placeholder found within fragment files identified by the list , said entry containing a position field whose value describes the relative offset position of the placeholder to other placeholders within the content of the fragment file , a parse index field whose value is the substitution index of the placeholder and a target field , whose value identifies the data held by the repository , said target field value representing the object of the placeholder . US6466983B1 CLAIM 14 . The system of claim 11 , wherein further including : means for determining access to said repository comprising a reference field means , a forresta identity field means , a destination field means and a supplementary items field means ; wherein said reference field means identifies the repository ; wherein said forresta identity field means conveys the privilege level and identity of the transmission ; wherein said destination field means identifies the specific data held by said repository that is to be assembled into a transmission for use by the client ; wherein said supplementary items field means contains zero or more values (match aggregator, match server) that are required to qualify the specific data being retrieved ; and the forresta identity field means is adapted to convey the privilege value and identity of the transmission of which it is a component , further comprising means for creating a forresta map table , each entry in said table containing one symbol whose appearance within said table is unique , and each said symbol being one of the upper-case characters “A” through “Z” inclusive , the lowercase characters “a” through “z” inclusive , and the character representations of the digits “1” through “9” inclusive , wherein one value of the forresta identity is created by selecting at least eight values from the forresta map table . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (more values, page table) , to a plurality of match servers , each match server (more values, page table) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6466983B1 CLAIM 4 . The system of claim 2 , further including means for constructing a response page table (match aggregator, match server) that contains a unique entry for each fragment file list , said list to be used as the template for selecting and assembling data held by the repository into a transmission response as a result of receiving a forresta identity associated with a separate transmission ; and further including : means for constructing a reference map table for each said fragment file list contained within the response page table , said reference map table containing an entry for each placeholder found within fragment files identified by the list , said entry containing a position field whose value describes the relative offset position of the placeholder to other placeholders within the content of the fragment file , a parse index field whose value is the substitution index of the placeholder and a target field , whose value identifies the data held by the repository , said target field value representing the object of the placeholder . US6466983B1 CLAIM 14 . The system of claim 11 , wherein further including : means for determining access to said repository comprising a reference field means , a forresta identity field means , a destination field means and a supplementary items field means ; wherein said reference field means identifies the repository ; wherein said forresta identity field means conveys the privilege level and identity of the transmission ; wherein said destination field means identifies the specific data held by said repository that is to be assembled into a transmission for use by the client ; wherein said supplementary items field means contains zero or more values (match aggregator, match server) that are required to qualify the specific data being retrieved ; and the forresta identity field means is adapted to convey the privilege value and identity of the transmission of which it is a component , further comprising means for creating a forresta map table , each entry in said table containing one symbol whose appearance within said table is unique , and each said symbol being one of the upper-case characters “A” through “Z” inclusive , the lowercase characters “a” through “z” inclusive , and the character representations of the digits “1” through “9” inclusive , wherein one value of the forresta identity is created by selecting at least eight values from the forresta map table . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (more values, page table) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6466983B1 CLAIM 4 . The system of claim 2 , further including means for constructing a response page table (match aggregator, match server) that contains a unique entry for each fragment file list , said list to be used as the template for selecting and assembling data held by the repository into a transmission response as a result of receiving a forresta identity associated with a separate transmission ; and further including : means for constructing a reference map table for each said fragment file list contained within the response page table , said reference map table containing an entry for each placeholder found within fragment files identified by the list , said entry containing a position field whose value describes the relative offset position of the placeholder to other placeholders within the content of the fragment file , a parse index field whose value is the substitution index of the placeholder and a target field , whose value identifies the data held by the repository , said target field value representing the object of the placeholder . US6466983B1 CLAIM 14 . The system of claim 11 , wherein further including : means for determining access to said repository comprising a reference field means , a forresta identity field means , a destination field means and a supplementary items field means ; wherein said reference field means identifies the repository ; wherein said forresta identity field means conveys the privilege level and identity of the transmission ; wherein said destination field means identifies the specific data held by said repository that is to be assembled into a transmission for use by the client ; wherein said supplementary items field means contains zero or more values (match aggregator, match server) that are required to qualify the specific data being retrieved ; and the forresta identity field means is adapted to convey the privilege value and identity of the transmission of which it is a component , further comprising means for creating a forresta map table , each entry in said table containing one symbol whose appearance within said table is unique , and each said symbol being one of the upper-case characters “A” through “Z” inclusive , the lowercase characters “a” through “z” inclusive , and the character representations of the digits “1” through “9” inclusive , wherein one value of the forresta identity is created by selecting at least eight values from the forresta map table . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6594673B1 Filed: 1999-09-09 Issued: 2003-07-15 Visualizations for collaborative information (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Marc A. Smith, Steven M. Drucker, Rebecca Xiong |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6594673B1 CLAIM 1 . In a computer readable medium (match server) , an interactive collaborative information visualization system , comprising : a database of threaded message information relating to a computer-based threaded message environment ; a database filter to obtain and measure a selected portion of the threaded message information ; user interface controls by which a user controls the database filter to select the selected portion of the threaded message information to be obtained and measured ; and a rendering engine to render a network graphical visualization of the selected portion of the threaded message information . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6594673B1 CLAIM 1 . In a computer readable medium (match server) , an interactive collaborative information visualization system , comprising : a database of threaded message information relating to a computer-based threaded message environment ; a database filter to obtain and measure a selected portion of the threaded message information ; user interface controls by which a user controls the database filter to select the selected portion of the threaded message information to be obtained and measured ; and a rendering engine to render a network graphical visualization of the selected portion of the threaded message information . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6594673B1 CLAIM 1 . In a computer readable medium (match server) , an interactive collaborative information visualization system , comprising : a database of threaded message information relating to a computer-based threaded message environment ; a database filter to obtain and measure a selected portion of the threaded message information ; user interface controls by which a user controls the database filter to select the selected portion of the threaded message information to be obtained and measured ; and a rendering engine to render a network graphical visualization of the selected portion of the threaded message information . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6594673B1 CLAIM 1 . In a computer readable medium (match server) , an interactive collaborative information visualization system , comprising : a database of threaded message information relating to a computer-based threaded message environment ; a database filter to obtain and measure a selected portion of the threaded message information ; user interface controls by which a user controls the database filter to select the selected portion of the threaded message information to be obtained and measured ; and a rendering engine to render a network graphical visualization of the selected portion of the threaded message information . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means (numeric values) to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6594673B1 CLAIM 16 . The interface of claim 15 in which the visualization style controls include a control for selectively displaying numeric values (instruction means) for the strengths of the links . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6594673B1 CLAIM 1 . In a computer readable medium (match server) , an interactive collaborative information visualization system , comprising : a database of threaded message information relating to a computer-based threaded message environment ; a database filter to obtain and measure a selected portion of the threaded message information ; user interface controls by which a user controls the database filter to select the selected portion of the threaded message information to be obtained and measured ; and a rendering engine to render a network graphical visualization of the selected portion of the threaded message information . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6594673B1 CLAIM 1 . In a computer readable medium (match server) , an interactive collaborative information visualization system , comprising : a database of threaded message information relating to a computer-based threaded message environment ; a database filter to obtain and measure a selected portion of the threaded message information ; user interface controls by which a user controls the database filter to select the selected portion of the threaded message information to be obtained and measured ; and a rendering engine to render a network graphical visualization of the selected portion of the threaded message information . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6594673B1 CLAIM 1 . In a computer readable medium (match server) , an interactive collaborative information visualization system , comprising : a database of threaded message information relating to a computer-based threaded message environment ; a database filter to obtain and measure a selected portion of the threaded message information ; user interface controls by which a user controls the database filter to select the selected portion of the threaded message information to be obtained and measured ; and a rendering engine to render a network graphical visualization of the selected portion of the threaded message information . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6594673B1 CLAIM 1 . In a computer readable medium (match server) , an interactive collaborative information visualization system , comprising : a database of threaded message information relating to a computer-based threaded message environment ; a database filter to obtain and measure a selected portion of the threaded message information ; user interface controls by which a user controls the database filter to select the selected portion of the threaded message information to be obtained and measured ; and a rendering engine to render a network graphical visualization of the selected portion of the threaded message information . |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means (numeric values) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6594673B1 CLAIM 16 . The interface of claim 15 in which the visualization style controls include a control for selectively displaying numeric values (instruction means) for the strengths of the links . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means (numeric values) for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6594673B1 CLAIM 16 . The interface of claim 15 in which the visualization style controls include a control for selectively displaying numeric values (instruction means) for the strengths of the links . |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means (numeric values) for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US6594673B1 CLAIM 16 . The interface of claim 15 in which the visualization style controls include a control for selectively displaying numeric values (instruction means) for the strengths of the links . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means (numeric values) for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US6594673B1 CLAIM 16 . The interface of claim 15 in which the visualization style controls include a control for selectively displaying numeric values (instruction means) for the strengths of the links . |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means (numeric values) for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6594673B1 CLAIM 16 . The interface of claim 15 in which the visualization style controls include a control for selectively displaying numeric values (instruction means) for the strengths of the links . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means (numeric values) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6594673B1 CLAIM 1 . In a computer readable medium (match server) , an interactive collaborative information visualization system , comprising : a database of threaded message information relating to a computer-based threaded message environment ; a database filter to obtain and measure a selected portion of the threaded message information ; user interface controls by which a user controls the database filter to select the selected portion of the threaded message information to be obtained and measured ; and a rendering engine to render a network graphical visualization of the selected portion of the threaded message information . US6594673B1 CLAIM 16 . The interface of claim 15 in which the visualization style controls include a control for selectively displaying numeric values (instruction means) for the strengths of the links . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6594673B1 CLAIM 1 . In a computer readable medium (match server) , an interactive collaborative information visualization system , comprising : a database of threaded message information relating to a computer-based threaded message environment ; a database filter to obtain and measure a selected portion of the threaded message information ; user interface controls by which a user controls the database filter to select the selected portion of the threaded message information to be obtained and measured ; and a rendering engine to render a network graphical visualization of the selected portion of the threaded message information . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means (numeric values) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6594673B1 CLAIM 1 . In a computer readable medium (match server) , an interactive collaborative information visualization system , comprising : a database of threaded message information relating to a computer-based threaded message environment ; a database filter to obtain and measure a selected portion of the threaded message information ; user interface controls by which a user controls the database filter to select the selected portion of the threaded message information to be obtained and measured ; and a rendering engine to render a network graphical visualization of the selected portion of the threaded message information . US6594673B1 CLAIM 16 . The interface of claim 15 in which the visualization style controls include a control for selectively displaying numeric values (instruction means) for the strengths of the links . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6594673B1 CLAIM 1 . In a computer readable medium (match server) , an interactive collaborative information visualization system , comprising : a database of threaded message information relating to a computer-based threaded message environment ; a database filter to obtain and measure a selected portion of the threaded message information ; user interface controls by which a user controls the database filter to select the selected portion of the threaded message information to be obtained and measured ; and a rendering engine to render a network graphical visualization of the selected portion of the threaded message information . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US20030097361A1 Filed: 1999-06-15 Issued: 2003-05-22 Message center based desktop systems (Original Assignee) Dinh Truong T (Current Assignee) Dinh Truong T ; Magically Inc Erwin S. Huang, Chan F. Chun, Chan S. Kwan, Tse P. Hung, Lau C. Kwok, Wong K. Fung, Tsoi Ng, Chow W. Kin |
|---|---|
| US9087321B2 CLAIM 5 . The poll-based networking system as set forth in claim 4 , wherein the one or more processors is further configured to perform operations of : receiving match commands to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20030097361A1 CLAIM 19 . A computer program product for processing data in a desktop comprising : code that sends and receives messages ; code that displays a received message ; code that receives a selection of a data item in the displayed message ; code that receives a command to process the selected data in a particular manner ; code that extracts the selected data ; code that stores the extracted data in a database ; code that generates a reminder message in response to the extracted data ; code that sends the reminder message at one or more designated times ; and an electronics storage medium configured to store (receiving match commands to identify users) the codes . |
| US9087321B2 CLAIM 14 . The computer implemented method as set forth in claim 13 , further comprising an act of causing the one or more processors to perform operations of : receiving match commands to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20030097361A1 CLAIM 19 . A computer program product for processing data in a desktop comprising : code that sends and receives messages ; code that displays a received message ; code that receives a selection of a data item in the displayed message ; code that receives a command to process the selected data in a particular manner ; code that extracts the selected data ; code that stores the extracted data in a database ; code that generates a reminder message in response to the extracted data ; code that sends the reminder message at one or more designated times ; and an electronics storage medium configured to store (receiving match commands to identify users) the codes . |
| US9087321B2 CLAIM 19 . A computer program product (computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US20030097361A1 CLAIM 19 . A computer program product (computer program product) for processing data in a desktop comprising : code that sends and receives messages ; code that displays a received message ; code that receives a selection of a data item in the displayed message ; code that receives a command to process the selected data in a particular manner ; code that extracts the selected data ; code that stores the extracted data in a database ; code that generates a reminder message in response to the extracted data ; code that sends the reminder message at one or more designated times ; and an electronics storage medium configured to store the codes . |
| US9087321B2 CLAIM 20 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US20030097361A1 CLAIM 19 . A computer program product (computer program product) for processing data in a desktop comprising : code that sends and receives messages ; code that displays a received message ; code that receives a selection of a data item in the displayed message ; code that receives a command to process the selected data in a particular manner ; code that extracts the selected data ; code that stores the extracted data in a database ; code that generates a reminder message in response to the extracted data ; code that sends the reminder message at one or more designated times ; and an electronics storage medium configured to store the codes . |
| US9087321B2 CLAIM 21 . The computer program product (computer program product) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US20030097361A1 CLAIM 19 . A computer program product (computer program product) for processing data in a desktop comprising : code that sends and receives messages ; code that displays a received message ; code that receives a selection of a data item in the displayed message ; code that receives a command to process the selected data in a particular manner ; code that extracts the selected data ; code that stores the extracted data in a database ; code that generates a reminder message in response to the extracted data ; code that sends the reminder message at one or more designated times ; and an electronics storage medium configured to store the codes . |
| US9087321B2 CLAIM 22 . The computer program product (computer program product) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US20030097361A1 CLAIM 19 . A computer program product (computer program product) for processing data in a desktop comprising : code that sends and receives messages ; code that displays a received message ; code that receives a selection of a data item in the displayed message ; code that receives a command to process the selected data in a particular manner ; code that extracts the selected data ; code that stores the extracted data in a database ; code that generates a reminder message in response to the extracted data ; code that sends the reminder message at one or more designated times ; and an electronics storage medium configured to store the codes . |
| US9087321B2 CLAIM 23 . The computer program product (computer program product) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users (configured to store) that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US20030097361A1 CLAIM 19 . A computer program product (computer program product) for processing data in a desktop comprising : code that sends and receives messages ; code that displays a received message ; code that receives a selection of a data item in the displayed message ; code that receives a command to process the selected data in a particular manner ; code that extracts the selected data ; code that stores the extracted data in a database ; code that generates a reminder message in response to the extracted data ; code that sends the reminder message at one or more designated times ; and an electronics storage medium configured to store (receiving match commands to identify users) the codes . |
| US9087321B2 CLAIM 24 . The computer program product (computer program product) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030097361A1 CLAIM 19 . A computer program product (computer program product) for processing data in a desktop comprising : code that sends and receives messages ; code that displays a received message ; code that receives a selection of a data item in the displayed message ; code that receives a command to process the selected data in a particular manner ; code that extracts the selected data ; code that stores the extracted data in a database ; code that generates a reminder message in response to the extracted data ; code that sends the reminder message at one or more designated times ; and an electronics storage medium configured to store the codes . |
| US9087321B2 CLAIM 25 . The computer program product (computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030097361A1 CLAIM 19 . A computer program product (computer program product) for processing data in a desktop comprising : code that sends and receives messages ; code that displays a received message ; code that receives a selection of a data item in the displayed message ; code that receives a command to process the selected data in a particular manner ; code that extracts the selected data ; code that stores the extracted data in a database ; code that generates a reminder message in response to the extracted data ; code that sends the reminder message at one or more designated times ; and an electronics storage medium configured to store the codes . |
| US9087321B2 CLAIM 26 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US20030097361A1 CLAIM 19 . A computer program product (computer program product) for processing data in a desktop comprising : code that sends and receives messages ; code that displays a received message ; code that receives a selection of a data item in the displayed message ; code that receives a command to process the selected data in a particular manner ; code that extracts the selected data ; code that stores the extracted data in a database ; code that generates a reminder message in response to the extracted data ; code that sends the reminder message at one or more designated times ; and an electronics storage medium configured to store the codes . |
| US9087321B2 CLAIM 27 . The computer program product (computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US20030097361A1 CLAIM 19 . A computer program product (computer program product) for processing data in a desktop comprising : code that sends and receives messages ; code that displays a received message ; code that receives a selection of a data item in the displayed message ; code that receives a command to process the selected data in a particular manner ; code that extracts the selected data ; code that stores the extracted data in a database ; code that generates a reminder message in response to the extracted data ; code that sends the reminder message at one or more designated times ; and an electronics storage medium configured to store the codes . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6351741B1 Filed: 1999-05-07 Issued: 2002-02-26 Method of locating a file linked to a document in a relocated document directory structure (Original Assignee) Adobe Systems Inc (Current Assignee) Adobe Inc Steve L. Flenniken |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6351741B1 CLAIM 5 . A computer program product residing on a computer readable medium (match server) for locating a linked file , comprises instructions for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6351741B1 CLAIM 5 . A computer program product residing on a computer readable medium (match server) for locating a linked file , comprises instructions for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6351741B1 CLAIM 5 . A computer program product residing on a computer readable medium (match server) for locating a linked file , comprises instructions for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6351741B1 CLAIM 5 . A computer program product residing on a computer readable medium (match server) for locating a linked file , comprises instructions for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means (comprises instructions) to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6351741B1 CLAIM 5 . A computer program product residing on a computer readable medium for locating a linked file , comprises instructions (instruction means) for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6351741B1 CLAIM 5 . A computer program product residing on a computer readable medium (match server) for locating a linked file , comprises instructions for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6351741B1 CLAIM 5 . A computer program product residing on a computer readable medium (match server) for locating a linked file , comprises instructions for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6351741B1 CLAIM 5 . A computer program product residing on a computer readable medium (match server) for locating a linked file , comprises instructions for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6351741B1 CLAIM 5 . A computer program product residing on a computer readable medium (match server) for locating a linked file , comprises instructions for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 19 . A computer program product (computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means (comprises instructions) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6351741B1 CLAIM 5 . A computer program product (computer program product) residing on a computer readable medium for locating a linked file , comprises instructions (instruction means) for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 20 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means (comprises instructions) for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6351741B1 CLAIM 5 . A computer program product (computer program product) residing on a computer readable medium for locating a linked file , comprises instructions (instruction means) for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 21 . The computer program product (computer program product) as set forth in claim 20 , further comprising instruction means (comprises instructions) for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US6351741B1 CLAIM 5 . A computer program product (computer program product) residing on a computer readable medium for locating a linked file , comprises instructions (instruction means) for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 22 . The computer program product (computer program product) as set forth in claim 21 , further comprising instruction means (comprises instructions) for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US6351741B1 CLAIM 5 . A computer program product (computer program product) residing on a computer readable medium for locating a linked file , comprises instructions (instruction means) for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 23 . The computer program product (computer program product) as set forth in claim 22 , further comprising instruction means (comprises instructions) for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6351741B1 CLAIM 5 . A computer program product (computer program product) residing on a computer readable medium for locating a linked file , comprises instructions (instruction means) for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 24 . The computer program product (computer program product) as set forth in claim 23 , further comprising instruction means (comprises instructions) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6351741B1 CLAIM 5 . A computer program product (computer program product) residing on a computer readable medium (match server) for locating a linked file , comprises instructions (instruction means) for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 25 . The computer program product (computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6351741B1 CLAIM 5 . A computer program product (computer program product) residing on a computer readable medium (match server) for locating a linked file , comprises instructions for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 26 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means (comprises instructions) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6351741B1 CLAIM 5 . A computer program product (computer program product) residing on a computer readable medium (match server) for locating a linked file , comprises instructions (instruction means) for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 CLAIM 27 . The computer program product (computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6351741B1 CLAIM 5 . A computer program product (computer program product) residing on a computer readable medium (match server) for locating a linked file , comprises instructions for causing a computer to : retrieve a reference to a linked file linked to a document , the reference specifying an original absolute pathname ; parse the absolute pathname into a plurality of relative pathnames ; append a first one of the relative pathnames to a current directory specification for the document to produce a new absolute pathname ; and append subsequent ones of the plurality of relative pathnames to the current directory specification until the new absolute pathname points to the linked file . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6058366A Filed: 1999-02-25 Issued: 2000-05-02 Generic run-time engine for interfacing between applications and speech engines (Original Assignee) Lernout and Hauspie Speech Products NV (Current Assignee) Nuance Communications Inc Erik Tarkiainen, Luc Van Tichelen |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (measurement information) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6058366A CLAIM 3 . A universal voice-data handling system according to claim 1 , wherein the specialized task includes at least one of the group of : a . querying a person to obtain an affirmation/negation response ; b . querying a person to obtain calendric information ; c . prompting a person to select from a menu ; d . querying a person to obtain payment information ; e . reading text to a person and responding to clarification queries ; f . querying a person to obtain address information ; g . querying a person to obtain information for data fields in an application-specific form ; h . prompting a person to provide a password ; i . querying a person to process queries to a database ; j . prompting a person to create a list of words selected for creation of specific lists or customized commands ; k . querying a person to obtain temporal information ; l . querying a person to obtain measurement information (data processing system, data processing system having one) ; and m . providing a spoken announcement message . |
| US9087321B2 CLAIM 19 . A computer program product (digital storage medium) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6058366A CLAIM 19 . A software program stored in a digital storage medium (computer program product, computer program product comprising computer) , the program , when loaded into a computer system , establishing : a . a run-time module adapted to a specialized task for running concurrently and interactively with at least one speech-related application interface chosen from the group of an automated speech recognizer , a text-to-speech converter , a speech recorder/player , a speech-and-music compressor/decompressor , speaker verification , language identification , and gender verification , the software program ; b . an initialization file containing parameters specific to the software application program for specifying a behavior of the run-time module ; and c . an application for generating the initialization file based on the behavior required by the software application program . |
| US9087321B2 CLAIM 20 . The computer program product (digital storage medium) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6058366A CLAIM 19 . A software program stored in a digital storage medium (computer program product, computer program product comprising computer) , the program , when loaded into a computer system , establishing : a . a run-time module adapted to a specialized task for running concurrently and interactively with at least one speech-related application interface chosen from the group of an automated speech recognizer , a text-to-speech converter , a speech recorder/player , a speech-and-music compressor/decompressor , speaker verification , language identification , and gender verification , the software program ; b . an initialization file containing parameters specific to the software application program for specifying a behavior of the run-time module ; and c . an application for generating the initialization file based on the behavior required by the software application program . |
| US9087321B2 CLAIM 21 . The computer program product (digital storage medium) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US6058366A CLAIM 19 . A software program stored in a digital storage medium (computer program product, computer program product comprising computer) , the program , when loaded into a computer system , establishing : a . a run-time module adapted to a specialized task for running concurrently and interactively with at least one speech-related application interface chosen from the group of an automated speech recognizer , a text-to-speech converter , a speech recorder/player , a speech-and-music compressor/decompressor , speaker verification , language identification , and gender verification , the software program ; b . an initialization file containing parameters specific to the software application program for specifying a behavior of the run-time module ; and c . an application for generating the initialization file based on the behavior required by the software application program . |
| US9087321B2 CLAIM 22 . The computer program product (digital storage medium) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US6058366A CLAIM 19 . A software program stored in a digital storage medium (computer program product, computer program product comprising computer) , the program , when loaded into a computer system , establishing : a . a run-time module adapted to a specialized task for running concurrently and interactively with at least one speech-related application interface chosen from the group of an automated speech recognizer , a text-to-speech converter , a speech recorder/player , a speech-and-music compressor/decompressor , speaker verification , language identification , and gender verification , the software program ; b . an initialization file containing parameters specific to the software application program for specifying a behavior of the run-time module ; and c . an application for generating the initialization file based on the behavior required by the software application program . |
| US9087321B2 CLAIM 23 . The computer program product (digital storage medium) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6058366A CLAIM 19 . A software program stored in a digital storage medium (computer program product, computer program product comprising computer) , the program , when loaded into a computer system , establishing : a . a run-time module adapted to a specialized task for running concurrently and interactively with at least one speech-related application interface chosen from the group of an automated speech recognizer , a text-to-speech converter , a speech recorder/player , a speech-and-music compressor/decompressor , speaker verification , language identification , and gender verification , the software program ; b . an initialization file containing parameters specific to the software application program for specifying a behavior of the run-time module ; and c . an application for generating the initialization file based on the behavior required by the software application program . |
| US9087321B2 CLAIM 24 . The computer program product (digital storage medium) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6058366A CLAIM 19 . A software program stored in a digital storage medium (computer program product, computer program product comprising computer) , the program , when loaded into a computer system , establishing : a . a run-time module adapted to a specialized task for running concurrently and interactively with at least one speech-related application interface chosen from the group of an automated speech recognizer , a text-to-speech converter , a speech recorder/player , a speech-and-music compressor/decompressor , speaker verification , language identification , and gender verification , the software program ; b . an initialization file containing parameters specific to the software application program for specifying a behavior of the run-time module ; and c . an application for generating the initialization file based on the behavior required by the software application program . |
| US9087321B2 CLAIM 25 . The computer program product (digital storage medium) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6058366A CLAIM 19 . A software program stored in a digital storage medium (computer program product, computer program product comprising computer) , the program , when loaded into a computer system , establishing : a . a run-time module adapted to a specialized task for running concurrently and interactively with at least one speech-related application interface chosen from the group of an automated speech recognizer , a text-to-speech converter , a speech recorder/player , a speech-and-music compressor/decompressor , speaker verification , language identification , and gender verification , the software program ; b . an initialization file containing parameters specific to the software application program for specifying a behavior of the run-time module ; and c . an application for generating the initialization file based on the behavior required by the software application program . |
| US9087321B2 CLAIM 26 . The computer program product (digital storage medium) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6058366A CLAIM 19 . A software program stored in a digital storage medium (computer program product, computer program product comprising computer) , the program , when loaded into a computer system , establishing : a . a run-time module adapted to a specialized task for running concurrently and interactively with at least one speech-related application interface chosen from the group of an automated speech recognizer , a text-to-speech converter , a speech recorder/player , a speech-and-music compressor/decompressor , speaker verification , language identification , and gender verification , the software program ; b . an initialization file containing parameters specific to the software application program for specifying a behavior of the run-time module ; and c . an application for generating the initialization file based on the behavior required by the software application program . |
| US9087321B2 CLAIM 27 . The computer program product (digital storage medium) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6058366A CLAIM 19 . A software program stored in a digital storage medium (computer program product, computer program product comprising computer) , the program , when loaded into a computer system , establishing : a . a run-time module adapted to a specialized task for running concurrently and interactively with at least one speech-related application interface chosen from the group of an automated speech recognizer , a text-to-speech converter , a speech recorder/player , a speech-and-music compressor/decompressor , speaker verification , language identification , and gender verification , the software program ; b . an initialization file containing parameters specific to the software application program for specifying a behavior of the run-time module ; and c . an application for generating the initialization file based on the behavior required by the software application program . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6353851B1 Filed: 1998-12-28 Issued: 2002-03-05 Method and apparatus for sharing asymmetric information and services in simultaneously viewed documents on a communication system (Original Assignee) Nokia of America Corp (Current Assignee) Nokia of America Corp ; Wsou Investments LLC Vinod Anupam, Narain H. Gehani, Viswanath Kadambari |
|---|---|
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6353851B1 CLAIM 2 . The method as defined in claim 1 wherein said communication system includes a World Wide Web (web server) (WWW) . US6353851B1 CLAIM 19 . A method for use in a server system (match servers) that provides communication in synchrony among user devices in a session via a communication system , at least a first user device and an at least second user device being in said session , each user device including a browser for obtaining information from said server system , each browser causing a document to be displayed at each user device including at least one document element for containing a prescribed data value , the method comprising the steps of : creating a surrogate in each of said user devices ; said surrogate including the steps of obtaining an indication of a change in said prescribed data value of said at least one document element ; supplying a representation of an indicated change in said prescribed data value of said at least one document element along with at least one name associated with said at least one document element as a browser input ; determining whether said at least one name associated with said at least one document element is available at the surrogate ; in response to said at least one name being available , processing said browser input to generate a prescribed output ; and supplying said generated prescribed output as an output to said communication system to be supplied to at least one other of said surrogates in at least one other of said user devices , whereby a plurality of users can collaboratively make changes in said at least one document element data value if said name associated with said at least one document element is available to a surrogate in the user device so that asymmetric collaboration is realized . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6353851B1 CLAIM 2 . The method as defined in claim 1 wherein said communication system includes a World Wide Web (web server) (WWW) . US6353851B1 CLAIM 19 . A method for use in a server system (match servers) that provides communication in synchrony among user devices in a session via a communication system , at least a first user device and an at least second user device being in said session , each user device including a browser for obtaining information from said server system , each browser causing a document to be displayed at each user device including at least one document element for containing a prescribed data value , the method comprising the steps of : creating a surrogate in each of said user devices ; said surrogate including the steps of obtaining an indication of a change in said prescribed data value of said at least one document element ; supplying a representation of an indicated change in said prescribed data value of said at least one document element along with at least one name associated with said at least one document element as a browser input ; determining whether said at least one name associated with said at least one document element is available at the surrogate ; in response to said at least one name being available , processing said browser input to generate a prescribed output ; and supplying said generated prescribed output as an output to said communication system to be supplied to at least one other of said surrogates in at least one other of said user devices , whereby a plurality of users can collaboratively make changes in said at least one document element data value if said name associated with said at least one document element is available to a surrogate in the user device so that asymmetric collaboration is realized . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one (second mean) or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6353851B1 CLAIM 66 . Apparatus for use in a user device including a browser for obtaining information from a communication system , the browser causing a document to be displayed including at least one document element for containing a prescribed data value , the user device comprising : means responsive to supplied programming code for creating a surrogate in said user device ; said surrogate including means for obtaining an indication of a change in said prescribed data value of said at least one document element ; first means for supplying a representation of an indicated change in said prescribed data value of said at least one document element along with at least one name associated with said at least one document element as a browser input ; means for determining whether said at least one name associated with said at least one document element is available at the surrogate ; second mean (computer having one) s responsive to said name associated with said at least one document element being available for supplying said browser input to a means for generating ; means responsive to said browser input for generating a prescribed output ; and means for supplying as an output to said communication system said generated prescribed output . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6353851B1 CLAIM 2 . The method as defined in claim 1 wherein said communication system includes a World Wide Web (web server) (WWW) . US6353851B1 CLAIM 19 . A method for use in a server system (match servers) that provides communication in synchrony among user devices in a session via a communication system , at least a first user device and an at least second user device being in said session , each user device including a browser for obtaining information from said server system , each browser causing a document to be displayed at each user device including at least one document element for containing a prescribed data value , the method comprising the steps of : creating a surrogate in each of said user devices ; said surrogate including the steps of obtaining an indication of a change in said prescribed data value of said at least one document element ; supplying a representation of an indicated change in said prescribed data value of said at least one document element along with at least one name associated with said at least one document element as a browser input ; determining whether said at least one name associated with said at least one document element is available at the surrogate ; in response to said at least one name being available , processing said browser input to generate a prescribed output ; and supplying said generated prescribed output as an output to said communication system to be supplied to at least one other of said surrogates in at least one other of said user devices , whereby a plurality of users can collaboratively make changes in said at least one document element data value if said name associated with said at least one document element is available to a surrogate in the user device so that asymmetric collaboration is realized . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6353851B1 CLAIM 2 . The method as defined in claim 1 wherein said communication system includes a World Wide Web (web server) (WWW) . US6353851B1 CLAIM 19 . A method for use in a server system (match servers) that provides communication in synchrony among user devices in a session via a communication system , at least a first user device and an at least second user device being in said session , each user device including a browser for obtaining information from said server system , each browser causing a document to be displayed at each user device including at least one document element for containing a prescribed data value , the method comprising the steps of : creating a surrogate in each of said user devices ; said surrogate including the steps of obtaining an indication of a change in said prescribed data value of said at least one document element ; supplying a representation of an indicated change in said prescribed data value of said at least one document element along with at least one name associated with said at least one document element as a browser input ; determining whether said at least one name associated with said at least one document element is available at the surrogate ; in response to said at least one name being available , processing said browser input to generate a prescribed output ; and supplying said generated prescribed output as an output to said communication system to be supplied to at least one other of said surrogates in at least one other of said user devices , whereby a plurality of users can collaboratively make changes in said at least one document element data value if said name associated with said at least one document element is available to a surrogate in the user device so that asymmetric collaboration is realized . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6353851B1 CLAIM 2 . The method as defined in claim 1 wherein said communication system includes a World Wide Web (web server) (WWW) . US6353851B1 CLAIM 19 . A method for use in a server system (match servers) that provides communication in synchrony among user devices in a session via a communication system , at least a first user device and an at least second user device being in said session , each user device including a browser for obtaining information from said server system , each browser causing a document to be displayed at each user device including at least one document element for containing a prescribed data value , the method comprising the steps of : creating a surrogate in each of said user devices ; said surrogate including the steps of obtaining an indication of a change in said prescribed data value of said at least one document element ; supplying a representation of an indicated change in said prescribed data value of said at least one document element along with at least one name associated with said at least one document element as a browser input ; determining whether said at least one name associated with said at least one document element is available at the surrogate ; in response to said at least one name being available , processing said browser input to generate a prescribed output ; and supplying said generated prescribed output as an output to said communication system to be supplied to at least one other of said surrogates in at least one other of said user devices , whereby a plurality of users can collaboratively make changes in said at least one document element data value if said name associated with said at least one document element is available to a surrogate in the user device so that asymmetric collaboration is realized . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6353851B1 CLAIM 2 . The method as defined in claim 1 wherein said communication system includes a World Wide Web (web server) (WWW) . US6353851B1 CLAIM 19 . A method for use in a server system (match servers) that provides communication in synchrony among user devices in a session via a communication system , at least a first user device and an at least second user device being in said session , each user device including a browser for obtaining information from said server system , each browser causing a document to be displayed at each user device including at least one document element for containing a prescribed data value , the method comprising the steps of : creating a surrogate in each of said user devices ; said surrogate including the steps of obtaining an indication of a change in said prescribed data value of said at least one document element ; supplying a representation of an indicated change in said prescribed data value of said at least one document element along with at least one name associated with said at least one document element as a browser input ; determining whether said at least one name associated with said at least one document element is available at the surrogate ; in response to said at least one name being available , processing said browser input to generate a prescribed output ; and supplying said generated prescribed output as an output to said communication system to be supplied to at least one other of said surrogates in at least one other of said user devices , whereby a plurality of users can collaboratively make changes in said at least one document element data value if said name associated with said at least one document element is available to a surrogate in the user device so that asymmetric collaboration is realized . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6453310B1 Filed: 1998-10-26 Issued: 2002-09-17 Installable schema for low-overhead databases (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Jason L. Zander |
|---|---|
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (application code) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6453310B1 CLAIM 17 . A method for processing relational databases having data files organized according to a defined schema , comprising : defining application program code for performing at least one function upon the databases ; including with the application code (executable instruction, computer executable instruction) a schema file separate from the data files and representing the schema of the data files , such that the function operates upon the data files in accordance with the schema ; and a further program for executing the function , the application code passing the schema file to the further program for locating particular data in the data files . |
| US9087321B2 CLAIM 19 . A computer program product (accessed data) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6453310B1 CLAIM 30 . A system according to claim 29 , further comprising an application program for selectively accessing any one of the data files and for accessing that one of the schema files identified by the pointer in the accessed data (computer program product, computer program product comprising computer) file . |
| US9087321B2 CLAIM 20 . The computer program product (accessed data) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6453310B1 CLAIM 30 . A system according to claim 29 , further comprising an application program for selectively accessing any one of the data files and for accessing that one of the schema files identified by the pointer in the accessed data (computer program product, computer program product comprising computer) file . |
| US9087321B2 CLAIM 21 . The computer program product (accessed data) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US6453310B1 CLAIM 30 . A system according to claim 29 , further comprising an application program for selectively accessing any one of the data files and for accessing that one of the schema files identified by the pointer in the accessed data (computer program product, computer program product comprising computer) file . |
| US9087321B2 CLAIM 22 . The computer program product (accessed data) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US6453310B1 CLAIM 30 . A system according to claim 29 , further comprising an application program for selectively accessing any one of the data files and for accessing that one of the schema files identified by the pointer in the accessed data (computer program product, computer program product comprising computer) file . |
| US9087321B2 CLAIM 23 . The computer program product (accessed data) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6453310B1 CLAIM 30 . A system according to claim 29 , further comprising an application program for selectively accessing any one of the data files and for accessing that one of the schema files identified by the pointer in the accessed data (computer program product, computer program product comprising computer) file . |
| US9087321B2 CLAIM 24 . The computer program product (accessed data) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6453310B1 CLAIM 30 . A system according to claim 29 , further comprising an application program for selectively accessing any one of the data files and for accessing that one of the schema files identified by the pointer in the accessed data (computer program product, computer program product comprising computer) file . |
| US9087321B2 CLAIM 25 . The computer program product (accessed data) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6453310B1 CLAIM 30 . A system according to claim 29 , further comprising an application program for selectively accessing any one of the data files and for accessing that one of the schema files identified by the pointer in the accessed data (computer program product, computer program product comprising computer) file . |
| US9087321B2 CLAIM 26 . The computer program product (accessed data) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6453310B1 CLAIM 30 . A system according to claim 29 , further comprising an application program for selectively accessing any one of the data files and for accessing that one of the schema files identified by the pointer in the accessed data (computer program product, computer program product comprising computer) file . |
| US9087321B2 CLAIM 27 . The computer program product (accessed data) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6453310B1 CLAIM 30 . A system according to claim 29 , further comprising an application program for selectively accessing any one of the data files and for accessing that one of the schema files identified by the pointer in the accessed data (computer program product, computer program product comprising computer) file . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6349302B1 Filed: 1998-07-07 Issued: 2002-02-19 Document processing method and system, and computer-readable recording medium having document processing program recorded therein (Original Assignee) Hitachi Ltd (Current Assignee) Hitachi Ltd Yuki Aoyama, Yukie Takita, Toru Takahashi, Yukio Hoshi |
|---|---|
| US9087321B2 CLAIM 19 . A computer program product (readable recording medium) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations (processing step) of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6349302B1 CLAIM 2 . A document processing method according to claim 1 , further comprising a step of managing a change history of said shared information and document and a step of subjecting the shared information to a consistency processing operation to generate consistency-processed shared information already subjected to said consistency processing operation , and wherein said version management step stores in said memory said generated shared information and generated document as the document of a new version , creates version information for each of the shared information and document and stores the version information in said memory , said consistency processing step (computer to perform operations) , when said shared information is generated and a character string or structure is already changed after editing of said document , maintains contents of said character string in its state after the change and returns the structure change to its state at the time of creating the document , generates shared information satisfying its consistency , and , when it is desired to display or print said document in said output step , embeds said consistency-satisfied shared information in the document . US6349302B1 CLAIM 11 . A computer readable recording medium (computer program product) storing a document processing program implemented by a computer , said program executing the steps of : generating as said shared information a term combination of such a term as abbreviation or coinage and such a term as person' ; s name or belonging department and edits the shared information into structured documents depending on the types of the information ; storing the generated shared information block in a first memory ; describing a link to the shared information in the documents ; storing the link-described documents in a second memory ; and reading out from said memories said generated shared information and described document , embedding the shared information in the link-described document according to the links described therein and said generated shared information , and generating and outputting information indicative of a document having the shared information embedded therein . |
| US9087321B2 CLAIM 20 . The computer program product (readable recording medium) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations (processing step) of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6349302B1 CLAIM 2 . A document processing method according to claim 1 , further comprising a step of managing a change history of said shared information and document and a step of subjecting the shared information to a consistency processing operation to generate consistency-processed shared information already subjected to said consistency processing operation , and wherein said version management step stores in said memory said generated shared information and generated document as the document of a new version , creates version information for each of the shared information and document and stores the version information in said memory , said consistency processing step (computer to perform operations) , when said shared information is generated and a character string or structure is already changed after editing of said document , maintains contents of said character string in its state after the change and returns the structure change to its state at the time of creating the document , generates shared information satisfying its consistency , and , when it is desired to display or print said document in said output step , embeds said consistency-satisfied shared information in the document . US6349302B1 CLAIM 11 . A computer readable recording medium (computer program product) storing a document processing program implemented by a computer , said program executing the steps of : generating as said shared information a term combination of such a term as abbreviation or coinage and such a term as person' ; s name or belonging department and edits the shared information into structured documents depending on the types of the information ; storing the generated shared information block in a first memory ; describing a link to the shared information in the documents ; storing the link-described documents in a second memory ; and reading out from said memories said generated shared information and described document , embedding the shared information in the link-described document according to the links described therein and said generated shared information , and generating and outputting information indicative of a document having the shared information embedded therein . |
| US9087321B2 CLAIM 21 . The computer program product (readable recording medium) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations (processing step) of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US6349302B1 CLAIM 2 . A document processing method according to claim 1 , further comprising a step of managing a change history of said shared information and document and a step of subjecting the shared information to a consistency processing operation to generate consistency-processed shared information already subjected to said consistency processing operation , and wherein said version management step stores in said memory said generated shared information and generated document as the document of a new version , creates version information for each of the shared information and document and stores the version information in said memory , said consistency processing step (computer to perform operations) , when said shared information is generated and a character string or structure is already changed after editing of said document , maintains contents of said character string in its state after the change and returns the structure change to its state at the time of creating the document , generates shared information satisfying its consistency , and , when it is desired to display or print said document in said output step , embeds said consistency-satisfied shared information in the document . US6349302B1 CLAIM 11 . A computer readable recording medium (computer program product) storing a document processing program implemented by a computer , said program executing the steps of : generating as said shared information a term combination of such a term as abbreviation or coinage and such a term as person' ; s name or belonging department and edits the shared information into structured documents depending on the types of the information ; storing the generated shared information block in a first memory ; describing a link to the shared information in the documents ; storing the link-described documents in a second memory ; and reading out from said memories said generated shared information and described document , embedding the shared information in the link-described document according to the links described therein and said generated shared information , and generating and outputting information indicative of a document having the shared information embedded therein . |
| US9087321B2 CLAIM 22 . The computer program product (readable recording medium) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations (processing step) of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US6349302B1 CLAIM 2 . A document processing method according to claim 1 , further comprising a step of managing a change history of said shared information and document and a step of subjecting the shared information to a consistency processing operation to generate consistency-processed shared information already subjected to said consistency processing operation , and wherein said version management step stores in said memory said generated shared information and generated document as the document of a new version , creates version information for each of the shared information and document and stores the version information in said memory , said consistency processing step (computer to perform operations) , when said shared information is generated and a character string or structure is already changed after editing of said document , maintains contents of said character string in its state after the change and returns the structure change to its state at the time of creating the document , generates shared information satisfying its consistency , and , when it is desired to display or print said document in said output step , embeds said consistency-satisfied shared information in the document . US6349302B1 CLAIM 11 . A computer readable recording medium (computer program product) storing a document processing program implemented by a computer , said program executing the steps of : generating as said shared information a term combination of such a term as abbreviation or coinage and such a term as person' ; s name or belonging department and edits the shared information into structured documents depending on the types of the information ; storing the generated shared information block in a first memory ; describing a link to the shared information in the documents ; storing the link-described documents in a second memory ; and reading out from said memories said generated shared information and described document , embedding the shared information in the link-described document according to the links described therein and said generated shared information , and generating and outputting information indicative of a document having the shared information embedded therein . |
| US9087321B2 CLAIM 23 . The computer program product (readable recording medium) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations (processing step) of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6349302B1 CLAIM 2 . A document processing method according to claim 1 , further comprising a step of managing a change history of said shared information and document and a step of subjecting the shared information to a consistency processing operation to generate consistency-processed shared information already subjected to said consistency processing operation , and wherein said version management step stores in said memory said generated shared information and generated document as the document of a new version , creates version information for each of the shared information and document and stores the version information in said memory , said consistency processing step (computer to perform operations) , when said shared information is generated and a character string or structure is already changed after editing of said document , maintains contents of said character string in its state after the change and returns the structure change to its state at the time of creating the document , generates shared information satisfying its consistency , and , when it is desired to display or print said document in said output step , embeds said consistency-satisfied shared information in the document . US6349302B1 CLAIM 11 . A computer readable recording medium (computer program product) storing a document processing program implemented by a computer , said program executing the steps of : generating as said shared information a term combination of such a term as abbreviation or coinage and such a term as person' ; s name or belonging department and edits the shared information into structured documents depending on the types of the information ; storing the generated shared information block in a first memory ; describing a link to the shared information in the documents ; storing the link-described documents in a second memory ; and reading out from said memories said generated shared information and described document , embedding the shared information in the link-described document according to the links described therein and said generated shared information , and generating and outputting information indicative of a document having the shared information embedded therein . |
| US9087321B2 CLAIM 24 . The computer program product (readable recording medium) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations (processing step) of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6349302B1 CLAIM 2 . A document processing method according to claim 1 , further comprising a step of managing a change history of said shared information and document and a step of subjecting the shared information to a consistency processing operation to generate consistency-processed shared information already subjected to said consistency processing operation , and wherein said version management step stores in said memory said generated shared information and generated document as the document of a new version , creates version information for each of the shared information and document and stores the version information in said memory , said consistency processing step (computer to perform operations) , when said shared information is generated and a character string or structure is already changed after editing of said document , maintains contents of said character string in its state after the change and returns the structure change to its state at the time of creating the document , generates shared information satisfying its consistency , and , when it is desired to display or print said document in said output step , embeds said consistency-satisfied shared information in the document . US6349302B1 CLAIM 11 . A computer readable recording medium (computer program product) storing a document processing program implemented by a computer , said program executing the steps of : generating as said shared information a term combination of such a term as abbreviation or coinage and such a term as person' ; s name or belonging department and edits the shared information into structured documents depending on the types of the information ; storing the generated shared information block in a first memory ; describing a link to the shared information in the documents ; storing the link-described documents in a second memory ; and reading out from said memories said generated shared information and described document , embedding the shared information in the link-described document according to the links described therein and said generated shared information , and generating and outputting information indicative of a document having the shared information embedded therein . |
| US9087321B2 CLAIM 25 . The computer program product (readable recording medium) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6349302B1 CLAIM 11 . A computer readable recording medium (computer program product) storing a document processing program implemented by a computer , said program executing the steps of : generating as said shared information a term combination of such a term as abbreviation or coinage and such a term as person' ; s name or belonging department and edits the shared information into structured documents depending on the types of the information ; storing the generated shared information block in a first memory ; describing a link to the shared information in the documents ; storing the link-described documents in a second memory ; and reading out from said memories said generated shared information and described document , embedding the shared information in the link-described document according to the links described therein and said generated shared information , and generating and outputting information indicative of a document having the shared information embedded therein . |
| US9087321B2 CLAIM 26 . The computer program product (readable recording medium) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations (processing step) of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6349302B1 CLAIM 2 . A document processing method according to claim 1 , further comprising a step of managing a change history of said shared information and document and a step of subjecting the shared information to a consistency processing operation to generate consistency-processed shared information already subjected to said consistency processing operation , and wherein said version management step stores in said memory said generated shared information and generated document as the document of a new version , creates version information for each of the shared information and document and stores the version information in said memory , said consistency processing step (computer to perform operations) , when said shared information is generated and a character string or structure is already changed after editing of said document , maintains contents of said character string in its state after the change and returns the structure change to its state at the time of creating the document , generates shared information satisfying its consistency , and , when it is desired to display or print said document in said output step , embeds said consistency-satisfied shared information in the document . US6349302B1 CLAIM 11 . A computer readable recording medium (computer program product) storing a document processing program implemented by a computer , said program executing the steps of : generating as said shared information a term combination of such a term as abbreviation or coinage and such a term as person' ; s name or belonging department and edits the shared information into structured documents depending on the types of the information ; storing the generated shared information block in a first memory ; describing a link to the shared information in the documents ; storing the link-described documents in a second memory ; and reading out from said memories said generated shared information and described document , embedding the shared information in the link-described document according to the links described therein and said generated shared information , and generating and outputting information indicative of a document having the shared information embedded therein . |
| US9087321B2 CLAIM 27 . The computer program product (readable recording medium) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6349302B1 CLAIM 11 . A computer readable recording medium (computer program product) storing a document processing program implemented by a computer , said program executing the steps of : generating as said shared information a term combination of such a term as abbreviation or coinage and such a term as person' ; s name or belonging department and edits the shared information into structured documents depending on the types of the information ; storing the generated shared information block in a first memory ; describing a link to the shared information in the documents ; storing the link-described documents in a second memory ; and reading out from said memories said generated shared information and described document , embedding the shared information in the link-described document according to the links described therein and said generated shared information , and generating and outputting information indicative of a document having the shared information embedded therein . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6338086B1 Filed: 1998-06-11 Issued: 2002-01-08 Collaborative object architecture (Original Assignee) Placeware Inc (Current Assignee) Microsoft Technology Licensing LLC Pavel Curtis, Michael D. Dixon, David A. Nichols |
|---|---|
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (electronic systems) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6338086B1 CLAIM 8 . A computer readable medium having stored thereon sequences of instructions which when executed cause one or more electronic systems (next polling) to : execute a pod having a first plurality of constituent parts on a server system coupled to a plurality of clients systems : a first client system adapted to execute a first applet having a second plurality of constituent parts ; and a second client system adapted to execute a second applet having a third plurality of constituent parts ; receive , at the pod , a first message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts ; receive , at the pod , a second message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts : process , at the pod , the plurality of messages by : determining an order in which to process the received messages ; and communicating a set of data resulting from the processing to first and second applets , wherein the first and second applets continue execution prior to processing the messages . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6338086B1 CLAIM 1 . A collaborative object architecture comprising : a server system (match servers) adapted to execute a pod having a plurality of constituent parts ; and a plurality client systems coupled to the server system , the client systems each adapted to execute at least one applet having a plurality of constituent parts , the pod and the applets together comprising a collaborative object , wherein the pod plurality of constituent parts correspond to the applet plurality of constituent parts such that a change to one of the applet plurality of constituent parts causes a change to a corresponding constituent part in the pod ; wherein the applets receive input , generate one or more messages to the pod in response to the input , and apply the input locally without waiting for a response from the pod , and further wherein the pod is adapted to receive message packets from multiple applets , determine an order in which to process the received message packets and communicate a set of data resulting from processing to the multiple applets such that the multiple applets receive the set of data from messages originating from the pod . US6338086B1 CLAIM 8 . A computer readable medium (match server) having stored thereon sequences of instructions which when executed cause one or more electronic systems to : execute a pod having a first plurality of constituent parts on a server system coupled to a plurality of clients systems : a first client system adapted to execute a first applet having a second plurality of constituent parts ; and a second client system adapted to execute a second applet having a third plurality of constituent parts ; receive , at the pod , a first message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts ; receive , at the pod , a second message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts : process , at the pod , the plurality of messages by : determining an order in which to process the received messages ; and communicating a set of data resulting from the processing to first and second applets , wherein the first and second applets continue execution prior to processing the messages . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6338086B1 CLAIM 8 . A computer readable medium (match server) having stored thereon sequences of instructions which when executed cause one or more electronic systems to : execute a pod having a first plurality of constituent parts on a server system coupled to a plurality of clients systems : a first client system adapted to execute a first applet having a second plurality of constituent parts ; and a second client system adapted to execute a second applet having a third plurality of constituent parts ; receive , at the pod , a first message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts ; receive , at the pod , a second message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts : process , at the pod , the plurality of messages by : determining an order in which to process the received messages ; and communicating a set of data resulting from the processing to first and second applets , wherein the first and second applets continue execution prior to processing the messages . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6338086B1 CLAIM 1 . A collaborative object architecture comprising : a server system (match servers) adapted to execute a pod having a plurality of constituent parts ; and a plurality client systems coupled to the server system , the client systems each adapted to execute at least one applet having a plurality of constituent parts , the pod and the applets together comprising a collaborative object , wherein the pod plurality of constituent parts correspond to the applet plurality of constituent parts such that a change to one of the applet plurality of constituent parts causes a change to a corresponding constituent part in the pod ; wherein the applets receive input , generate one or more messages to the pod in response to the input , and apply the input locally without waiting for a response from the pod , and further wherein the pod is adapted to receive message packets from multiple applets , determine an order in which to process the received message packets and communicate a set of data resulting from processing to the multiple applets such that the multiple applets receive the set of data from messages originating from the pod . US6338086B1 CLAIM 8 . A computer readable medium (match server) having stored thereon sequences of instructions which when executed cause one or more electronic systems to : execute a pod having a first plurality of constituent parts on a server system coupled to a plurality of clients systems : a first client system adapted to execute a first applet having a second plurality of constituent parts ; and a second client system adapted to execute a second applet having a third plurality of constituent parts ; receive , at the pod , a first message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts ; receive , at the pod , a second message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts : process , at the pod , the plurality of messages by : determining an order in which to process the received messages ; and communicating a set of data resulting from the processing to first and second applets , wherein the first and second applets continue execution prior to processing the messages . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6338086B1 CLAIM 8 . A computer readable medium (match server) having stored thereon sequences of instructions which when executed cause one or more electronic systems to : execute a pod having a first plurality of constituent parts on a server system coupled to a plurality of clients systems : a first client system adapted to execute a first applet having a second plurality of constituent parts ; and a second client system adapted to execute a second applet having a third plurality of constituent parts ; receive , at the pod , a first message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts ; receive , at the pod , a second message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts : process , at the pod , the plurality of messages by : determining an order in which to process the received messages ; and communicating a set of data resulting from the processing to first and second applets , wherein the first and second applets continue execution prior to processing the messages . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (electronic systems) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6338086B1 CLAIM 8 . A computer readable medium having stored thereon sequences of instructions which when executed cause one or more electronic systems (next polling) to : execute a pod having a first plurality of constituent parts on a server system coupled to a plurality of clients systems : a first client system adapted to execute a first applet having a second plurality of constituent parts ; and a second client system adapted to execute a second applet having a third plurality of constituent parts ; receive , at the pod , a first message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts ; receive , at the pod , a second message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts : process , at the pod , the plurality of messages by : determining an order in which to process the received messages ; and communicating a set of data resulting from the processing to first and second applets , wherein the first and second applets continue execution prior to processing the messages . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6338086B1 CLAIM 1 . A collaborative object architecture comprising : a server system (match servers) adapted to execute a pod having a plurality of constituent parts ; and a plurality client systems coupled to the server system , the client systems each adapted to execute at least one applet having a plurality of constituent parts , the pod and the applets together comprising a collaborative object , wherein the pod plurality of constituent parts correspond to the applet plurality of constituent parts such that a change to one of the applet plurality of constituent parts causes a change to a corresponding constituent part in the pod ; wherein the applets receive input , generate one or more messages to the pod in response to the input , and apply the input locally without waiting for a response from the pod , and further wherein the pod is adapted to receive message packets from multiple applets , determine an order in which to process the received message packets and communicate a set of data resulting from processing to the multiple applets such that the multiple applets receive the set of data from messages originating from the pod . US6338086B1 CLAIM 8 . A computer readable medium (match server) having stored thereon sequences of instructions which when executed cause one or more electronic systems to : execute a pod having a first plurality of constituent parts on a server system coupled to a plurality of clients systems : a first client system adapted to execute a first applet having a second plurality of constituent parts ; and a second client system adapted to execute a second applet having a third plurality of constituent parts ; receive , at the pod , a first message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts ; receive , at the pod , a second message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts : process , at the pod , the plurality of messages by : determining an order in which to process the received messages ; and communicating a set of data resulting from the processing to first and second applets , wherein the first and second applets continue execution prior to processing the messages . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6338086B1 CLAIM 8 . A computer readable medium (match server) having stored thereon sequences of instructions which when executed cause one or more electronic systems to : execute a pod having a first plurality of constituent parts on a server system coupled to a plurality of clients systems : a first client system adapted to execute a first applet having a second plurality of constituent parts ; and a second client system adapted to execute a second applet having a third plurality of constituent parts ; receive , at the pod , a first message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts ; receive , at the pod , a second message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts : process , at the pod , the plurality of messages by : determining an order in which to process the received messages ; and communicating a set of data resulting from the processing to first and second applets , wherein the first and second applets continue execution prior to processing the messages . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6338086B1 CLAIM 1 . A collaborative object architecture comprising : a server system (match servers) adapted to execute a pod having a plurality of constituent parts ; and a plurality client systems coupled to the server system , the client systems each adapted to execute at least one applet having a plurality of constituent parts , the pod and the applets together comprising a collaborative object , wherein the pod plurality of constituent parts correspond to the applet plurality of constituent parts such that a change to one of the applet plurality of constituent parts causes a change to a corresponding constituent part in the pod ; wherein the applets receive input , generate one or more messages to the pod in response to the input , and apply the input locally without waiting for a response from the pod , and further wherein the pod is adapted to receive message packets from multiple applets , determine an order in which to process the received message packets and communicate a set of data resulting from processing to the multiple applets such that the multiple applets receive the set of data from messages originating from the pod . US6338086B1 CLAIM 8 . A computer readable medium (match server) having stored thereon sequences of instructions which when executed cause one or more electronic systems to : execute a pod having a first plurality of constituent parts on a server system coupled to a plurality of clients systems : a first client system adapted to execute a first applet having a second plurality of constituent parts ; and a second client system adapted to execute a second applet having a third plurality of constituent parts ; receive , at the pod , a first message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts ; receive , at the pod , a second message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts : process , at the pod , the plurality of messages by : determining an order in which to process the received messages ; and communicating a set of data resulting from the processing to first and second applets , wherein the first and second applets continue execution prior to processing the messages . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6338086B1 CLAIM 8 . A computer readable medium (match server) having stored thereon sequences of instructions which when executed cause one or more electronic systems to : execute a pod having a first plurality of constituent parts on a server system coupled to a plurality of clients systems : a first client system adapted to execute a first applet having a second plurality of constituent parts ; and a second client system adapted to execute a second applet having a third plurality of constituent parts ; receive , at the pod , a first message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts ; receive , at the pod , a second message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts : process , at the pod , the plurality of messages by : determining an order in which to process the received messages ; and communicating a set of data resulting from the processing to first and second applets , wherein the first and second applets continue execution prior to processing the messages . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling (electronic systems) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6338086B1 CLAIM 8 . A computer readable medium having stored thereon sequences of instructions which when executed cause one or more electronic systems (next polling) to : execute a pod having a first plurality of constituent parts on a server system coupled to a plurality of clients systems : a first client system adapted to execute a first applet having a second plurality of constituent parts ; and a second client system adapted to execute a second applet having a third plurality of constituent parts ; receive , at the pod , a first message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts ; receive , at the pod , a second message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts : process , at the pod , the plurality of messages by : determining an order in which to process the received messages ; and communicating a set of data resulting from the processing to first and second applets , wherein the first and second applets continue execution prior to processing the messages . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6338086B1 CLAIM 1 . A collaborative object architecture comprising : a server system (match servers) adapted to execute a pod having a plurality of constituent parts ; and a plurality client systems coupled to the server system , the client systems each adapted to execute at least one applet having a plurality of constituent parts , the pod and the applets together comprising a collaborative object , wherein the pod plurality of constituent parts correspond to the applet plurality of constituent parts such that a change to one of the applet plurality of constituent parts causes a change to a corresponding constituent part in the pod ; wherein the applets receive input , generate one or more messages to the pod in response to the input , and apply the input locally without waiting for a response from the pod , and further wherein the pod is adapted to receive message packets from multiple applets , determine an order in which to process the received message packets and communicate a set of data resulting from processing to the multiple applets such that the multiple applets receive the set of data from messages originating from the pod . US6338086B1 CLAIM 8 . A computer readable medium (match server) having stored thereon sequences of instructions which when executed cause one or more electronic systems to : execute a pod having a first plurality of constituent parts on a server system coupled to a plurality of clients systems : a first client system adapted to execute a first applet having a second plurality of constituent parts ; and a second client system adapted to execute a second applet having a third plurality of constituent parts ; receive , at the pod , a first message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts ; receive , at the pod , a second message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts : process , at the pod , the plurality of messages by : determining an order in which to process the received messages ; and communicating a set of data resulting from the processing to first and second applets , wherein the first and second applets continue execution prior to processing the messages . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6338086B1 CLAIM 8 . A computer readable medium (match server) having stored thereon sequences of instructions which when executed cause one or more electronic systems to : execute a pod having a first plurality of constituent parts on a server system coupled to a plurality of clients systems : a first client system adapted to execute a first applet having a second plurality of constituent parts ; and a second client system adapted to execute a second applet having a third plurality of constituent parts ; receive , at the pod , a first message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts ; receive , at the pod , a second message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts : process , at the pod , the plurality of messages by : determining an order in which to process the received messages ; and communicating a set of data resulting from the processing to first and second applets , wherein the first and second applets continue execution prior to processing the messages . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers (server system) , each match server (computer readable medium) being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6338086B1 CLAIM 1 . A collaborative object architecture comprising : a server system (match servers) adapted to execute a pod having a plurality of constituent parts ; and a plurality client systems coupled to the server system , the client systems each adapted to execute at least one applet having a plurality of constituent parts , the pod and the applets together comprising a collaborative object , wherein the pod plurality of constituent parts correspond to the applet plurality of constituent parts such that a change to one of the applet plurality of constituent parts causes a change to a corresponding constituent part in the pod ; wherein the applets receive input , generate one or more messages to the pod in response to the input , and apply the input locally without waiting for a response from the pod , and further wherein the pod is adapted to receive message packets from multiple applets , determine an order in which to process the received message packets and communicate a set of data resulting from processing to the multiple applets such that the multiple applets receive the set of data from messages originating from the pod . US6338086B1 CLAIM 8 . A computer readable medium (match server) having stored thereon sequences of instructions which when executed cause one or more electronic systems to : execute a pod having a first plurality of constituent parts on a server system coupled to a plurality of clients systems : a first client system adapted to execute a first applet having a second plurality of constituent parts ; and a second client system adapted to execute a second applet having a third plurality of constituent parts ; receive , at the pod , a first message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts ; receive , at the pod , a second message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts : process , at the pod , the plurality of messages by : determining an order in which to process the received messages ; and communicating a set of data resulting from the processing to first and second applets , wherein the first and second applets continue execution prior to processing the messages . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server (computer readable medium) is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6338086B1 CLAIM 8 . A computer readable medium (match server) having stored thereon sequences of instructions which when executed cause one or more electronic systems to : execute a pod having a first plurality of constituent parts on a server system coupled to a plurality of clients systems : a first client system adapted to execute a first applet having a second plurality of constituent parts ; and a second client system adapted to execute a second applet having a third plurality of constituent parts ; receive , at the pod , a first message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts ; receive , at the pod , a second message from at least one of the second plurality of constituent parts indicating a change to data controlled by the first plurality of constituent parts : process , at the pod , the plurality of messages by : determining an order in which to process the received messages ; and communicating a set of data resulting from the processing to first and second applets , wherein the first and second applets continue execution prior to processing the messages . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US6366923B1 Filed: 1998-03-23 Issued: 2002-04-02 Gathering selected information from the world wide web (Original Assignee) Webivore Res LLC (Current Assignee) WEBIVORE RESEARCH LLC ; Webivore Res LLC Cecilia Lenk, James E. Gouldstone, James G. Reidy, Carl J. Gort |
|---|---|
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (web browser) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6366923B1 CLAIM 4 . The method of claim 1 , further comprising outputting the file to a frame in a web browser (executable instruction, computer executable instruction) displayed on the computer monitor . |
| US9087321B2 CLAIM 19 . A computer program product (location info) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations (location info) of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US6366923B1 CLAIM 9 . The method of claim 1 , wherein location info (computer program product, computer to perform operations) rmation about the clipped portion relative to the URL of the view is stored . |
| US9087321B2 CLAIM 20 . The computer program product (location info) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations (location info) of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US6366923B1 CLAIM 9 . The method of claim 1 , wherein location info (computer program product, computer to perform operations) rmation about the clipped portion relative to the URL of the view is stored . |
| US9087321B2 CLAIM 21 . The computer program product (location info) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations (location info) of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US6366923B1 CLAIM 9 . The method of claim 1 , wherein location info (computer program product, computer to perform operations) rmation about the clipped portion relative to the URL of the view is stored . |
| US9087321B2 CLAIM 22 . The computer program product (location info) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations (location info) of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US6366923B1 CLAIM 9 . The method of claim 1 , wherein location info (computer program product, computer to perform operations) rmation about the clipped portion relative to the URL of the view is stored . |
| US9087321B2 CLAIM 23 . The computer program product (location info) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations (location info) of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US6366923B1 CLAIM 9 . The method of claim 1 , wherein location info (computer program product, computer to perform operations) rmation about the clipped portion relative to the URL of the view is stored . |
| US9087321B2 CLAIM 24 . The computer program product (location info) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations (location info) of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6366923B1 CLAIM 9 . The method of claim 1 , wherein location info (computer program product, computer to perform operations) rmation about the clipped portion relative to the URL of the view is stored . |
| US9087321B2 CLAIM 25 . The computer program product (location info) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6366923B1 CLAIM 9 . The method of claim 1 , wherein location info (computer program product, computer to perform operations) rmation about the clipped portion relative to the URL of the view is stored . |
| US9087321B2 CLAIM 26 . The computer program product (location info) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations (location info) of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US6366923B1 CLAIM 9 . The method of claim 1 , wherein location info (computer program product, computer to perform operations) rmation about the clipped portion relative to the URL of the view is stored . |
| US9087321B2 CLAIM 27 . The computer program product (location info) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US6366923B1 CLAIM 9 . The method of claim 1 , wherein location info (computer program product, computer to perform operations) rmation about the clipped portion relative to the URL of the view is stored . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | JPH1125288A Filed: 1997-07-09 Issued: 1999-01-29 Cyberspace system and cyberspace construction method (Original Assignee) Casio Comput Co Ltd; カシオ計算機株式会社 Toru Yamakita, 徹 山北 |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (plurality) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JPH1125288A CLAIM 1 【請求項１】 サイバースペースを表示する複数のユー ザ端末と、それら複数のユーザ端末に表示されるサイバ ースペースを管理するマップサーバとを有するサイバー スペースシステムであって、 各ユーザ端末は、 当該ユーザ端末にメタファの配置を設定させる手段と、 上記設定されたメタファの配置に従ってサイバースペー スを表示する手段と、 上記サイバースペース内にユーザの分身であるアバター を表示する手段とを有し、 上記マップサーバは、 上記各ユーザ端末ごとに構築されたサイバースペースに おける各アバターの位置を検出する手段と、 上記検出結果に基づいて２つ以上のサイバースペースを 互いにリンク付ける手段とを有するサイバースペースシ ステム。 1 . A cyberspace system comprising : a plurality (data processing system, data processing system having one) of user terminals for displaying cyberspace ; and a map server for managing the cyberspace displayed on the plurality of user terminals , wherein each user terminal includes the user terminal . Means for setting the arrangement of metaphors , means for displaying cyberspace in accordance with the set arrangement of metaphors , and means for displaying an avatar that is a user' ; s alter ego in the cyberspace . A cyberspace system comprising : means for detecting the position of each avatar in a cyberspace constructed for each user terminal ; and means for linking two or more cyberspaces based on the detection result . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction means (の指示) to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JPH1125288A CLAIM 10 【請求項１０】 サイバースペース内に配置されるメタ ファのサイズをユーザに指定させ、その指示 (readable instruction, instruction means, readable instruction means) に従ってメ タファを表示するメタファ表示手段と、 表示されるメタファのサイズに従って上記閾値を変更す る閾値変更手段とをさらに有する請求項６に記載のサイ バースペースシステム。 10 . A metaphor display unit for allowing a user to specify the size of a metaphor arranged in cyberspace and displaying the metaphor in accordance with the instruction , and a threshold changing unit for changing the threshold according to the displayed size of the metaphor . The cyberspace system according to claim 6 , further comprising : |
| US9087321B2 CLAIM 19 . A computer program product for creating a poll-based network , the computer program product comprising computer-readable instruction means (の指示) stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
JPH1125288A CLAIM 10 【請求項１０】 サイバースペース内に配置されるメタ ファのサイズをユーザに指定させ、その指示 (readable instruction, instruction means, readable instruction means) に従ってメ タファを表示するメタファ表示手段と、 表示されるメタファのサイズに従って上記閾値を変更す る閾値変更手段とをさらに有する請求項６に記載のサイ バースペースシステム。 10 . A metaphor display unit for allowing a user to specify the size of a metaphor arranged in cyberspace and displaying the metaphor in accordance with the instruction , and a threshold changing unit for changing the threshold according to the displayed size of the metaphor . The cyberspace system according to claim 6 , further comprising : |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means (の指示) for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
JPH1125288A CLAIM 10 【請求項１０】 サイバースペース内に配置されるメタ ファのサイズをユーザに指定させ、その指示 (readable instruction, instruction means, readable instruction means) に従ってメ タファを表示するメタファ表示手段と、 表示されるメタファのサイズに従って上記閾値を変更す る閾値変更手段とをさらに有する請求項６に記載のサイ バースペースシステム。 10 . A metaphor display unit for allowing a user to specify the size of a metaphor arranged in cyberspace and displaying the metaphor in accordance with the instruction , and a threshold changing unit for changing the threshold according to the displayed size of the metaphor . The cyberspace system according to claim 6 , further comprising : |
| US9087321B2 CLAIM 21 . The computer program product as set forth in claim 20 , further comprising instruction means (の指示) for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
JPH1125288A CLAIM 10 【請求項１０】 サイバースペース内に配置されるメタ ファのサイズをユーザに指定させ、その指示 (readable instruction, instruction means, readable instruction means) に従ってメ タファを表示するメタファ表示手段と、 表示されるメタファのサイズに従って上記閾値を変更す る閾値変更手段とをさらに有する請求項６に記載のサイ バースペースシステム。 10 . A metaphor display unit for allowing a user to specify the size of a metaphor arranged in cyberspace and displaying the metaphor in accordance with the instruction , and a threshold changing unit for changing the threshold according to the displayed size of the metaphor . The cyberspace system according to claim 6 , further comprising : |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means (の指示) for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
JPH1125288A CLAIM 10 【請求項１０】 サイバースペース内に配置されるメタ ファのサイズをユーザに指定させ、その指示 (readable instruction, instruction means, readable instruction means) に従ってメ タファを表示するメタファ表示手段と、 表示されるメタファのサイズに従って上記閾値を変更す る閾値変更手段とをさらに有する請求項６に記載のサイ バースペースシステム。 10 . A metaphor display unit for allowing a user to specify the size of a metaphor arranged in cyberspace and displaying the metaphor in accordance with the instruction , and a threshold changing unit for changing the threshold according to the displayed size of the metaphor . The cyberspace system according to claim 6 , further comprising : |
| US9087321B2 CLAIM 23 . The computer program product as set forth in claim 22 , further comprising instruction means (の指示) for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
JPH1125288A CLAIM 10 【請求項１０】 サイバースペース内に配置されるメタ ファのサイズをユーザに指定させ、その指示 (readable instruction, instruction means, readable instruction means) に従ってメ タファを表示するメタファ表示手段と、 表示されるメタファのサイズに従って上記閾値を変更す る閾値変更手段とをさらに有する請求項６に記載のサイ バースペースシステム。 10 . A metaphor display unit for allowing a user to specify the size of a metaphor arranged in cyberspace and displaying the metaphor in accordance with the instruction , and a threshold changing unit for changing the threshold according to the displayed size of the metaphor . The cyberspace system according to claim 6 , further comprising : |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means (の指示) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JPH1125288A CLAIM 10 【請求項１０】 サイバースペース内に配置されるメタ ファのサイズをユーザに指定させ、その指示 (readable instruction, instruction means, readable instruction means) に従ってメ タファを表示するメタファ表示手段と、 表示されるメタファのサイズに従って上記閾値を変更す る閾値変更手段とをさらに有する請求項６に記載のサイ バースペースシステム。 10 . A metaphor display unit for allowing a user to specify the size of a metaphor arranged in cyberspace and displaying the metaphor in accordance with the instruction , and a threshold changing unit for changing the threshold according to the displayed size of the metaphor . The cyberspace system according to claim 6 , further comprising : |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means (の指示) for causing the computer to perform operations of : collecting the selected answers with a web server and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
JPH1125288A CLAIM 10 【請求項１０】 サイバースペース内に配置されるメタ ファのサイズをユーザに指定させ、その指示 (readable instruction, instruction means, readable instruction means) に従ってメ タファを表示するメタファ表示手段と、 表示されるメタファのサイズに従って上記閾値を変更す る閾値変更手段とをさらに有する請求項６に記載のサイ バースペースシステム。 10 . A metaphor display unit for allowing a user to specify the size of a metaphor arranged in cyberspace and displaying the metaphor in accordance with the instruction , and a threshold changing unit for changing the threshold according to the displayed size of the metaphor . The cyberspace system according to claim 6 , further comprising : |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | WO9800787A1 Filed: 1997-06-30 Issued: 1998-01-08 Electronic mail system for receiving and forwarding e-mail messages based on subscriber supplied criteria (Original Assignee) Datalink Systems Corporation Manuel Zahariev |
|---|---|
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (e-mail messages) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
WO9800787A1 CLAIM 1 . A system for receiving and forwarding e-mail messages (next polling) for a subscriber , the system comprising : a server connected to a network ; and a Mail Alert code set resident and operable on the server ; wherein the MailAlert code set is adapted to compare characteristics of e-mail messages received for the subscriber to specific message characteristics provided by the subscriber and pre-stored on the server , to alert the subscriber when a characteristic match is found , and to execute following instructions from the subscriber for forwarding of the message received for which a match was found . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (mail server) per selected answer and m rows per user . |
WO9800787A1 CLAIM 5 . An e-mail server (n bytes) comprising : an e-mail system adapted for receiving and forwarding e-mail : and a Mail Alert system adapted to compare characteristics of e-mail messages received for the subscriber to specific message characteristics provided by the subscriber and pre-stored on the server , to alert the subscriber when a characteristic match is found , and to execute 5 following instructions from the subscriber for forwarding of the message received for which a match was found . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (mail server) per selected answer and m rows per user . |
WO9800787A1 CLAIM 5 . An e-mail server (n bytes) comprising : an e-mail system adapted for receiving and forwarding e-mail : and a Mail Alert system adapted to compare characteristics of e-mail messages received for the subscriber to specific message characteristics provided by the subscriber and pre-stored on the server , to alert the subscriber when a characteristic match is found , and to execute 5 following instructions from the subscriber for forwarding of the message received for which a match was found . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (e-mail messages) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
WO9800787A1 CLAIM 1 . A system for receiving and forwarding e-mail messages (next polling) for a subscriber , the system comprising : a server connected to a network ; and a Mail Alert code set resident and operable on the server ; wherein the MailAlert code set is adapted to compare characteristics of e-mail messages received for the subscriber to specific message characteristics provided by the subscriber and pre-stored on the server , to alert the subscriber when a characteristic match is found , and to execute following instructions from the subscriber for forwarding of the message received for which a match was found . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes (mail server) per selected answer and m rows per user . |
WO9800787A1 CLAIM 5 . An e-mail server (n bytes) comprising : an e-mail system adapted for receiving and forwarding e-mail : and a Mail Alert system adapted to compare characteristics of e-mail messages received for the subscriber to specific message characteristics provided by the subscriber and pre-stored on the server , to alert the subscriber when a characteristic match is found , and to execute 5 following instructions from the subscriber for forwarding of the message received for which a match was found . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (mail server) per selected answer and m rows per user . |
WO9800787A1 CLAIM 5 . An e-mail server (n bytes) comprising : an e-mail system adapted for receiving and forwarding e-mail : and a Mail Alert system adapted to compare characteristics of e-mail messages received for the subscriber to specific message characteristics provided by the subscriber and pre-stored on the server , to alert the subscriber when a characteristic match is found , and to execute 5 following instructions from the subscriber for forwarding of the message received for which a match was found . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling (e-mail messages) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
WO9800787A1 CLAIM 1 . A system for receiving and forwarding e-mail messages (next polling) for a subscriber , the system comprising : a server connected to a network ; and a Mail Alert code set resident and operable on the server ; wherein the MailAlert code set is adapted to compare characteristics of e-mail messages received for the subscriber to specific message characteristics provided by the subscriber and pre-stored on the server , to alert the subscriber when a characteristic match is found , and to execute following instructions from the subscriber for forwarding of the message received for which a match was found . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (mail server) per selected answer and m rows per user . |
WO9800787A1 CLAIM 5 . An e-mail server (n bytes) comprising : an e-mail system adapted for receiving and forwarding e-mail : and a Mail Alert system adapted to compare characteristics of e-mail messages received for the subscriber to specific message characteristics provided by the subscriber and pre-stored on the server , to alert the subscriber when a characteristic match is found , and to execute 5 following instructions from the subscriber for forwarding of the message received for which a match was found . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (mail server) per selected answer and m rows per user . |
WO9800787A1 CLAIM 5 . An e-mail server (n bytes) comprising : an e-mail system adapted for receiving and forwarding e-mail : and a Mail Alert system adapted to compare characteristics of e-mail messages received for the subscriber to specific message characteristics provided by the subscriber and pre-stored on the server , to alert the subscriber when a characteristic match is found , and to execute 5 following instructions from the subscriber for forwarding of the message received for which a match was found . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US5845299A Filed: 1996-07-29 Issued: 1998-12-01 Draw-based editor for web pages (Original Assignee) Rae Tech LLC (Current Assignee) WEBCOM GROUP Inc ; Adobe Inc Samir Arora, Gagan Arora, Rajagopal Lakshminarayan, Gregory Brown, Martin Fried-Nielsen |
|---|---|
| US9087321B2 CLAIM 1 . A poll-based networking system , comprising : a data processing system (data processing system) having one or more processors and a memory , the memory being specifically encoded with instructions such that when executed , the instructions cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US5845299A CLAIM 1 . A method of allowing a user to define a World Wide Web page comprising the steps , performed by a data processing system (data processing system) , of : displaying a plurality of page display elements on a display device , the display elements forming a page layout on the display device ; receiving an indication that the user wants to add a new display element to a page at a first position on the page ; adding a new draw data structure in a memory of the data processing system for the new display element to a plurality of other draw data structures , the draw data structures corresponding to the plurality of page display elements , where the new draw data structure includes data representing the first position ; and generating in response to an indication to create the Web page , at least one HTML table that substantially reflects a layout of the entire displayed page on a pixel by pixel basis in accordance with the draw data structures . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US5845299A CLAIM 1 . A method of allowing a user to define a World Wide Web (web server) page comprising the steps , performed by a data processing system , of : displaying a plurality of page display elements on a display device , the display elements forming a page layout on the display device ; receiving an indication that the user wants to add a new display element to a page at a first position on the page ; adding a new draw data structure in a memory of the data processing system for the new display element to a plurality of other draw data structures , the draw data structures corresponding to the plurality of page display elements , where the new draw data structure includes data representing the first position ; and generating in response to an indication to create the Web page , at least one HTML table that substantially reflects a layout of the entire displayed page on a pixel by pixel basis in accordance with the draw data structures . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US5845299A CLAIM 1 . A method of allowing a user to define a World Wide Web (web server) page comprising the steps , performed by a data processing system , of : displaying a plurality of page display elements on a display device , the display elements forming a page layout on the display device ; receiving an indication that the user wants to add a new display element to a page at a first position on the page ; adding a new draw data structure in a memory of the data processing system for the new display element to a plurality of other draw data structures , the draw data structures corresponding to the plurality of page display elements , where the new draw data structure includes data representing the first position ; and generating in response to an indication to create the Web page , at least one HTML table that substantially reflects a layout of the entire displayed page on a pixel by pixel basis in accordance with the draw data structures . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one or more processors and a memory specifically encoded with computer executable instruction (web browser) means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US5845299A CLAIM 24 . The method of claim 5 , further including the steps of : viewing the HTML via a web browser (executable instruction, computer executable instruction) , where the page displayed by the browser corresponds to the displayed page layout on a pixel by pixel basis . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US5845299A CLAIM 1 . A method of allowing a user to define a World Wide Web (web server) page comprising the steps , performed by a data processing system , of : displaying a plurality of page display elements on a display device , the display elements forming a page layout on the display device ; receiving an indication that the user wants to add a new display element to a page at a first position on the page ; adding a new draw data structure in a memory of the data processing system for the new display element to a plurality of other draw data structures , the draw data structures corresponding to the plurality of page display elements , where the new draw data structure includes data representing the first position ; and generating in response to an indication to create the Web page , at least one HTML table that substantially reflects a layout of the entire displayed page on a pixel by pixel basis in accordance with the draw data structures . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US5845299A CLAIM 1 . A method of allowing a user to define a World Wide Web (web server) page comprising the steps , performed by a data processing system , of : displaying a plurality of page display elements on a display device , the display elements forming a page layout on the display device ; receiving an indication that the user wants to add a new display element to a page at a first position on the page ; adding a new draw data structure in a memory of the data processing system for the new display element to a plurality of other draw data structures , the draw data structures corresponding to the plurality of page display elements , where the new draw data structure includes data representing the first position ; and generating in response to an indication to create the Web page , at least one HTML table that substantially reflects a layout of the entire displayed page on a pixel by pixel basis in accordance with the draw data structures . |
| US9087321B2 CLAIM 19 . A computer program product (computer program product) for creating a poll-based network , the computer program product comprising computer-readable instruction means stored on a non-transitory computer-readable medium that are executable by a computer for causing the computer to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US5845299A CLAIM 3 . A computer program product (computer program product) , including : a computer usable medium having computer readable code embodied therein for allowing a user to define a World Wide Web page , the computer program product comprising : computer readable program code devices configured to cause a computer to effect displaying a plurality of page display elements on a display device , the display elements forming a page layout on the display device ; computer readable program code devices configured to cause a computer to effect receiving an indication that the user wants to add a new display element to a page at a first position on the page ; computer readable program code devices configured to cause a computer to effect adding a new draw data structure in a memory for the new display element to a plurality of other draw data structures , the draw data structures corresponding to the plurality of page display elements , where the new draw data structure includes data representing the first position ; and computer readable program code devices configured to cause a computer to effect generating in response to an indication to create the Web page , at least one HTML table that substantially reflects a layout of the entire displayed page on a pixel by pixel basis in accordance with the draw data structures . |
| US9087321B2 CLAIM 20 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US5845299A CLAIM 3 . A computer program product (computer program product) , including : a computer usable medium having computer readable code embodied therein for allowing a user to define a World Wide Web page , the computer program product comprising : computer readable program code devices configured to cause a computer to effect displaying a plurality of page display elements on a display device , the display elements forming a page layout on the display device ; computer readable program code devices configured to cause a computer to effect receiving an indication that the user wants to add a new display element to a page at a first position on the page ; computer readable program code devices configured to cause a computer to effect adding a new draw data structure in a memory for the new display element to a plurality of other draw data structures , the draw data structures corresponding to the plurality of page display elements , where the new draw data structure includes data representing the first position ; and computer readable program code devices configured to cause a computer to effect generating in response to an indication to create the Web page , at least one HTML table that substantially reflects a layout of the entire displayed page on a pixel by pixel basis in accordance with the draw data structures . |
| US9087321B2 CLAIM 21 . The computer program product (computer program product) as set forth in claim 20 , further comprising instruction means for causing the computer to perform operations of : matching the user to other users based upon all of the selected answers by the user and all of the selected answers by the other users , such that all of the selected answers by the user are compared to all of the selected answers of all of the other users ; and generating a likelihood of match between the user and each of the other users as a match percentage . |
US5845299A CLAIM 3 . A computer program product (computer program product) , including : a computer usable medium having computer readable code embodied therein for allowing a user to define a World Wide Web page , the computer program product comprising : computer readable program code devices configured to cause a computer to effect displaying a plurality of page display elements on a display device , the display elements forming a page layout on the display device ; computer readable program code devices configured to cause a computer to effect receiving an indication that the user wants to add a new display element to a page at a first position on the page ; computer readable program code devices configured to cause a computer to effect adding a new draw data structure in a memory for the new display element to a plurality of other draw data structures , the draw data structures corresponding to the plurality of page display elements , where the new draw data structure includes data representing the first position ; and computer readable program code devices configured to cause a computer to effect generating in response to an indication to create the Web page , at least one HTML table that substantially reflects a layout of the entire displayed page on a pixel by pixel basis in accordance with the draw data structures . |
| US9087321B2 CLAIM 22 . The computer program product (computer program product) as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US5845299A CLAIM 3 . A computer program product (computer program product) , including : a computer usable medium having computer readable code embodied therein for allowing a user to define a World Wide Web page , the computer program product comprising : computer readable program code devices configured to cause a computer to effect displaying a plurality of page display elements on a display device , the display elements forming a page layout on the display device ; computer readable program code devices configured to cause a computer to effect receiving an indication that the user wants to add a new display element to a page at a first position on the page ; computer readable program code devices configured to cause a computer to effect adding a new draw data structure in a memory for the new display element to a plurality of other draw data structures , the draw data structures corresponding to the plurality of page display elements , where the new draw data structure includes data representing the first position ; and computer readable program code devices configured to cause a computer to effect generating in response to an indication to create the Web page , at least one HTML table that substantially reflects a layout of the entire displayed page on a pixel by pixel basis in accordance with the draw data structures . |
| US9087321B2 CLAIM 23 . The computer program product (computer program product) as set forth in claim 22 , further comprising instruction means for causing the computer to perform operations of : receiving match commands to identify users that fall within a maximum and minimum match percentage between the user and other users ; and displaying to the user a maximum number of members that fall within the maximum and minimum match percentage . |
US5845299A CLAIM 3 . A computer program product (computer program product) , including : a computer usable medium having computer readable code embodied therein for allowing a user to define a World Wide Web page , the computer program product comprising : computer readable program code devices configured to cause a computer to effect displaying a plurality of page display elements on a display device , the display elements forming a page layout on the display device ; computer readable program code devices configured to cause a computer to effect receiving an indication that the user wants to add a new display element to a page at a first position on the page ; computer readable program code devices configured to cause a computer to effect adding a new draw data structure in a memory for the new display element to a plurality of other draw data structures , the draw data structures corresponding to the plurality of page display elements , where the new draw data structure includes data representing the first position ; and computer readable program code devices configured to cause a computer to effect generating in response to an indication to create the Web page , at least one HTML table that substantially reflects a layout of the entire displayed page on a pixel by pixel basis in accordance with the draw data structures . |
| US9087321B2 CLAIM 24 . The computer program product (computer program product) as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US5845299A CLAIM 1 . A method of allowing a user to define a World Wide Web (web server) page comprising the steps , performed by a data processing system , of : displaying a plurality of page display elements on a display device , the display elements forming a page layout on the display device ; receiving an indication that the user wants to add a new display element to a page at a first position on the page ; adding a new draw data structure in a memory of the data processing system for the new display element to a plurality of other draw data structures , the draw data structures corresponding to the plurality of page display elements , where the new draw data structure includes data representing the first position ; and generating in response to an indication to create the Web page , at least one HTML table that substantially reflects a layout of the entire displayed page on a pixel by pixel basis in accordance with the draw data structures . US5845299A CLAIM 3 . A computer program product (computer program product) , including : a computer usable medium having computer readable code embodied therein for allowing a user to define a World Wide Web page , the computer program product comprising : computer readable program code devices configured to cause a computer to effect displaying a plurality of page display elements on a display device , the display elements forming a page layout on the display device ; computer readable program code devices configured to cause a computer to effect receiving an indication that the user wants to add a new display element to a page at a first position on the page ; computer readable program code devices configured to cause a computer to effect adding a new draw data structure in a memory for the new display element to a plurality of other draw data structures , the draw data structures corresponding to the plurality of page display elements , where the new draw data structure includes data representing the first position ; and computer readable program code devices configured to cause a computer to effect generating in response to an indication to create the Web page , at least one HTML table that substantially reflects a layout of the entire displayed page on a pixel by pixel basis in accordance with the draw data structures . |
| US9087321B2 CLAIM 25 . The computer program product (computer program product) as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US5845299A CLAIM 3 . A computer program product (computer program product) , including : a computer usable medium having computer readable code embodied therein for allowing a user to define a World Wide Web page , the computer program product comprising : computer readable program code devices configured to cause a computer to effect displaying a plurality of page display elements on a display device , the display elements forming a page layout on the display device ; computer readable program code devices configured to cause a computer to effect receiving an indication that the user wants to add a new display element to a page at a first position on the page ; computer readable program code devices configured to cause a computer to effect adding a new draw data structure in a memory for the new display element to a plurality of other draw data structures , the draw data structures corresponding to the plurality of page display elements , where the new draw data structure includes data representing the first position ; and computer readable program code devices configured to cause a computer to effect generating in response to an indication to create the Web page , at least one HTML table that substantially reflects a layout of the entire displayed page on a pixel by pixel basis in accordance with the draw data structures . |
| US9087321B2 CLAIM 26 . The computer program product (computer program product) as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator , to a plurality of match servers , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US5845299A CLAIM 1 . A method of allowing a user to define a World Wide Web (web server) page comprising the steps , performed by a data processing system , of : displaying a plurality of page display elements on a display device , the display elements forming a page layout on the display device ; receiving an indication that the user wants to add a new display element to a page at a first position on the page ; adding a new draw data structure in a memory of the data processing system for the new display element to a plurality of other draw data structures , the draw data structures corresponding to the plurality of page display elements , where the new draw data structure includes data representing the first position ; and generating in response to an indication to create the Web page , at least one HTML table that substantially reflects a layout of the entire displayed page on a pixel by pixel basis in accordance with the draw data structures . US5845299A CLAIM 3 . A computer program product (computer program product) , including : a computer usable medium having computer readable code embodied therein for allowing a user to define a World Wide Web page , the computer program product comprising : computer readable program code devices configured to cause a computer to effect displaying a plurality of page display elements on a display device , the display elements forming a page layout on the display device ; computer readable program code devices configured to cause a computer to effect receiving an indication that the user wants to add a new display element to a page at a first position on the page ; computer readable program code devices configured to cause a computer to effect adding a new draw data structure in a memory for the new display element to a plurality of other draw data structures , the draw data structures corresponding to the plurality of page display elements , where the new draw data structure includes data representing the first position ; and computer readable program code devices configured to cause a computer to effect generating in response to an indication to create the Web page , at least one HTML table that substantially reflects a layout of the entire displayed page on a pixel by pixel basis in accordance with the draw data structures . |
| US9087321B2 CLAIM 27 . The computer program product (computer program product) as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes per selected answer and m rows per user . |
US5845299A CLAIM 3 . A computer program product (computer program product) , including : a computer usable medium having computer readable code embodied therein for allowing a user to define a World Wide Web page , the computer program product comprising : computer readable program code devices configured to cause a computer to effect displaying a plurality of page display elements on a display device , the display elements forming a page layout on the display device ; computer readable program code devices configured to cause a computer to effect receiving an indication that the user wants to add a new display element to a page at a first position on the page ; computer readable program code devices configured to cause a computer to effect adding a new draw data structure in a memory for the new display element to a plurality of other draw data structures , the draw data structures corresponding to the plurality of page display elements , where the new draw data structure includes data representing the first position ; and computer readable program code devices configured to cause a computer to effect generating in response to an indication to create the Web page , at least one HTML table that substantially reflects a layout of the entire displayed page on a pixel by pixel basis in accordance with the draw data structures . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US5987498A Filed: 1996-02-16 Issued: 1999-11-16 Credit card operated computer on-line service communication system (Original Assignee) Atcom Inc (Current Assignee) CAIS Inc William David Athing, Peter Foster Van Horne |
|---|---|
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling (e-mail messages) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US5987498A CLAIM 6 . Them method of claim 4 wherein said data received from each said content provider includes e-mail messages (next polling) . |
| US9087321B2 CLAIM 6 . The poll-based networking system as set forth in claim 5 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (respective network, collecting step, respective content) , to a plurality of match servers (respective network, collecting step, respective content) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood , of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US5987498A CLAIM 3 . The method of claim 1 further comprising the step of storing in the central server the user information collected in the collecting step (match aggregator, match servers) . US5987498A CLAIM 9 . The method of claim 4 wherein at least one of said content providers is a World Wide Web (web server) content server . US5987498A CLAIM 12 . The method of claim 1 , wherein said method provides communication between said remote site computer and a plurality of content providers using the central server , wherein : the step of retrieving user information includes retrieving user information pertaining to each of said content providers ; and the step of the central server communicating comprises the central server communicating with each of said content providers based on user configuration information pertaining to the respective content (match aggregator, match servers) provider . US5987498A CLAIM 18 . A method of operating a server computer of a network , to which are connected a plurality of computer terminals , the method comprising the steps of : receiving a first set of user information at the control computer from a first user at one of the computer terminals sufficient to identify a user account to be debited for billing purposes ; verifying the first set of user information for authorization and beginning a network log-on session by the first user ; retrieving a second set of user information from a storage device in communication with the server computer , the second set of user information including user account information for the first user ; establishing communication between the first user computer and one or more network service providers in accordance with information selected from a group including the first set of user information and the second set of user information ; providing user account information to each respective network (match aggregator, match servers) service provider ; receiving data from the network service providers for presentation to the first user ; ending the network log-on session ; and transmitting user configuration information from the first user computer to the server computer and displaying session charge information at the first computer . |
| US9087321B2 CLAIM 8 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors is further configured to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (respective network, collecting step, respective content) , to a plurality of match servers (respective network, collecting step, respective content) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US5987498A CLAIM 3 . The method of claim 1 further comprising the step of storing in the central server the user information collected in the collecting step (match aggregator, match servers) . US5987498A CLAIM 9 . The method of claim 4 wherein at least one of said content providers is a World Wide Web (web server) content server . US5987498A CLAIM 12 . The method of claim 1 , wherein said method provides communication between said remote site computer and a plurality of content providers using the central server , wherein : the step of retrieving user information includes retrieving user information pertaining to each of said content providers ; and the step of the central server communicating comprises the central server communicating with each of said content providers based on user configuration information pertaining to the respective content (match aggregator, match servers) provider . US5987498A CLAIM 18 . A method of operating a server computer of a network , to which are connected a plurality of computer terminals , the method comprising the steps of : receiving a first set of user information at the control computer from a first user at one of the computer terminals sufficient to identify a user account to be debited for billing purposes ; verifying the first set of user information for authorization and beginning a network log-on session by the first user ; retrieving a second set of user information from a storage device in communication with the server computer , the second set of user information including user account information for the first user ; establishing communication between the first user computer and one or more network service providers in accordance with information selected from a group including the first set of user information and the second set of user information ; providing user account information to each respective network (match aggregator, match servers) service provider ; receiving data from the network service providers for presentation to the first user ; ending the network log-on session ; and transmitting user configuration information from the first user computer to the server computer and displaying session charge information at the first computer . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling (e-mail messages) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US5987498A CLAIM 6 . Them method of claim 4 wherein said data received from each said content provider includes e-mail messages (next polling) . |
| US9087321B2 CLAIM 15 . The computer implemented method as set forth in claim 14 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (respective network, collecting step, respective content) , to a plurality of match servers (respective network, collecting step, respective content) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US5987498A CLAIM 3 . The method of claim 1 further comprising the step of storing in the central server the user information collected in the collecting step (match aggregator, match servers) . US5987498A CLAIM 9 . The method of claim 4 wherein at least one of said content providers is a World Wide Web (web server) content server . US5987498A CLAIM 12 . The method of claim 1 , wherein said method provides communication between said remote site computer and a plurality of content providers using the central server , wherein : the step of retrieving user information includes retrieving user information pertaining to each of said content providers ; and the step of the central server communicating comprises the central server communicating with each of said content providers based on user configuration information pertaining to the respective content (match aggregator, match servers) provider . US5987498A CLAIM 18 . A method of operating a server computer of a network , to which are connected a plurality of computer terminals , the method comprising the steps of : receiving a first set of user information at the control computer from a first user at one of the computer terminals sufficient to identify a user account to be debited for billing purposes ; verifying the first set of user information for authorization and beginning a network log-on session by the first user ; retrieving a second set of user information from a storage device in communication with the server computer , the second set of user information including user account information for the first user ; establishing communication between the first user computer and one or more network service providers in accordance with information selected from a group including the first set of user information and the second set of user information ; providing user account information to each respective network (match aggregator, match servers) service provider ; receiving data from the network service providers for presentation to the first user ; ending the network log-on session ; and transmitting user configuration information from the first user computer to the server computer and displaying session charge information at the first computer . |
| US9087321B2 CLAIM 17 . The computer implemented method as set forth in claim 10 , further comprising an act of causing the one or more processors to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (respective network, collecting step, respective content) , to a plurality of match servers (respective network, collecting step, respective content) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US5987498A CLAIM 3 . The method of claim 1 further comprising the step of storing in the central server the user information collected in the collecting step (match aggregator, match servers) . US5987498A CLAIM 9 . The method of claim 4 wherein at least one of said content providers is a World Wide Web (web server) content server . US5987498A CLAIM 12 . The method of claim 1 , wherein said method provides communication between said remote site computer and a plurality of content providers using the central server , wherein : the step of retrieving user information includes retrieving user information pertaining to each of said content providers ; and the step of the central server communicating comprises the central server communicating with each of said content providers based on user configuration information pertaining to the respective content (match aggregator, match servers) provider . US5987498A CLAIM 18 . A method of operating a server computer of a network , to which are connected a plurality of computer terminals , the method comprising the steps of : receiving a first set of user information at the control computer from a first user at one of the computer terminals sufficient to identify a user account to be debited for billing purposes ; verifying the first set of user information for authorization and beginning a network log-on session by the first user ; retrieving a second set of user information from a storage device in communication with the server computer , the second set of user information including user account information for the first user ; establishing communication between the first user computer and one or more network service providers in accordance with information selected from a group including the first set of user information and the second set of user information ; providing user account information to each respective network (match aggregator, match servers) service provider ; receiving data from the network service providers for presentation to the first user ; ending the network log-on session ; and transmitting user configuration information from the first user computer to the server computer and displaying session charge information at the first computer . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling (e-mail messages) question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question (identifying information) against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions . |
US5987498A CLAIM 2 . The method of claim 1 , wherein the step of collecting comprises collecting information selected from a group including : charge account information user identifying information (net polling question) , user e-mail account identifying information , content provider identifying information , security information and payment method information . US5987498A CLAIM 6 . Them method of claim 4 wherein said data received from each said content provider includes e-mail messages (next polling) . |
| US9087321B2 CLAIM 24 . The computer program product as set forth in claim 23 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (respective network, collecting step, respective content) , to a plurality of match servers (respective network, collecting step, respective content) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US5987498A CLAIM 3 . The method of claim 1 further comprising the step of storing in the central server the user information collected in the collecting step (match aggregator, match servers) . US5987498A CLAIM 9 . The method of claim 4 wherein at least one of said content providers is a World Wide Web (web server) content server . US5987498A CLAIM 12 . The method of claim 1 , wherein said method provides communication between said remote site computer and a plurality of content providers using the central server , wherein : the step of retrieving user information includes retrieving user information pertaining to each of said content providers ; and the step of the central server communicating comprises the central server communicating with each of said content providers based on user configuration information pertaining to the respective content (match aggregator, match servers) provider . US5987498A CLAIM 18 . A method of operating a server computer of a network , to which are connected a plurality of computer terminals , the method comprising the steps of : receiving a first set of user information at the control computer from a first user at one of the computer terminals sufficient to identify a user account to be debited for billing purposes ; verifying the first set of user information for authorization and beginning a network log-on session by the first user ; retrieving a second set of user information from a storage device in communication with the server computer , the second set of user information including user account information for the first user ; establishing communication between the first user computer and one or more network service providers in accordance with information selected from a group including the first set of user information and the second set of user information ; providing user account information to each respective network (match aggregator, match servers) service provider ; receiving data from the network service providers for presentation to the first user ; ending the network log-on session ; and transmitting user configuration information from the first user computer to the server computer and displaying session charge information at the first computer . |
| US9087321B2 CLAIM 26 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : collecting the selected answers with a web server (World Wide Web) and storing the selected answers in a database ; upon receipt of a selected answer , separately transmitting the selected answer from the web server , through a match aggregator (respective network, collecting step, respective content) , to a plurality of match servers (respective network, collecting step, respective content) , each match server being assigned a distinct subset of the other users , such that each match server compares the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and each of the users in its distinct subset ; receiving in the match aggregator , from each match server , a likelihood of match between the user and the users in the distinct subset ; compiling the likelihood of matches from the plurality of match servers to generate the likelihood of match between the user and each of the other users ; and transmitting the likelihood of match between the user and each of the other users to the web server for further processing . |
US5987498A CLAIM 3 . The method of claim 1 further comprising the step of storing in the central server the user information collected in the collecting step (match aggregator, match servers) . US5987498A CLAIM 9 . The method of claim 4 wherein at least one of said content providers is a World Wide Web (web server) content server . US5987498A CLAIM 12 . The method of claim 1 , wherein said method provides communication between said remote site computer and a plurality of content providers using the central server , wherein : the step of retrieving user information includes retrieving user information pertaining to each of said content providers ; and the step of the central server communicating comprises the central server communicating with each of said content providers based on user configuration information pertaining to the respective content (match aggregator, match servers) provider . US5987498A CLAIM 18 . A method of operating a server computer of a network , to which are connected a plurality of computer terminals , the method comprising the steps of : receiving a first set of user information at the control computer from a first user at one of the computer terminals sufficient to identify a user account to be debited for billing purposes ; verifying the first set of user information for authorization and beginning a network log-on session by the first user ; retrieving a second set of user information from a storage device in communication with the server computer , the second set of user information including user account information for the first user ; establishing communication between the first user computer and one or more network service providers in accordance with information selected from a group including the first set of user information and the second set of user information ; providing user account information to each respective network (match aggregator, match servers) service provider ; receiving data from the network service providers for presentation to the first user ; ending the network log-on session ; and transmitting user configuration information from the first user computer to the server computer and displaying session charge information at the first computer . |
| US9087321B2 Filed: 2010-03-01 Issued: 2015-07-21 Poll-based networking system (Original Assignee) TRINITY INTEL MEDIA LLC (Current Assignee) Trinity Info Media LLC David Shaun Neal, Timothy Beggy | US5613113A Filed: 1995-06-07 Issued: 1997-03-18 Consistent recreation of events from activity logs (Original Assignee) International Business Machines Corp (Current Assignee) International Business Machines Corp Robert D. Goldring |
|---|---|
| US9087321B2 CLAIM 2 . The poll-based networking system as set forth in claim 1 , wherein the one or more processors are further configured to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (other event) . |
US5613113A CLAIM 3 . A method of associating time series data in a data base management computer system in which users produce data base events that are automatically recorded in an activity log of a storage medium in the computer system according to a transaction sequence number that is not time ordered , the computer system including a central processor operating in accordance with a system clock , the method comprising the steps of : (a) defining a time series data structure for containing time series data ; (b) selecting a predetermined data base event that occurs periodically in the computer system ; (c) generating a time series event in accordance with the selected predetermined data base event that inserts a system clock time in the time series data structure , thereby constituting a data base event that will automatically be assigned a transaction sequence number and recorded in the activity log ; (d) reading the activity log and detecting the time series event from among the other event (polling questions) s recorded in the activity log ; and (e) reading the activity log and assigning the clock time value from the detected time series event to all other events in the activity log that were recorded in the activity log after the detected time series event and before a subsequent time series event ; wherein : the predetermined event selected in step (b) comprises a user initialization of a snapshot copy in the data base management system ; the step of generating a time series event comprises updating the time series data structure with the system clock time ; the activity log includes records of committed and uncommitted transactional updates ; the step of reading the activity log and assigning the clock time to other events comprises reading a log record having information including an update operation identifier , a unit of work identifier , and an intent sequence number ; and the step of assigning the clock time to other events comprises : storing the update operation identifier , unit of work identifier , and intent sequence number in a Change -- Data table and storing the unit of work identifier , a commit sequence number , and the clock time value previously read from the activity log in a Unit -- of -- Work table . |
| US9087321B2 CLAIM 4 . The poll-based networking system as set forth in claim 3 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , the one or more processors are further configured to perform operations of : determining a total number of polling questions (other event) as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US5613113A CLAIM 3 . A method of associating time series data in a data base management computer system in which users produce data base events that are automatically recorded in an activity log of a storage medium in the computer system according to a transaction sequence number that is not time ordered , the computer system including a central processor operating in accordance with a system clock , the method comprising the steps of : (a) defining a time series data structure for containing time series data ; (b) selecting a predetermined data base event that occurs periodically in the computer system ; (c) generating a time series event in accordance with the selected predetermined data base event that inserts a system clock time in the time series data structure , thereby constituting a data base event that will automatically be assigned a transaction sequence number and recorded in the activity log ; (d) reading the activity log and detecting the time series event from among the other event (polling questions) s recorded in the activity log ; and (e) reading the activity log and assigning the clock time value from the detected time series event to all other events in the activity log that were recorded in the activity log after the detected time series event and before a subsequent time series event ; wherein : the predetermined event selected in step (b) comprises a user initialization of a snapshot copy in the data base management system ; the step of generating a time series event comprises updating the time series data structure with the system clock time ; the activity log includes records of committed and uncommitted transactional updates ; the step of reading the activity log and assigning the clock time to other events comprises reading a log record having information including an update operation identifier , a unit of work identifier , and an intent sequence number ; and the step of assigning the clock time to other events comprises : storing the update operation identifier , unit of work identifier , and intent sequence number in a Change -- Data table and storing the unit of work identifier , a commit sequence number , and the clock time value previously read from the activity log in a Unit -- of -- Work table . |
| US9087321B2 CLAIM 7 . The poll-based networking system as set forth in claim 6 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (sequence number) per selected answer and m rows (time values) per user . |
US5613113A CLAIM 2 . A method as defined in claim 1 , wherein the step of storing the event in a table of the memory unit comprises storing the update operation identifier , unit of work identifier , and intent sequence number (n bytes) in a Change -- Data table and storing the unit of work identifier , a commit sequence number , and the most recent time value previously read from the activity log in a Unit -- of -- Work table . US5613113A CLAIM 9 . A computer data base system that orders a set of computer system events according to an event characteristic of interest , the computer system including a plurality of computer user terminals connected to a computer central processor having a memory unit , a system clock , and a non-volatile storage medium , the data base system recording a sequence of computer system events in a data base activity log of the non-volatile storage medium , the computer system events comprising data base operations generated by the user terminals , the computer data base system further including : a data manager that automatically records the computer system events in an activity log of the storage medium as the events occur with a transaction number that is not time-ordered ; an apply processor that periodically causes a system clock time value to be recorded in the activity log ; a log read processor that reads the activity log and identifies recorded computer system events as comprising recorded system clock time values (m rows) of interest or computer system events , the log read processor responding to such reads by identifying a computer system event having an event characteristic of interest and storing the identified event in a table of the memory unit according to the event characteristic of interest and assigning the recorded system clock time value to the event ; wherein : the data manager comprises a relational data base management system ; the system events generated by the users comprise updates to user data tables of the relational data base system ; the data base management system automatically records updates to the relational data base tables in the activity log and provides user snapshot copies of the user data tables in accordance with requests from the users ; the apply processor causes a system clock time value to be recorded in the activity log by periodically updating a relational data base user table containing time value information ; the activity log includes records of committed and uncommitted transactional updates and the event characteristic of interest comprises committed updates ; the computer system event log records contain information including an update operation identifier , a unit of work identifier , and an intent sequence number ; and the log read processor stores the update operation identifier , unit of work identifier , and intent sequence number in a Change -- Data table and stores the unit of work identifier , a commit sequence number , and the clock time value from the activity log in a Unit -- of -- Work table . |
| US9087321B2 CLAIM 9 . The poll-based networking system as set forth in claim 8 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (sequence number) per selected answer and m rows (time values) per user . |
US5613113A CLAIM 2 . A method as defined in claim 1 , wherein the step of storing the event in a table of the memory unit comprises storing the update operation identifier , unit of work identifier , and intent sequence number (n bytes) in a Change -- Data table and storing the unit of work identifier , a commit sequence number , and the most recent time value previously read from the activity log in a Unit -- of -- Work table . US5613113A CLAIM 9 . A computer data base system that orders a set of computer system events according to an event characteristic of interest , the computer system including a plurality of computer user terminals connected to a computer central processor having a memory unit , a system clock , and a non-volatile storage medium , the data base system recording a sequence of computer system events in a data base activity log of the non-volatile storage medium , the computer system events comprising data base operations generated by the user terminals , the computer data base system further including : a data manager that automatically records the computer system events in an activity log of the storage medium as the events occur with a transaction number that is not time-ordered ; an apply processor that periodically causes a system clock time value to be recorded in the activity log ; a log read processor that reads the activity log and identifies recorded computer system events as comprising recorded system clock time values (m rows) of interest or computer system events , the log read processor responding to such reads by identifying a computer system event having an event characteristic of interest and storing the identified event in a table of the memory unit according to the event characteristic of interest and assigning the recorded system clock time value to the event ; wherein : the data manager comprises a relational data base management system ; the system events generated by the users comprise updates to user data tables of the relational data base system ; the data base management system automatically records updates to the relational data base tables in the activity log and provides user snapshot copies of the user data tables in accordance with requests from the users ; the apply processor causes a system clock time value to be recorded in the activity log by periodically updating a relational data base user table containing time value information ; the activity log includes records of committed and uncommitted transactional updates and the event characteristic of interest comprises committed updates ; the computer system event log records contain information including an update operation identifier , a unit of work identifier , and an intent sequence number ; and the log read processor stores the update operation identifier , unit of work identifier , and intent sequence number in a Change -- Data table and stores the unit of work identifier , a commit sequence number , and the clock time value from the activity log in a Unit -- of -- Work table . |
| US9087321B2 CLAIM 10 . A computer-implemented method for creating a poll-based network , the method comprising an act of causing a computer having one (management system) or more processors and a memory specifically encoded with computer executable instruction means to execute the instruction means to cause the one or more processors to perform operations of : receiving user information from a user to generate a unique user profile for the user ; providing the user a first polling question , the first polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the first polling question ; comparing the selected answer against the selected answers of other users , based on the unique identification , to generate a likelihood of match between the user and each of the other users ; and displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold . |
US5613113A CLAIM 3 . A method of associating time series data in a data base management computer system in which users produce data base events that are automatically recorded in an activity log of a storage medium in the computer system according to a transaction sequence number that is not time ordered , the computer system including a central processor operating in accordance with a system clock , the method comprising the steps of : (a) defining a time series data structure for containing time series data ; (b) selecting a predetermined data base event that occurs periodically in the computer system ; (c) generating a time series event in accordance with the selected predetermined data base event that inserts a system clock time in the time series data structure , thereby constituting a data base event that will automatically be assigned a transaction sequence number and recorded in the activity log ; (d) reading the activity log and detecting the time series event from among the other events recorded in the activity log ; and (e) reading the activity log and assigning the clock time value from the detected time series event to all other events in the activity log that were recorded in the activity log after the detected time series event and before a subsequent time series event ; wherein : the predetermined event selected in step (b) comprises a user initialization of a snapshot copy in the data base management system (computer having one) ; the step of generating a time series event comprises updating the time series data structure with the system clock time ; the activity log includes records of committed and uncommitted transactional updates ; the step of reading the activity log and assigning the clock time to other events comprises reading a log record having information including an update operation identifier , a unit of work identifier , and an intent sequence number ; and the step of assigning the clock time to other events comprises : storing the update operation identifier , unit of work identifier , and intent sequence number in a Change -- Data table and storing the unit of work identifier , a commit sequence number , and the clock time value previously read from the activity log in a Unit -- of -- Work table . |
| US9087321B2 CLAIM 11 . The computer implemented method as set forth in claim 10 , further comprising operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the next polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (other event) . |
US5613113A CLAIM 3 . A method of associating time series data in a data base management computer system in which users produce data base events that are automatically recorded in an activity log of a storage medium in the computer system according to a transaction sequence number that is not time ordered , the computer system including a central processor operating in accordance with a system clock , the method comprising the steps of : (a) defining a time series data structure for containing time series data ; (b) selecting a predetermined data base event that occurs periodically in the computer system ; (c) generating a time series event in accordance with the selected predetermined data base event that inserts a system clock time in the time series data structure , thereby constituting a data base event that will automatically be assigned a transaction sequence number and recorded in the activity log ; (d) reading the activity log and detecting the time series event from among the other event (polling questions) s recorded in the activity log ; and (e) reading the activity log and assigning the clock time value from the detected time series event to all other events in the activity log that were recorded in the activity log after the detected time series event and before a subsequent time series event ; wherein : the predetermined event selected in step (b) comprises a user initialization of a snapshot copy in the data base management system ; the step of generating a time series event comprises updating the time series data structure with the system clock time ; the activity log includes records of committed and uncommitted transactional updates ; the step of reading the activity log and assigning the clock time to other events comprises reading a log record having information including an update operation identifier , a unit of work identifier , and an intent sequence number ; and the step of assigning the clock time to other events comprises : storing the update operation identifier , unit of work identifier , and intent sequence number in a Change -- Data table and storing the unit of work identifier , a commit sequence number , and the clock time value previously read from the activity log in a Unit -- of -- Work table . |
| US9087321B2 CLAIM 13 . The computer implemented method as set forth in claim 12 , wherein in generating a likelihood of match between the user and each of the other users as a match percentage , further comprising an act of causing the one or more processors to perform operations of : determining a total number of polling questions (other event) as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US5613113A CLAIM 3 . A method of associating time series data in a data base management computer system in which users produce data base events that are automatically recorded in an activity log of a storage medium in the computer system according to a transaction sequence number that is not time ordered , the computer system including a central processor operating in accordance with a system clock , the method comprising the steps of : (a) defining a time series data structure for containing time series data ; (b) selecting a predetermined data base event that occurs periodically in the computer system ; (c) generating a time series event in accordance with the selected predetermined data base event that inserts a system clock time in the time series data structure , thereby constituting a data base event that will automatically be assigned a transaction sequence number and recorded in the activity log ; (d) reading the activity log and detecting the time series event from among the other event (polling questions) s recorded in the activity log ; and (e) reading the activity log and assigning the clock time value from the detected time series event to all other events in the activity log that were recorded in the activity log after the detected time series event and before a subsequent time series event ; wherein : the predetermined event selected in step (b) comprises a user initialization of a snapshot copy in the data base management system ; the step of generating a time series event comprises updating the time series data structure with the system clock time ; the activity log includes records of committed and uncommitted transactional updates ; the step of reading the activity log and assigning the clock time to other events comprises reading a log record having information including an update operation identifier , a unit of work identifier , and an intent sequence number ; and the step of assigning the clock time to other events comprises : storing the update operation identifier , unit of work identifier , and intent sequence number in a Change -- Data table and storing the unit of work identifier , a commit sequence number , and the clock time value previously read from the activity log in a Unit -- of -- Work table . |
| US9087321B2 CLAIM 16 . The computer implemented method as set forth in claim 15 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected , answers as an in memory , two-dimensional array , with n bytes (sequence number) per selected answer and m rows (time values) per user . |
US5613113A CLAIM 2 . A method as defined in claim 1 , wherein the step of storing the event in a table of the memory unit comprises storing the update operation identifier , unit of work identifier , and intent sequence number (n bytes) in a Change -- Data table and storing the unit of work identifier , a commit sequence number , and the most recent time value previously read from the activity log in a Unit -- of -- Work table . US5613113A CLAIM 9 . A computer data base system that orders a set of computer system events according to an event characteristic of interest , the computer system including a plurality of computer user terminals connected to a computer central processor having a memory unit , a system clock , and a non-volatile storage medium , the data base system recording a sequence of computer system events in a data base activity log of the non-volatile storage medium , the computer system events comprising data base operations generated by the user terminals , the computer data base system further including : a data manager that automatically records the computer system events in an activity log of the storage medium as the events occur with a transaction number that is not time-ordered ; an apply processor that periodically causes a system clock time value to be recorded in the activity log ; a log read processor that reads the activity log and identifies recorded computer system events as comprising recorded system clock time values (m rows) of interest or computer system events , the log read processor responding to such reads by identifying a computer system event having an event characteristic of interest and storing the identified event in a table of the memory unit according to the event characteristic of interest and assigning the recorded system clock time value to the event ; wherein : the data manager comprises a relational data base management system ; the system events generated by the users comprise updates to user data tables of the relational data base system ; the data base management system automatically records updates to the relational data base tables in the activity log and provides user snapshot copies of the user data tables in accordance with requests from the users ; the apply processor causes a system clock time value to be recorded in the activity log by periodically updating a relational data base user table containing time value information ; the activity log includes records of committed and uncommitted transactional updates and the event characteristic of interest comprises committed updates ; the computer system event log records contain information including an update operation identifier , a unit of work identifier , and an intent sequence number ; and the log read processor stores the update operation identifier , unit of work identifier , and intent sequence number in a Change -- Data table and stores the unit of work identifier , a commit sequence number , and the clock time value from the activity log in a Unit -- of -- Work table . |
| US9087321B2 CLAIM 18 . The computer implemented method as set forth in claim 17 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (sequence number) per selected answer and m rows (time values) per user . |
US5613113A CLAIM 2 . A method as defined in claim 1 , wherein the step of storing the event in a table of the memory unit comprises storing the update operation identifier , unit of work identifier , and intent sequence number (n bytes) in a Change -- Data table and storing the unit of work identifier , a commit sequence number , and the most recent time value previously read from the activity log in a Unit -- of -- Work table . US5613113A CLAIM 9 . A computer data base system that orders a set of computer system events according to an event characteristic of interest , the computer system including a plurality of computer user terminals connected to a computer central processor having a memory unit , a system clock , and a non-volatile storage medium , the data base system recording a sequence of computer system events in a data base activity log of the non-volatile storage medium , the computer system events comprising data base operations generated by the user terminals , the computer data base system further including : a data manager that automatically records the computer system events in an activity log of the storage medium as the events occur with a transaction number that is not time-ordered ; an apply processor that periodically causes a system clock time value to be recorded in the activity log ; a log read processor that reads the activity log and identifies recorded computer system events as comprising recorded system clock time values (m rows) of interest or computer system events , the log read processor responding to such reads by identifying a computer system event having an event characteristic of interest and storing the identified event in a table of the memory unit according to the event characteristic of interest and assigning the recorded system clock time value to the event ; wherein : the data manager comprises a relational data base management system ; the system events generated by the users comprise updates to user data tables of the relational data base system ; the data base management system automatically records updates to the relational data base tables in the activity log and provides user snapshot copies of the user data tables in accordance with requests from the users ; the apply processor causes a system clock time value to be recorded in the activity log by periodically updating a relational data base user table containing time value information ; the activity log includes records of committed and uncommitted transactional updates and the event characteristic of interest comprises committed updates ; the computer system event log records contain information including an update operation identifier , a unit of work identifier , and an intent sequence number ; and the log read processor stores the update operation identifier , unit of work identifier , and intent sequence number in a Change -- Data table and stores the unit of work identifier , a commit sequence number , and the clock time value from the activity log in a Unit -- of -- Work table . |
| US9087321B2 CLAIM 20 . The computer program product as set forth in claim 19 , further comprising instruction means for causing the computer to perform operations of : providing the user with a next polling question , the next polling question having a finite set of answers and a unique identification ; receiving and storing a selected answer for the next polling question ; cumulatively comparing the selected answer for the first polling question and the net polling question against the selected answers of other users to generate a likelihood of match between the user and each of the other users ; displaying to the user the user profiles of other users that have a likelihood of match within a predetermined threshold ; and repeating the process for a plurality of next polling questions (other event) . |
US5613113A CLAIM 3 . A method of associating time series data in a data base management computer system in which users produce data base events that are automatically recorded in an activity log of a storage medium in the computer system according to a transaction sequence number that is not time ordered , the computer system including a central processor operating in accordance with a system clock , the method comprising the steps of : (a) defining a time series data structure for containing time series data ; (b) selecting a predetermined data base event that occurs periodically in the computer system ; (c) generating a time series event in accordance with the selected predetermined data base event that inserts a system clock time in the time series data structure , thereby constituting a data base event that will automatically be assigned a transaction sequence number and recorded in the activity log ; (d) reading the activity log and detecting the time series event from among the other event (polling questions) s recorded in the activity log ; and (e) reading the activity log and assigning the clock time value from the detected time series event to all other events in the activity log that were recorded in the activity log after the detected time series event and before a subsequent time series event ; wherein : the predetermined event selected in step (b) comprises a user initialization of a snapshot copy in the data base management system ; the step of generating a time series event comprises updating the time series data structure with the system clock time ; the activity log includes records of committed and uncommitted transactional updates ; the step of reading the activity log and assigning the clock time to other events comprises reading a log record having information including an update operation identifier , a unit of work identifier , and an intent sequence number ; and the step of assigning the clock time to other events comprises : storing the update operation identifier , unit of work identifier , and intent sequence number in a Change -- Data table and storing the unit of work identifier , a commit sequence number , and the clock time value previously read from the activity log in a Unit -- of -- Work table . |
| US9087321B2 CLAIM 22 . The computer program product as set forth in claim 21 , further comprising instruction means for causing the computer to perform operations of : determining a total number of polling questions (other event) as taken by the user and a selected other user ; determining a number of same selected answers between the user and the selected other user ; and dividing the number of same selected answers by the total number of polling questions to generate the match percentage between the user and the selected other user . |
US5613113A CLAIM 3 . A method of associating time series data in a data base management computer system in which users produce data base events that are automatically recorded in an activity log of a storage medium in the computer system according to a transaction sequence number that is not time ordered , the computer system including a central processor operating in accordance with a system clock , the method comprising the steps of : (a) defining a time series data structure for containing time series data ; (b) selecting a predetermined data base event that occurs periodically in the computer system ; (c) generating a time series event in accordance with the selected predetermined data base event that inserts a system clock time in the time series data structure , thereby constituting a data base event that will automatically be assigned a transaction sequence number and recorded in the activity log ; (d) reading the activity log and detecting the time series event from among the other event (polling questions) s recorded in the activity log ; and (e) reading the activity log and assigning the clock time value from the detected time series event to all other events in the activity log that were recorded in the activity log after the detected time series event and before a subsequent time series event ; wherein : the predetermined event selected in step (b) comprises a user initialization of a snapshot copy in the data base management system ; the step of generating a time series event comprises updating the time series data structure with the system clock time ; the activity log includes records of committed and uncommitted transactional updates ; the step of reading the activity log and assigning the clock time to other events comprises reading a log record having information including an update operation identifier , a unit of work identifier , and an intent sequence number ; and the step of assigning the clock time to other events comprises : storing the update operation identifier , unit of work identifier , and intent sequence number in a Change -- Data table and storing the unit of work identifier , a commit sequence number , and the clock time value previously read from the activity log in a Unit -- of -- Work table . |
| US9087321B2 CLAIM 25 . The computer program product as set forth in claim 24 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (sequence number) per selected answer and m rows (time values) per user . |
US5613113A CLAIM 2 . A method as defined in claim 1 , wherein the step of storing the event in a table of the memory unit comprises storing the update operation identifier , unit of work identifier , and intent sequence number (n bytes) in a Change -- Data table and storing the unit of work identifier , a commit sequence number , and the most recent time value previously read from the activity log in a Unit -- of -- Work table . US5613113A CLAIM 9 . A computer data base system that orders a set of computer system events according to an event characteristic of interest , the computer system including a plurality of computer user terminals connected to a computer central processor having a memory unit , a system clock , and a non-volatile storage medium , the data base system recording a sequence of computer system events in a data base activity log of the non-volatile storage medium , the computer system events comprising data base operations generated by the user terminals , the computer data base system further including : a data manager that automatically records the computer system events in an activity log of the storage medium as the events occur with a transaction number that is not time-ordered ; an apply processor that periodically causes a system clock time value to be recorded in the activity log ; a log read processor that reads the activity log and identifies recorded computer system events as comprising recorded system clock time values (m rows) of interest or computer system events , the log read processor responding to such reads by identifying a computer system event having an event characteristic of interest and storing the identified event in a table of the memory unit according to the event characteristic of interest and assigning the recorded system clock time value to the event ; wherein : the data manager comprises a relational data base management system ; the system events generated by the users comprise updates to user data tables of the relational data base system ; the data base management system automatically records updates to the relational data base tables in the activity log and provides user snapshot copies of the user data tables in accordance with requests from the users ; the apply processor causes a system clock time value to be recorded in the activity log by periodically updating a relational data base user table containing time value information ; the activity log includes records of committed and uncommitted transactional updates and the event characteristic of interest comprises committed updates ; the computer system event log records contain information including an update operation identifier , a unit of work identifier , and an intent sequence number ; and the log read processor stores the update operation identifier , unit of work identifier , and intent sequence number in a Change -- Data table and stores the unit of work identifier , a commit sequence number , and the clock time value from the activity log in a Unit -- of -- Work table . |
| US9087321B2 CLAIM 27 . The computer program product as set forth in claim 26 , wherein in comparing the selected answer of the user against the selected answers of the users in its distinct subset to generate a likelihood of match between the user and the users in its distinct subset , each match server is further configured to store selected answers as an in memory , two-dimensional array , with n bytes (sequence number) per selected answer and m rows (time values) per user . |
US5613113A CLAIM 2 . A method as defined in claim 1 , wherein the step of storing the event in a table of the memory unit comprises storing the update operation identifier , unit of work identifier , and intent sequence number (n bytes) in a Change -- Data table and storing the unit of work identifier , a commit sequence number , and the most recent time value previously read from the activity log in a Unit -- of -- Work table . |