Distributed channel assignment strategies using coexistenceetiquettes for land based radio environment

The performance of two distributed channel assignment algorithms which use coexistence etiquettes for point to point links are considered by the authors. It has been found that selecting channels prior to transmission at the transmitter as opposed to the receiver, supports greater offered traffic with the additional advantage of a less complex protocol     

Thermally insulating behaviour of single and multiple layers of textiles under wind assault

One or more layers of textiles can provide a thermal resistance between the human body and its environment, and so help maintain the body in a thermally comfortable state. The effect of wind on and its penetration through such thermal cladding is examined experimentally.     

Comparison between normal and reverse thin crystalline silicon solar cells

The newly developed ingot growing techniques, as the three-grain and the columnar multigrain ingot processes, are now offering the possibility of slicing thinner wafers (≤ 100 μm). In this paper we present the results obtained on p type large area (≥ 100 cm²) and 100 μm thick wafers by using both conventional and reverse cell manufacturing technologies.The conventional cells are provided with aluminium or boron BSF plus screen-printed silver mirror or a silver-aluminium net; the reverse cells have a FSF and the deep back junction completely covered by a screen-printed or CVD silver layer.The constructing parameters have been chosen on the base of one and two dimensions modeling and both raw material and devices have been completely characterized.This work shows that very thin wafers do not introduce serious problems for the conventional manufacturing of solar cells. The efficiencies of the normal and of the reverse cells are found to be comparable and are of the same order than those of thicker cells, however at a significant lower cost. The main obtained result has to be related to the demonstration of a cell manufacturing feasibility starting from very thin wafers.     

The application of transmission-line modelling to the simulation ofan induction motor drive

The simulation of a complete induction motor drive is presented. The entire network is modelled using the transmission-line modelling (TLM) technique. The network is split into three sections which are solved independently and are joined together by link transmission-line models. Advantages of this approach are the explicit nature of the algorithm which remains unaltered irrespective of the network topology, unconditional stability, and straightforward modelling of switching elements. Results are presented for a complete drive which illustrate the capabilities and flexibility of the simulation technique     

Markets and Hierarchies and (Mathematical) Economic Theory

Over the past decade transaction-cost economics has been partiallytranslated in the more mathematical language of game theory,and understanding of the costs of transactions has been deepened,refined and extended. But the translation is incomplete: a greatdeal of human behaviour is missed, and doing game theory withmore life-like models of individuals will bring theory closerto phenomena. Transaction-cost economics, particulary the economicsof relational contracts, provides a major arena for these developments,since the important issues of bounded rationality and individualbehavior are central to the topic.     

Effective biased estimates for parameters of binomial distributions and allowance fora priori information

We obtain expressions for biased estimates for parameters of binomial distributions with allowance fora priori information; our starting poins is the Rao-Kramer inequality. Translated from Izmeritel'naya Tekhnika, No. 10, pp. 14–16, October, 1996.     

Analysis of macro-dataflow dynamic scheduling on nonuniform memoryaccess architectures

The author studies dynamic scheduling of computational tasks with communication costs using nonuniform memory access architecture. The computing model assumes that data transfer can be partitioned into parallel and sequential parts with respect to the task execution. A scheduling heuristic, called least-communication (LC), together with a two-level scheduler is proposed in an attempt to minimize the finish time. The LC selects the task that removes the largest amount of remaining data transfer, if no such tasks are available the task that has been ready to run at the earliest is selected first. The time complexity of LC is O(n₂). Testing the finish time of LC and first-come first-served scheduling (FCFS) shows that LC is useful for tasks having moderate granularity and whose computation and communication requirements vary widely for different data sets