scispace - formally typeset
Search or ask a question

Showing papers on "List update problem published in 2006"


Patent
02 May 2006
TL;DR: In this paper, a system and method operates on a client device and acquires a suspect list of user products based on information derived from the client device, which is sent to a server where the user product list is compared to other lists using collaborative filtering techniques.
Abstract: A system and method operates on a client device and acquires a suspect list of user products based on information derived from the client device. The system normalizes the list, and the user confirms the accuracy of the product list. The user product list is sent to a server where the user product list is compared to other lists using collaborative filtering techniques. The collaborative filtering techniques determine products of interest for the use and the level of interest of the user. The system computes a similarity measure based upon the number of similar products that match the user's product list and rankings provided by the user and others. Demographic and behavioral data may also be used in performing the comparison and the similarity measure. The system acquires editorial rankings of products from other users and provides a ranked list of recommended products based upon the editorial rankings.

274 citations


Patent
08 May 2006
TL;DR: In this paper, improved capabilities are described for creating a list of expected search queries associated with a search vertical, ordering the list based on at least one factor, and presenting the ordered list of search queries to a mobile communication facility for user selection.
Abstract: In embodiments of the present invention improved capabilities are described for creating a list of expected search queries associated with a search vertical, ordering the list based on at least one factor, and presenting the ordered list of search queries to a mobile communication facility for user selection.

134 citations


Patent
02 Oct 2006
TL;DR: In this article, the authors propose a method for generating a content recommendation list comprising several content recommendations list entries in dependence on a user feedback profile, each content item representing a content item, and transferring the content recommendation from the server to the client.
Abstract: A method provides content items located on a server to a client, the server being able to communicate with the client via a communication network. The method includes generating a content recommendation list comprising several content recommendation list entries in dependence on a user feedback profile, each content recommendation list entry representing a content item, and transferring the content recommendation list from the server to the client. The method also includes providing a representation of the content recommendation list entries through a client user interface, each entry being selectable and arranged such that for each entry, user feedback may be generated and corresponding user feedback information sent to the server and that upon selection of an entry at a predetermined position in the content recommendation list, a recommendation list request is transferred to the server.

126 citations


Patent
David W. Flynt1, Micah Shotel1
06 Oct 2006
TL;DR: In this paper, the authors present a method to expand and preview list items to maximize the number of items that are viewable at the same time without having to scroll the entire list.
Abstract: Computing devices such as mobile devices are typically limited in display size. Information on the devices can be typically displayed in list form, which often allows a user to locate desired information more quickly. Lists of information can be condensed by list items so that an item can be identified using relatively small display space. The condensed list items can be expanded and previewed by implicitly indicating a desired list item. Preview expansion of list items often allows condensed, richer lists of information to be quickly browsed, while maximizing the number of items that are viewable at the same time without having to scroll.

92 citations


Patent
Joshua A. Triplett1
29 Nov 2006
TL;DR: In this article, a system, method and computer program product for moving a shared list element from a first list location to a second list location includes making the list element appear simultaneously in the first and the second lists under a first key associated with the first list.
Abstract: A system, method and computer program product for moving a shared list element from a first list location to a second list location includes making the list element appear simultaneously in the first list and the second list under a first key associated with the first list, changing the first key associated with the first list to a second key associated with the second list, and making the list element appear only in the second list under the second key associated with the second list.

53 citations


Patent
15 Dec 2006
TL;DR: In this paper, the system level information is retrieved from a remote system and a request is automatically sent to an update agent for a list of software updates for the remote system, which includes the retrieved system-level information.
Abstract: System-level information is retrieved from a remote system and a request is automatically sent to an update agent for a list of software updates for the remote system. The request includes the retrieved system-level information. The update agent provides a list of available software updates that is filtered based at least in part on the system-level information. The filtered list of software updates is then sent to the remote system. The enterprise system receives user input indicating a selection of one or more software updates from the filtered list. Selected software updates are incorporated into a business action.

41 citations


Patent
Tod DeBie1
22 Dec 2006
TL;DR: In this paper, a file plan includes a plurality of containers, wherein each container is capable of providing management information for documents in the file plan, and each container can provide different ways to form file plan document access control lists using at least one of the access control list rules defined for a container and a pre-file plan document Access Control list indicating users enabled to access the document before the document is added to file plan.
Abstract: Provided are a method, system, and article of manufacture for using an access control list rule to generate an access control list for a document included in a file plan. A file plan includes a plurality of containers, wherein each container is capable of providing management information for documents in the file plan. An access control list rule indicates one of a plurality of access control list rules, wherein the access control list rules provide different ways to form file plan document access control lists using at least one of an access control list defined for a container and a pre-file plan document access control list indicating users enabled to access the document before the document is added to the file plan. A request to add a document to the file plan is received and a file plan document access control list is generated according to the defined access control list rule. The file plan document access control list is associated with the document in the file plan.

39 citations


Patent
30 Mar 2006
TL;DR: In this article, a wireless terminal selectively stores incoming voice calls and text messages in a common Answer List and deletes them from the Missed Call List, Text Message List or Call Log.
Abstract: The wireless terminal (100) selectively stores incoming voice calls and text messages in a common Answer List (144). The incoming transmissions may be added to the Answer List manually. If the 'Answer List' menu option is selected, the incoming transmission data is logged into the Answer List and that entry is deleted from the Missed Call List, Text Message List or Call Log (140). In this manner, the incoming transmission data may be saved in only one location on the wireless terminal. An entry may also be saved to the Answer List from the wireless terminal's calendar application (146) or web browser application (108). An entry may be deleted from the Answer List after the entry is responded to. This allows the user to enter wireless terminal related activities in the Answer List such that the list may also include entries that do not arise from an incoming transmission.

29 citations


Patent
11 Sep 2006
TL;DR: In this paper, a character scroll mode enables a user to conveniently and efficiently traverse a list in accordance with one or more significant characters of the items in the list, which may or may not provide acceleration.
Abstract: Improved methods and systems that assist a user in navigating lists of ordered items are disclosed. According to one embodiment, a character scroll mode enables a user to conveniently and efficiently traverse a list in accordance with one or more significant characters of the items in the list. In one implementation, the list is a list of media items that are arranged in an ordered way. For example, the media items in the list can be arranged alphabetically. Besides the character scroll mode, the user is able to traverse the list in a quantity scroll mode, which may or may not provide acceleration.

22 citations


Patent
11 Jan 2006
TL;DR: In this paper, a technology is proposed that creates a list with a placeholder for each of the elements in the list, and as portions of the list are needed (or viewed), the relevant data is downloaded and used to populate the relevant items.
Abstract: Some applications require the use of a long list of items. For example, an email application may have a long list of emails or an online banking application may have a long list of transactions. A problem arises, however, when there are many items in the list because it may take too long to download all of the data. To overcome this problem, a technology is proposed that creates a list with a placeholder for each of the elements in the list. As portions of the list are needed (or viewed), the relevant data is downloaded and used to populate the relevant items in the list.

16 citations


Patent
04 Jan 2006
TL;DR: In this paper, a controller accepts an updating request and identifying information of a third party terminal from the third party terminals, and the controller determines whether the updating authority for updating the buddy list or not, using the identifying information.
Abstract: A buddy list manager stores a buddy list sent from a receiver terminal and manages the buddy list. A controller accepts an updating request and identifying information of a third party terminal from the third party terminal. When the controller accepts the updating request and the identifying information from the third party terminal, the controller determines whether the third party has an updating authority for updating the buddy list or not, using the identifying information. If the controller judges that the third party has an updating authority for updating the buddy list, then the controller permits the third party terminal to update the buddy list.

Patent
11 May 2006
TL;DR: In this article, a taxonomy of data related to a specified domain of knowledge on the web is constructed from the taxonomy tree and a sub-domain related sub-tree is selected from the tree.
Abstract: A selection system and method. The selection method comprises receiving, by a computing system, a taxonomy of data related to a specified domain of knowledge on the web. A taxonomy tree is constructed from the taxonomy. A sub tree related to a sub-domain from specified domain is selected from the taxonomy tree. A first list comprising user expected universal resource locators (URLs) related to the sub-domain is received. A second list comprising topic expressions defining each node of the taxonomy sub-tree is generated. A query based on the second list is generated. The query is applied on an index of URLs generated from a web crawling process to generate a third list. A recall value is calculated based on the first list and the third list.

Patent
05 Jan 2006
TL;DR: In this article, a method for piecemeal restoration of a database involves a computer system having a user interface and a selection device, and a command is automatically formulated to bring the designated one or more filegroups online.
Abstract: This disclosure concerns systems and methods for restoring data. In one example, a method for piecemeal restoration of a database involves a computer system having a user interface and a selection device. The method begins when a query is sent to a database server application requesting a list of all offline filegroups for the database. Next, the list of all offline filegroups is received from the database server application. Then, the list of all offline filegroups is automatically presented on the user interface. Next, a list selection signal is received, indicative of the selection device designating one or more of the filegroups from the list. Finally, in response to the receipt of the list selection signal, a command is automatically formulated to bring the designated one or more filegroups online.

Patent
29 Mar 2006
TL;DR: A method of providing search results includes performing a search in response to a search request, providing a first list of results responsive to the search request as mentioned in this paper, providing a list of selectable terms based on content included in the first list, receiving a user-selected term from the list of selected terms, and providing a second list of result excluded results having content related to the user selected term.
Abstract: A method of providing search results includes performing a search in response to a search request, providing a first list of results responsive to the search request, providing a list of selectable terms based on content included in the first list of results, receiving a user-selected term from the list of selectable terms, and providing a second list of results. The second list of results excludes results having content related to the user-selected term.

Patent
13 Dec 2006
TL;DR: In this article, a method for compiling and presenting an ordered list for each of the available options for a communication device is disclosed, which includes monitoring a frequency of employment of available options by a user of the communication device.
Abstract: A method ( 200 ) for compiling and presenting an ordered list for each of the available options for a communication device is disclosed. The method includes monitoring a frequency of employment of available options by a user of the communication device ( 100 ). Further, the method ( 200 ) includes dynamically compiling a list for each of the available options. The list is ordered from the most frequently employed to the least frequently employed. Furthermore, the method ( 200 ) includes presenting the ordered list for access by the user of the communicating device.

Patent
Akira Murotani1, Tetsuya Abe1
07 Apr 2006
TL;DR: In this paper, a file management system and method, and a storage system that can prevent file-multiplexing in a storage apparatus, and efficiently use the storage capacity of the storage apparatus.
Abstract: The present invention provides a file management system and method, and a storage system that can prevent file-multiplexing in a storage apparatus, and efficiently use the storage capacity of the storage apparatus. The storage apparatus stores first management information for managing two or more kinds of classification list, each classification list including one or more keywords, and second management information for managing the kinds of classification list set for each of one or more users with regard to each of one or more tiers of their respective virtual file trees; and sends, in response to a request from a client apparatus to search the classification lists for a classification list set for a directory, the classification list set for the relevant user with regard to the tier matching the request to the client apparatus with reference to the first and second management information.

Patent
06 Oct 2006
TL;DR: In this article, the problem of solving the problem that a function which desires to be originally restricted can not be restricted although a function executable by combining a plurality of functions matches the function or the function is restricted although they do not match each other is solved.
Abstract: PROBLEM TO BE SOLVED: To solve the problem that a function which desires to be originally restricted can not be restricted although a function executable by combining a plurality of functions matches the function or the function is restricted although they do not match each other SOLUTION: An image processing apparatus comprises: a restricted function list acquiring unit 321 which acquires a list of functions whose execution is restricted; an execution function list acquiring unit 323 which acquires a list of functions to be called by scripts; a combination determining unit 322 which determines, based on the function list acquired by the execution function list acquiring unit, a realizable function by combining the functions included in the function list; and an execution determining unit 320 which determines whether to permit execution of the scripts corresponding to the function list based on the restricted function list acquired by the restricted function list acquiring unit 321 and the realizable function determined by the combination determining unit 322 COPYRIGHT: (C)2008,JPO&INPIT

Patent
23 Oct 2006
TL;DR: In this article, a method and computing device for providing concurrent read and write access to a linked list of elements is presented, where read access by a reader process and write accessing by a writer process may occur substantially concurrently.
Abstract: A method and computing device for providing concurrent read and write access to a linked list of elements is presented. A linked list is provided wherein read access by a reader process and write access by a writer process may occur substantially concurrently. The linked list includes three internal lists for processes to reference elements of the linked list. The linked list also includes an updated indicator. Read access to the linked list is provided to a reader process such that the reader process accesses elements in the linked list according to a read list of the three internal lists. Write access to the linked list is provided to a writer process such that the writer process accesses elements in the linked list according to a write list of the three internal lists.

Journal ArticleDOI
TL;DR: The upper bound implies that read-only programs with singly-linked input can do string matching much faster than previously expected and quantify the efficiency gap in a read- only situation.
Abstract: We show how to reduce the time overhead for implementing two-way movement on a singly linked list to O(ne) per operation without modifying the list and without making use of storage other than a finite number of pointers into the list. We also prove a matching lower bound.These results add precision to the intuitive feeling that doubly linked lists are more efficient than singly linked lists, and quantify the efficiency gap in a read-only situation. We further analyze the number of points of access into the list (pointers) necessary for obtaining a desired value of e. We obtain tight tradeoffs which also separate the amortized and worst-case settings.Our upper bound implies that read-only programs with singly-linked input can do string matching much faster than previously expected.

Patent
26 Oct 2006
TL;DR: In this paper, a method and a system for forwarding presence subscription along with contact list entries to other users is described, wherein the steps of forwarding the contact list entry by a server including the steps including: receiving a request for forwarding the information, presetting IDs of other users as a preset value list by each user for which said user is interested to accept forwarded documents, alias names and presence subscriptions; and checking the preset value lists by the server while performing a forward operation.
Abstract: This invention explains a method and a system for forwarding presence subscription along with contact list entries to other users wherein said method including the steps of: receiving a request for forwarding the contact list entries by a server; presetting IDs of other users as a preset value list by each user for which said user is interested to accept forwarded documents, alias names and presence subscriptions; and checking the preset value list by the server while performing a forward operation; wherein if a sending user's ID is in the preset value list, the server puts said contact list documents in a recipient user's tree.

Patent
22 Jun 2006
TL;DR: In this paper, a list broker, a list manager, and a service bureau (list provider) of a supply chain in the list industry, each terminal including means for translating to and/or from native format an indication of a subset of a list expressed in XML.
Abstract: A terminal for use by a list broker, a terminal for use by a list manager, and a terminal for use by a service bureau (list provider) of a supply chain in the list industry, each terminal including means for translating to and/or from native format an indication of a subset of a list expressed in XML. An intermediate node is also provided, for optional use as a router and validator of XML statements exchanged between the elements of the supply chain. Advantageously, the indication of a subset of a list expressed in XML is provided using terms (tagged field values serving as select filter parameters) from a with the tags according to a list of terms in an XML schema description, and the possible values, in some embodiments, according to a predetermined “lingo” or, in other words, a standardized vocabulary. Corresponding methods are also provided.

Patent
20 Dec 2006
TL;DR: In this article, the authors propose a solution to allow easy selection of desired content data from a list by adding the album data's ID information to a temporary list TL1 of the ID information that is usable in selecting album data.
Abstract: PROBLEM TO BE SOLVED: To allow easy selection of desired content data from a list. SOLUTION: As album data is reproduced, an information addition part 16 adds the album data's ID information to a temporary list TL1 of the album data's ID information that is usable in selecting album data. Also, as album data is recorded, the album data's ID information is added. According to a history of reproduction or recording of album data, an information deleting part 18 deletes the ID information of the particular album data from the temporary list TL1, whereby the temporary list TL1 can be updated as there is a change to album data that is relatively likely to be selected by the user. In this way, the desired album data can easily be selected from the temporary list TL1. COPYRIGHT: (C)2008,JPO&INPIT

Patent
Andrew David James Banks1
21 Nov 2006
TL;DR: For concurrent processing of list items by multiple control threads, a list structure is provided in the form of a reference list referencing items by a sequence number and a plurality of sub-lists across which the items are distributed as discussed by the authors.
Abstract: For concurrent processing of list items by multiple control threads, a list structure is provided in the form of a reference list referencing items by a sequence number and a plurality of sub-lists across which the items are distributed. The reference list is locked when allocating or retrieving a sequence number for an item, but only the sub-list in which an item is held is locked when a control thread adds or removes an item to or from the sub-list.

Patent
25 Aug 2006
TL;DR: In this paper, a display data creation part 160 makes a display part 170 display a content selection screen for presenting a plurality of contents as alternatives on the basis of a content list which determines a form of display of the plurality of content.
Abstract: PROBLEM TO BE SOLVED: To provide a content recommendation device, content recommendation system, and content recommendation method capable of attaining an interface of content recommendation efficiently which is customized for every user. SOLUTION: A display data creation part 160 makes a display part 170 display a content selection screen for presenting a plurality of contents as alternatives on the basis of a content list which determines a form of display of the plurality of contents. A selection candidate detection part 130 detects which of the contents is a user's selection candidate in the content selection screen, accumulates detection results, and generates selection candidate history information. A selection viewpoint analysis part 140 analyzes a user's selection viewpoint on the basis of the selection candidate history information, while a content list update part 150 updates contents of the content list so that contents more likely to be selected are displayed conspicuously from the analyzed viewpoint of the user. COPYRIGHT: (C)2008,JPO&INPIT


01 Jan 2006
TL;DR: In this paper, the adaptive/cooperative analysis (ACA) framework is used to analyze on-line algorithms for paging and list update problems, and it is shown that the ability of the adaptive algorithm to ignore pathological worst cases can lead to more efficient in practice.
Abstract: On-line algorithms are usually analyzed using competitive analysis, in which the performance of on-line algorithm on a sequence is normalized by the performance of the optimal on-line algorithm on that sequence. In this paper we introduce adaptive/cooperative analysis as an alternative general framework for the analysis of on-line algorithms. This model gives promising results when applied to two well known on-line problems, paging and list update. The idea is to normalize the performance of an on-line algorithm by a measure other than the performance of the on-line optimal algorithm OPT. We show that in many instances the perform of OPT on a sequence is a coarse approximation of the difficulty or complexity of a given input. Using a finer, more natural measure we can separate paging and list update algorithms which were otherwise undistinguishable under the classical model. This createas a performance hierarchy of algorithms which better reflects the intuitive relative strengths between them. Lastly, we show that, surprisingly, certain randomized algorithms which are superior to MTF in the classical model are not so in the adaptive case. This confirms that the ability of the on-line adaptive algorithm to ignore pathological worst cases can lead to algorithms that are more efficient in practice.

Patent
05 Dec 2006
TL;DR: In this paper, a method for managing updating of a contents file list in a WIPI(Wireless Internet Platform for Interoperability) of a mobile terminal is provided to enhance the quality of a wireless Internet service at the user side is degraded and reduce a service cost.
Abstract: A method for managing updating of a contents file list in a WIPI(Wireless Internet Platform for Interoperability) of a mobile terminal is provided to enhance the quality of a wireless Internet service at the user side is degraded and reduce a service cost. When an external memory is discovered, a terminal control module selectively generates a new contents file list reflecting particulars of contents files mounted in the external memory and temporarily stores it(S10). A user selects a wireless Internet service by pressing a particular keypad to execute a WIPI, and in this state, when a WIPI management module asks about whether to update its contents file list, the terminal control module immediately provides the temporarily stored new contents file list to the WIPI management module(S20).

Patent
28 Dec 2006
TL;DR: In this paper, a user supplies criteria for a list via a graphical user interface tool and the criteria are used to generate a query, and the query when executed against a data store produces results representing the list.
Abstract: Techniques for data store list generation and management are provided. A user supplies criteria for a list via a graphical user interface tool. The criteria are used to generate a query, and the query when executed against a data store produces results representing the list. The list may then be used for a variety of purposes.

Patent
05 Oct 2006
TL;DR: In this paper, a sub-element generation algorithm is proposed to improve real-time performance of image generation by generating data of an image subelement corresponding to an area other than the overlap area for an image element other than a foreground image element.
Abstract: PROBLEM TO BE SOLVED: To provide an apparatus and a method for image processing that improve real-time performance of image generation SOLUTION: A sub-element generation section 108 decides an overlap are of image elements, generates sub-element data of an image sub-element corresponding to an area other than the overlap area for an image element other than a foreground image element among the image elements including the overlap area, and stores element raster data of image elements which do not include the overlap area and the foreground image element including the overlap area and the generated sub-element data of the image sub-element in a cache memory 112, and a list update section 114 updates a page assembly list in response to the generation of the sub-element data COPYRIGHT: (C)2007,JPO&INPIT

Patent
23 Feb 2006
TL;DR: In this article, a system and method for updating a source copy of an ordered list comprising a plurality of list items according to modifications made to the order of the list items in a local copy of the ordered list (the local list) is provided.
Abstract: A system and method for updating a source copy of an ordered list (the source list) comprising a plurality of list items according to modifications made to the order of the list items in a local copy of the ordered list (the local list) is provided. Each list item includes an order value. The order of the list items is determined according to the order values. To update the source list, the list items that have been moved in the local list are identified and placed on a temporary list, retaining the ordinal position in the local list. For each list item in the temporary list, the list item is placed back in the local list and its order value is set according to the average of the previous list item's order value and the subsequent list item's order value. The list item is then written to the source list.