Automatic increasing of capacity of a virtual space in a virtual world

Abstract
A system for automatically increasing a capacity of a virtual space in a virtual world may include a processor and a module operating on the processor for detecting an attempt by an avatar to enter a virtual space in a virtual world. The system may also include another module for determining if an allowable number of avatars is currently in the virtual space. The allowable number of avatars may be determined by at least a capacity of a server that is hosting the virtual space. Another module may be provided for increasing a capacity of the virtual space when the allowable number of avatars is currently in the virtual space. Increasing the capacity of the virtual space may include spawning a replicate new virtual space on a different server in response to the capacity of the server that is hosting the virtual space reaching the allowable number of avatars.
Description
BACKGROUND OF THE INVENTION

The present invention is related to virtual space in a virtual world, and more specifically to automatic increasing of capacity of a virtual space in a virtual world.


Virtual reality (VR) worlds bring the best of online and real-world brick and mortar to many scenarios, for example shopping. In the brick and mortar worlds, shopping has both a social and a visually immersive experience. Two dimensional (2D) shopping web sites are convenient (e.g., they do not require traveling to a physical location) and scalable to 1,000s of users by a hosting server. However, they lack that social and visual experience of brick and mortar. Today three dimensional (3D) web sites combine the convenience of online shopping with the social and the visual benefits of brick and mortar. However, they suffer from the scalability issue of brick and mortar.


Current virtual worlds, (e.g., Second Life), differ from traditional 2D web sites in many ways. One way is that if you are looking at a page on the Circuit City® web site, you don't know if you are the only one looking at that page or if there are thousands or perhaps tens of thousands of other users looking at that page at the same time. In virtual worlds, to see something you must be in a particular location to view it. When there are too many avatars in a particular location at the same time, it creates congestion not just for the user who has to attempt to move around all the other avatars, but also for the server that is running that particular virtual space in the virtual world. Therefore, if someone is running a store in a virtual world, they may only want to allow a certain number of avatars in at a time to facilitate a good shopping and user experience as well as control the load on the server running that store. However, a problem exists in that if the store is full, the next avatar desiring access to the store has to be turned away. Currently, one solution to this problem is that when a virtual world store effectively closes, the avatar is put on a waiting list to enter. This is unacceptable to users who will not want to be denied.


BRIEF SUMMARY OF THE INVENTION

According to one aspect of the present invention, a system for automatically increasing a capacity of a virtual space in a virtual world may include a processor and a module operating on the processor for detecting an attempt by an avatar to enter a virtual space in a virtual world. The system may also include another module operating on the processor for determining if an allowable number of avatars are currently in the virtual space. The allowable number of avatars may be determined by at least a capacity of a server that is hosting the virtual space. Another module operating on the processor may be provided for increasing a capacity of the virtual space when the allowable number of avatars is currently in the virtual space. Increasing the capacity of the virtual space may include spawning a replicate new virtual space on a different server in response to the capacity of the server that is hosting the virtual space reaching the allowable number of avatars.


According to another aspect of the present invention, a system for automatically increasing a capacity of a virtual space in a virtual world may include a processor and a module operating on the processor for determining if an allowable number of avatars is currently in the virtual space. The allowable number of avatars may be determined by at least a capacity of a server that is hosting the virtual space. The system may also include another module operating on the processor for increasing a capacity of the virtual space when the allowable number of avatars is currently in the virtual space. Increasing the capacity of the virtual space may include spawning a replicate new virtual space on a different server in response to the capacity of the server that is hosting the virtual space reaching the allowable number of avatars.


According to a further aspect of the present invention, a system for automatically increasing a capacity of a virtual space in a virtual world may include a server, one or more workstations, and a network interconnecting the server and the one or more workstations, wherein the server hosts a virtual world allowing a user at the one or more workstations to control an avatar in the virtual world to access a virtual space. The server may be adapted to detect an attempt by an avatar to enter the virtual space in the virtual world and may determine if an allowable number of avatars is currently in the virtual space. A capacity of the virtual space may be increased when the allowable number of avatars is currently in the virtual space.


According to a still further aspect of the present invention, a computer program product for automatically increasing a capacity of a virtual space in a virtual world may include a computer readable storage medium having computer readable program code embodied therewith. The computer readable program code may include computer readable program code configured to detect an attempt by an avatar to enter a virtual space in a virtual world. The computer readable program code may also include computer readable program code configured to determine if an allowable number of avatars is currently in the virtual space. The allowable number of avatars may be determined by at least a capacity of a server that is hosting the virtual space. The computer readable program code may additionally include computer readable program code configured to increase a capacity of the virtual space when the allowable number of avatars is currently in the virtual space. Increasing the capacity of the virtual space may include spawning a replicate new virtual space on a different server in response to the capacity of the server that is hosting the virtual space reaching the allowable number of avatars.





BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is further described in the detailed description which follows in reference to the noted plurality of drawings by way of non-limiting examples of embodiments of the present invention in which like reference numerals represent similar parts throughout the several views of the drawings and wherein:



FIG. 1 is a diagram of system for automatically increasing a capacity of a virtual space in a virtual world according to an example embodiment of the present invention;



FIG. 2 is a diagram of virtual environment for automatically increasing a capacity of a virtual space in a virtual world according to an example embodiment of the present invention;



FIG. 3 is a diagram of increasing a capacity of a virtual space by spawning a replicate new virtual space according to an example embodiment of the present invention;



FIG. 4 is a diagram of increasing a capacity of a virtual space by expanding a size of the virtual space according to an example embodiment of the present invention;



FIG. 5 is a flowchart of a process for increasing a capacity of a virtual space in a virtual world according to an example embodiment of the present invention;



FIG. 6 is a flowchart of increasing a capacity of a virtual space by spawning a replicate new virtual space according to an example embodiment of the present invention;



FIG. 7 is a flowchart of a process for increasing a capacity of a virtual space by expanding a physical size of the virtual space according to an example embodiment of the present invention;



FIG. 8 is a flowchart of a process for defining virtual space settings according to an example embodiment of the present invention; and



FIG. 9 is a flowchart of a process for setting an avatar capacity limit for automatic increase in capacity according to an example embodiment of the present invention.





DETAILED DESCRIPTION OF THE INVENTION

As will be appreciated by one of skill in the art, the present invention may be embodied as a method, system, computer program product, or a combination of the foregoing. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may generally be referred to herein as a “system.” Furthermore, the present invention may take the form of a computer program product on a computer-usable storage medium having computer-usable program code embodied in the medium.


Any suitable computer usable or computer readable medium may be utilized. The computer usable or computer readable medium may be, for example but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, device, or propagation medium. More specific examples (a non-exhaustive list) of the computer readable medium would include the following: an electrical connection having one or more wires; a tangible medium such as a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a compact disc read-only memory (CD-ROM), or other tangible optical or magnetic storage device; or transmission media such as those supporting the Internet or an intranet. Note that the computer usable or computer readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted, or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory.


In the context of this document, a computer usable or computer readable medium may be any medium that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, platform, apparatus, or device. The computer usable medium may include a propagated data signal with the computer-usable program code embodied therewith, either in baseband or as part of a carrier wave. The computer usable program code may be transmitted using any appropriate medium, including but not limited to the Internet, wireline, optical fiber cable, radio frequency (RF) or other means.


Computer program code for carrying out operations of the present invention may be written in an object oriented, scripted or unscripted programming language such as Java, Perl, Smalltalk, C++ or the like. However, the computer program code for carrying out operations of the present invention may also be written in conventional procedural programming languages, such as the “C” programming language or similar programming languages.


The present invention is described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.


These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture including instruction means which implement the function/act specified in the flowchart and/or block diagram block or blocks.


The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operations to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. Alternatively, computer program implemented steps or acts may be combined with operator or human implemented steps or acts in order to carry out an embodiment of the invention.


Embodiments according to the present invention relate to automatically increasing a capacity of a virtual space in a virtual world allowing avatars to enter that would otherwise be put on hold until space is available or denied entry and turned away. A virtual space may be any type or form of virtual space in a virtual world, such as, for example, a store, a business, an arena, a building, a land area, an open space, a room, etc. When an avatar attempts to enter a virtual space in a virtual world, it is determined if an allowable number of avatars are currently in the virtual space and if so, a capacity of the virtual space may be automatically increased. Thus the avatar desiring entry is not turned away or denied.


Owners or managers of a virtual space in a virtual world may set a threshold for the number of avatars that are allowed in the virtual space at any given time to limit overcrowding. A threshold number of allowed avatars may be related to a number for an ideal avatar capacity for the virtual space or may be related to a number for a maximum avatar capacity for the virtual space. The threshold number of avatars may be set based on any one of a variety of factors such as, for example, how large the area is (e.g., the larger the area the more avatars it can hold at one time and still have a positive user experience), how large the server capacity is that is hosting the virtual space in the virtual world, etc. Even if more avatars can fit into the “physical” size of a virtual space area, it may be desired to limit the number of avatars in a virtual space on a given server. For example, if a threshold limit of allowable avatars is set to twenty, when a twenty-first avatar attempts to enter the virtual space, embodiments according to the present invention dynamically increase a capacity of the virtual space in the virtual world.


The virtual space may be automatically increased by dynamically spawning a replicate virtual space or by expanding the physical size of the area of the virtual space. If a replicate virtual space is spawned, this may occur on another partition on the same server hosting the original virtual space or on a different server. Once the new avatar enters a spawned replicate virtual space, initially, the avatar may be alone in the new virtual space while the original virtual space may still be at capacity or at the desired threshold of allowable avatars. Thus, embodiments according to the present invention allow an owner or manager of a virtual space to provide access to avatars without having to turn an avatar away or allow an unlimited number of avatars into the virtual space and have the avatars, or users controlling the avatars, frustrated by a less than desirable experience due to overcrowding in the virtual space.


According to embodiments of the present invention, a manager or owner of a virtual space may define various settings for the virtual space related to avatar access and/or increasing a capacity of the virtual space. A virtual space may have associated settings such as, for example, a maximum avatar capacity for the virtual space, an ideal avatar capacity for the virtual space, a limit on a number of replicate new virtual spaces that may be spawned from the virtual space, a limit on an expansion of a physical size of the virtual space, etc. The capacity for the virtual space may be automatically increased based on an ideal avatar capacity for the virtual space being reached or a maximum avatar capacity for the virtual space being reached, or any other type criteria or setting.



FIG. 1 shows a diagram of system for automatically increasing a capacity of a virtual space in a virtual world according to an example embodiment of the present invention. The system 100 may include a server 101 and one or more workstations 102 where the server 101 and the one or more workstations 102 may be interconnected to a network 103. Although one server 101 is shown, there may be multiple servers connected to the network 103 and accessible by the one or more workstations 102. The server 101 may host the virtual environment 105 and also contain a controller 104 and storage 106. Therefore, a user at a workstation 102 may access the virtual environment 105 hosted on the server 101 and control an avatar in the virtual environment 105 to access a virtual space. An owner or supplier of the service, the item, the event or the virtual space may also access the virtual world or environment 105, hosted on the server 101, via one or more workstations 102 and control an avatar to provide or restrict access to the virtual space. The server 101 may detect an attempt by an avatar to enter a virtual space in the virtual world, determine if an allowable number of avatars are currently in the virtual space, and increase a capacity of the virtual space when the number of allowable avatars is currently in the virtual space.



FIG. 2 shows a diagram of virtual environment for automatically increasing a capacity of a virtual space in a virtual world according to an example embodiment of the present invention. In the virtual environment/world 200 there may exist an environment containing buildings, stores, trees, cars, people (represented by avatars) and any other items that currently exist in the real world. For example, a virtual world may contain virtual businesses, stores, venues, or other virtual spaces 201, 202, 203 that allow an avatar 204 access to a virtual space.


In this example embodiment, a user may desire to control an avatar 204 to access a virtual space in a virtual world such as, for example, “Electronix Town” 201 to shop for electronics, “Haggar Menswear” 202 to shop for clothing, “Ferdes Amphitheatre” 203 to attend a music or cultural event, etc. The avatar may also desire access to any other types of virtual spaces such as, for example, any type of store, business, arena, building, land area, room, etc. As noted previously, once an attempt by an avatar to enter a virtual space in the virtual world is detected, it may be determined if an allowable number of avatars are currently in the virtual space, and a capacity of the virtual space may be increased when the allowable number of avatars are currently already in the virtual space. For example, if an avatar 204 desires to enter the virtual space “Electronix Town” 201 to shop for electronics, if it is determined that the “Electronix Town” store 201 already has an allowable number of avatars in the store, a capacity of the “Electronix Town” 201 store may be increased, this allowing the avatar 204 to access the store. The capacity of the virtual space may be increased by spawning a replicate new “Electronix Town” virtual space, or by expanding a size of the “Electronix Town” 201 virtual space.



FIG. 3 shows a diagram of increasing a capacity of a virtual space by spawning a replicate new virtual space according to an example embodiment of the present invention. The diagram shows a virtual space 301 that has a number of avatars 302 in the virtual space 301. In this example embodiment, twenty avatars are shown in the virtual space 301, however, embodiments according to the present invention are not limited to any specific number of avatars being in a virtual space. In this example embodiment, the number of avatars in the virtual space is at an allowable number of avatars where it may be desired that no more avatars be allowed into the virtual space 301. When a new avatar 303 (i.e., twenty-first avatar) desires access to the virtual space 301, the capacity of the virtual space 301 may be automatically increased by spawning a replicate new virtual space 304. Therefore, the new avatar 303 (i.e., twenty-first avatar) may then access and enter the newly spawned replicate virtual space 304. The replicate virtual space 304 may be identical and provide the same resources, services, etc. as the original virtual space 301. Should some avatars 302 leave the original virtual space 301 and other new avatars desire entry to the virtual space 301, they may be given access to the original virtual space 301 or to the newly spawned replicate virtual space 304. The newly spawned replicate virtual space 304 may reside on a same server as that hosting the original virtual space 301 or on a different server.



FIG. 4 shows a diagram of increasing a capacity of a virtual space by expanding a size of the virtual space according to an example embodiment of the present invention. The diagram shows a virtual space 401 that has a number of avatars 402 in the virtual space 401. In this example embodiment, twenty avatars are shown in the virtual space 401, however, embodiments according to the present invention are not limited to any specific number of avatars being in a virtual space. In this example embodiment, the number of avatars in the virtual space is at an allowable number of avatars where it may be desired that no more avatars be allowed into the virtual space 401. When a new avatar 403 desires access to the virtual space 401, since the virtual space 401 currently has an allowable number of avatars in the virtual space 401, a capacity of the virtual space 401 may be increased by a expanding a physical size of the virtual space 401 as shown in the expanded virtual space 404 with increased physical space. The new avatar 403 may then be allowed to enter the expanded virtual space 404 with increased physical space along with the avatars 402 in the original virtual space 401.



FIG. 5 shows a flowchart of a process for increasing a capacity of a virtual space in a virtual world according to an example embodiment of the present invention. In the process 500, in block 501 a new avatar attempts to enter a virtual space. In block 502, it may be determined if an allowable number of avatars currently exist in the virtual space and if not, in block 503 a new avatar desiring entry into the virtual space may be allowed entry into the virtual space. If it is determined that the allowable number of avatars currently exist in the virtual space, then in block 504, a capacity of the virtual space may be increased. In block 505, the new avatar desiring entry into the virtual space may be allowed to enter the increased capacity virtual space.



FIG. 6 shows a flowchart of increasing a capacity of a virtual space by spawning a replicate new virtual space according to an example embodiment of the present invention. In the process 600, in block 601, a new avatar may attempt to enter a virtual space. In block 602 it may be determined if an allowable number of avatars already currently exist in the virtual space and if not, in block 603 the new avatar may be allowed to enter the virtual space. If it is determined that an allowable number of avatars currently exist in the virtual space, in block 604, a replicate new virtual space may be automatically spawned from the original virtual space. Then in block 605, the new avatar may be allowed entry into the replicate new virtual space.



FIG. 7 shows a flowchart of a process for increasing a capacity of a virtual space by expanding a physical size of the virtual space according to an example embodiment of the present invention. In the process 700, in block 701, a new avatar may desire entry into a virtual space. In block 702, it may be determined if an allowable number of avatars already currently exist in the virtual space and if not, in block 703, the new avatar may be allowed to enter the virtual space. If it is determined that an allowable number of avatars already currently exist in the virtual space, in block 704, a physical size of the virtual space may be automatically expanded. Then in block 705, the new avatar may be allowed to enter the expanded virtual space.



FIG. 8 shows a flowchart of a process for defining virtual space settings according to an example embodiment of the present invention. In the process 800, in block 801, it may be desired to define settings for a virtual space. In block 802 it may be determined if it is desired to set a maximum allowable avatar capacity value for the virtual space and if not, the process ends. If it is desired to set a maximum allowable avatar capacity for the virtual space, in block 803, a value for a maximum number of avatars allowed to enter the virtual space may be set.


In block 804 it may be determined if it is desired to set a limit on a number of spawned replicate new virtual spaces and if not, the process ends. If it is desired to set a limit on a number of spawned replicate new virtual spaces, in block 805, a maximum number of allowable replicates of the virtual space may be set. In block 806 it may be determined if an ideal allowable capacity of avatars in a virtual space is desired to be set and if not, the process ends. If an ideal allowable capacity of avatars in a virtual space is desired to be set, in block 807, a value for a number of avatars ideal for the virtual space may be set. In block 808, it may be determined if it is desired to set a limit on a physical size expansion of the virtual space and if not, the process ends. If it is desired to set a limit on an expansion of the physical size of the virtual space, then in block 809 a maximum expansion size for the virtual space may be set.



FIG. 9 shows a flowchart of a process for setting an avatar capacity limit for automatic increase in capacity according to an example embodiment of the present invention. In the process 900, in block 901, it may be desired to set an avatar capacity limit that initiates an automatic increase in capacity for the virtual space. In block 902, it may be determined if an ideal avatar capacity limit is desired to be set and if so, in block 903, an automatic increase in the capacity of the virtual space may occur when the number of avatars desiring access to the virtual space exceeds an ideal capacity. If it is not desired to set an ideal avatar capacity, in block 904 it may be determined if it is desired to set a maximum avatar capacity limit and if not the process ends. If it is desired to set a maximum avatar capacity, then in block 905, a capacity of the virtual space may be automatically increased when a number of avatars desiring access to the virtual space exceed a maximum capacity of the virtual space.


The flowcharts and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.


The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.


Although specific embodiments have been illustrated and described herein, those of ordinary skill in the art appreciate that any arrangement which is calculated to achieve the same purpose may be substituted for the specific embodiments shown and that the invention has other applications in other environments. This application is intended to cover any adaptations or variations of the present invention. The following claims are in no way intended to limit the scope of the invention to the specific embodiments described herein.

Claims
  • 1. A system for automatically increasing a capacity of a virtual space in a virtual world, wherein the virtual world is hosted by a server, comprising: one or more physical processors programmed with one or more computer program instructions which, when executed, cause the one or more physical processors to: detect an attempt by an avatar to enter a virtual space in a virtual world;determine a threshold number of avatars for the virtual space;determine whether a current number of avatars in the virtual space has reached the threshold number of avatars; andincrease the capacity of the virtual space in response to the detection of the attempt and a determination that the current number of avatars in the virtual space has reached the threshold number of avatars, wherein the increase of the capacity is achieved by spawning a replicate virtual space, corresponding to the virtual space, in said server.
  • 2. The system of claim 1, wherein the one or more physical processors are further caused to: allow the avatar to enter the virtual space in response to the increase of the capacity of the virtual space.
  • 3. The system of claim 1, wherein the one or more physical processors are further caused to: increase the threshold number of avatars in response to the increase of the capacity of the virtual space.
  • 4. The system of claim 1, wherein the virtual space comprises at least one of a store, a business, an arena, a building, a land area, or a room.
  • 5. The system of claim 1, wherein increasing the capacity of the virtual space comprises creating a new instance of the virtual space in response to the detection of the attempt and a determination that the current number of avatars in the virtual space has reached the threshold number of avatars.
  • 6. The system of claim 1, wherein the threshold number of avatars is set for the virtual space by at least one of an owner of the virtual space or a manager of the virtual space.
  • 7. The system of claim 6, wherein the threshold number of avatars comprises a maximum avatar capacity for the virtual space.
  • 8. The system of claim 1, wherein increasing the capacity of the virtual space comprises providing a perception of increased physical space in the virtual space in response to the detection of the attempt and a determination that the current number of avatars in the virtual space has reached the threshold number of avatars.
  • 9. The system of claim 1, wherein the threshold number of avatars is based on computer resources available for the virtual space, and wherein the one or more physical processors are further caused to: provide additional computing resources for the virtual space in response to the detection of the attempt and a determination that the current number of avatars in the virtual space has reached the threshold number of avatars.
  • 10. A system for automatically increasing a capacity of a virtual space in a virtual world, wherein the virtual world is hosted by a server, comprising: one or more physical processors programmed with one or more computer program instructions which, when executed, cause the one or more physical processors to: determine a threshold number of avatars for the virtual space based on computing resources available for the virtual space;determine whether a current number of avatars in the virtual space has reached the threshold number of avatars; andincrease the capacity of the virtual space in response to a determination that the current number of avatars in the virtual space has reached the threshold number of avatars, wherein the increase of the capacity is achieved by spawning a replicate virtual space, corresponding to the virtual space, in said server.
  • 11. The system of claim 10, wherein the virtual space comprises at least one of a store, a business, an arena, a building, a land area, or a room.
  • 12. The system of claim 10, wherein increasing the capacity of the virtual space comprises creating a new instance of the virtual space in response to the detection of the attempt and a determination that the current number of avatars in the virtual space has reached the threshold number of avatars.
  • 13. The system of claim 10, wherein increasing the capacity of the virtual space comprises providing a perception of increased physical space in the virtual space in response to the detection of the attempt and a determination that the current number of avatars in the virtual space has reached the threshold number of avatars.
  • 14. A method of automatically increasing a capacity of a virtual space in a virtual world, wherein the virtual world is hosted by a server, the method being implemented on a computer system comprising one or more physical processors executing one or more computer program instructions which, when executed, perform the method, the method comprising: detecting, by the computer system, an attempt by an avatar to enter a virtual space in a virtual world;determining, by the computer system, a threshold number of avatars for the virtual space;determining, by the computer system, whether a current number of avatars in the virtual space has reached the threshold number of avatars; andincreasing, by the computer system, the capacity of the virtual space in response to the detection of the attempt and a determination that the current number of avatars in the virtual space has reached the threshold number of avatars, wherein the increasing of the capacity is achieved by spawning a replicate virtual space, corresponding to the virtual space, in said server.
  • 15. The method of claim 14, further comprising: allowing, by the computer system, the avatar to enter the virtual space in response to the increase of the capacity of the virtual space.
  • 16. The method of claim 14, wherein the threshold number of avatars is based on computer resources available for the virtual space.
  • 17. The method of claim 16, further comprising: providing, by the computer system, additional computing resources for the virtual space in response to the detection of the attempt and a determination that the current number of avatars in the virtual space has reached the threshold number of avatars.
  • 18. The method of claim 14, wherein the virtual space comprises at least one of a store, a business, an arena, a building, a land area, or a room.
  • 19. The method of claim 14, wherein increasing the capacity of the virtual space comprises creating a new instance of the virtual space in response to the detection of the attempt and a determination that the current number of avatars in the virtual space has reached the threshold number of avatars.
  • 20. The method of claim 14, wherein increasing the capacity of the virtual space comprises providing a perception of increased physical space in the virtual space in response to the detection of the attempt and a determination that the current number of avatars in the virtual space has reached the threshold number of avatars.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 13/341,255, filed Dec. 30, 2011 (status: pending), which is a continuation of U.S. patent application Ser. No. 11/947,829, filed Nov. 30, 2007 (and issued as U.S. Pat. No. 8,127,235 on Feb. 28, 2012), each of which is hereby incorporated by reference herein in its entirety.

US Referenced Citations (655)
Number Name Date Kind
3621214 Romney Nov 1971 A
3736564 Watkins May 1973 A
3792243 Appel Feb 1974 A
3996672 Osofsky Dec 1976 A
4461301 Ochs Jul 1984 A
4841292 Zeno Jun 1989 A
4879849 Hollingsworth Nov 1989 A
4895376 Chiang Jan 1990 A
4902469 Watson Feb 1990 A
4908761 Tai Mar 1990 A
4970666 Welsh Nov 1990 A
5015188 Pellosie May 1991 A
5031089 Liu Jul 1991 A
5058180 Khan Oct 1991 A
5130794 Ritchey Jul 1992 A
5179656 Lisle Jan 1993 A
5255352 Falk Oct 1993 A
5276785 Mackinlay Jan 1994 A
5287437 Deering Feb 1994 A
5295234 Ishida Mar 1994 A
5310349 Daniels May 1994 A
5325472 Horiuchi Jun 1994 A
5333272 Capek Jul 1994 A
5339390 Robertson Aug 1994 A
5347628 Brewer Sep 1994 A
5367614 Bisey Nov 1994 A
5371673 Fan Dec 1994 A
5371851 Pieper Dec 1994 A
5381158 Takahara Jan 1995 A
5381526 Ellson Jan 1995 A
5432895 Myers Jul 1995 A
5442569 Osano Aug 1995 A
5442733 Kaufman Aug 1995 A
5452414 Rosendahl Sep 1995 A
5498003 Gechter Mar 1996 A
5502638 Takenaka Mar 1996 A
5502794 Sakurai Mar 1996 A
5522018 Takeda May 1996 A
5530796 Wang Jun 1996 A
5535276 Ganesan Jul 1996 A
5537618 Boulton Jul 1996 A
5539883 Allon Jul 1996 A
5555354 Strasnick Sep 1996 A
5561736 Moore Oct 1996 A
5563946 Cooper Oct 1996 A
5577981 Jarvik Nov 1996 A
5584700 Feldman Dec 1996 A
5594644 Hasegawa Jan 1997 A
5594859 Palmer Jan 1997 A
5621906 Oneill Apr 1997 A
5630129 Wheat May 1997 A
5633993 Redmann May 1997 A
5662523 Yasumaru Sep 1997 A
5675746 Marshall Oct 1997 A
5680524 Maples Oct 1997 A
5685775 Bakoglu Nov 1997 A
5696892 Redmann Dec 1997 A
5702307 Moran Dec 1997 A
5706507 Schloss Jan 1998 A
5708764 Borrel Jan 1998 A
5734805 Isensee Mar 1998 A
5736982 Suzuki Apr 1998 A
5736985 Lection Apr 1998 A
5736990 Barrus Apr 1998 A
5737416 Cooper Apr 1998 A
5737533 De Apr 1998 A
5737619 Judson Apr 1998 A
5745113 Jordan Apr 1998 A
5745678 Herzberg Apr 1998 A
5745711 Kitahara Apr 1998 A
5761083 Brown Jun 1998 A
5762552 Vuong Jun 1998 A
5764232 Oouchi Jun 1998 A
5764912 Rosborough Jun 1998 A
5768511 Galvin Jun 1998 A
5774668 Choquier Jun 1998 A
5796393 MacNaughton Aug 1998 A
5802294 Ludwig Sep 1998 A
5825877 Dan Oct 1998 A
5835094 Ermel Nov 1998 A
5835692 Cragun Nov 1998 A
5850225 Cosman Dec 1998 A
5854897 Radziewicz Dec 1998 A
5860137 Raz Jan 1999 A
5862337 Gray Jan 1999 A
5875296 Shi Feb 1999 A
5878233 Schloss Mar 1999 A
5879236 Lambright Mar 1999 A
5880731 Liles Mar 1999 A
5883628 Mullaly Mar 1999 A
5884024 Lim Mar 1999 A
5884029 Brush Mar 1999 A
5898423 Tognazzini Apr 1999 A
5900879 Berry May 1999 A
5903266 Berstis May 1999 A
5903271 Bardon May 1999 A
5908469 Botz Jun 1999 A
5911045 Leyba Jun 1999 A
5919045 Tagge Jul 1999 A
5920325 Morgan Jul 1999 A
5923324 Berry Jul 1999 A
5926179 Matsuda Jul 1999 A
5933818 Kasravi Aug 1999 A
5938722 Johnson Aug 1999 A
5944824 He Aug 1999 A
5963915 Kirsch Oct 1999 A
5966129 Matsukuma Oct 1999 A
5969720 Lisle Oct 1999 A
5969724 Berry Oct 1999 A
5977979 Clough Nov 1999 A
5978841 Berger Nov 1999 A
5982372 Brush Nov 1999 A
5983003 Lection Nov 1999 A
5990888 Blades Nov 1999 A
5990896 Barrus Nov 1999 A
6003065 Yan Dec 1999 A
6006223 Agrawal Dec 1999 A
6008848 Tiwari Dec 1999 A
6009455 Doyle Dec 1999 A
6014145 Bardon Jan 2000 A
6018734 Zhang Jan 2000 A
6021268 Johnson Feb 2000 A
6023270 Brush Feb 2000 A
6023698 Lavey Feb 2000 A
6025839 Schell Feb 2000 A
6049819 Buckle Apr 2000 A
6058266 Megiddo May 2000 A
6059842 Dumarot May 2000 A
6064389 Berry May 2000 A
6069632 Mullaly May 2000 A
6070143 Barney May 2000 A
6072498 Brittain Jun 2000 A
6081270 Berry Jun 2000 A
6081271 Bardon Jun 2000 A
6088727 Hosokawa Jul 2000 A
6091410 Lection Jul 2000 A
6094196 Berry Jul 2000 A
6098056 Rusnak Aug 2000 A
6101538 Brown Aug 2000 A
6104406 Berry Aug 2000 A
6111581 Berry Aug 2000 A
6115718 Huberman Sep 2000 A
6134588 Guenthner Oct 2000 A
6137904 Lubin Oct 2000 A
6138128 Perkowitz Oct 2000 A
6141699 Luzzi Oct 2000 A
6144381 Lection Nov 2000 A
6148294 Beyda Nov 2000 A
6148328 Cuomo Nov 2000 A
6177932 Galdes Jan 2001 B1
6179713 James Jan 2001 B1
6182067 Presnell Jan 2001 B1
6185614 Cuomo Feb 2001 B1
6195657 Rucker Feb 2001 B1
6199067 Geller Mar 2001 B1
6201881 Masuda Mar 2001 B1
6212494 Boguraev Apr 2001 B1
6216098 Clancey Apr 2001 B1
6219045 Leahy Apr 2001 B1
6222551 Schneider Apr 2001 B1
6226009 Carraro May 2001 B1
6233583 Hoth May 2001 B1
6249779 Hitt Jun 2001 B1
6256043 Aho Jul 2001 B1
6266649 Linden Jul 2001 B1
6271842 Bardon Aug 2001 B1
6271843 Lection Aug 2001 B1
6275820 Navin-Chandra Aug 2001 B1
6282547 Hirsch Aug 2001 B1
6298374 Sasaki Oct 2001 B1
6308208 Jung Oct 2001 B1
6311206 Malkin Oct 2001 B1
6314465 Paul Nov 2001 B1
6327541 Pitchford Dec 2001 B1
6329986 Cheng Dec 2001 B1
6330281 Mann Dec 2001 B1
6334127 Bieganski Dec 2001 B1
6334141 Varma Dec 2001 B1
6336134 Varma Jan 2002 B1
6337700 Kinoe Jan 2002 B1
6345264 Breese Feb 2002 B1
6345287 Fong Feb 2002 B1
6346938 Chan Feb 2002 B1
6346956 Matsuda Feb 2002 B2
6349091 Li Feb 2002 B1
6351775 Yu Feb 2002 B1
6353449 Gregg Mar 2002 B1
6356297 Cheng Mar 2002 B1
6363174 Lu Mar 2002 B1
6370560 Robertazzi Apr 2002 B1
6388688 Schileru-Key May 2002 B1
6393467 Potvin May 2002 B1
6411312 Sheppard Jun 2002 B1
6418424 Hoffberg Jul 2002 B1
6418462 Xu Jul 2002 B1
6421051 Kato Jul 2002 B1
6426757 Smith Jul 2002 B1
6437777 Kamachi Aug 2002 B1
6445389 Bossen Sep 2002 B1
6452593 Challener Sep 2002 B1
6462760 Cox, Jr. Oct 2002 B1
6466550 Foster Oct 2002 B1
6469712 Hilpert, Jr. Oct 2002 B1
6473085 Brock Oct 2002 B1
6473597 Johnson Oct 2002 B1
6496851 Morris Dec 2002 B1
6499053 Marquette Dec 2002 B1
6505208 Kanevsky Jan 2003 B1
6509925 Dermler Jan 2003 B1
6525731 Suits Feb 2003 B1
6539415 Mercs Mar 2003 B1
6549933 Barrett Apr 2003 B1
6567109 Todd May 2003 B1
6567813 Zhu May 2003 B1
6570587 Efrat May 2003 B1
6574477 Rathunde Jun 2003 B1
6580441 Schileru-Key Jun 2003 B2
6580981 Masood Jun 2003 B1
6594673 Smith Jul 2003 B1
6598029 Johnson Jul 2003 B1
6601084 Bhaskaran Jul 2003 B1
6618751 Challenger Sep 2003 B1
6631309 Boies Oct 2003 B2
6636889 Estrada Oct 2003 B1
6645153 Kroll Nov 2003 B2
RE38375 Herzberg Dec 2003 E
6657617 Paolini Dec 2003 B2
6657642 Bardon Dec 2003 B1
6672961 Uzun Jan 2004 B1
6674484 Boland Jan 2004 B1
6684255 Martin Jan 2004 B1
6717600 Dutta Apr 2004 B2
6732146 Miyake May 2004 B1
6734884 Berry May 2004 B1
6742032 Castellani May 2004 B1
6753857 Matsuura Jun 2004 B1
6763371 Jaendel Jul 2004 B1
6765596 Lection Jul 2004 B2
6767287 McQuaid Jul 2004 B1
6772195 Hatlelid Aug 2004 B1
6781607 Benham Aug 2004 B1
6784901 Harvey Aug 2004 B1
6785592 Smith Aug 2004 B1
6801930 Dionne Oct 2004 B1
6819669 Rooney Nov 2004 B2
6826523 Guy Nov 2004 B1
6832239 Kraft Dec 2004 B1
6836480 Basso Dec 2004 B2
6845389 Sen Jan 2005 B1
6886026 Hanson Apr 2005 B1
6912565 Powers Jun 2005 B1
6937946 Culp Aug 2005 B1
6941236 Huelsbergen Sep 2005 B2
6948168 Kuprionas Sep 2005 B1
RE38865 Dumarot Nov 2005 E
6970929 Bae Nov 2005 B2
6981223 Becker Dec 2005 B2
6982372 England Jan 2006 B2
6985937 Keshav Jan 2006 B1
6990381 Nomura Jan 2006 B2
6993596 Hinton Jan 2006 B2
7006616 Christofferson Feb 2006 B1
7028296 Irfan Apr 2006 B2
7062533 Brown Jun 2006 B2
7089266 Stolte Aug 2006 B2
7096360 Fries Aug 2006 B1
7124071 Rich Oct 2006 B2
7135956 Bartone Nov 2006 B2
7139792 Mishra Nov 2006 B1
7143409 Herrero Nov 2006 B2
7146627 Ismail Dec 2006 B1
7155680 Akazawa Dec 2006 B2
7159217 Pulsipher Jan 2007 B2
7171287 Weiss Jan 2007 B2
7185067 Viswanath Feb 2007 B1
7209137 Brokenshire Apr 2007 B2
7230616 Taubin Jun 2007 B2
7249123 Elder Jul 2007 B2
7263511 Bodin Aug 2007 B2
7269632 Edecker Sep 2007 B2
7287053 Bodin Oct 2007 B2
7293235 Powers Nov 2007 B1
7305438 Christensen Dec 2007 B2
7308476 Mannaru Dec 2007 B2
7353295 Crow Apr 2008 B1
7358973 Herbrich Apr 2008 B2
7386799 Clanton Jun 2008 B1
7404149 Fox Jul 2008 B2
7426538 Bodin Sep 2008 B2
7427980 Partridge Sep 2008 B1
7428588 Berstis Sep 2008 B2
7429987 Leah Sep 2008 B2
7436407 Doi Oct 2008 B2
7439975 Hsu Oct 2008 B2
7443393 Shen Oct 2008 B2
7447996 Cox Nov 2008 B1
7467180 Kaufman Dec 2008 B2
7467181 McGowan Dec 2008 B2
7475354 Guido Jan 2009 B2
7478127 Creamer Jan 2009 B2
7484012 Hinton Jan 2009 B2
7503007 Goodman Mar 2009 B2
7506264 Polan Mar 2009 B2
7509369 Tormasov Mar 2009 B1
7515136 Kanevsky Apr 2009 B1
7515156 Tinker Apr 2009 B2
7517282 Pryor Apr 2009 B1
7525964 Astley Apr 2009 B2
7552177 Kessen Jun 2009 B2
7565650 Bhogal Jul 2009 B2
7571224 Childress Aug 2009 B2
7571389 Broussard Aug 2009 B2
7580888 Ur Aug 2009 B2
7587492 Dyck Sep 2009 B2
7590984 Kaufman Sep 2009 B2
7596596 Chen Sep 2009 B2
7640587 Fox Dec 2009 B2
7643673 Rohlf Jan 2010 B2
7667701 Leah Feb 2010 B2
7698656 Srivastava Apr 2010 B2
7702784 Berstis Apr 2010 B2
7714867 Doi May 2010 B2
7719532 Schardt May 2010 B2
7719535 Tadokoro May 2010 B2
7734691 Creamer Jun 2010 B2
7737969 Shen Jun 2010 B2
7743095 Goldberg Jun 2010 B2
7747679 Galvin Jun 2010 B2
7765478 Reed Jul 2010 B2
7768514 Pagan Aug 2010 B2
7773087 Fowler Aug 2010 B2
7774407 Daly Aug 2010 B2
7782318 Shearer Aug 2010 B2
7792263 D Amora Sep 2010 B2
7792801 Hamilton, II Sep 2010 B2
7796128 Radzikowski Sep 2010 B2
7805680 Meyers Sep 2010 B2
7808500 Shearer Oct 2010 B2
7814152 McGowan Oct 2010 B2
7814154 Kandekar Oct 2010 B1
7827208 Bosworth Nov 2010 B2
7827318 Hinton Nov 2010 B2
7843471 Doan Nov 2010 B2
7844663 Boutboul Nov 2010 B2
7847799 Taubin Dec 2010 B2
7853594 Elder Dec 2010 B2
7856469 Chen Dec 2010 B2
7873485 Castelli Jan 2011 B2
7882222 Dolbier Feb 2011 B2
7882243 Ivory Feb 2011 B2
7884819 Kuesel Feb 2011 B2
7886045 Bates Feb 2011 B2
7890623 Bates Feb 2011 B2
7893936 Shearer Feb 2011 B2
7904829 Fox Mar 2011 B2
7921128 Hamilton, II Apr 2011 B2
7940265 Brown May 2011 B2
7945620 Bou-Ghannam May 2011 B2
7945802 Hamilton, II May 2011 B2
7970837 Lyle Jun 2011 B2
7970840 Cannon Jun 2011 B2
7985138 Acharya Jul 2011 B2
7990387 Hamilton, II Aug 2011 B2
7996164 Hamilton, II Aug 2011 B2
8001161 Finn Aug 2011 B2
8004518 Fowler Aug 2011 B2
8005025 Bodin Aug 2011 B2
8006182 Bates Aug 2011 B2
8013861 Hamilton, II Sep 2011 B2
8018453 Fowler Sep 2011 B2
8018462 Bhogal Sep 2011 B2
8019797 Hamilton, II Sep 2011 B2
8019858 Bauchot Sep 2011 B2
8022948 Garbow Sep 2011 B2
8022950 Brown Sep 2011 B2
8023048 Dacosta Sep 2011 B2
8026913 Garbow Sep 2011 B2
8028021 Reisinger Sep 2011 B2
8028022 Brownholtz Sep 2011 B2
8037416 Bates Oct 2011 B2
8041614 Bhogal Oct 2011 B2
8046700 Bates Oct 2011 B2
8051462 Hamilton, II Nov 2011 B2
8055656 Cradick Nov 2011 B2
8056121 Hamilton, II Nov 2011 B2
8057307 Berstis Nov 2011 B2
8062130 Smith Nov 2011 B2
8063905 Brown Nov 2011 B2
8070601 Acharya Dec 2011 B2
8082245 Bates Dec 2011 B2
8085267 Brown Dec 2011 B2
8086544 Boss Dec 2011 B2
8089481 Shearer Jan 2012 B2
8092288 Theis Jan 2012 B2
8095881 Reisinger Jan 2012 B2
8099338 Betzler Jan 2012 B2
8099668 Garbow Jan 2012 B2
8102334 Brown Jan 2012 B2
8103640 Lo Jan 2012 B2
8103959 Cannon Jan 2012 B2
8105165 Karstens Jan 2012 B2
8108774 Finn Jan 2012 B2
8113959 De Judicibus Feb 2012 B2
8117551 Cheng Feb 2012 B2
8125485 Brown Feb 2012 B2
8127235 Haggar Feb 2012 B2
8127236 Hamilton, II Feb 2012 B2
8127297 Hamilton Feb 2012 B2
8128487 Hamilton, II Mar 2012 B2
8131740 Cradick Mar 2012 B2
8132235 Bussani Mar 2012 B2
8134560 Bates Mar 2012 B2
8139060 Brown Mar 2012 B2
8139780 Shearer Mar 2012 B2
8140340 Bhogal Mar 2012 B2
8140620 Creamer Mar 2012 B2
8140978 Betzler Mar 2012 B2
8140982 Hamilton, II Mar 2012 B2
8145676 Bhogal Mar 2012 B2
8145725 Dawson Mar 2012 B2
8149241 Do Apr 2012 B2
8150941 Edecker Apr 2012 B2
8151191 Nicol, II Apr 2012 B2
8156184 Kurata Apr 2012 B2
8165350 Fuhrmann Apr 2012 B2
8171407 Huang May 2012 B2
8171408 Dawson May 2012 B2
8171559 Hamilton, II May 2012 B2
8174541 Greene May 2012 B2
8176421 Dawson May 2012 B2
8176422 Bergman May 2012 B2
8184092 Cox May 2012 B2
8184116 Finn May 2012 B2
8185450 McVey May 2012 B2
8185829 Cannon May 2012 B2
8187067 Hamilton, II May 2012 B2
8199145 Hamilton, II Jun 2012 B2
8203561 Carter Jun 2012 B2
8214335 Hamilton, II Jul 2012 B2
8214433 Dawson Jul 2012 B2
8214750 Hamilton, II Jul 2012 B2
8214751 Dawson Jul 2012 B2
8214843 Boss Jul 2012 B2
8217953 Comparan Jul 2012 B2
8219616 Dawson Jul 2012 B2
8230045 Kawachiya Jul 2012 B2
8230338 Dugan Jul 2012 B2
8233005 Finn Jul 2012 B2
8234016 Boss Jul 2012 B2
8234234 Shearer Jul 2012 B2
8234579 Do Jul 2012 B2
8239775 Beverland Aug 2012 B2
8241131 Bhogal Aug 2012 B2
8245241 Hamilton, II Aug 2012 B2
8245283 Dawson Aug 2012 B2
8265253 D Amora Sep 2012 B2
8310497 Comparan Nov 2012 B2
8327376 Hamilton, II Dec 2012 B2
8334871 Hamilton, II Dec 2012 B2
8341640 Hamilton, II Dec 2012 B2
8347235 Allen Jan 2013 B2
8360886 Karstens Jan 2013 B2
8364804 Childress Jan 2013 B2
8425326 Chudley Apr 2013 B2
8442946 Hamilton, II May 2013 B2
8506372 Chudley Aug 2013 B2
8514249 Hamilton, II Aug 2013 B2
8554841 Kurata Oct 2013 B2
8607142 Bergman Dec 2013 B2
8607356 Hamilton, II Dec 2013 B2
8624903 Hamilton, II Jan 2014 B2
8626836 Dawson Jan 2014 B2
8667498 Hamilton, II Mar 2014 B2
8692835 Hamilton, II Apr 2014 B2
8721412 Chudley May 2014 B2
8827816 Bhogal Sep 2014 B2
8838640 Bates Sep 2014 B2
8849917 Dawson Sep 2014 B2
8911296 Chudley Dec 2014 B2
8992316 Smith Mar 2015 B2
9083654 Dawson Jul 2015 B2
9152914 Haggar Oct 2015 B2
9205328 Bansi Dec 2015 B2
9268385 Hamilton, II Feb 2016 B2
9286731 Hamilton, II Mar 2016 B2
9299080 Dawson Mar 2016 B2
9364746 Chudley Jun 2016 B2
9525746 Bates Dec 2016 B2
9583109 Kurata Feb 2017 B2
9682324 Bansi Jun 2017 B2
9764244 Bansi Sep 2017 B2
9789406 Marr Oct 2017 B2
9808722 Kawachiya Nov 2017 B2
20010044725 Matsuda Nov 2001 A1
20010055039 Matsuda Dec 2001 A1
20020007317 Callaghan Jan 2002 A1
20020010776 Lerner Jan 2002 A1
20020015003 Kato Feb 2002 A1
20020023159 Vange Feb 2002 A1
20020026477 Choi Feb 2002 A1
20020035593 Salim Mar 2002 A1
20020041327 Hildreth Apr 2002 A1
20020043568 Hess Apr 2002 A1
20020056006 Vange May 2002 A1
20020062177 Hannaford May 2002 A1
20020065870 Baehr-Jones May 2002 A1
20020078192 Kopsell Jun 2002 A1
20020095586 Doyle Jul 2002 A1
20020107918 Shaffer Aug 2002 A1
20020112002 Abato Aug 2002 A1
20020116466 Trevithick Aug 2002 A1
20020124137 Ulrich Sep 2002 A1
20020130904 Becker Sep 2002 A1
20020135618 Maes Sep 2002 A1
20020138607 O Sep 2002 A1
20020152147 Shulman Oct 2002 A1
20020158873 Williamson Oct 2002 A1
20020184373 Maes Dec 2002 A1
20030008712 Poulin Jan 2003 A1
20030037131 Verma Feb 2003 A1
20030040946 Sprenger Feb 2003 A1
20030050977 Puthenkulam Mar 2003 A1
20030055892 Huitema Mar 2003 A1
20030056002 Trethewey Mar 2003 A1
20030057884 Dowling Mar 2003 A1
20030067554 Klarfeld Apr 2003 A1
20030084094 Shim May 2003 A1
20030084172 Dejong May 2003 A1
20030084302 De May 2003 A1
20030110399 Rail Jun 2003 A1
20030122858 Mauve Jul 2003 A1
20030126318 Nomura Jul 2003 A1
20030128210 Muffler Jul 2003 A1
20030135621 Romagnoli Jul 2003 A1
20030145128 Baird Jul 2003 A1
20030149781 Yared Aug 2003 A1
20030163733 Barriga-Caceres Aug 2003 A1
20030172174 Mihalcheon Sep 2003 A1
20030177187 Levine Sep 2003 A1
20030187984 Banavar Oct 2003 A1
20030190951 Matsumoto Oct 2003 A1
20030195957 Banginwar Oct 2003 A1
20030210271 King Nov 2003 A1
20030212760 Chen Nov 2003 A1
20040002380 Brosnan Jan 2004 A1
20040014514 Yacenda Jan 2004 A1
20040034831 Grober Feb 2004 A1
20040059436 Anderson Mar 2004 A1
20040088303 Elder May 2004 A1
20040098142 Warren May 2004 A1
20040103079 Tokusho May 2004 A1
20040113756 Mollenkopf Jun 2004 A1
20040130549 Tinker Jul 2004 A1
20040210627 Kroening Oct 2004 A1
20040215536 Deliwala Oct 2004 A1
20040228291 Huslak Nov 2004 A1
20040244006 Kaufman Dec 2004 A1
20040252123 Estrada Dec 2004 A1
20040254899 Abe Dec 2004 A1
20040261037 Ording Dec 2004 A1
20050015571 Kaufman Jan 2005 A1
20050021484 Bodin Jan 2005 A1
20050022139 Gettman Jan 2005 A1
20050024362 Klein Feb 2005 A1
20050024376 Gettman Feb 2005 A1
20050033601 Kirby Feb 2005 A1
20050050137 Bodin Mar 2005 A1
20050071462 Bodin Mar 2005 A1
20050080894 Apostolopoulos Apr 2005 A1
20050165512 Peljto Jul 2005 A1
20050210413 Quek Sep 2005 A1
20050216346 Kusumoto Sep 2005 A1
20050246711 Berstis Nov 2005 A1
20050253843 Losasso Nov 2005 A1
20050278323 Horvitz Dec 2005 A1
20060010229 Chen Jan 2006 A1
20060026233 Tenembaum Feb 2006 A1
20060038805 Yun-Wen Feb 2006 A1
20060080613 Savant Apr 2006 A1
20060085759 Knapheide Apr 2006 A1
20060094501 Oleary May 2006 A1
20060119598 Littlefield Jun 2006 A1
20060123351 Littlefield Jun 2006 A1
20060135261 Kinne Jun 2006 A1
20060212900 Ismail Sep 2006 A1
20060230407 Rosu Oct 2006 A1
20060284792 Foxlin Dec 2006 A1
20070005466 Rosenblatt Jan 2007 A1
20070035548 Jung Feb 2007 A1
20070050721 De Mar 2007 A1
20070061201 Ellis Mar 2007 A1
20070097206 Houvener May 2007 A1
20070218965 Tilston Sep 2007 A1
20070219645 Thomas Sep 2007 A1
20070240119 Ducheneaut Oct 2007 A1
20070244604 McNally Oct 2007 A1
20080059972 Ding Mar 2008 A1
20080070684 Haigh-Hutchinson Mar 2008 A1
20080074415 Woo Mar 2008 A1
20080086696 Sri Apr 2008 A1
20080102809 Beyer May 2008 A1
20080134056 Shuster Jun 2008 A1
20080177423 Brickfield Jul 2008 A1
20080207322 Mizrahi Aug 2008 A1
20080207327 Van Aug 2008 A1
20080255899 McConnell Oct 2008 A1
20080270605 Berstis Oct 2008 A1
20080291217 Vincent Nov 2008 A1
20080301405 Kaufman Dec 2008 A1
20080313011 Rose Dec 2008 A1
20080320514 Dacosta Dec 2008 A1
20090013052 Robarts Jan 2009 A1
20090063228 Forbes Mar 2009 A1
20090064052 Mihalcheon Mar 2009 A1
20090077158 Riley Mar 2009 A1
20090077475 Koster Mar 2009 A1
20090089157 Narayanan Apr 2009 A1
20090094535 Bromenshenkel Apr 2009 A1
20090109229 Hamilton Apr 2009 A1
20090113338 Hamilton Apr 2009 A1
20090113421 Hamilton Apr 2009 A1
20090113448 Smith Apr 2009 A1
20090118019 Perlman May 2009 A1
20090165140 Robinson Jun 2009 A1
20090187782 Greene Jul 2009 A1
20090222276 Romney Sep 2009 A1
20090267938 Nicol Oct 2009 A1
20090276718 Dawson Nov 2009 A1
20090278841 Hamilton Nov 2009 A1
20090281743 Hamilton Nov 2009 A1
20090281885 Castelli Nov 2009 A1
20090281886 Castelli Nov 2009 A1
20100011312 Banerjee Jan 2010 A1
20100050004 Hamilton Feb 2010 A1
20100052872 Boss Mar 2010 A1
20100057529 Boss Mar 2010 A1
20100057625 Boss Mar 2010 A1
20100057641 Boss Mar 2010 A1
20100058350 Boss Mar 2010 A1
20100070807 Hamilton Mar 2010 A1
20100083107 Allen Apr 2010 A1
20100107084 Hamilton Apr 2010 A1
20100220097 Hamilton Sep 2010 A1
20100332997 Hamilton Dec 2010 A1
20110055726 Hamilton Mar 2011 A1
20110113018 Hamilton May 2011 A1
20110131226 Chandra Jun 2011 A1
20110225276 Hamilton Sep 2011 A1
20110254853 Hamilton Oct 2011 A1
20120113127 Hamilton May 2012 A1
20120117233 Hamilton May 2012 A1
20120188278 Hamilton Jul 2012 A1
20130002667 Hamilton, II Jan 2013 A1
20140344725 Bates Nov 2014 A1
20160191671 Dawson Jun 2016 A1
Foreign Referenced Citations (104)
Number Date Country
768367 Mar 2004 AU
2005215048 Oct 2011 AU
2143874 Jun 2000 CA
2292678 Jul 2005 CA
2552135 Jul 2013 CA
1334650 Feb 2002 CN
1202652 Oct 2002 CN
1141641 Mar 2004 CN
1494679 May 2004 CN
1219384 Sep 2005 CN
1307544 Mar 2007 CN
100407675 Jul 2008 CN
100423016 Oct 2008 CN
100557637 Nov 2009 CN
101001678 May 2010 CN
101436242 Dec 2010 CN
101801482 Dec 2014 CN
668583 Aug 1995 EP
0940960 Sep 1999 EP
0998091 May 2000 EP
1020804 Jul 2000 EP
0627728 Sep 2000 EP
1089516 Apr 2001 EP
0717337 Aug 2001 EP
1207694 May 2002 EP
0679977 Oct 2002 EP
0679978 Mar 2003 EP
0890924 Sep 2003 EP
1377902 Aug 2004 EP
0813132 Jan 2005 EP
1380133 Mar 2005 EP
1021021 Sep 2005 EP
0930584 Oct 2005 EP
0883087 Aug 2007 EP
1176828 Oct 2007 EP
1852829 Nov 2007 EP
2076888 Jul 2015 EP
2339938 Oct 2002 GB
2352154 Jul 2003 GB
H0759945 Mar 1995 JP
H07254072 Oct 1995 JP
H1198134 Apr 1999 JP
H11191097 Apr 1999 JP
11191097 Jul 1999 JP
3033956 Apr 2000 JP
3124916 Jan 2001 JP
2001119403 Apr 2001 JP
3177221 Jun 2001 JP
2001204973 Jul 2001 JP
3199231 Aug 2001 JP
3210558 Sep 2001 JP
3275935 Feb 2002 JP
3361745 Jan 2003 JP
3368188 Jan 2003 JP
2003061263 Feb 2003 JP
2003061263 Feb 2003 JP
3470955 Sep 2003 JP
3503774 Dec 2003 JP
3575598 Jul 2004 JP
3579823 Jul 2004 JP
3579154 Oct 2004 JP
3701773 Oct 2005 JP
3777161 Mar 2006 JP
3914430 Feb 2007 JP
3942090 Apr 2007 JP
3962361 May 2007 JP
4009235 Sep 2007 JP
4225376 Dec 2008 JP
4653075 Dec 2010 JP
5063698 Aug 2012 JP
5352200 Nov 2013 JP
5734566 Jun 2015 JP
20020038229 May 2002 KR
20030039019 May 2003 KR
117864 Aug 2004 MY
55396 Dec 1998 SG
424213 Mar 2001 TW
527825 Apr 2003 TW
200836091 Sep 2008 TW
200937926 Sep 2009 TW
201002013 Jan 2010 TW
201009746 Mar 2010 TW
201024997 Jul 2010 TW
201028871 Aug 2010 TW
5159375 Mar 2013 TW
9504331 Feb 1995 WO
9642041 Dec 1996 WO
9900960 Jan 1999 WO
0137162 May 2001 WO
0201455 Jan 2002 WO
0203645 Jan 2002 WO
2002073457 Sep 2002 WO
20020087156 Oct 2002 WO
03049459 Jun 2003 WO
03058518 Jul 2003 WO
2004086212 Oct 2004 WO
2005079538 Sep 2005 WO
2007101785 Sep 2007 WO
2008037599 Apr 2008 WO
2008074627 Jun 2008 WO
2008095767 Aug 2008 WO
2009037257 Mar 2009 WO
2009104564 Aug 2009 WO
2010096738 Aug 2010 WO
Non-Patent Literature Citations (52)
Entry
[“What Are Virtual Environments”],IEEE Computer Graphics & Applications, Stephen R. Ellis, Jan. 1994.
[“Synchronous Writing Environment : Real-time interaction in cyberspace”], Journal of Adolescent & Adult Literacy, Oct. 1996.
Wi. Clement, “An Instructional robotics and machine Vision Laboratory,” IEEE Transactions on Education, pp. 87-90, 1994.
http://www.news.com.SpecialFeatrues/Continued/0,6,4804 4,00.html, “Billboards on the Infobahn,” pp. 1-2, May 23, 1997.
Kohda, Youji, et al., Ubiquitous advertising on the WWW. Merging advertisement on the browser, Computer Networks and IDSN Systems, 28, pp. 1493-1499 (1996).
Jacobson, J., “Collision avoidance in virtual environments,” 1997 IEEE Int. Conf. on SMC pp. 1704-1709.
Kormann et al., “Risks of the Passport Single Signon Protocol”&It; 9th Intl. WWW Conf., May 15, 2000.
Syverson, “Limitations on design principles for public key protocols”, Proc. of 1996 IEEE Symposium on Security and Privacy, pp. 62-72, May 6, 1996.
Abadi et al., “Prudent Engineering Practice for Cryptogrphic Protocols”, Proc. of 1994 IEEE Computer Society Symposium on Research in Security and Privacy, pp. 122-136, May 16, 1994.
Kautz, H., B. Selman, M. Shah.. “Referral Web: Combining Social Networks and Collaborative Filtering”. Communications of the ACM, vol. 40, No. 3, Mar. 1997.
Schwartz, M. F., D. C. M. Wood. “Discovering shared interests among people using graph analysis of global electronic mail traffic”. Department of Computer Science, University of Colorado, Boulder CO. Oct. 1992.
Wellman, B. “For a social network analysis of computer networks: a sociological perspective on collaborative work and virtual community”. Proceedings of the 1996 conference on ACM SIGCPR/SIGMIS. 1-11.
Qureshi, S. “Supporting electronic group processes: a social perspective”. Proceedings of the 1995 ACM SIGCPR Conference on Supporting teams, groups, and learning inside the IS function. ACM Press. 24-34.
Ackerman, M.S., B. Starr. “Social activity indicators: interface components for CSCW systems”. Proceedings of the 8th ACM Symposium on User Interface and Software Technology. ACM Press. 159-168, Nov. 14-17, 1995.
Garton, L., C. Haythornthwaite, B. Wellman. “Studying on-line social networks in Doing Internet Research”, Jun. 1997.
Srivastava, Jaidepp, Robert Cooley, Mukund Deshpande, Pang-Ning Tan. “Web Usage Mining: Discovery and Applications of Usage Patterns from Web Data”. SIGKDD Explorations, vol. 1, Issue 2. Jan. 2000. 12-23.
Wang, Y. “Web Mining and Knowledge Discovery of Usage Patterns”. CS748T Project (Part I) Feb. 2000.
Sack, W. “Conversation Map: a content-based Usenet newsgroup browser”. Proceedings of the 2000 International Conference on Intelligent User Interfaces. ACM Press. 233-240.
Feldman, R. “Mining unstructured data”. Tutorial notes for ACK SIGKDD 1999. AMC Press. 182-236.
Supplementary European Search from the European Patent Office for EP05723458.5, dated Jul. 19, 2010.
International Search Report as Published as WO2005/079538 in corresponding international application No. PCT/US2005/005550. dated Jul. 5, 2006.
Duong et al; “A dynamic load sharing algorithm for massivly multiplayer online games” published Sep. 28, 2003-Oct. 1, 2003.http://ieeexplore.ieee.org/iel5/8945/28322/01266179.pdf?tp=&arnumber-=1266179&isnumber=28322http://ieeexplore.ieee.org/xpl/absprintf.jsp?arnumb- er=1266179.
“A multi-server architecture for distributed virtual walkthrough” http://delivery.acm.org/10.1145/590000/585768/p163-ng.pdf?key1=585768&key-2=0554824911&coll=GUIDE&dl=GUIDE&CFID=41712537&CFTOKEN=50783297.
Mauve, M., Fischer, S., and Widmer, J. 2002. A generic proxy system for networked computer games. In Proceedings of the 1st Workshop on Network and System Support for Games (Braunschweig, Germany, Apr. 16-17, 2002). NetGames '02. ACM, New York, NY, 25-28. DOI= http://doi.acm.org/10.1145/566500.566504.
IBM developer Works, OptimalGrid—autonomic computing on the Grid, James H. Kaufman; Tobin J. Lehman; Glenn Deen; and John Thomas, Jun. 2003.
IBM, Transcoding: Extending e-business to new environments, Britton et al., Sep. 22, 2000.
Lee et al., “A Self-Adjusting Data Distribution Mechanism for Multidimensional Load Balancing in Multiprocessor-Based Database Systems,” Information Systems vol. 19, No. 7, pp. 549-567, 1994.
Ma et al., “A Scalable Parallel Cell-Projection Volume Rendering Algorithm for Three-Dimensional Unstructured Data”, IEEE 1997, pp. 1-10.
Feng et al., “A Parallel Hierarchical Radiosity Algorithm for Complex Scenes,” Proceedings IEEE Symposium on Parallel Rendering (PRS) '97), IEEE Computer Society Technical Committee on Computer Graphics in cooperation with ACM SIGGRAPH pp. 71-79, 1997.
Hassen et al., “A Task-and Data-Parallel Programming Language Based on Shared Objects,” ACM Transactions on Programming Languages and Systems, vol. 20, No. 6, Nov. 1998, pp. 1131-1170.
Andert, “A Simulation of Dynamic Task Allocation in a Distributed Computer System,” Proceedings of the 1987 Winter Simulation Conference, 1987, pp. 1-9.
Jim X. Chen, Yonggao Yang, and Bowen Loftin, 2003, “MUVEES: a PC-based Multi-User Virtual Environment for Learning”, Proceedings of the IEEE Virtual Reality 2003 (VR '03), IEEE Computer Society, Washington, DC, USA, pp. 163-170.
Fernando, et al., “Cloning and teleporting avatars across workstations and mobile devices in collaborative virtual environments: Clipboard operations for virtual reality”, Proceedings ICIA'05: Int. Conf. on Information and Automation, Colombo, Sri Lanka, Dec. 15-18, 2005, pp. 133-140.
Anonymous; Window (computing); Download date: Jun. 3, 2007; Wikipedia; http://en.wikipedia.org/wiki/Window.sub.—(computing).
A. Newitz, “Your Second Life is ready,” Popular Science, Oct. 2006, 4 pages: http://www.popsci.com/popsci/technology/7balaf8f3812d010vgnvcm1000-004eecbccdrcrd.html.
Judson et al., “Virtual Venue Management Users Guide”, Argonne National Laboratory, Mathematics and Computer Science Division, Technical Memorandum No. 287, Feb. 2006, 19 pages, downloaded from: http://scholar.google.com/scholar?cluster=14486023041208461039&hl=en&as.s- ub.--sdt=80000000000000.
Stardock.com; The User Guide—Version 2; DesktopX, 2000; 52 pages.
Wang; SmartCU3D: a collaborative virtual environment system with behavior based interaction management; Proceedings of the ACM Symposium on Virtual Reality Software and Tech; VRST '01, Nov. 15-17, 2001, pp. 25-32.
Celentano; Adaptive interaction in Web3D virtual worlds; Proceedings of the Ninth International Conference on 3D Web Technology; Apr. 2004; pp. 41-50.
Chittaro; Dynamic generation of personalized VRML content; Proceedings of the Seventh International Conference on 3D Web Technology; Feb. 2002; pp. 145-154.
Elvins, T. T., Nadeau, D. R., Schul, R., and Kirsh, D., “Worldlets: 3D thumbnails for 3D browsing”, Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, Apr. 18-23, 1998, Conference on Human Factors in Computing Systems. ACM Press/Addison-Wesley Publishing Co., New York, NY, 163-170.
Elvins; Worldlets-3D Thumbnails for Wayfinding in virtual environments;Proceedings of the 10th Annual ACM Symposium on User Interface Software and; Oct. 1997; pp. 21-30.
Elvins, T.T., et al; Wordlets: 3D thumbnails for 3D browsing; Proceedings of the SIGCHI Conference on Human Factors in Computing systems; Apr. 18-23, 1998; ACM Press/Addison-Wesley Publishing Co., NY, NY; pp. 163-170.
Amund Tveit; Customizing Cyberspace: Methods for User Representation and Prediction; Thesis, Department of Computer Science, Norwegian University of Science and Technology; Trondheim, Norway; Jul. 1, 2004; 187 pages.
Grammenos, D., Filou, M., Papadakos, P., and Stephanidis, C., “Virtual Prints: leaving trails in virtual environments”, Proceedings of the Workshop on Virtual Environments 2002, May 30-31, 2002, W. Sturzlinger and S. Muller, Eds., ACM International Conference Proceeding Series, vol. 23. Eurographics Association, pp. 131-138, 222.
Stardock.com et al., “The User Guide-Version 2”, DesktopX, 2000, 57 pages.
Elvins, T. T., Nadeau, D. R., and Kirsh, D. 1997. Worldlets-3D thumbnails for wayfinding in virtual environments. In Proceedings of the 10th Annual ACM Symposium on User interface Software and Technology (Banff, Alberta, Canada, Oct. 14-17, 1997). UIST '97. ACM, New York, NY, 21-30.
Wang, W., Lin, Q., Ng, J. M., and Low, C. P. 2001. SmartCU3D: a collaborative virtual environment system with behavior based interaction management. In Proceedings of the ACM Symposium on Virtual Reality Software and Technology (Baniff, Alberta, Canada, Nov. 15-17, 2001). VRST '01. ACM, New York, NY, 25-32.
PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration dated Mar. 23, 2009.
Bares, William H., et al., “Habitable 3D Learning Environments for Situated Learning”, ITS-98: Proceedings of the Fourth International Conference on Intelligent Tutoring Systems, San Antonio, Texas, (1998),76-85.
Bares, William H., “Realtime Generation of Customized 3D Animated Explanations for Knowledge-Based Learning Environments”, AAAI-97: Proceedings of the Fourtheenth National Conference on Artificial Intelligence, Providence,Rhode Island, (1997),347-354.
Trefftz, Helmuth, et al., “Local and Global Impact of Message Caching in Shared Virtual Environments” Proceedings of the IASTED International Conference on Computer Graphics and Imaging 2000 (CGIM 2000), Las Vegas, NV, Nov. 20, 2000, pp. 8-13.
Related Publications (1)
Number Date Country
20160164769 A1 Jun 2016 US
Continuations (2)
Number Date Country
Parent 13341255 Dec 2011 US
Child 14875270 US
Parent 11947829 Nov 2007 US
Child 13341255 US