Abstract: A material reducing apparatus may be provided. The material reducing apparatus may include a rotor structure for driving rotation of the rotary reducing component. The rotary reducing component includes a first set of reducing component elements and a second set of reducing component elements, each with distinct characteristics. The first set of reducing elements can be carried by the rotor structure within first mounting locations such that the first set of reducing elements is balanced as a set relative to the axis of rotation. The rotary reducing component further includes a second set of reducing elements carried by the rotor structure within second mounting locations such that the second set of reducing elements is balanced as a set relative to the axis of rotation. In certain examples, multiple sets of reducing elements may coexist within the rotary reducing component, each with distinct characteristics.

Abstract: A computer-implemented method for team battle matching in a computer game is provided. The method includes obtaining registration information and player number information for teams to participate in a team battle having two battle camps and creating a plurality of matching queues. The method also includes allocating teams having equal number of players to a same matching queue based on the player number information and selecting one team from a matching queue allocated with one or more teams having the maximum number of players. Further, the method includes determining whether a total number of players in the selected team is equal to a preset number and allocating the team to a battle camp when the total number of players of the selected team is equal to the preset number.

Abstract: Methods and systems for managing distributed storage servers are described. The storage servers may be selected and divided into multiple sequences and multiple virtual node groups. Each sequence of the multiple sequences may include a predetermined number of storage servers, and each virtual node group may include a set of storage servers of the multiple sequences. Data may be transferred to storage severs of a virtual node group. If the storage servers have instantaneous or temporary malfunctions, the data may be transferred to temporary storage servers and then transferred back the storage servers after being revived. If the storage servers have permanent malfunctions, the data may be transferred to the temporary storage servers. The storage servers may be replaced using the temporary storage servers.

Abstract: A computer-implemented method for team battle matching in a computer game is provided. The method includes obtaining registration information and player number information for teams to participate in a team battle having two battle camps and creating a plurality of matching queues. The method also includes allocating teams having equal number of players to a same matching queue based on the player number information and selecting one team from a matching queue allocated with one or more teams having the maximum number of players. Further, the method includes determining whether a total number of players in the selected team is equal to a preset number and allocating the team to a battle camp when the total number of players of the selected team is equal to the preset number.

Abstract: Implementing Web access includes finding a Web module and a Web module method associated with a client request. Based on a parameter declaration of the Web module method, a Web server obtains from a Web context request data that is used to invoke the Web module method. The Web server then stores in a Web context a return value and renders a displayed Web page based on the Web context. In some aspects, implementing Web access further includes analyzing the parameter declaration of the Web module methods and finding a data scope and a data item associated with the request data. In some aspects, implementing Web access further includes generating a Web module instance in response to determination that the instance does not exist.

Abstract: Implementing Web access includes finding a Web module and a Web module method associated with a client request. Based on a parameter declaration of the Web module method, a Web server obtains from a Web context request data that is used to invoke the Web module method. The Web server then stores in a Web context a return value and renders a displayed Web page based on the Web context. In some aspects, implementing Web access further includes analyzing the parameter declaration of the Web module methods and finding a data scope and a data item associated with the request data. In some aspects, implementing Web access further includes generating a Web module instance in response to determination that the instance does not exist.

Abstract: Methods and systems for managing distributed storage servers are described. The storage servers may be selected and divided into multiple sequences and multiple virtual node groups. Each sequence of the multiple sequences may include a predetermined number of storage servers, and each virtual node group may include a set of storage servers of the multiple sequences. Data may be transferred to storage severs of a virtual node group. If the storage servers have instantaneous or temporary malfunctions, the data may be transferred to temporary storage servers and then transferred back the storage servers after being revived. If the storage servers have permanent malfunctions, the data may be transferred to the temporary storage servers. The storage servers may be replaced using the temporary storage servers.