5,980 research outputs found
The Evaluation of Telephone Conselling of Community Mental Health Center of Taipei City.
No full textThe Evaluation of Telephone Counselling of Community Mental Health Center of Taipei City.
No full textExit Chart Aided Irregular Convolutional Code Design for Iterative Downlink SDMA Systems using Imperfect Channel State Information
Full text linkWe analyze a precoded and iteratively detected downlink multiuser system employing imperfect Spatio-Temporal Channel Impulse Response at the Transmitters (ST-CIRT) with the aid of Extrinsic Information Transfer (EXIT) charts. A Precoded Iterative DownLink Space Division Multiple Access (PI-DLSDMA) system proposed in our previous research is further improved and shown to be capable of maintaining an infinitesimally low BER, despite using imperfect ST-CIRT. A further novel feature of the PI-DL-SDMA system is that we design an IrRegular Convolutional Code (IRCC) with the aid of EXIT chart analysis for creating an open EXIT tunnel between the inner decoder’s and outer decoder’s EXIT curve at a reduced Eb/N0 value and hence maintain an infinitesimally low BER. Index Terms— SDMA, downlink, iterative, EXIT char
Interactively using Semantic Web knowledge: Creating scalable abstractions with FacetOntology
No full textThe amount of knowledge accessible on the Semantic Web is growing, and there is a need for a scalable solution to facilitate exploring that data. Currently approaches to exploring Semantic Web data either focus on exploring resources individually, following links during exploration, and making little use of collated data, or take the approach of collating and aligning multiple sources into one store for one purpose, and hand-crafting a specific browsing interface onto it. We present an approach that provides a scalable browsing interface, which can browse knowledge from the Semantic Web at will. Our approach creates abstractions of knowledge, collated into facets, which are described using FacetOntology. FacetOntology facilitates describing facets from RDF data, suitable for use in creating datasets for faceted browsing
Growth Morphologies and Mechanisms of Non-Equilibrium Solidified MC Carbide
No full textGrowth morphologies and mechanisms of the carbide of group IVB and VB elements (MC carbide), a typical faceted crystal, were studied with an estimated cooling rate from 102 to 105 K/s. Results showed that although the growth morphologies of the MC carbide vary remarkably with solidification cooling rate, the solid/liquid interface is always atomically smooth, and the growth mechanisms are always lateral growth. The growth mechanism transition from lateral to continuous growth mode, which was predicted by the classic crystal growth theory, was not observed for the TiC type MC carbide within the estimated cooling rate range of 102?105 K/s
Quantum search algorithms, quantum wireless, and a low-complexity maximum likelihood iterative quantum multi-user detector design
No full textThe high complexity of numerous optimal classic communication schemes, such as the maximum likelihood (ML) multiuser detector (MUD), often prevents their practical implementation. In this paper, we present an extensive review and tutorial on quantum search algorithms (QSA) and their potential applications, and we employ a QSA that finds the minimum of a function in order to perform optimal hard MUD with a quadratic reduction in the computational complexity when compared to that of the ML MUD. Furthermore, we follow a quantum approach to achieve the same performance as the optimal soft-input soft-output classic detectors by replacing them with a quantum algorithm, which estimates the weighted sum of a function’s evaluations. We propose a soft-input soft-output quantum-assisted MUD (QMUD) scheme, which is the quantum-domain equivalent of the ML MUD. We then demonstrate its application using the design example of a direct-sequence code division multiple access system employing bit-interleaved coded modulation relying on iterative decoding, and compare it with the optimal ML MUD in terms of its performance and complexity. Both our extrinsic information transfer charts and bit error ratio curves show that the performance of the proposed QMUD and that of the optimal classic MUD are equivalent, but the QMUD’s computational complexity is significantly lower
Ruth Klüger: la creatività per non “smarrirsi strada facendo”
No full textR. Klüger, a jewish viennese, a US citizen and a germanist, is the Author of two autobiographies “weiter leben”and “unterwegs versore”. Written in a style which alternates between essay and poetry, account and recollection, they are the occasion for the Author to establish a dialogue with the women having as a focus the exchange of experiences and reflections over the status of the feminine emancipation
Eutectic MC Carbide Growth Morphologies of a Laser Clad TiC/FeAl Composite Coating
No full textIn this paper, eutectic MC carbide growth morphology and its evolution with laser scanning speed were studied comprehensively of a laser clad MC carbide reinforced FeAl intermetallic matrix composite coating. As the laser scanning speed increased, the growth morphology of eutectic MC carbide was found to be needle-aligned annulation, butterfly-like and well-developed dendrite
Distributed Self-Concatenated Coding for Cooperative Communication
No full textIn this paper, we propose a power-efficient distributed binary self-concatenated coding scheme using iterative decoding (DSECCC-ID) for cooperative communications. The DSECCC-ID scheme is designed with the aid of binary extrinsic information transfer (EXIT) charts. The source node transmits self-concatenated convolutional coded (SECCC) symbols to both the relay and destination nodes during the first transmission period. The relay performs SECCC-ID decoding, where it mayor may not encounter decoding errors. It then reencodes the information bits using a recursive systematic convolutional (RSC) code during the second transmission period. The resultant symbols transmitted from the source and relay nodes can be viewed as the coded symbols of a three-component parallel concatenated encoder. At the destination node, three-component DSECCC-ID decoding is performed. The EXIT chart gives us an insight into operation of the distributed coding scheme, which enables us to significantly reduce the transmit power by about 3.3 dB in signal-to-noise ratio (SNR) terms, as compared with a noncooperative SECCC-ID scheme at a bit error rate (BER) of 10-5. Finally, the proposed system is capable of performing within about 1.5 dB from the two-hop relay-aided network’s capacity at a BER of 10-5 , even if there may be decoding errors at the relay
EXIT-chart Aided Joint Source-Coding, Channel-Coding and Modulation Design for Two-Way Relaying
Full text linkIn this contribution, we have proposed and investigated an attractive Joint Source-coding, Channel coding and Modulation (JSCM) scheme for a two-way relaying system. We commence by quantifying the achievable capacity of the corresponding two-way relay channel, before proposing low-complexity source coding schemes for concatenation with bandwidth-and power-efficient coded modulation schemes. Extrinsic Information Transfer (EXIT) charts is used to investigate the decoding convergence of the joint source and channel decoder as well as for the overall system design. The quality of the decoded source signals is quantified using the Bit-Error Ratio (BER) metric. It is found that the two-way relay based JSCM scheme is capable of attaining a combined coding and relaying gain of 5.7 dB over the conventional non-cooperative JSCM scheme, when communicating over uncorrelated Rayleigh fading channels in an outdoor environment
- …
