bluuebunny/crossref_metadata_2025_split huggingface dataset:
Antioxidant activity of Potentilla fruticosa
Authors: Miliauskas Giedrius , van Beek Teris A , Venskutonis Petras R , Linssen Jozef P H , de Waard Pieter , Sudhölter Ernst JR 
Published: September 2004

AbstractThe molecular structures of the radical scavenging compounds present in extracts of Potentilla fruticosa blossoms were elucidated and the antioxidant activities of various extracts were determined. The activities of the different fractions were monitored by off‐line and on‐line RP‐HPLC DPPH• and ABTS•+ scavenging methods. Twelve compounds were isolated and identified, namely ellagic acid, catechin, quercetin‐3‐β‐glucopyranoside, quercetin‐3‐β‐galactopyranoside, quercetin‐3‐β‐rutinoside, quercetin‐3‐β‐glucuronopyranoside, quercetin‐3‐α‐arabinofuranoside, kaempferol‐3‐β‐rutinoside, kaempferol‐3‐O‐β‐(6″‐O‐(E)‐p‐coumaroyl)glucopyranoside, rhamnetin‐3‐β‐glucopyranoside and rhamnetin‐3‐β‐galactopyranoside. The radical scavenging activity of each isolated compound was measured using DPPH• and ABTS•+ assays and compared with the activity of rosmarinic acid. Catechin and ellagic acid were found to be the most active radical scavengers. The antioxidant properties of plant fractions were assessed in model systems by measuring superoxide anion and hydrogen peroxide scavenging, β‐carotene bleaching, hexanal production in edible oil, peroxide formation, and the increase in UV absorbance in the course of oxidation. Copyright © 2004 Society of Chemical Industry
Comparison of matrix‐free acceleration techniques in compressible Navier–Stokes calculations
Authors: Marques N. P. C. , Pereira J. C. F. 
Published: September 2004

AbstractSix different preconditioning methods to accelerate the convergence rate of Krylov‐subspace iterative methods are described, implemented and compared in the context of matrix‐free techniques. The acceleration techniques comprehend Krylov‐subspace iterative methods; invariant subspace‐based methods and matrix approximations: Jacobi, LU‐SGS, Deflated GMRES; Augmented GMRES; polynomial preconditioner and FGMRES/Krylov.The relative behaviour of the methods is explained in terms of the spectral properties of the resulting iterative matrix. The employed code uses a Newton–Krylov approach to iteratively solve the Euler or Navier–Stokes equations, for a supersonic ramp or a viscous compressible double‐throat flow. The linear system approximate solver is the GMRES method, in either the restarted or FGMRES variants. The results show the better performance of the methods that approximate the iterative matrix, such as Jacobi, LU‐SGS and FGMRES/Krylov. Copyright © 2004 John Wiley & Sons, Ltd.
Central‐upwind schemes on triangular grids for hyperbolic systems of conservation laws
Authors: Kurganov Alexander , Petrova Guergana 
Published: September 2004

AbstractWe present a family of central‐upwind schemes on general triangular grids for solving two‐dimensional systems of conservation laws. The new schemes enjoy the main advantages of the Godunov‐type central schemes—simplicity, universality, and robustness and can be applied to problems with complicated geometries. The “triangular” central‐upwind schemes are based on the use of the directional local speeds of propagation and are a generalization of the central‐upwind schemes on rectangular grids, recently introduced in Kurganov et al. [SIAM J Sci Comput 23 (2001), 707–740]. We test a second‐order version of the proposed scheme on various examples. The main purpose of the numerical experiments is to demonstrate the potential of our method. The more universal “triangular” central‐upwind schemes provide the same high accuracy and resolution as the original, “rectangular” ones, and at the same time, they can be used to solve hyperbolic systems of conservation laws on complicated domains, where the implementation of triangular or mixed grids is advantageous. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005
Operational performance of grid‐connected PV systems on buildings in Germany
Authors: Jahn Ulrike , Nasse Wolfgang 
Published: September 2004

AbstractThis paper presents operational performance results of grid‐connected PV systems in Germany, as collected and elaborated for the Photovoltaic Power Systems Programme (PVPS) of the International Energy Agency (IEA). Performance ratios obtained from 235 PV installations in Germany and from 133 PV plants in other countries are compared and discussed. For Germany, a significant rise in PV system performance and reliability was observed for new PV installations due to higher component efficiencies (e.g., inverter) and increased availabilities.There is a lack of long‐term experience in performance and reliability of PV systems, owing to the absence of monitoring programmes. As an outcome of IEA PVPS collaborative work, Task 2 provides reliable and worldwide monitoring performance data and results (www.task2.org). Technical and operational data is available for system planning and comparison, for teaching and training purposes as well as for future developments of financing schemes (e.g., feed‐in‐tariffs) in order to stimulate the PV market. Copyright © 2004 John Wiley & Sons, Ltd.
Photovoltaics in an architectural context
Authors: Kaan Henk , Reijenga Tjerk 
Published: September 2004

AbstractIn well‐populated areas, such as western Europe, PV is often integrated into the building envelope. Despite the fact that there are many examples showing that PV can be an aesthetically neutral or visually attractive element in architecture, many BIPV systems display few architectural qualities. But if well applied, PV can increase a building's character and value. Within Task 7 of the IEA PVPS programme a team of experts with an architectural background studied which key requirements needed to be complied with (design criteria for good‐quality PV projects) in order to produce successful PV integration. These criteria are discussed in the article.PV is not automatically considered an indispensable material in architectural terms. This is why, no matter how well it is integrated, PV remains an ‘added’ element. Architects can take this as their starting point and can use one of the design approaches that are presented in the article. These criteria for incorporating PV in the building design and the design criteria for good‐quality PV projects are important to architects and architectural critics in determining why a BIPV project, be it their own design or that of a colleague, is or is not aesthetically pleasing. This offers learning opportunities and reasons for follow‐up or improvement options. Architects who apply PV in a well‐thought‐out way can make their clients very happy, and thereby contribute to a greater acceptance of PV technology. Copyright © 2004 John Wiley & Sons, Ltd.
Electrotechnical requirements for PV on buildings
Authors: van Zolingen Ronald J. C. 
Published: September 2004

AbstractWorld‐wide the number of grid‐connected PV systems is growing fast, especially in the built environment. In order to assure the quality and energy output of these systems, a number of electrotechnical requirements need to be fulfilled, at both component and system levels. In addition requirements with respect to electrical safety need to be met. Part of these requirements are covered by international standards, especially with respect to the PV modules. A number of standards is still under development. In the area of systems and utility interfacing local codes are still in use. These local codes differ significantly from country to country. Copyright © 2004 John Wiley & Sons, Ltd.
Progress in markets for grid‐connected PV systems in the built environment
Authors: Haas Reinhard 
Published: September 2004

AbstractIn the last decade of the 20th century a wide variety of promotion strategies increased the market penetration of small grid‐connected PV systems world‐wide. The objective of this paper is to assess the impact of these promotion strategies on the market for and on the economic performance of small grid‐connected PV systems. The most important conclusions of this analysis are:Pure cost‐effectiveness is not crucial for private customers. Affordability is rather what counts.Non‐monetary issues play an important role for a substantial increase in market deployment.Comprehensive accompanied information and education activities are also important along with financial incentives.There are still considerable barriers in the market: on the one hand transparent and competitive markets exist in only a few countries; on the other hand non‐monetary transaction costs still represent a major barrier.Progress with respect to cost reduction has been achieved, but mainly for non‐module components. Copyright © 2004 John Wiley & Sons, Ltd.
Field experience with large‐scale implementation of domestic PV systems and with large PV systems on buildings in Japan
Authors: Otani Kenji , Kato Kazuhiko , Takashima Takumi , Yamaguchi Tetsuo , Sakuta Koichi 
Published: September 2004

AbstractUnder the auspices of the New Sunshine Program and continuous R&D programs by the New Energy Development and Industrial Technology Organization (NEDO), the authors have been implementing a measurement and evaluation program for photovoltaic (PV) systems since the fiscal year 1997. In this program, a total of 100 residential PV systems, equipped with special data acquisition systems, have been set up over seven years. The purpose of this study was to clarify the operating performance of the grid‐connected PV systems on the rooftops of residential houses in Japan and to develop a simulation methodology in order to estimate the electricity generation and costs in the actual housing environment. The validity of the simulation methodology was assessed by using the actually monitored data from some hundreds residential PV systems. Simulation results were also used to optimize the PV system design as well as to diagnose their operating conditions. The mean value of the final annual yield was around 1000 h; 975 h in 2000, 982 h in 2001 and 975 h in 2002, and the mean value of the performance ratio was over 70%; 73·3% in 2000, 71·8% in 2001 and 72·5% in 2001. Copyright © 2004 John Wiley & Sons, Ltd.
Examples of successful architectural integration of PV: Japan
Authors: Ohno Jiro 
Published: September 2004

AbstractBy the end of 2002 more than 1300 MWp of photovoltaic power was installed in industrialized countries worldwide. Of this, approximately 640 MWp, or 48%, is installed in Japan, mainly on buildings. This makes Japan the most prominent country in the field of building‐integrated photovoltaics (BIPV). The interest in integration of PV among Japanese architects has increased accordingly, which has resulted in many sophisticated and innovative designs. This short communication introduces four examples of successful architectural integration from different fields.The Japanese government aims at an installed PV capacity of 4820 MWp in 2010. In parallel, the Japanese PV industry needs to develop into a strong sector which is able to operate without direct market support. The role of architects in this process should not only be to increase the volume of building integrated PV, but also to make comprehensive, integral designs, which include sunlight shading, thermal insulation, energy saving, passive use of solar energy, and obviously also photovoltaics. Furthermore, architects could make an important contribution to establishing a new, sustainable urban environment in which BIPV is used on a large scale as a distributed source of energy. This fits well within the new international effort in the framework of the International Energy Agency (IEA), Photovoltaic Power Systems (PVPS), Task 10. Copyright © 2004 John Wiley & Sons, Ltd.
A support system for software function discovery using histories of function executions
Authors: Morisaki Shuuji , Shiraishi Yumi , Yamato Masatake , Monden Akito , Matsumoto Ken‐ichi , Torii Koji 
Published: September 2004

AbstractThe majority of current application software packages have an extremely large number of functions because of the many different users envisioned for the software. This means that it is not easy for users to find useful functions. In this paper, the authors propose a system that supports the discovery of useful functions for users by allowing for shared referencing of function execution histories among users with similar uses for the software. The proposed system gathers a wide range of function execution histories over a long period of time, efficiently processes them, and then displays in a format that is easy to understand candidate functions that are unknown and useful to the user. The results of evaluation experiments using Microsoft Word 2000 and PowerPoint 2000 showed that an average of 63.7 functions were displayed as useful candidate functions to a total of nine subjects, with an average of 16.1 of them being unknown functions. In addition, the percentage of functions that users said were actually useful among the unknown functions discovered was 39.2% on average for Word and 46.3% on average for PowerPoint. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(12): 93–106, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10024
Application of genetic algorithm to flight schedule planning
Authors: Adachi Nobue , Sato Makihiko , Kobayashi Shigenobu 
Published: September 2004

AbstractThe authors developed a system that automatically creates regular aircraft flight schedules and minimizes the total number of aircraft required. Since the target problems are real‐world problems having constraints that are intertwined in a complex manner, the authors used a genetic algorithm to achieve the optimization. In this paper, the authors describe the problem setup and genetic algorithm configuration and verify the algorithm's effectiveness through experiments using real data. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(12): 83–92, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10036
Spoken dialogue processing method using inductive learning with genetic algorithm
Authors: Kimura Yasutomo , Araki Kenji , Momouchi Yoshio , Tochinai Koji 
Published: September 2004

AbstractThis paper describes a spoken dialogue processing, which includes the learning using spoken dialogue examples. Most of the spoken dialogue systems up to the present are task‐oriented, where the processing is based on the prespecified generation rules and database. It is then difficult to handle various topics, such as miscellaneous talks in daily dialogue. In the proposed method, the dialogue between the system and the user is processed as the spoken dialogue example, and the rule is acquired based on the pair of system response and user utterance, through inductive learning using the genetic algorithm. In other words, it is not necessary to prepare the training data beforehand, but the response is composed using the rules acquired from the actual dialogue examples. With this approach, the learning can be executed based on the dynamic data, and the deviation depending on the data is reduced. It is intended in this paper to examine the usefulness of the proposed method. Miscellaneous talks are considered. ELIZA‐type system, which is extended to the spoken dialogue, and the proposed method are compared through a comparison experiment and an experiment with multiple examinees. As a result, it is verified that the total ratio of the correct and almost correct responses is improved from 66.3% to 76.1%, and the effective responses can be constructed using the rules acquired from actual dialogue examples. This improvement of 9.8 points indicates that the proposed method is effective in handling miscellaneous talks. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(12): 67–82, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10204
Air transportation planning using neural networks as an example of the transportation squadron in the Japan Air Self‐Defense Force
Authors: Kurokawa Takakazu , Takeshita Ken 
Published: September 2004

AbstractThe task of a squadron at the Japan Air Self‐Defense Force (JASDF) is to transport personnel and materials, and the efficient operation of the squadron is a crucial issue in an emergency. However, transportation is planned manually at present, and it is difficult to quickly formulate an efficient plan. In this context, air transportation planning is considered a transport problem, and an air transportation planning method using a mutually coupled neural network composed of binary neurons, while considering the hardware implementation, is proposed. In the proposed neural network, air transportation planning is partitioned into three subproblems, which are successively solved by three neuron blocks. By this provision, the scale of the problem is reduced and the solution is derived efficiently. Several practical problems with various numbers of aircraft and transportation demands are considered, and simulations are performed using the neural network with various parameters. An examination of the results reveals that the proposed neural network is able to determine whether the air transportation planning can be performed with high speed and high accuracy. In other words, the proposed method is an efficient solution method with many advantages. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(12): 46–56, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10419
Generating derangements by interchanging at most four elements
Authors: Mikawa Kenji , Semba Ichiro 
Published: September 2004

AbstractFor the set S = {1,2,…,n}, a permutation π:S → S such that π(i)≠i is called a complete permutation, and the string π(1)π(2)…π(n) is called a derangement. In this paper, the authors consider the generation of a list that contains one instance of every derangement. Sequential generation, which sequentially generates a string by interchanging characters in the string, can generate the list more efficiently when fewer characters are interchanged. If 𝒫(S) denotes the list of derangements and deg(𝒫(S)) denotes the maximum value of the numbers of characters that are interchanged, no list of derangements such that deg(𝒫(S)) = O(1) is known as of today. In this paper, the authors notice that a derangement can be decomposed into mutually disjoint cycles to show that there exists no list of derangements such that deg(𝒫(S)) = 2. Also, in the second half of this paper, they consider an algorithm for generating a list for which deg(𝒫(S)) = 4 for |S|≥4. According to this algorithm, the average number of characters that are interchanged is roughly 2.980. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(12): 25–31, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10531
On the statistical properties of least‐square estimators of layered neural networks
Authors: Kitahara Masashi , Hayasaka Taichi , Toda Naohiro , Usui Shiro 
Published: September 2004

AbstractThere are still some statistical properties which have not been clarified in the regression model based on the three‐layered neural network. This paper presents an analysis of these problems, in terms of the probability distribution of the parameter estimators. It is first shown numerically that the least‐square estimator for the condition in which the probability distribution for the parameter estimator has not been clearly described follows a distribution which is different from the probability distribution derived in the past for various conditions. Based on the result, a theoretical analysis is presented for the simplified regression model, and it is shown that the least‐square parameter estimator follows the double‐exponential distribution. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(12): 1–9, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10580
Leaf trenching by Indian red admiral caterpillars for feeding and shelter construction
Authors: Ide Jun‐Ya 
Published: September 2004

AbstractMany folivorous insects sever leaf veins, trench across leaf blades, or girdle petioles prior to feeding on leaves. The purpose of these behaviours is generally thought to be sabotage of the anti‐herbivore chemical defences of host plants. For insects that construct leaf shelters, these behaviours may make leaves easier to roll or fold. Larvae of the Indian red admiral butterfly, Vanessa indica (Herbst), cut trenches at the base of host plant leaves and construct leaf‐fold shelters. I attempted to determine which of the above functions the trenching behaviour of V. indica larvae serves. If the function of trenching is to facilitate leaf‐folding, then larvae should cut trenches before folding leaves. When the larvae used larger leaves, they tended to trench them prior to folding them. This suggests that the function of trenching behaviour is to make leaves easier to fold. However, larvae sometimes cut trenches after folding the leaves, suggesting that this behaviour has additional functions. When the larvae were about to moult or pupate, they did not cut trenches, suggesting that trenching behaviour may also be involved in feeding.
Harnack type estimates for nonlinear elliptic systems and applications
Authors: Busca Jérôme , Sirakov Boyan 
Published: September 2004

In this paper we obtain a generalised maximum principle of Alexandrov–Bakelman–Pucci type for viscosity solutions of fully nonlinear cooperative elliptic systems. We also establish a Harnack estimate for such systems and give some applications. In particular, a Harnack type estimate for solutions of higher order equations is given.

Résumé
Dans cet article nous obtenons un principe de maximum généralisé de type Alexandrov–Bakelman–Pucci pour les solutions de viscosité de systèmes elliptiques coopératifs complètement non-linéaires. Nous établissons une inégalité de Harnack pour ce type de systèmes et présentons quelques applications. En particulier, nous obtenons une inégalité de type Harnack pour les solutions d’équations polyharmoniques.
Multiplicity of positive solutions for an indefinite superlinear elliptic problem on RN
Authors: Du Yihong 
Published: September 2004

We consider the elliptic problem

−Δu−λu=a(x)u^p

, with

p>1

and

a(x)

sign-changing. Under suitable conditions on

p

and

a(x)

, we extend the multiplicity, existence and nonexistence results known to hold for this equation on a bounded domain (with standard homogeneous boundary conditions) to the case that the bounded domain is replaced by the entire space

R^N

. More precisely, we show that there exists

Λ>0

such that this equation on

R^N

has no positive solution for

λ>Λ

, at least two positive solutions for

λ\in (0,Λ)

, and at least one positive solution for

λ\in (−∞,0]∪\{Λ\}

.

Résumé

On considère le problème elliptique

−Δu−λu=a(x)u^p

, où

p>1

et

a(x)

change le signe. Sous des conditions adéquates sur

p

et

a(x)

, nous étendons les résultats connus sur la multiplicité, l’existence et la non-existence de cette équation sur un domaine borné (avec des conditions aux limites homogènes naturelles) où le domaine borné est remplacé par l’espace tout entier. Plus précisement, nous montrons qu’il existe

Λ>0

tel que cette équation dans

R^N

n’a aucune solution positive pour

λ>Λ

, au moins deux solutions positives pour

λ\in (0,Λ)

, et au moins une solution positive pour

λ\in (−∞,0]∪\{Λ\}

.