bluuebunny/crossref_metadata_2025_split huggingface dataset:
Characterization of sonochemical reactors by chemical dosimetry
Authors: Asakura Yoshiyuki , Maebayashi Masahiro , Matsuoka Tatsuro , Koda Shinobu 
Published: April 2007

AbstractIrradiation of ultrasonic waves induces cavitation in a solution, and a chemical action instigated by radicals occurs. This chemical action is reported to be most efficient in the region of several hundred kilohertz frequencies. Application of sonochemistry based on ultrasonic chemical action remains at the laboratory scale and has not yet reached the industrial practical scale. In order to realize practical applications of sonochemistry, there is a need to scale‐up the sonochemical reactors. For this purpose, we used a 490‐kHz cylindrical sonochemical reactor that is long in the irradiation direction, and used potassium iodide (KI) dosimetry, sonochemical luminescence, and calorimetry to evaluate the sonochemical reaction efficiency and reaction field of the reactor. We performed the evaluation with the ultrasonic irradiation direction in the horizontal and vertical directions. As a result, we observed sonochemical luminescence and a rise in temperature near the reflection surface, for both the horizontal and vertical irradiation. For the horizontal irradiation, the I3− concentration was evenly distributed in the irradiation direction. Moreover, we found that the sonochemical reaction efficiency was the same for both the horizontal irradiation and the vertical irradiation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(8): 1– 8, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20315
Algorithms for the minimum partitioning problems in graphs
Authors: Nagamochi Hiroshi 
Published: April 2007

AbstractIn this paper, the author explains the recent evolution of algorithms for minimum partitioning problems in graphs. When the set of vertices of a graph having non‐negative weights for edges is divided intoksubsets, the set of edges for which both endpoints are contained in different subsets is called ak‐way cut ork‐cut. The problem of obtaining thek‐way cut that minimizes the sum of the weights is an important research topic that appears in many practical applications such as VLSI design. In this paper, the author introduces recent results including cases in which sets of terminals or sets of terminal pairs that are to be separated are further specified in this problem and cases in which the objects to be partitioned are extended from graphs to hypergraphs or submodular set functions. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 63– 78, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20341
Design and evaluation of a system for running two coexisting Linux systems
Authors: Tabuchi Masaki , Itoh Ken‐Ichi , Nomura Yoshinari , Taniguchi Hideo 
Published: April 2007

AbstractA method to independently run two coexisting Linux systems on one computer is proposed. Up to the present time a virtual computer method has been used as a method to run multiple operating systems on one computer. This method has a problem, however, in which the guest operating system depends on the running state of the host operating system making it impossible to efficiently utilize the processing performance of each operating system. In contrast to this, because each operating system runs independently in the proposed method by time sharing the processes and exclusively dividing the other hardware resources, one of the operating systems and applications running on the operating systems are not influenced by the other operating system and the applications running on the operating system. This paper presents the proposed method and reports the results of performance evaluations when actually implemented in Linux. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 56– 68, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20343
Application of fingerprint identification technology to systems against inside information leaks and a proposal for its development form
Authors: Kodama Mitsuharu , Umezaki Taizo , Sato Yukio 
Published: April 2007

AbstractChanges are occurring in the environment surrounding business organizations, such as the development of open networks and flexible migration of employees. In the context of such changes, it has recently been considered more important to prepare measures against information leaks from inside the organization. Among these, an urgent issue in ordinary organizations is to reinforce the existing business system so as to realize highly cost‐effective security functions. This paper considers an actual case of information leakage as a model and systematically summarizes the conditions regarding security functions, based on the views of legal specialists. An actually introduced security system based on fingerprint identification is investigated, and it is shown that practical security measures can be established. A development configuration is then proposed in which part of the security system is placed in a data center and shared by multiple organizations. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 54– 62, 2007; Published online in Wiley InterScience (www.interscience.wiley. com). DOI 10.1002/ecjc.20346
Face detection by generating and selecting features based on Kullback‐Leibler divergence
Authors: Morooka Ken'Ichi , Arakawa Junya , Nagahashi Hiroshi 
Published: April 2007

AbstractFace detection from images is a complex and nonlinear problem due to the various kinds of face images. This problem is solved by conversion of the original feature vectors extracted from images into high‐dimension feature vectors using nonlinear mapping, and then finding face/nonface discriminant functions in the mapping space. If such discriminant functions are based on the inner products of high‐dimension vectors, such inner products can be easily obtained by substitute calculations of kernel functions in the original feature space. However, in conventional recognition algorithms using kernel functions, numerous features are required to improve recognition accuracy. This paper proposes a new face detection method that uses generation and selection of features on the basis of Kullback‐Leibler divergence (KLD). KLD refers to a distance between the distributions of face and nonface data for certain features. Features with large KLD are used for face detection. Moreover, by evaluating the features based on their KLDs, we can generate new features, and deal with different kinds of features concurrently. In experiments, a classifier designed by the proposed method achieved high recognition performance, while using few features. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 29– 39, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20347
Spin Canting and Topological Ferrimagnetism in Two Manganese(II) Coordination Polymers Generated by In Situ Solvothermal Ligand Reactions
Authors: Cheng Lin , Zhang Wei‐Xiong , Ye Bao‐Hui , Lin Jian‐Bin , Chen Xiao‐Ming 
Published: April 2007

AbstractTwo manganese(II) coordination polymers, [Mn2(bpt)(pa)2(N3)]n [1; Hpa = picolinic acid, Hbpt = 3,5‐bis(2‐pyridyl)‐4H‐1,2,4‐triazole] and [Mn3(ina)2(pa)2(N3)2]n (2; Hina = isonicotinic acid), have been synthesized by solvothermal treatment, in which the ligands bpt and pa were generated in situ by cyclocondensation and hydrolysis of 2‐pyridylamidrazone, respectively. In 1, each binuclear subunit [Mn2(bpt)(N3)] bridged by bpt and N3– ligands is interlinked to four adjacent subunits via four tridentate pa ligands into a diamondoid 3D network, which shows spin‐canting magnetism arising from the lack of inversion centers between the interacting spin centers. In 2, the MnII ions are alternately connected by double μ1,3‐carboxylate/μ1,1‐azide and double μ1,1‐carboxylate bridges into a 1D magnetic chain, which exhibits a topological ferrimagnetic behavior in an antiferromagnetic‐antiferromagnetic‐ferromagnetic sequence. These chains are further interlinked via ina ligands into a 2D network.(© Wiley‐VCH Verlag GmbH & Co. KGaA, 69451 Weinheim, Germany, 2007)
Synthesis and Structures of Two New Types of Boronium Salts
Authors: Braun Ulrike , Nöth Heinrich 
Published: April 2007

AbstractTransamination of di(pyrid‐2‐yl)amine (1) with B(NMe2)3 leads to the isomeric heterocyclic bis(dimethylamino)boryl compound 4 and not to bis(dimethylamino)di(pyrid‐2‐yl)aminoborane (2). B(NMe2)3 reacts with aniline (1:2 ratio) to yield a 1:1 mixture of B(NHPh)3 and (Me2N)2BNHPh. Transamination of this mixture with 1 yields the anilinodimethylamino analogue of 4 (compound 7). Compound 4 reacts with CHCl3 to generate the boronium salt 5 by the abstraction of HCl from CHCl3 and addition of HCl to one of the dimethylamino groups. Compound 5 crystallizes with 4 molecules of CHCl3. Compound 4 is attacked by AlCl3 in toluene to give a mixture of unidentified products from which the tetrachloroaluminate of a new type of spirocyclic diboronium cation, 8, was isolated and characterized by X‐ray crystallography. (© Wiley‐VCH Verlag GmbH & Co. KGaA, 69451 Weinheim, Germany, 2007)
Tariquidar Analogues: Synthesis by CuI‐Catalysed N/O–Aryl Coupling and Inhibitory Activity against the ABCB1 Transporter
Authors: Egger Michael , Li Xuqin , Müller Christine , Bernhardt Günther , Buschauer Armin , König Burkhard 
Published: April 2007

AbstractLess lipophilic and better water soluble tariquidar analogues were synthesised from one central anthranilic acid derived building block by CuI‐catalysed N/O–arylation reactions. The compounds were tested for their inhibitory activity against the ABCB1 transporter in a flow cytometric calcein‐AM efflux assay. A correlation between their calculated log P values and their activities was observed, with the more lipophilic analogues being as potent as the reference substance tariquidar.(© Wiley‐VCH Verlag GmbH & Co. KGaA, 69451 Weinheim, Germany, 2007)
Cationic Vanadium(IV) Complexes as Efficient Catalysts for Nazarov Cyclizations
Authors: Walz Irene , Bertogg Andreas , Togni Antonio 
Published: April 2007

AbstractVanadium(IV) species generated in situ from V(salen)Cl2 complexes (1) by reaction with 2 equiv. of AgSbF6 are effective catalysts for Nazarov cyclizations. Thus, dialkenyl ketones bearing α‐ester groups are efficiently converted to corresponding cyclopentenones in good yields at room temperature, in the presence of 2 mol‐% catalyst. Under such conditions full conversion takes place within minutes for substrates bearing an electron‐donating group at position 1 of the 1,4‐dien‐3‐one system.(© Wiley‐VCH Verlag GmbH & Co. KGaA, 69451 Weinheim, Germany, 2007)
Synthesis of Substituted 1H‐ and 3H‐1‐Benzazepines and Rearrangement of Alkyl 1H‐1‐Benzazepine‐2‐carboxylates into Isoquinolines
Authors: Singh Vijay , Batra Sanjay 
Published: April 2007

AbstractThe SnCl2‐mediated reduction of nitro groups in 2‐nitro‐4‐(2‐nitrobenzylidene)alkanoates and 4‐nitro‐2‐(2‐nitroalkylidene)alkanoates allows the facile synthesis of substituted 1H‐1‐benzazepines and 3H‐1‐benzazepines. This reaction proceeds via SN2′ reaction of ethyl nitroacetate and nitroethane with the acetyl derivatives of Baylis–Hillman adducts deriving from 2‐nitro‐substituted benzaldehydes. During the study, an unprecedented rearrangement of an alkyl 1H‐benzazepine‐2‐carboxylate to a substituted isoquinoline has been observed. (© Wiley‐VCH Verlag GmbH & Co. KGaA, 69451 Weinheim, Germany, 2007)
Minimizing forced outage risk in generator bidding
Authors: Das Dibyendu , Wollenberg Bruce F. 
Published: April 2007

AbstractCompetition in power markets has exposed the participating companies to physical and financial uncertainties. A random outage after acceptance of bids by the ISO forces a generator to buy power from the real‐time hourly spot market and sell to the ISO at the set day‐ahead market‐clearing price, incurring losses if the real‐time hourly spot market is expensive. This paper assesses the financial risk of the generators using risk profiles and VaRs. A risk minimization module is developed which derives optimum bidding strategies of the generator company such that the estimated total earning is maximized keeping the Value at Risk (VaR) below a tolerable limit. Copyright © 2007 John Wiley & Sons, Ltd.
A novel selectivity technique for high impedance arcing fault detection in compensated MV networks
Authors: Elkalashy Nagy I. , Lehtonen Matti , Darwish Hatem A. , Taalab Abdel‐Maksoud I. , Izzularab Mohamed A. 
Published: April 2007

AbstractIn this paper, the initial transients due to arc reignitions associated with high impedance faults caused by leaning trees are extracted using discrete wavelet transform (DWT). In this way, the fault occurrence is localized. The feature extraction is carried out for the phase quantities corresponding to a band frequency 12.5–6.25 kHz. The detection security is enhanced because the DWT corresponds to the periodicity of these transients. The selectivity term of the faulty feeder is based on a novel technique, in which the power polarity is examined. This power is mathematically processed by multiplying the DWT detail coefficients of the phase voltage and current for each feeder. Its polarity identifies the faulty feeder. In order to reduce the computational burden of the technique, the extraction of the fault features from the residual components is examined. The same methodology of computing the power is considered by taking into account the residual voltage and current detail coefficients where the proposed algorithm performs best. Test cases provide evidence of the efficacy of the proposed technique. Copyright © 2007 John Wiley & Sons, Ltd.
Flexible transmission network planning using the connection number
Authors: Jin Huazheng , Cheng Haozhong 
Published: April 2007

AbstractVarieties of uncertainties exist in transmission network planning, which directly affects the efficiency and reliability of the planning schemes. Rational expressions of those uncertainties are needed to satisfy the developing power market. In this paper, we present a new method for flexible transmission network planning by introducing the connection number. The connection number is used to represent the synthetic uncertainties of the random, fuzzy and grey ones in the transmission network planning. It can also describe information of both certainty and uncertainty simultaneously, which provides a good match for the reality. A new power flow model of the connection number is presented to obtain the line power flow, and a connection number model (CNM) is developed for the overload analysis, from which the reliable section of the network is obtained. The blind number is defined to describe the flexibility of each reliable section, which is combined with the economics by the cost‐benefit analysis method to evaluate the candidate schemes. In the last section of this paper, two examples are presented on the transmission networks in China to verify the efficiency and reliability of our flexible planning method. Copyright © 2007 John Wiley & Sons, Ltd.
Factor graph based receiver design for PCC‐coded BPSK transmissions over a frequency‐selective fading channel
Authors: Flanagan Mark F. , Fagan Anthony D. 
Published: April 2007

AbstractThis paper presents an iterative receiver to detect and decode parallel concatenated convolutional (PCC) coded BPSK transmissions over a frequency‐selective Rayleigh fading channel. The scheme generalises work by Valenti and Woerner to frequency‐selective channels. A detailed derivation of the receiver from factor graph theory is presented. For the purposes of channel estimation, a Wiener filter based estimator is derived, and the interaction between the channel estimation procedure and the message‐passing algorithm is illustrated. In particular it is shown that, in contrast to Valenti and Woerner's scheme, the pilot symbols appear as variables in the factor graph, leading to the insertion and removal of ‘pilot symbol LLRs’ in the receiver. Finally, the BER performance of the system is demonstrated through computer simulations. Copyright © 2007 John Wiley & Sons, Ltd.
Design issues in the implementation of versatile, high‐speed iterative decoders
Authors: Benedetto Sergio , Dinoi Libero , Montorsi Guido , Tarable Alberto 
Published: April 2007

AbstractThe ever increasing demand for high data rate communication, and the use of radio resource management techniques requiring frame‐by‐frame adaptive coding/modulation to match user demands and channel conditions, pose a number of crucial problems to the design of versatile, high‐speed iterative decoders, for both turbo‐like and low‐density parity‐check codes. Among them, we mention:The modification of the Soft‐Input Soft‐Output (SISO) algorithm in a way that permits its implementation using several parallel processors working independently on segments of the received frame.The collisions in the process of reading/writing into/from the memory by the parallel processors.The design of prunable interleavers covering a wide range of information and/or code words lengths while keeping good spreading properties.The design of codes yielding a wide range of code rates with good performance for the range of probability of error of interest.The paper will touch all the previous points, offering state‐of‐the art solutions and examples showing their performance. Copyright © 2007 John Wiley & Sons, Ltd.
Estimating the minimum distance of large‐block turbo codes using iterative multiple‐impulse methods
Authors: Crozier Stewart , Guinand Paul , Hunt Andrew 
Published: April 2007

AbstractA difficult problem for turbo codes is the efficient and accurate determination of the distance spectrum, or even just the minimum distance, for specific interleavers. This is especially true for large blocks, with many thousands of data bits, if the distance is high. This paper compares a number of recent distance estimation techniques and introduces a new approach, based on using specific event impulse patterns and iterative processing, that is specifically tailored to handle long interleavers with high spread. The new method is as reliable as two previous iterative multiple‐impulse methods, but with much lower complexity. A minimum distance of 60 has been estimated for a rate 1/3, 8‐state, turbo code with a dithered relative prime (DRP) interleaver of lengthK = 65 536. Copyright © 2007 John Wiley & Sons, Ltd.
On the design of rate‐compatible serially concatenated convolutional codes
Authors: Amat Alexandre Graell i , Brännström Fredrik , Rasmussen Lars K. 
Published: April 2007

AbstractA powerful class of rate‐compatible serially concatenated convolutional codes (SCCCs) has been proposed based on minimising analytical upper bounds on the error probability in the error floor region. In this paper, this class of codes is further investigated by combining analytical upper bounds with extrinsic information transfer chart analysis to improve performance in the waterfall region. Following this approach, we construct a family of rate‐compatible SCCCs with low complexity and good performance in both the error floor and the waterfall regions over a broad range of code rates. The proposed codes outperform standard SCCCs and have a similar performance as more complex parallel concatenated convolutional codes (PCCCs). The proposed codes perform particularly well for high code rates. Copyright © 2007 John Wiley & Sons, Ltd.
Finding distance profiles of unequal error protection block codes
Authors: Bossert Martin , Sidorenko Vladimir , Zyablov Victor 
Published: April 2007

AbstractWe consider distance profiles of arbitrary block codes (over arbitrary alphabets) with unequal error correcting capabilities. We show that for group codes (and hence for codes linear over fields) these distance profiles can be obtained using the well known MaxLog a posteriori probability decoding algorithm. Copyright © 2007 John Wiley & Sons, Ltd.
On genomic coding theory
Authors: Dawy Zaher , Hanus Pavol , Weindl Johanna , Dingel Janis , Morcos Faruck 
Published: April 2007

AbstractThis paper gives a brief overview of several applications from the emerging interdisciplinary field of genomic coding theory that aims at applying concepts and techniques from the field of coding theory to problems from the field of molecular biology. This is motivated by the high precision and robustness found in genomic processes in addition to the increase in the availability of genomic data for a wide range of species. The considered applications include source coding for DNA classification, channel coding for modelling gene expression with emphasis on the process of translation, existence of error correcting codes in the DNA and channel coding structure in the genetic code. Example results are presented that demonstrate the relevance of the proposed approaches and open questions are formulated to suggest future research work. Copyright © 2007 John Wiley & Sons, Ltd.
Estimation of functionals over noisy channels
Authors: Barros João , Tüchler Michael 
Published: April 2007

AbstractThe combination of graphical models and belief propagation algorithms has found wide acceptance in the design of communication systems. We extend the general framework of joint source‐channel decoding on graphs to account for estimation problems in which the goal is not to decode the entire data set but to estimate a function of the transmitted data. This problem is deemed relevant, for example in the context of wireless sensor networks. Copyright © 2007 John Wiley & Sons, Ltd.
Cohen–Merhav bounds on the symbol error rate of uncoded signalling in AWGN interference
Authors: Yousefi Shahram , Holmes Billy 
Published: April 2007

AbstractUsing a recent Bonferroni‐type inequality proposed by Cohen and Merhav, we develop new tight lower bounds on the word error probability of uncoded systems with optimal Maximum A Posteriori (MAP) coherent detection for non‐uniform signalling over additive white Gaussian noise channel. Our results are compared to the state‐of‐the‐art Kuai‐Alajaji‐Takahara (KAT) lower bounds and it is shown that the superiority of one bound to another is dependent on the signal constellation, the amount of non‐uniformity of the Bernoulli source to be communicated and the SNR range of interest. It is noted that bounding techniques for the performance evaluation of communication systems are receiving increasing attention today, thanks to their suitability for a wide variety of schemes ranging from uncoded signalling to space–time‐coded multiple‐input multiple‐output (MIMO) systems. Copyright © 2007 John Wiley & Sons, Ltd.
Digital interference cancellation for DSL using information from the RS decoder
Authors: Toumpakaris Dimitris , Cioffi John M. , Gauthier F. , Zeddam A. 
Published: April 2007

AbstractOne of the factors that affect the performance of Digital Subscriber Loop (DSL) systems is non‐stationary interference, comprising of impulse noise and Radio Frequency Ingress (RFI). In order to achieve reliable transmission, DSL transceivers employ a Forward Error‐Correction scheme that consists of interleaving and Reed–Solomon (RS) encoding. Although RFI typically affects a small area of a symbol in DMT‐based DSL systems, its duration is much longer than that of impulse noise and many DMT symbols are impacted. This leads to increased interleaving and/or RS parity requirements. This paper presents a digital RFI cancellation algorithm for DMT‐based DSL systems. The method exploits information contained in the output of the RS decoder. Under certain conditions it can remove part of the effect of RFI on the received symbols and lead to reduction of the interleaving delay or the RS code parity. The technique does not require any changes at the transmitter and can therefore be incorporated in current DMT‐DSL systems. Copyright © 2007 John Wiley & Sons, Ltd.