Abstract: One aspect of the invention provides a method for implementing a colonial relationship in a multiplayer online game. The method includes: receiving instructions from a first entity to attack a second entity; determining whether the first entity's attack is successful; and if the first entity's attack is successful, establishing a colonial relationship between the second entity and the first entity, wherein a portion of production of the second entity is transferred to the first entity.

Abstract: One aspect of the invention provides a method of awarding items in a multiplayer online game. The method includes: presenting a primary award interface to a first user, the award interface configured to implement a primary award algorithm that determines whether the first user will receive an item and, if so, informs the first user of the award; and informing other users of the award to the first user. Another aspect of the invention provides a system awarding items in a multiplayer online game. The system includes a presentation module configured to present an award interface to a first user, the award interface configured implement a primary award algorithm that determines whether the first user will receive an item and, if so, informs the first user of the award; and a notification module configured to inform other users of the award to the first user.

Abstract: One aspect of the invention provides a method of increasing interest in a massively multiplayer online game. The method includes providing the massively multiplayer online game on each of a plurality of shards and associating a list of accomplishments with each of the plurality of shards. Another aspect of the invention provides a computer program product comprising computer-usable medium having control logic stored therein for causing a computer to implement a method of increasing interest in a massively multiplayer online game. The control logic includes: first computer readable program code for causing the computer to provide the massively multiplayer online game on each of a plurality of shards and second computer readable program code for causing the computer to associate a list of accomplishments with each of the plurality of shards.

Abstract: A deadlock detection method and computer system for parallel programs. A determination is made that a lock of the parallel programs is no longer used in a running procedure of the parallel programs. A node corresponding to the lock that is no longer used, and edges relating to the lock that is no longer used, are deleted from a lock graph corresponding to the running procedure of the parallel programs in order to acquire an updated lock graph. The lock graph is constructed according to a lock operation of the parallel programs. Deadlock detection is then performed on the updated lock graph.

Abstract: A universal motor has a stator and a rotor installed in the stator. The stator comprises a pair of stator segments. Each segment has a yoke with first and second ends, a pole and a neck connecting the pole to the first end of the yoke. The second end of each yoke is connected with the first end of the other yoke. A pair of pre-formed windings are mounted on respective poles of the stator segments.

Abstract: System(s), method(s), and computer program product(s) for collecting program runtime information are provided. In one aspect, this comprises: an instrumentation module for inserting, by program instrumentation, monitoring code into the constructor of an exception class in a program to run; and a monitoring module implemented by said monitoring code, the monitoring module for collecting program runtime information during the running process of the program. In another aspect, this comprises: obtaining verification point variables from assertions for a program to be tested; inserting monitoring code into positions in the program that access the obtained verification point variables; and as the program runs, collecting runtime information of the program by the inserted monitoring code.

Abstract: A method and/or system for detecting deadlock, comprising: obtaining lock information related to locking operation in a program; generating a first lock graph based on the obtained lock information, wherein each node in the first lock graph comprises a set of locks comprising at least one lock and a set of program locations comprising at least one lock location; extracting a strongly connected sub graph in the first lock graph; unfolding the strongly connected sub graph in the first lock graph to generate a second lock graph, wherein each node in the second lock graph comprises a single lock; and extracting a strongly connected sub graph in the second lock graph, the strongly connected sub graph in the second lock graph indicating a deadlock in the program.

Abstract: Web services are automatically generated from corresponding Web applications under service-oriented architecture. A Web service is generated based on a Web application, comprising: obtaining user input information of the Web application, obtaining call stack information that is generated by the Web application at runtime based on the user input information, performing parameter matching between the user input information and the call stack information, selecting a method from the call stack information as an application programming interface based on a result of the parameter matching and the call stack information, and generating the Web service using the application programming interface.

Abstract: A method, computer program product and apparatus for indicating program modifications affecting program performance in an Integrated Development Environment (IDE). The modifications that a developer makes to a program is detected and the code location where these modifications occur is determined. The previous profiling data of the program is acquired. The effect of the modifications on the program performance according to the previous profiling data and the code location where the modifications occur is evaluated. The evaluation results may then be provided to the developer. As a result of the above process, the developer can be aware of the performance problem while he/she is editing the source code so as to make corrections without waiting after the profiling phase, thus greatly shortening the development period.

Abstract: The present invention relates to viral interleukin-6 (v-IL-6), which can be obtained by recombinant expression of the DNA of human herpesvirus type 8 (HHV-8), and which may be used in diagnosis and treatment of human diseases such as kaposi sarcoma, Castleman's disease, multiple myeloma, kidney cell carcinoma, mesangial proliferative glomerulonephritis or B cell lymphoma.

Abstract: Dynamic help information is provided by receiving unit, configured to receive at least one operation of a user and to obtain the user's operation history, where the operation history includes at least one operation; a determining unit, configured to determine the corresponding help information according to the user's operation history; and an information obtaining unit, configured to obtain said corresponding help information. Assistance in providing help information is also provided, comprising: an operation capturing unit, configured to capture and send at least one operation of a user; and an information displaying unit, configured to receive and display the help information corresponding to the user's operation history, where the operation history includes at least one operation. With the apparatuses and method of this invention, the pertinent help information can be dynamically provided for users according to user's operation history.

Abstract: System(s), method(s), and computer program product(s) for collecting program runtime information are provided. In one aspect, this comprises: an instrumentation module for inserting, by program instrumentation, monitoring code into the constructor of an exception class in a program to run; and a monitoring module implemented by said monitoring code, the monitoring module for collecting program runtime information during the running process of the program. In another aspect, this comprises: obtaining verification point variables from assertions for a program to be tested; inserting monitoring code into positions in the program that access the obtained verification point variables; and as the program runs, collecting runtime information of the program by the inserted monitoring code.

Abstract: A method and system of deadlock detection in a parallel program, the method comprising: recording lock events during the operation of the parallel program and a first order relation among the lock events; converting information relevant to the operation of the parallel program into gate lock events and recording the gate lock events; establishing a second order relation among the gate lock events and lock events associated with the gate lock events and adding the second order relation to the first order relation; constructing a lock graph corresponding to the operation procedure of the parallel program based on the added first order relation; and performing deadlock detection on the constructed lock graph. The deadlock detection method of the invention can improve the accuracy of deadlock detection without depending on the deadlock detection algorithm per se, and can be applied with facility to various development environments and reduce development costs.

Abstract: A method and system for facilitating runtime memory analysis. The method includes: assigning a unique ID for each task in a running program; recording memory access events occurring during the running program, including the IDs of the task performing the memory accesses; issuing a task termination notification in response to a task terminating, the task termination notification including the ID of the terminating task; and releasing all the memory access events having the ID of the terminating task in the memory, in response to the task termination notification. This method and system can ensure that the memory access events stored in the memory will not increase unlimitedly, so that the memory overhead is reduced remarkably and dynamic memory analysis can be faster and more efficient.

Abstract: A deadlock detection method and computer system for parallel programs. A determination is made that a lock of the parallel programs is no longer used in a running procedure of the parallel programs. A node corresponding to the lock that is no longer used, and edges relating to the lock that is no longer used, are deleted from a lock graph corresponding to the running procedure of the parallel programs in order to acquire an updated lock graph. The lock graph is constructed according to a lock operation of the parallel programs. Deadlock detection is then performed on the updated lock graph.

Abstract: Multilayer optical films having one or more reflection bands are provided. The films include alternating polymeric layers configured to selectively reflect and transmit visible light at a design angle of incidence, where the selective reflection includes first and second visible reflection bands. At least one of the first and second visible reflection bands is a first-order reflection.

Abstract: A universal motor has a stator and a rotor installed in the stator. The stator comprises a pair of stator segments. Each segment has a yoke with first and second ends, a pole and a neck connecting the pole to the first end of the yoke. The second end of each yoke is connected with the first end of the other yoke. A pair of pre-formed windings are mounted on respective poles of the stator segments.

Abstract: The present invention provides a method and system for processing memory access events.

Abstract: A method of accessing a shared data structure in parallel by multiple threads in a parallel application program is disclosed, in which a lock of the shared data structure is granted to one thread of the multiple threads, an operation of the thread which acquires the lock is performed on the shared data structure, then an operation of each thread of the multiple threads which does not acquire the lock is buffered, and finally the buffered operations are performed on the shared data structure when another thread of the multiple threads subsequently acquires the lock. By using this method, the operations of other threads which do not acquire the lock of the shared data structure can be buffered automatically when the shared data structure is locked by one thread, and all the buffered operations can be performed when another thread acquires the lock.

Abstract: Multilayer optical films having one or more reflection bands are provided. The films include alternating polymeric layers configured to selectively reflect and transmit visible light at a design angle of incidence, where the selective reflection includes first and second visible reflection bands. At least one of the first and second visible reflection bands is a first-order reflection.