Variable-gain up-converter with current reuse for 5-GHz WLAN applications

A variable-gain up-conversion mixer for 5-GHz WLAN applications is presented, whose input stage is based on a novel variable gain transconductor. The proposed topology features reduced power consumption by exploiting dc current reuse for mixer biasing. Moreover, a new low-consumption control circuit is introduced, which achieves a temperature-stable and linear-in-dB characteristic, providing a 40-dB dynamic range within ±1 dB gain error.     

On quartics with three-divisible sets of cusps

 We study the geometry and codes of quartic surfaces with many cusps. We apply Gr?bner bases to find examples of various configurations of cusps on quartics. Received: 10 May 2002 / Revised version: 11 November 2002 Published online: 3 March 2003 Permanent address: Institute of Mathematics, Jagiellonian University, ul. Reymonta 4, 30-059 Kraków, Poland. e-mail: rams@mi.uni-erlangen.de, rams@im.uj.edu.pl Research partially supported by the Schwerpunktprogramm ``Global methods in complex geometry' of the Deutsche Forschungsgemeinschaft, and by EAGER. Mathematics Subject Classification (2000): 14J25, 14J17     

An Enhancement of the Drezner—Wesolowsky Algorithm for Single-Facility Location with Maximin of Rectilinear Distance

In this note, we examine the algorithm of Drezner and Wesolowsky for locating a facility with maximin rectilinear distance to a given set of demand points. The concept of the closest-point constraint is introduced as a technique for increasing the efficiency of the algorithm. This potential increase in efficiency is demonstrated by an example.     

Scheduling Parts in a Combined Production-transportation Work Cell

This paper is concerned with a combined production-transportation scheduling problem. The problem comprises a simple, two-machine, automated manufacturing cell, which either stands alone or is a subunit of a complete flexible manufacturing system. The cell consists of two machines in series with a dedicated part-handling device such as a crane or robotic arm for transferring parts from the first machine to the second. The loading of a new piece on the first machine and the ejection of a finished piece from the second machine are performed by dedicated automated mechanisms. The introduction of parts into the system is done n at a time, whereby the parts are reshuffled into a sequence that minimizes completion time. All processing and transfer times are considered deterministic—a reasonable assumption for a cell comprising a robotic transfer device and two CNC machining units. What complicates the problem is the assumption of a non-negligible time for the transfer device to return (empty) from the second machine to the first. The operation is a generalization of a two-machine flowshop problem, and is formulated as a specially structured, asymmetric travelling salesman problem. An approximate polynomial time 0(n log n) algorithm is proffered. The procedure incorporates a lower bound using the Gilmore–Gomory algorithm for the no-wait, two-machine flowshop problem.     

Template synthesis in the nickel(II)–thiocarbohydrazide–propanone triple system

The complexing process proceeding in the Ni^II–thiocarbohydrazide (H₂N–H–NC(=S)–NH–NH₂)–propanone triple system in EtOH solution and nickel(II)hexacyanoferrate(II) gelatin-immobilized matrix has been studied. It has been found that in the first case, template synthesis leading, as a minimum, to formation of three coordination compounds of Ni^II with (N,N,S,S)-donor tetradentate ligands having NiL¹, NiL² and NiL³compositions where L¹ is 4,6,6-trimethyl-2,3,7,8-tetraazanonen-3-di(thiohydrazide)-1,9, L² is 4,6,6,12-tetrametyl-1,9-dithio-2,3,7,8,10,11-hexaazatridekadien-3,11-hydrazide-1 and L³ is 2,8,10,10,16-pentamethyl-5,13-dithio-3,4,6,7,11,12,14,15-octaazaheptadekatrien-2,7,15 is observed, whereas in the gelatin-immobilized matrix, a complexing process in the system considered does not occur.     

Chemische Vitamin D<Subscript>3</Subscript>-Bestimmung in Lebertran

The different aspects of Vitamin D₃ determination and the data reported in the literature are discussed. The spectrophotometric determination of Vitamin D₃ in cod-liver oil is carried out after the alkaline saponification, extraction of unsaponified parts, precipitation of accompanying sterols and the column- and thin-layer chromatographic purification and separation of vitamin D₃ on 40 cm plates from other vitamins. The dyestuff α-naphtholbenzein is suited well as standard substance for the better location and identification of vitamin D₃ zone on the thin-layer plate. The results obtained from the chemical method were checked through the simultaneous biological determination.     

Clumping Data in 2-Way Tables: A User-Orientated Perspective

Following a critique of existing algorithms, an algorithm is presented which will re-organize a 2-way data table to bring like rows together, and like columns together. Extensions of the method are described, and justified, to accommodate distances measured in modular arithmetic, and with bipolar columns/rows, as in repertory grid analysis. One value of the algorithms is that the user can see relationships in the tables without the data in the cells themselves ever having been transformed. Thus, users will continue to feel they own their data.     

Refining the Diffusion Approximation for the <Emphasis Type="Italic">GI</Emphasis><Superscript><Emphasis Type="Italic">x</Emphasis></Superscript><Emphasis Type="Italic">/G/c</Emphasis> Queue

This paper deals with the GI ^x /G/c queueing system in a steady state. We refine a diffusion approximation method incorporating the constraint of traffic conservation for general queueing systems. An approximate expression for the distribution of the number of customers is obtained. Numerical results are presented to show that the refined model provides improved performance.     

Λ-Shaped Policies to Schedule Deteriorating Jobs

We study a problem of scheduling deteriorating jobs, i.e. jobs whose processing times are an increasing function of their starting times. We consider the case of a single machine and linear job-independent deterioration. The objective is to minimize the sum of weighted completion times, with weights proportional to the basic processing times. The optimal schedule is shown to be Λ-shaped, i.e. the sequence of the basic processing times has a single local maximum. Moreover, we show that the problem is solved in O(N log N) time. In the last section we test heuristics for the case of general weights.