bluuebunny/crossref_metadata_2025_split huggingface dataset:
Conformational investigation of α, β‐dehydropeptides. XI. Molecular and crystal structure of Ac‐(Z)‐ΔPhe‐NMe2 as compared to those of related molecules
Authors: Siodłak Dawid , Broda Małgorzata A. , Rzeszotarska Barbara , Dybała Izabela , Kozioł Anna E. 
Published: January 2003

AbstractA series of three homologous dimethyldiamides Ac‐(Z)‐ΔPhe‐NMe2, Ac‐L‐Phe‐NMe2 and Ac‐DL‐Phe‐NMe2 have been synthesized and their structures determined from single‐crystal X‐ray diffraction data. To learn more about the conformational preferences of the compounds studied, the fully relaxed ϕ, ψ conformational energy maps on the free molecules of Ac‐ΔAla‐NMe2 and Ac‐(Z)‐ΔPhe‐NMe2 were obtained with the HF/3‐21G method and the calculated minima re‐optimized with the DFT/B3LYP/6‐31G** method. The crystal state results have been compared with the literature data. The studied dimethyldiamide Ac‐ΔXaa‐NMe2 combines the double bond in positions α, β and the C‐terminal tertiary amide within one molecule. As the representative probe with ΔXaa = ΔAla, (Z)‐ΔLeu and (Z)‐ΔPhe shows, in the solid state they adopt the conservative conformation with ϕ, ψ∼ −45°, ∼130° and with a non‐planar tertiary amide bond, whatever the packing forces are. This conformation is located on the Ramachandran map in region H/F, which is of high‐energy for common amino acids, but not so readily accessible to them. The free molecule calculations on Ac‐ΔAla‐NMe2 and Ac‐(Z)‐ΔPhe‐NMe2 reveal that, in spite of dissimilar overall conformational profiles of these molecules, this structure is one of their low‐energy conformers and for Ac‐(Z)‐ΔPhe‐NMe2 it constitutes the global minimum. So, the theoretical results corroborate those experimental results proving that this structure is robust enough to avoid conformational distortion due to packing forces. In contrast to Ac‐ΔXaa‐NMe2, the saturated Ac‐L/DL‐Xaa‐NMe2 shows the constancy of the associative patterns but do not prefer any molecular structure in the solid state. Copyright © 2003 European Peptide Society and John Wiley & Sons, Ltd.
Diketopiperazines in peptide and combinatorial chemistry
Authors: Fischer Peter M. 
Published: January 2003

AbstractDiketopiperazines (DKPs), the smallest cyclic peptides, represent an important class of biologically active natural products and their research has been fundamental to many aspects of peptide chemistry. The advent of combinatorial chemistry has revived interest in DKPs for two reasons: firstly, they are simple heterocyclic scaffolds in which diversity can be introduced and stereochemically controlled at up to four positions; secondly, they can be prepared from readily available α‐amino acids using very robust chemistry. Here synthetic methods, conformation, as well as applications of DKPs are summarized and discussed critically. Copyright © 2003 European Peptide Society and John Wiley & Sons, Ltd.
A comparison of the performance of lightweight glass containers manufactured by the P&B and B&B processes
Authors: Jaime Sandra Balan Mendoza , Ortiz Sylvio Alves , Dantas Tiago Bassani , Damasceno Cristiano Ferreira 
Published: January 2003

AbstractThe mechanical performance of lightweight glass packages produced by the NNPB (narrow neck press and blow) process was evaluated by comparison with the same glass packages (regular weight) produced by the conventional process (blow and blow). The temper number (annealing process evaluation), thickness distribution behaviour and mechanical performance (impact, vertical load and thermal shock strength) were analysed before and after line simulation, applied in optimized conditions in the laboratory. The performance of lightweight glass packages under transport simulation (truck envelope) in relation to the regular weight bottles was also evaluated. Both bottles presented residual stress values within the specified limits. The lightweight glass bottles had a more homogenous thickness distribution in comparison with the regular weight bottles and a better performance (about 33% improvement) in relation to the impact strength, especially in the heel, even when evaluated after line simulation. As to the vertical load strength, the lightweight glass bottle also indicated a superior performance to the regular weight bottle, both before and after line simulation. Both bottles withstood the temperature difference of 42°C that such packages are supposed to resist according to thermal shock specification. Due to the better thickness distribution of lightweight glass packages, they withstood a maximum temperature difference (progressive thermal shock) of 5–10°C higher than the regular weight bottles. No restrictions of the lightweight glass packages submitted to the transport simulation were found. Copyright © 2002 John Wiley & Sons, Ltd.
The packaging technology and science of ancient transport amphoras
Authors: Twede Diana 
Published: January 2003

AbstractCommercial transport amphoras are large ceramic vessels that were used from 1500BCto 500ADto ship wine and other products throughout the Mediterranean. The most large‐scale use was to serve the ancient Greek and Roman empires. Although their form is much different from our own packages, the shape and design were clearly the result of the same reasoning that we use to design successful packaging today. They were designed to be economical to produce and ship. The unusual shapes, and especially the pointed base, facilitated handling, storage, transport and use in logistical systems that were very differently shaped from those that we use today. This paper investigates amphoras as a packaging system from a functional approach. It describes their protective physical properties, manufacturing process and industry structure, logistical and marketing advantages, and illustrates the value of such packaging artifacts in documenting the history of trade. Copyright © 2002 John Wiley & Sons, Ltd.
Implementing an applet system without fixing virtual‐machine designs
Authors: Itabashi Kazumasa , Matsubara Katsuya , Moriyama Yutaka , Someya Yuuichi , Kato Kazuhiko , Sekiguchi Tatsuro , Yonezawa Akinori 
Published: January 2003

AbstractAn applet is program code which is downloaded dynamically from a server on the World Wide Web and which can be executed while maintaining security on the client side. The majority of applet systems at present, as represented by the Java Applet, implement the applets using virtual machine code which is independent of computer architecture. This is advantageous in terms of installation and use in different machine environments. Because virtual machine code is associated with execution by an interpreter or conversion to native code, the design of the virtual machine code greatly impacts performance during execution. Normally, however, representation of virtual machine code is fixed for each applet system and cannot be altered. The authors focused on the independence of virtual machine code and implementing an applet execution environment which is independent of the design of virtual machine code by making the Just‐In‐Time (JIT) compiler which converts virtual machine code to native code mobile. In this approach, native code conversion modules which are appropriate for the virtual machine code being used in the applet description are downloaded dynamically. In addition, this applet execution environment provides monitoring functions during applet execution so that a native code applet generated from any virtual machine code can be executed safely. The applet execution monitoring mechanism allows for the programming of system control policies for users, and allows for flexible applet execution control for various levels of monitoring. In this paper, the authors describe an implementation using their newly designed virtual machine code representation in both the SPARC and Intel x86 architecture environments, as well as experiments using this implementation. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(2): 32–42, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10013
A measurement system for the behavior of children with developmental disorder using an omnidirectional camera
Authors: Suga Mikio , Taya Motonori , Minato Kotaro , Yamamura Kanako , Tomohisa Hisao , Komori Masaru 
Published: January 2003

AbstractIn the evaluation of children with developmental disorder, such as autism and learning disabilities (LD), an interview and behavior observation by a doctor or a clinical psychologist, as well as the hearing or behavior checklist completed by the parent or classroom teacher, are employed. Those, however, cannot be quantitative, and it is difficult to analyze in detail the long‐term observation or effectiveness of education or therapy. From such a viewpoint, it is desired to establish a method that can measure the behavior of the child on a more objective and quantitative basis. As a means of behavior measurement, the child may carry a transmitter or a marker, but a child with a developmental disorder often rejects an instrument that directly touches the body, which makes the application difficult. A wide‐angle camera may be employed, but its use is not simple, such as the need for calibration at the site of installation. In this study, a noncontact behavior measurement system is constructed, in which an omnidirectional camera with a hyperbolic mirror is used to determine the spatial position of the child in an objective and quantitative way. Using the constructed system, the behavior of the child with a developmental disorder is examined, and characteristic patterns are observed. It is concluded that the result of such a measurement can be a useful index in the evaluation of the observation of the course of the child with a developmental disorder, as well as in the evaluation of the effectiveness of education or therapy. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(2): 23–31, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10177
A compression method for color images using multilayered neural networks
Authors: Watanabe Eiji , Mori Katsumi 
Published: January 2003

AbstractMultilayered neural networks can obtain compressed representations for input patterns in the hidden layer, when output patterns are identical with input patterns. However, when color images have complex features, a single neural network model cannot compress them with sufficient accuracy. In this paper, a compression method for color images is proposed based on a group of multilayered neural networks, which can reduce the reconstructed error in stepwise fashion. Finally, the compression and decoding performances of the proposed method are discussed in detail. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(2): 13–22, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10208
Detection of vanishing point sequence with temporal fluctuation
Authors: Minagawa Akihiro , Kobayashi Yukihiko , Tagawa Norio , Tanaka Toshiyuki 
Published: January 2003

AbstractA method for detecting the vanishing point from sequential images is proposed. In existing methods, a method for detecting the vanishing point from a single image had been discussed. However, since sequential images are frequently used in environment recognition from images, it is important that the temporal fluctuation characteristics caused by camera vibration are considered. In this paper, we introduce such a temporal characteristic, and one vanishing point sequence is stably estimated based on both the temporal characteristic and the information on lines constructed from feature points as observed data. In our approach, the expectation‐maximization (EM) algorithm is used hierarchically, and both maximum a posteriori (MAP) estimation of the vanishing point sequence and line clustering for feature points are simultaneously performed. The saddle point approximation is used for convenience in calculating the expectation with respect to the posterior in the EM algorithm. Experiments in which autoregressive (AR) processing was applied to the temporal characteristics and 400 images were used confirmed that the error was effectively reduced in comparison with the conventional method for images with lower reliability of the observed data. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(2): 1–12, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10259
A development method of time‐triggered object‐oriented software for embedded control systems
Authors: Yokoyama Takanori , Naya Hidemitsu , Narisawa Fumio , Kuragaki Satoru , Nagaura Wataru , Imai Takaaki , Suzuki Shoji 
Published: January 2003

AbstractThis paper describes a time‐triggered object‐oriented model for embedded control systems and a control software development method based on that model. Conventional object‐oriented models had been based on event‐triggered actions. In contrast, we propose a time‐triggered object‐oriented model for real‐time control. This model, which consists of a set of objects for calculating data values required for control, activates these objects cyclically to implement time‐triggered actions. This paper also shows that a distributed control system having location transparency can be implemented efficiently according to this model. In addition, we propose a control software development method based on the proposed time‐triggered object‐oriented model. This development method can extract objects according to simple operations from control block diagrams used to describe control specifications. This paper also introduces an embedded system‐oriented implementation method that does not consume much resource and presents an application example in a distributed control system for automobiles. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(2): 43–54, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.1189
Contour extraction of left ventricular cavity from digital subtraction angiograms using a neural edge detector
Authors: Suzuki Kenji , Horiba Isao , Sugie Noboru , Nanki Michio 
Published: January 2003

AbstractIn this paper, a supervised edge detector based on a multilayer neural network, which is called a neural edge detector (NED), is proposed for detecting edges which coincide with edges traced by a human operator (e.g., a medical doctor). The NED is trained by use of the contours traced by a cardiologist. Using the trained NED, the contours coinciding well with the contours traced by a cardiologist are extracted from the left ventricular angiograms even with nonuniform contrast medium.The proposed contour extraction method consists of (1) detection of fine edges by the NED, (2) extraction of rough contours, and (3) contour tracing based on contour candidates synthesized from the rough contours and the edges detected by the NED. The contour of the left ventricle is automatically extracted by inputting two points manually. Experiments with clinical images show that the proposed method can stably extract the contours coinciding well with the contours traced by a cardiologist. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(2): 55–69, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.1190
Adaptive clustering using modular learning architecture
Authors: Suzuki Satoshi , Ueda Naonori 
Published: January 2003

AbstractWe present a clustering method for data that are continuously distributed within each class and where there is no overlap between the classes. With the method the data are clustered by on‐line processing, starting at a point where the number of classes is unknown. The proposed method uses ideas derived from statistical mechanics and applies them to a modular learning architecture: learning progresses by regarding the data as particles and regarding each module as a space in which the particles are distributed. The learning method estimates the energy state that matches the particle distribution. As a result of learning, continuously distributed data are clustered in the same module. At the same time, certain modules appear that contain no data. Consequently, the number of classes is estimated by defining each module containing data as a class. This paper describes the proposed method in detail and shows the results of clustering experiments undertaken using two‐dimensional artificial data and facial images. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(2): 70–80, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.1191
Strategy of high‐speed template matching and its optimization by using GA
Authors: Muramatsu Shoji , Otsuka Yuji , Kobayashi Yoshiki , Shimizu Eiji 
Published: January 2003

AbstractThe template matching technique is now applied to various image processing systems, and there is an increasing demand for applications of template matching based on the normalized correlation coefficient, which is robust to variations of illumination. In order to use techniques based on the normalized correlation coefficient in practical application problems, however, high‐speed calculation of the normalized correlation coefficient is required. The purpose of this paper is to increase speed by shrinking the image to be processed. However, stable template matching requires that the features of the image to be processed be retained in the shrunken image. For this purpose, the shrinkage ratio must be determined reasonably considering the properties of the template image as well as the search image. In order to set the shrinkage ratio effectively it is also necessary to preprocess the image so that the features are enhanced. In this study, the combination of the shrinkage ratio and preprocessing, which may depend on the individual image, is optimized by using a genetic algorithm. For evaluation, the proposed method is applied to a real system, and the effectiveness of the method is verified in terms of the practical processing speed and stability. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(2): 81–91, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.1192
Quantitative evaluation of print density uniformity using MTF fractal dimension
Authors: Nakamoto Jun , Yamashita Hiroshi , Kaneko Hiroshi 
Published: January 2003

AbstractThe unevenness of the density of a printed product which should ideally be even is evaluated by a printer's visual sense, and thus is affected by each printer's individual characteristics. There have been no quantitative standards for such an evaluation.This paper proposes to use the fractal dimension, which is originally an index representing the complexity of an object, for the quantitative evaluation of print density uniformity. It has been found that the modulation transfer function (MTF) fractal dimension produces results similar to those obtained by visual evaluation. It has also been found that the MTF fractal dimension with the visual spatial‐frequency characteristic (sensitivity of appearance) can emphasize the differences in print density uniformity. These findings will help in establishing the quantitative evaluation of print density uniformity. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(2): 92–99, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.1193
Speech recognition using recurrent neural prediction model
Authors: Uchiyama Toru , Takahashi Haruhisa 
Published: January 2003

AbstractThe neural prediction model (NPM) proposed by Iso and Watanabe is a successful example of a speech recognition neural network with a high recognition rate. This model uses multilayer perceptrons for pattern prediction (not for pattern recognition), and achieves a recognition rate as high as 99.8% for speaker‐independent isolated words. This paper proposes a recurrent neural prediction model (RNPM), and a recurrent network architecture for this model. The proposed model very significantly reduces the size of the network, with as high a recognition rate as the original model, and with a high efficiency of learning, for speaker‐independent isolated words. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(2): 100–107, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.1194
A comparative evaluation of generic programming in Java and C++
Authors: Saiedian Hossein , Hill Steve 
Published: January 2003

AbstractGeneric programming has been defined as ‘programming with concepts’ where a concept refers to a family of abstractions. The criteria for generic programming include independence of collections from data types, independence of algorithms that operate on the collection, and the adaptability of the collections. This paper examines and evaluates the support for generic programming in the Java Development Kit (JDK) in comparison to C++'s Standard Template Library (STL). The evaluation will consider both the ‘qualitative’ factors as well as certain ‘quantitative’ factors (i.e. factors that can be measured). The qualitative factors that are considered include: 1. a comparison of the structure and APIs; 2. homogeneity versus heterogeneity; and 3. ease of use (including ease of converting to collection classes, ease of changing collection type, and ease of error handling).The quantitative factors include: 1. compiled size; 2. runtime memory usage; and 3. performance. The results of our evaluative comparisons based on the above factors and certain other criteria are presented at the end. Based on the results, we conclude that the support provided for generic programming in C++'s STL is superior to that provided by JDK. Copyright © 2003 John Wiley & Sons, Ltd.
DrawCAD: using deductive object‐relational databases in CAD
Authors: Liu Mengchi 
Published: January 2003

AbstractComputer‐aided design (CAD) involves the use of computers in the various stages of engineering design. CAD has large volumes of data with complex structures that need to be stored and managed effectively and properly. Database systems provide general purpose programs that can be used to access and manipulate large amounts of data stored in the database. They also provide an independence between the program accessing data and the database. It is therefore important to use database systems to store CAD data in the most efficient and effective manner for easy retrieval and better management.Graphical objects can be created, in CAD, by reusing previously created objects. The data of these objects have references to the other objects they contain. Deductive object‐relational databases not only provide direct support for the effective storage and efficient access to large amounts of data with complex structures on disk, but also perform the inferences and computations to obtain the complete data of graphical objects that reuse other objects. They should be able to play a major role in CAD systems. This is the idea behind the development of the DrawCAD system. DrawCAD is a CAD system built on top of the Relationlog object‐relational deductive database system. It facilitates the creation of graphical objects by reusing previously created objects. The DrawCAD system illustrates how CAD systems can be developed, using database systems to store and manage data and also perform the inferences and computations that are normally performed by the application program. Copyright © 2003 John Wiley & Sons, Ltd.