bluuebunny/crossref_metadata_2025 huggingface dataset:
Two‐Dimensional Array Processor AAP2 and Its Programming Language
Authors: Kondo Toshio , Sugiyama Yoshi , Nakashima Takayoshi
Published: November 2009

An SIMD cellular array processor “AAP2” and its programming language AAPL have been developed. This array processor is packed into as little as 0.2 m volume in spite of its massive processor array being composed of 256 × 256 single‐bit processing elements [PEs], each of which has 8‐kbit local memory. The compact size is due to the simple and regular array structure for dense packing and a custom CMOS LSI with 8 × 8 PEs developed for the processor array.

The massive processor array offers outstanding operation power together with the following functions: (1) modified SIMD control which is able to select a different operation function or different direction of inter‐PE transfer in each PE; (2) propagation transfer operation capable of propagating data through 15 PEs within one clock cycle (330 ns).

The AAPL enables a simple and efficient program to be designed due to its APL‐like scanning statements and its primitive operation statements for unique AAP functions.

The high performance of the AAP2 has been shown to be equivalent in simulation capability to the very high‐speed hardware logic simul.ator or routing capability of over 1000 MIPS in the automatic chip layout design.
Service Base System: Its Concepts and Design
Authors: Ogino Tadashi , Tanaka Hidehiko , Fukazawa Tomoo
Published: November 2009

The service base system (SBS) has been developed as a framework for efficient utilization of computer resources in the network, including LAN and WAN. SBS is a system which provides a network environment which is easy to use by utilizing the existing network and OS.

This paper presents the basic concept, fundamental configuration and prospect of SBS. The major features of this system are as follows: (1) The functions offered by the computer are modeled at the abstract level—i.e. service—and the user can utilize the functions of the computer without considering the detailed differences in the use of the computer; (2) the distributed services are managed by a three‐layered view, and the expansion of functions such as addition and combination of services can easily be performed at each node.

Thus, the basic concept of SBS and the construction of each node is presented. To demonstrate the usefulness of the system, a simple experimental system was constructed by combining M680H and VAX. It was verified by the experimental system that distributed services can be utilized in a fairly flexible way. A problem left for further study is the description of the resources.
A 1‐Version Cautious Transaction Scheduler with Dynamic Version Selection
Authors: Kiniwa Jun , Katoh Naoki
Published: November 2009

This paper presents a one‐version cautious scheduler with version selection control CS1(WRW1±) which is an extension of a recently proposed single‐version cautious scheduler CS(WRW). The set of schedules that our scheduler CS1(WRW1±) accepts without delay properly includes the one that CS(WRW) does without delay. It is shown also that our CS1 (WRW1±) is free from cancellation anomaly and runs in polynomial time.
Anomaly Detection of Functional Programs Based on Global Dataflow Analysis
Authors: Ogawa Mizuhlto , Ono Satoshi
Published: November 2009

This paper proposes a new anomaly detection algorithm based on the global dataflow analysis, considering the first‐order functional program. The anomaly detection is made concerning two points: the irrelevant object which does not affect the result by evaluation; and the diverged object which will fall in an infinite loop without being terminated if an evaluation is made. The detection algorithm is based on the global functional analysis technique which determines the computation path arriving at the result of computation. Because of this property, the algorithm has a higher detection ability than the cross‐reference analysis, which simply traces the syntactic definition and reference relation. Using the proposed algorithm, the bug which may diverge the computation is detected effectively automatically, and is often produced in the program using a stream which is conceptually an infinite list.
Stereo Matching Using Segment Shape as Constraint
Authors: Seki Yasuo
Published: November 2009

This paper describes the stereo matching algorithm using the shape information of the edge segment as the constraint. The authors have been studying 3‐D information reconstruction by stereo vision from the viewpoints of the accuracy of correspondence and the versatility of the algorithm. A method was proposed in the course of study where the edge segment is used as the basic unit of the correspondence, and the composite edge segment is used as the real unit of correspondence to cope with the incomplete image processing.

Promising results were obtained by the proposed method, but the following problems remained: (1) a heuristic method is employed for the case of more than one candidate, where the candidate with the depth closest to the average depth of the scene (called average‐depth‐oriented heuristics), which results in the restricted range of applications; (2) for simplicity, the correspondence is determined based on the adjustment only among partial contradictory candidates with the result not always being adequate. This paper aims at solution of those problems with the following points.

(a) Instead of the forementioned heuristics, a method employing the shape information of the segment as the constraint is proposed which is made possible by the segment method. The direction vector sequence difference is considered as a stable measure for the difference of shapes in the left and the right frames.

(b) The hierarchical clique method is proposed as the method of correspondence, where the contradictory relation between candidates is considered globally.

(c) The effectiveness of the algorithm is demonstrated by a simulation experiment.
Image Restoration Method by Spectral Linear Prediction and Its Application to Artificially Made Images
Authors: Hioki Sakio
Published: November 2009

Spectral linear prediction has been used primarily for speech and audio signal analysis, but its application in image restoration has not been exploited sufficiently. This paper proposes an image restoration method using spectral linear prediction and demonstrates its application in the restoration of synthetic (artificially made) images. Boundary conditions are established so that the covariance matrix of an observed image signal can be represented by a lower tri‐diagonal matrix with cyclic‐ordered elements. The determination of prediction coefficients can be treated as an eigenvalue problem which allows the coefficients to be obtained by an iterative process. Spectral distribution of the image signal is estimated using these prediction coefficients.

Using the proposed method, test results indicate that synthetic images can be restored successfully regardless of an assumption of uncorrelated pixels in the vertical direction. Even when the covariance matrix of the observed image is unknown, the approximation of the prediction coefficient can be used by the proposed method for restoring the image.
Screening and Moiré Suppression in Printing and Its Analysis by Fourier Transform
Authors: Morimoto Yoshiharu , Seguchi Yasuyuki , Okada Masao
Published: November 2009

Moiré patterns are often observed in printing when the image is reproduced as a bilevel image with halftone. A Fourier transform analysis of screening a picture by an optical method or an ordered dither method is presented. Conventional moiré—suppressing techniques are discussed considering the human visual system. The moiré fringes are explained as aliasing and visible moiré fringes are especially due to high‐frequency spectra with high power. From this viewpoint, a screening method is proposed which uses the Fourier transform for moiré suppression. This method has the additional advantage that any pitch and any screen angle may be selected.
A Parsing Method for Context‐Sensitive C‐Plex Grammars Using Logic Programming
Authors: Peng Kejuan , Onda Kunio , Aoki Yoshinao
Published: November 2009

The high‐dimensional grammars, such as Plex grammar and graph grammar, have strong descriptive powers, but have a problem in that the parsing algorithm is difficult. To apply those grammars to the pattern analysis and recognition, it is desirable that the parsing method for those grammars should be established. As a method toward the parsing of Plex grammar, the authors previously have proposed a C‐Plex grammar and a parsing method for the context‐free C‐Plex grammar, based on the logic programming of Prolog. Further, a parsing method is presented for context‐sensitive C‐Plex grammar based on the logic programming.

First, a parsing algorithm is proposed which realizes the pseudo‐leftmost derivation in context‐sensitive C‐Plex grammar. Then, to arrive at a Horn clause program executing the parsing algorithm, a general rewriting method from the context‐sensitive C‐plex grammar to Horn clause is presented. Using the circuit pattern as an example, the result of parsing is shown. The description of rules by predicate logic expression and the parsing method based on logic language Prolog characterize the C‐Plex grammar as a kind of logic grammar. C‐Plex grammar can be applied not only to the grammatical pattern analysis and recognition but also to the parsing processing in the intelligent system such as pattern interpretation as a logic grammar.
Optimal Concurrency Control Schedulers in Terms of Secondary Storage Access
Authors: Kakeshita Tetsuro , Kambayashi Yahiko
Published: November 2009

Conventional concurrency control schedulers are used to increase concurrency to avoid transaction rollbacks, and it is widely accepted that a scheduler is effective if it can provide more concurrency. However, transaction rollbacks seldom occur in a practical transaction processing system. The performance of a scheduler should be evaluated by how efficient a schedule it can generate in such a situation. We select the number of secondary storage accesses to process a given schedule as such an efficient criterion.

A schedule is regarded as a page reference string and the memory cost of the schedule is defined by the cost to process the schedule by an optimal paging algorithm. Then we consider the minimum memory cost scheduling problem for a given set of transactions. The problem is shown to be NP hard in the general case. Thus we turn our attention to: (1) a restriction of the transaction model to construct an optimal schedule in a linear time; and (2) a nearly optimal solution to the given problem under a general transaction model. The nearly optimal scheduling problem is shown to be rather difficult.
A Unified Coding Method of Image and Text Data Using Discrete Orthogonal Transform
Authors: Nakamura Yasuhiro , Matsui Kineo
Published: November 2009

A unified coding method of image and text data is proposed in this paper. This scheme enables us to embed a text into an image by using some redundant region in the frequency space. Our results show that a text of about 4 k to 8 kbytes can be embedded into the image of 256 × 256 pixels and it retains an S/N ratio of about 30 to 40 dB.
A Support System for Constructing Rule Base for Speech Synthesis by Rule. Automatic Extraction of Synthesis Rules
Authors: Yamashita Yoichi , Mizoguchi Riichiro , Kakusho Osamu , Taniguchi Ken'Ichi , Yanagida Masuzo
Published: November 2009

In speech synthesis by rule, various acoustic parameters are determined by rules from the phonetic transcription and then the speech is synthesized. In the past, the synthesis rules have been constructed by an expert on speech synthesis, iterating trials and errors. To construct sophisticated rules efficiently, as well as to improve and maintain those rules, it will be useful to use a computer to support the expert's effort. For this purpose, several functions are required.

Among those, this paper discusses especially the method which automatically extracts the synthesis rules from a large number of speech data by inductive inference. In the method, the acoustic parameters, which are determined by the already prepared synthesis rules, are compared with those of the actual speech uttered by a human subject and the difference is described in the form of a “comparison example.” Then inductive inference is performed. In the comparison example, the phonetic environment for the speech data also is described.

The concept hierarchy for the attributes concerning the environment is prespecified as the “expert knowledge of phonology,” and is utilized in the inductive inference. Especially for consonants, more than one hierarchical structure is considered, among which the most favorable is employed. The synthesis rules actually were extracted for the CV syllable duration in the word, indicating the effectiveness of the proposed method.
Binocular Stereograph Based on Structures of Edge‐Arcs
Authors: Tatsumi Eiichi , Fukunaga Kunio , Kasai Tamotsu
Published: November 2009

Stereography is one of the representative methods to determine the 3‐D position of an object. The determination of the matching feature points in the left and the right images is one of the important problems. As one means to cope with this problem, a method has been presented in which the continuous feature points are approximated by edges, and the matching pair is determined by comparing the edge‐line structures of the two images.
Parallel Computation of the Fast Fourier Transform on a Binary Tree Multiprocessor
Authors: Niki Noboru , Takahashi Yoshizou
Published: November 2009

High‐speed FFT computation has previously been executed by an array processor using a pipeline processing. However, with advances in VLSI, parallel computation on multiprocessor systems becomes an interesting and challenging problem. In this paper, the parallel FFT computation is performed on a binary tree multiprocessor. The binary tree structure provides a recursive and hierarchical structure, and its processor can be constructed by a simple architecture and embedded efficiently in VLSI array. The binary tree multiprocessor realizes a practical multiprocessor system. First, parallel multidimensional radix 2n FFT algorithms are generalized from the work of Norton and Silberger. Second, to perform efficiently the parallel FFT algorithms, two division and pipeline data communication methods are presented and analyzed. The pipeline method is shown to be powerful.

Finally, radix‐2 FFT, radix‐4 FFT, and 2‐D FFT algorithms are implemented on the binary tree machine CORAL68K. High‐performance results are shown. By using various processor capabilities FFT performances are predicted on this machine. Various algorithmic and architectural optimizations on the binary tree machine for the number of data are shown.
Proposal for Cryptographic Key Distribution System Based on Identification Information
Authors: Okamoto Eiji , Tanaka Kazue
Published: November 2009

A key distribution system based on identification information is presented. The system is based on the Diffie‐Hellman public key distribution scheme (DH‐PKDS) and has an identity authentication function. It uses identification information on individual users instead of a public file employed in the DH‐PKDS. The system proposed here does not require any services of a center to distribute work keys, not does it require users to maintain directories of information for the generation of keys. This allows key management for cryptosystems to be simplified.

In this paper, two kinds of identity‐based key distribution systems are proposed. One uses two‐way (interactive) communication to distribute work keys, and the other uses one‐way communication. They are applied to communication networks, on‐line talk networks and mail networks, for instance. Modular exponentiations of large numbers used in the networks are implemented with digital signal processors.
An Adaptive Signal Processing System for Voiced Speech with Automatic Spectrum Selector
Authors: Hiroshige Makoto , Miyanaga Yoshikazu , Tochinai Koji
Published: November 2009

In this paper, adaptive spectrum analysis algorithms for voiced speech are discussed. A new adaptive signal processing system which uses a modified MIS algorithm and has a spectrum selector using a neural network is proposed. Based on the properties of voiced speech, we first test an identification algorithm which estimates AR parameters from the first moment of the observed signal and investigate its sensitivity to noise. In order to compare the modified MIS for voiced speech analysis with the above first moment analysis, the frequency domain properties of weighting factor A which is used in the modified MIS are presented.

This paper shows that we should select only the accurate spectra from among the results given by the modified MIS. The selection of spectra is automatically performed using a neural network. Using above methods, we construct a new analysis system for voiced speech. Experiments on real speech show that the proposed system is effective for speech analysis.
Analysis of Fault Detection Probability of CMOS Combinational Circuits and Its Application to Signature Testing
Authors: Iwasaki Kazuhiko
Published: November 2009

This paper analyzes the rough behavior of aliasing probabilities (missing faults) when the signature testing is applied to CMOS combinational circuits. In the analysis of aliasing probabilities, the fault detection probability for one‐digit test patterns—the fault detection probability—becomes important. However, for general circuits it is difficult to evaluate the fault detection probability.

In this paper the circuits are restricted to CMOS combinational circuits, and it is intended for the control circuits for microprocessors. For CMOS logic LSI's, the utilization of combinational gates follows a certain specific frequency and the expected value of the fault detection probability can be calculated.

First, the gate usage frequencies are examined for three types of CMOS logic LSI's. Next, the fault detection probabilities of single gates are analyzed. Based on the forementioned results, the fault detection probabilities of simplified κ‐stage combinational circuits are analyzed. As a result, the expected value of the fault detection probability for a CMOS combinational circuit is shown to be 0.4 – 0.5. Using this expected value, the approximate behaviors of the aliasing probabilities for the signature testing are presented for MISR's and single‐input LFSR's applied to CMOS combinational circuits. In particular, for single‐input LFSR's it is shown that within the range of practical use, the aliasing probabilities are not monotonic.
Data Structure for Multilayer N‐Dimensional Data Using Hierarchical Structure
Authors: Nakamura Yasuaki , Abe Shigeru , Ohsawa Yutaka , Sakauchi Masao
Published: November 2009

Data such as vectors, points and symbols of maps and facilities location maps are classified into layers and managed according to such attributes as roads, houses, and facilities. In editing a diagram, range searchings and neighborhood searching frequently are made, where the objects of search are the data in a number of layers. When such multidimensional data classified into layers (called multilayer data) are managed by the conventional multidimensional data structure, a problem occurs in that the retrieval efficiency varies greatly depending on the number of considered layers. This paper proposes the ML structure (multi‐layered structure), which is a new managing structure for the multilayer data based on a tree structure.

In ML structure, the node structure is extended so that data can be stored not only in the terminal node of the tree but also in the internal node. A layer management mechanism is added to each node. It is arranged that the data of the layer with small number of data are placed close to the root of the tree structure. As a result, a satisfactory performance with small variation in the retrieval efficiency is realized, even if a range searching is made for a particular layer, or for a number of layers.

This paper describes the construction of ML structure, method of data management, and searching. It is shown by experiment that the data management and searching by ML structure is effective for the multilayer data.
High‐Speed Algorithm for Component Labeling
Authors: Gotoh Toshiyuki , Ohta Yoshiyuki , Yoshida Masumi , Shirai Yoshiaki
Published: November 2009

This paper describes a fast labeling algorithm which separates regions lying all over an image based on a pipeline method. In the previous labeling algorithm of raster‐scan type, a bottleneck for fast processing was the label classification process to classify temporarily assigned labels based on the connectivity. To cope with this problem, consideration was given to how to reduce the number of connectivities input to the labeling process, and how to make the labeling process efficient.

For the problem of the number of connectivities, a method was developed for reducing the number of connectivities due to reshaping of a region, and a fast method for reducing the number of duplicate connectivities by introduction of a dividing process. Also, for the problem of label classification, a label classification method was developed using direct search for connectivities. Moreover, the relationship between the number of provisional labels in the labeling process and the number of connectivities was investigated. As a result, it was shown that the label classification process can be implemented in time proportional to the number of provisional labels and the effectiveness of the algorithm presented here was verified by simulation.
3D Recovery of Polyhedra by Parallelism Heuristics
Authors: Tanaka Toshie , Kawashima Takao , Kanatani Ken‐Ichi
Published: November 2009

A method is presented which recovers the 3‐D shape of a polyhedron under the assumption of a large number of parallel edges. The method is based on the fact that three or more parallel edges intersect at a point (vanishing point) when extended on the image plane. To determine a pair of two parallel edges, a heuristic method based on the structure of polyhedra is employed. To cope with the error in the image, a threshold processing based on the causes of error is proposed.

When parallel edges are found, the 3‐D orientation of each edge can be determined from the vanishing point. However, contradictions may arise in the calculated 3‐D orientations of the edges due to errors. To overcome such a problem, an optimization technique based on the constraint on polyhedra is proposed. Then our method is applied to an actual image.
Relational Matching Using a Neural Network
Authors: Katta Noboru , Takahashi Hideya , Matsushita Kenji , Shimizu Eiji
Published: November 2009

This paper proposes an algorithm for relational matching, which is important in pattern recognition, by using the Hopfield model as one of the neural network models. First, the objective function for relational matching is derived and the computer simulation of the neural networking for relational matching according to this objective function is conducted by use of a simple model. Next, the local minima in connection with the Hopfield model is avoided by using triangular noise and its effectiveness is verified in the network for relational matching. This method differs from the conventional simulated annealing method and, by adding noise to the network, the network will reach only one stationary state for which results will be derived by this method.
Design of an RSA Encryption Processor Based on Signed‐Digit Multivalued Arithmetic Circuits
Authors: Kameyama Michitaka , Wei Shugang , Higuchi Tatsuo
Published: November 2009

This paper proposes an LSI‐oriented multiple‐valued hardware algorithm based on the signed‐digit number (SD number) for highspeed RSA public key encryption processor. A very long word‐length arithmetic is required in RSA encryption processing. The proposed algorithm realizes a high‐speed processing by iterative additions based on the radix‐A SD number system. Microprogram control is adopted in the encryption processor. To verify the basic operation of the proposed processor architecture, a model processor for 16‐bit encryption is implemented using binary TTL logic IC's. A comprehensive evaluation of the 2 μm CMOS encryption LSI is made by a simulation using the electronic circuit analysis program SPICE2. The encryption rate for the message of 512‐bit word length is 60 kbit/s, which is a factor of eight times faster than that of the corresponding binary LSI. The developed processor contains about 100 k transistors and it can be implemented on a single single chip.
Improvement of HDTV‐PAL Standard Converter Using Motion‐Compensation Technique and Detection Probability of Motion Vectors
Authors: Tanaka Yutaka , Nishizawa Taiji , Ohmura Toshiro
Published: November 2009

HDTV signal can be converted into the present standard TV signal with a high spatial resolution. However, some problems have been pointed out in the standard conversion with different field frequencies, which are the degradation of resolution and jitter for moving pictures. To avoid such problems, the motion compensation frame conversion method was developed, which realized a practically satisfactory standard conversion. In the development of a practical system for the standard conversion from HDTV to PAL, the quality of the converted picture is improved by improving the detection of motion vector and the processing of motion‐compensated picture. The detection probability for the motion vector is investigated, and the usefulness of the motion compensation based on the detection of the motion vector used in the proposed system is verified.
A Reconstructed Image Analysis and a Practical Algorithm of the Direct 2‐D Fourier Transform
Authors: Niki Noboru
Published: November 2009

Significant research and development have been made on various kinds of CT's such as the X‐ray, the MRI and the positron, which are applied widely in practice. The CT device is divided into the measurement system and the image reconstruction system. Efforts are still being made at present to improve the resolution and speed of those systems. This paper discusses the 2‐D Fourier transform method, which is one of the image reconstruction methods that have been investigated and applied in the image reconstruction in various types of CT's.

Traditionally, the 2‐D Fourier transform method has been considered as suffering from low image quality, although the image can be reconstructed with a high speed. The reason for image degradation is the lack of accuracy in the interpolation in the 2‐D Fourier transform domain, which can be remedied by improving the accuracy.

A problem then is that the coordinate transformation in the Fourier domain depends on the individual CT. From such a viewpoint, this paper analyzes the relation between the coordinate transformation and the reconstructed image to indicate the reason for the image degradation.

A systematic analysis is made of the reconstructed image when the linear interpolation is applied to each coordinate transformation, to indicate the reason for the image degradation and to describe the artifact appearing in the reconstructed image. Based on the result of this analysis, an algorithm is constructed which can eliminate the artifact from the reconstructed image. The algorithm is composed of the normalization algorithm for the interpolation characteristics, the interpolation by the fast‐Fourier transform and the inverse 2‐D Fourier transform enlarging the reconstructed image region. The effectiveness of the method is demonstrated by applying the method to the transformation from the polar to the Cartesian coordinate.
Directional Feature Field and Parallel Operations for Binary Images: Twisting Operation for Arbitrary Directional Propagation by 8‐Neighbors
Authors: Yamada Hiromitsu , Yamamoto Kazuhiko
Published: November 2009

This paper points out the importance of directional propagation with an expression of directional elements at each pixel of a binary image, as an extension of local parallel operations. This paper also proposes “a twisting operation” for an 8‐neighbor operation with an arbitrary direction and an arbitrary directional accuracy. By using this operation and the concept of vibrating operations, such as erosion‐dilatation or dilatation‐erosion, directional local parallel operations are defined to extract linear features. The effectiveness of the ideas is confirmed experimentally.
Establishing Correspondence and Obtaining 3‐D Information in Dynamic Images
Authors: Suzuki Kaoru , Yachida Masahiko
Published: November 2009

To establish correspondences between dynamic images, methods based on their local similarity such as the correlation method have been used widely. If corresponding points are searched over the whole image, however, the computation time and risk of occurrence of false correspondences increase. Therefore, it is important to restrict the search area.

This paper proposes a reliable and efficient method of establishing correspondences among the sequences of dynamic images by using geometrical constraint conditions derived from the positional relationship of viewpoints before and after a movement. Also proposed is another method by which the correspondences between images formed by the binocular view of a mobile robot and the correspondences between images formed before and after a movement can be carried out simultaneously. The experimental results show that the correspondences of dynamic stereo images and the range information are obtained successfully.
A method to develop sustainable water management strategies for an uncertain future
Authors: Haasnoot M. , Middelkoop H. , van Beek E. , van Deursen W. P. A.
Published: November 2009

Development of sustainable water management strategies involves identification of vulnerability and adaptation possibilities, followed by an effect analysis of these adaptation strategies under different possible futures. Recent scenario studies on water management were mainly ‘what‐if’ assessments in one or two future situations. The future is, however, more complex and dynamic. It involves general trends and unexpected events in both the water and the social system. Moreover, the two systems interact: society responds to events and the state of the water system changes in response to management. In this paper we discuss a transdisciplinary approach. Key elements in the concept are (1) the model of pressure, state, impact and response, (2) the Perspectives method to consider uncertainties of social and natural systems and (3) the evaluation of the system using transient scenarios in which we consider time series of trends, events and interaction between the water system and society. The effect analysis is executed with an integrated assessment meta‐model based on simple cause–effect relations and response curves. Copyright © 2009 John Wiley & Sons, Ltd and ERP Environment.
A method to explore social response for sustainable water management strategies under changing conditions
Authors: Offermans Astrid , Haasnoot Marjolijn , Valkering Pieter
Published: November 2009

Society aims at sustainable water management, which means that it is effective (meeting targets for people, planet and profit), robust (able to cope with uncertainties) and flexible (easily adaptable to changing conditions). The past has demonstrated that extreme weather events and their impacts are important triggers for adaptations in water management. Furthermore, societal changes or events lead to changes in perception of desired situations, goals, and valuation of costs and benefits. Insight into the dynamic nature of societal perspectives and responses provides information about the (non‐) support and sustainability of water management strategies. The method presented here comprises the ‘Perspectives method’, derived from Cultural Theory to classify, analyze and explore present and future perspectives and according social response. These are presented in a so‐called perspective map. We illustrate the method with a historic example of the river Meuse. Copyright © 2009 John Wiley & Sons, Ltd and ERP Environment.
Mesenchymal Cells Appearing in Pancreatic Tissue Culture Are Bone Marrow-Derived Stem Cells With the Capacity to Improve Transplanted Islet Function
Authors: Sordi Valeria , Melzi Raffaella , Mercalli Alessia , Formicola Roberta , Doglioni Claudio , Tiboni Francesca , Ferrari Giuliana , Nano Rita , Chwalek Karolina , Lammert Eckhard , Bonifacio Ezio , Piemonti Lorenzo
Published: November 2009

Adherent fibroblast-like cells have been reported to appear in cultures of human endocrine or exocrine pancreatic tissue during attempts to differentiate human β cells from pancreatic precursors. A thorough characterization of these mesenchymal cells has not yet been completed, and there are no conclusive data about their origin. We demonstrated that the human mesenchymal cells outgrowing from cultured human pancreatic endocrine or exocrine tissue are pancreatic mesenchymal stem cells (pMSC) that propagate from contaminating pMSC. The origin of pMSC is partly extrapancreatic both in humans and mice, and by using green fluorescent protein (GFP+) bone marrow transplantation in the mouse model, we were able to demonstrate that these cells derive from the CD45+ component of bone marrow. The pMSC express negligible levels of islet-specific genes both in basal conditions and after serum deprivation or exogenous growth factor exposure, and might not represent optimal candidates for generation of physiologically competent β-cells. On the other hand, when cotransplanted with a minimal pancreatic islet mass, pMSC facilitate the restoration of normoglycemia and the neovascularization of the graft. These results suggest that pMSCs could exert an indirect role of “helper” cells in tissue repair processes.
The pattern of neuronal loss and survival may reflect differential expression of proteasome activators in Parkinson's disease
Authors: Mcnaught Kevin St.P. , Jnobaptiste Ruth , Jackson Tehone , Jengelley Toni‐Ann
Published: November 2009

The basis of neuronal vulnerability, degeneration, and sparing in PD are unknown, but there is increasing evidence to suggest that the ubiquitin‐proteasome system (UPS) plays an important role in the pathogenesis of the disorder. In this study, we employed an immunocytochemical approach to determine if the differential expression of key UPS components in various brain regions and cells might underlie the pattern of neuronal degeneration and survival seen in PD. We showed that the ubiquitin activating enzyme (E1), ubiquitin conjugating enzyme (E2), and 26/20S proteasome α‐ and β‐subunits, are abundantly expressed in the substantia nigra pars compacta (SNc) and in cultured dopaminergic neurons. Although the proteasome activator PA700 is expressed in the medial SNc, levels are low in the lateral region, and expression of the other proteasome activator, PA28, is near absent in the entire SNc. PA28 (but not PA700) was found to be poorly expressed in noradrenergic neurons in the locus coeruleus (LC) compared with adjacent cells in the mesencephalic nucleus. PA700 and PA28 are also poorly expressed in dopaminergic neurons compared with other cell types in culture. Inhibition of proteasomal function, generation of misfolded proteins, induction of oxidative stress or impairment of mitochondrial complex I activity, caused a compensatory upregulation in PA700 and PA28 in a variety of cells but not in dopaminergic neurons in culture. These findings are consistent with the demonstration that, in sporadic PD, proteasomal activity and levels of PA700/PA28 are reduced in the SNc butare markedly upregulated in regions/cells that are spared from the neurodegenerative process. Thus, the differential distribution and activity of proteasome activations could play a significant role in the pathogenesis of PD. Synapse 64:241–250, 2010. © 2009 Wiley‐Liss, Inc.
Car wars: Factors underlying the success or failure of new car programs
Authors: Hanawalt Edward S. , Rouse William B.
Published: November 2009

This paper explores the factors responsible for success or failure of an automobile through a case study analysis of 10 product successes and 10 product failures in the United States auto market over the last 50 years. Through the creation and analysis of twenty case studies we have generated a first listing of 14 factors driving success or failure. Seven experts assessed the extent to which these factors were associated with each automobile. Their assessments indicate that the product development system of new automobiles, particularly those that are highly successful, is often born from financial and corporate responses to market crisis. The target segment of a new entry in the automotive market and its development process as they are adapted to economic conditions in the marketplace, coupled with leadership, are central success factors. The role of these factors play in the success of automobiles is discussed in the context of several case studies. © 2009 Wiley Periodicals, Inc. Syst Eng 13
Facile synthesis of functional polyperoxides by radical alternating copolymerization of 1,3‐dienes with oxygen
Authors: Sato Eriko , Matsumoto Akikazu
Published: November 2009

We have developed a facile synthesis of degradable polyperoxides by the radical alternating copolymerization of 1,3‐diene monomers with molecular oxygen at an atmospheric pressure. In this review, the synthesis, the degradation behavior, and the applications of functional polyperoxides are summarized. The alkyl sorbates as the conjugated 1,3‐dienes gave a regiospecific alternating copolymer by exclusive 5,4‐addition during polymerization and the resulting polyperoxides decomposed by the homolysis of a peroxy linkage followed by successive β‐scissions. The preference of 5,4‐addition was well rationalized by theoretical calculations. The degradation of the polyperoxides occurred with various stimuli, such as heating, UV irradiation, a redox reaction with amines, and an enzyme reaction. The various functional polyperoxides were synthesized by following two methods, one is the direct copolymerization of functional 1,3‐dienes, and the other is the functionalization of the precursor polyperoxides. Water soluble polyperoxides were also prepared, and the LCST behavior and the application to a drug carrier in the drug delivery system were investigated. In order to design various types of degradable polymers and gels we developed a method for the introduction of dienyl groups into the precursor polymers. The resulting dienyl‐functionalized polymers were used for the degradable gels. The degradable branched copolymers showed a microphase‐separated structure, which changed owing to the degradation of the polyperoxide segments. © 2009 The Japan Chemical Journal Forum and Wiley Periodicals, Inc. Chem Rec 9: 000–000; 2009: Published online in Wiley InterScience (www.interscience.wiley.com) DOI 10.1002/tcr.200900009
The relative effects and equity of inquiry‐based and commonplace science teaching on students' knowledge, reasoning, and argumentation
Authors: Wilson Christopher D. , Taylor Joseph A. , Kowalski Susan M. , Carlson Janet
Published: November 2009

We conducted a laboratory‐based randomized control study to examine the effectiveness of inquiry‐based instruction. We also disaggregated the data by student demographic variables to examine if inquiry can provide equitable opportunities to learn. Fifty‐eight students aged 14–16 years old were randomly assigned to one of two groups. Both groups of students were taught toward the same learning goals by the same teacher, with one group being taught from inquiry‐based materials organized around the BSCS 5E Instructional Model, and the other from materials organized around commonplace teaching strategies as defined by national teacher survey data. Students in the inquiry‐based group reached significantly higher levels of achievement than students experiencing commonplace instruction. This effect was consistent across a range of learning goals (knowledge, reasoning, and argumentation) and time frames (immediately following the instruction and 4 weeks later). The commonplace science instruction resulted in a detectable achievement gap by race, whereas the inquiry‐based materials instruction did not. We discuss the implications of these findings for the body of evidence on the effectiveness of teaching science as inquiry; the role of instructional models and curriculum materials in science teaching; addressing achievement gaps; and the competing demands of reform and accountability. © 2009 Wiley Periodicals, Inc. J Res Sci Teach 47:276–301, 2010
Liver functional reserve estimation: state of the art and relevance for local treatments
Authors: Manizate Fotini , Hiotis Spiros P. , Labow Daniel , Roayaie Sasan , Schwartz Myron
Published: November 2009

More than 90% of cases of hepatocellular carcinoma (HCC) develop as a consequence of underlying liver disease (most commonly viral hepatitis), often resulting in impaired liver function. In such cases, transplantation is an appealing alternative as it can potentially cure both the malignancy and the underlying disease. When transplant is not readily available due to organ scarcity, borderline cases must be considered for resection. The function of the underlying liver can be assessed by the Child Pugh score or by quantitative tests such as indocyanine green (ICG) clearance, metabolism of lidocaine to the metabolite MEG‐X, and the arterial body ketone ratio (AKBR); liver biopsy pathology scoring and the platelet count can serve as indicators of fibrosis and portal hypertension. Another important factor to be considered is the risk of tumor recurrence, either because of unrecognized metastasis or due to de‐novo tumor formation. Both factors must be considered in weighing resection against nonsurgical alternatives. Preoperative portal vein embolization is a strategy that can evoke regeneration in anticipation of surgery, serving as a “stress test” of the liver's regenerative capacity.
A case of primary psoas abscess presenting as buttock abscess
Authors: Yoo Jae Ho , Kim Eung Ha , Song Hyun Seok , Cha Jang Gyu
Published: November 2009

Buttock abscess is a rare clinical manifestation from unusual extrapelvic extension of psoas abscess. A 48-year-old woman presented with painful swelling of the buttock with a sense of local heat. Magnetic resonance imaging revealed a large subfascial abscess over the glutei muscles and was traced into the intraabdominal cavity over the iliac wing to the psoas muscle. Both the psoas abscess and the buttock abscess were evacuated via separate approaches. Empirical antibiotic therapy was delivered for 3 weeks. After 6 months, no evidence of recurrence was found. Psoas abscess could be included in the differential diagnosis of buttock abscess.
PDH E1β deficiency with novel mutations in two patients with Leigh syndrome
Authors: Quintana E. , Mayr J. A. , García Silva M. T. , Font A. , Tortoledo M. A. , Moliner S. , Ozaez L. , Lluch M. , Cabello A. , Ricoy J. R. , Koch J. , Ribes A. , Sperl W. , Briones P.
Published: November 2009

Most cases of pyruvate dehydrogenase complex (PDHc) deficiency are attributable to mutations in the PDHA1 gene which encodes the E1α subunit, with few cases of mutations in the genes for E3, E3BP (E3 binding protein), E2 and E1‐phosphatase being reported. Only seven patients with deficiency of the E1β subunit have been described, with mutations in the PDHB gene in six of them. Clinically they presented with a non‐specific encephalomyopathy. We report two patients with new mutations in PDHB and Leigh syndrome. Patient 1 was a boy with neonatal onset of hyperlactataemia, corpus callosum hypoplasia and a convulsive encephalopathy. After neurological deterioration, he died at age 5 months. Autopsy revealed the characteristic features of Leigh syndrome. Patient 2, also a boy, presented a milder clinical course. First symptoms were noticed at age 16 months with muscular hypotonia, lactic acidosis and recurrent episodes of somnolence and transient tetraparesis. MRI revealed bilateral signal hyperintensities in the globus pallidus, midbrain and crura cerebri. PDHc and E1 activities were deficient in fibroblasts in patient 1; in patient 2 PDHc deficiency was found in skeletal muscle. Mutations in PDHA1 were excluded. Sequencing of PDHB revealed a homozygous point mutation (c.302T>C), causing a predicted amino acid change (p.M101T) in patient 1. Patient 2 is compound heterozygote for mutations c.301A>G (p.M101V) and c.313G>A (p.R105Q). All three mutations appear to destabilize the E1 enzyme with a decrease of both E1α and E1β subunits in immunoblot analysis. To our knowledge, these patients with novel PDHB mutations are the first reported with Leigh syndrome.
The value of focused assessment with sonography in trauma examination for the need for operative intervention in blunt torso trauma: a rebuttal to “emergency ultrasound-based algorithms for diagnosing blunt abdominal trauma (review)”, from the Cochrane Collaboration
Authors: Melniker Lawrence A.
Published: November 2009

Background and significance

The Cochrane Database of Systematic Reviews published a manuscript critical of the use of the FAST examination. The reference is Stengel D. Bauwens K. Sehouli J. Rademacher G. Mutze S. Ekkernkamp A. Porzsolt F. Emergency ultrasound-based algorithms for diagnosing blunt abdominal trauma.Cochrane Database of Systematic Reviews. (2):CD004446, 2005.UI: 15846717. The stated objective was the assessment of the “efficiency and effectiveness” of ultrasound-inclusive evaluative algorithms in patients with suspected blunt abdominal trauma (BAT). The primary outcome measures explored were Mortality, CT and DPL use, and laparotomy rates. Little or no benefit was seen and the conclusion was that “there is insufficient evidence from randomized controlled trials to justify promotion” of FAST in patients with BAT. While the review used the same rigorous methods employed in all Cochrane Reviews, it appears that several serious flaws plagued the manuscript. The finest methodological rigor cannot yield usable results, if it is not applied to a clinically relevant question. In a world of increasingly conservative management of BAT, do we need FAST, a rapid, repeatable screening modality at the point-of-care to visualize any amount of free fluid or any degree of organ injury? The obvious answer is no. However, quantifying the value of FAST to predict the need for immediate operative intervention (OR) is essential.

Methods

To rebut this recurrent review, a systematic literature review was conducted using verbatim methodologies as described in the Cochrane Review with the exception of telephone contacts. Data were tabulated and presented descriptively.

Results

Out of 487 citations, 163 articles were fully screened, 11 contained prospectively derived data with FAST results, patient disposition and final diagnoses, and a description of cases considered false negatives or false positives. Of the 2,755 patients, 448 (16%) went to the OR. There were a total of 5 patients with legitimately false-negative diagnoses made based on the FAST: 3 involving inadequate scans and 2 of blunt trauma-induced small bowel perforations without hemoperitoneum.

Conclusion

The FAST examination, adequately completed, is a nearly perfect test for predicting a “Need for OR” in patients with blunt torso trauma.