A note on kernel principal component regression

Kernel principal component regression (KPCR) was studied by Rosipal et al. [18, 19, 20], Hoegaerts et al. [7], and Jade et al. [8]. However, KPCR still encounters theoretical difficulties in the procedure for constructing KPCR and in the choice rule for the retained number of principal components. In this paper, we revise the method of KPCR to overcome the difficulties. The performance of the revised method is compared to linear regression, nonlinear regression based on Gompertz function, and nonparametric Nadaraya-Watson regression, and gives better results than those of the three methods

MECHANICAL EFFICIENCY OF ROWING FOR ELITE FEMALE ROWERS IN JAPAN

The purpose of this study was to determine the mechanical efficiensy of rowing-ergometer exercise and to evaluate it from rowing motion analysis

OUTER APPROXIMATION METHOD FOR THE MINIMUM MAXIMAL FLOW PROBLEM

Abstract The minimum maximal flow problem is the problem of minimizing the flow value on the set of maximal flows of a given network. The optimal value indicates how inefficiently the network can be utilized in the presence of some uncontrollability. After extending the gap function characterizing the set of maximal flows, we reformulate the problem as a D.C. optimization problem, and then propose an outer approximation algorithm. The algorithm, based on the idea of ε-optimal solution and local search technique, terminates after finitely many iterations with the optimal value of the problem

Ranking by Relational Power based on Digraphs

In this paper we examine the ranking for the case of many judges and manyobjects. We use a directed graph to determine the ranking of the objects. A measureis the function whose domain is the collection of all directed graphs and range is theset of real vectors of as many components as the number of nodes, and the componentsare called relational power. We proposed two measures and showed the validity of themeasures from two aspects: axiomatization and the Shapley value. We also showed thecharacter of measures by some numerical examples

AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES

In this paper we consider cooperative transferable utility games with limited communication structure, called graph games. Agents are able to cooperate only if they can communicate directly or indirectly with each other. For the class of acyclic graph games the average tree solution has recently been proposed. It was proven that the average tree solution is a core element if the game exhibits super-additivity. We show that the condition of super-additivity can be relaxed to a weaker condition, which admits for a natural interpretation. Moreover, we introduce the concept of subcore, which is a subset of the core, always contains the average tree solution, and therefore is a non-empty refinement of the core

Average Tree Solution and Core for Cooperative Games with Graph Structure

This paper considers cooperative transferable utility games with graph structure,called graph games. A graph structure restricts the set of possible coalitions of players, so thatplayers are able to cooperate only if they are connected in the graph. Recently the average treesolution has been proposed for arbitrary graph games by Herings et al. The average tree solutionis the average of some specific marginal contribution vectors, and was shown to belong to the coreif the game exhibits link-convexity. In this paper the main focus is placed on the relationshipbetween the core and the average tree solution, and the following results were obtained. Firstly,it was shown that some marginal contribution vectors do not belong to the core even though thegame is link-convex. Secondly, an alternative condition to link-convexity was given. Thirdly, itwas proven that for cycle-complete graph games the average tree solution is an element of thecore if the game is link-convex

On Optimization over the Efficient Set in Linear Multicriteria Programming

The efficient set of a linear multicriteria programming problem can be representedby a reverse convex constraint of the form g(z) ≤ 0, where g is a concavefunction. Consequently, the problem of optimizing some real function over the efficientset belongs to an important problem class of global optimization called reverseconvex programming. Since the concave function used in the literature is only definedon some set containing the feasible set of the underlying multicriteria programmingproblem, most global optimization techniques for handling this kind of reverse convexconstraint cannot be applied. The main purpose of our article is to present amethod for overcoming this disadvantage. We construct a concave function which isfinitely defined on the whole space and can be considered as an extension of the existingfunction. Different forms of the linear multicriteria programming problem arediscussed, including the minimum maximal flow problem as an example

FACTORS AFFECTING FREE THROWING

Every basketball player has an appetite to increase the free throw shooting performance. Sometimes the game depends upon their success shots. But it is difficult for basketball players to improve their own performance because, to do so, there are some factors such as good timing of muscle activity and mechanical efficiency. Especially relating to mechanical efficiency, it was investigated in various physical movements. As a result, previous study indicated that mechanical efficiency was an important index to "skill". However, it has not been reported about its improvement in conjunction with training. Therefore, the purpose of this study was to determine the mechanical efficiency of free throw shooting exercise in basketball, and assess the improvement of mechanical efficiency and performance through an eight week training program

Vaccination with Human Induced Pluripotent Stem Cells Creates an Antigen-Specific Immune Response Against HIV-1 gp160

Induced pluripotent stem cells (iPSCs) are artificially derived from somatic cells that have been transduced with defined reprogramming factors. A previous report has indicated the possibility of using iPSCs as an immune stimulator to generate antigen-specific immunity. In our current study, we have investigated whether human iPSCs (hiPSCs) have the ability to enhance specific immune response against a human immunodeficiency virus type 1 (HIV-1) antigen in a xenogenic mouse model. Our results show that BALB/c mice immunized with hiPSCs transduced with an adenoviral vector encoding HIV-1 gp160 exhibited prominent antigen-specific cellular immune responses. We further found that pre-treatment of hiPSCs with ionizing radiation promotes the secretion of pro-inflammatory cytokines such as interleukin-1 alpha (IL-1α), IL-12, and IL-18. These cytokines might promote the activation of antigen-presenting cells and the effective induction of cellular immunity. Our present findings thus demonstrate that a hiPSCs-based vaccine has the potential to generate cellular immunity against viral antigens such as HIV-1 gp160 in a xenogenic condition

A Kerato-Epithelin (βig-h3) Mutation in Lattice Corneal Dystrophy Type IIIA

This report covers phase 2 of the IWMI-Tata Water Policy Research Program (ITP) for the period 2006-2010. The major areas of action: Research focusing on water sector issues concerning underprivileged communities and backward regions in the country; Idea-incubation for livelihoods enhancement efforts using water as a central input, supporting the Trust in their water sector partnerships; Dissemination and raising public awareness; Widening the network of research partners; Policy influencing