With the conceptualization of next generation architecture for Data Warehousing, that is the DW 2.0, there is now an increased emphasis on using fully-temporalized databases, in particular with approaches such as the Data Vault. In this paper we present a template XML Schema for Data Vault model concepts (at a metamodel level) and a process for creating XML Schemas for data warehouse designs represented as Data Vault models. These templates can be used to describe and present data from disparate systems in a structured format suitable for exchange and loading into a data warehouse.

The effectiveness of the small cells for capacity relief in modern heterogeneous networks is analyzed. Based on the real network traffic data, we demonstrate that a few (1 to 3) properly deployed small cells in less than one third of the present macro sectors can often triple the network capacity, due to the non-uniformity of the traffic load. Some practical issues related to planning and deployment of the small cell solutions in the field are also discussed and a few real life examples shown.

Nowadays most of the attention is on instantiating undergraduate programs in Software Engineering. Given that many of the master programs are well established, certainly there are lessons learned and advances in pragmatics of instruction that will be of help to new Undergraduate Programs. Furthermore variations of intent and organization of existing master programs provide numerous models of interest for undergraduate programs. And finally, the future of undergraduate education in Software Engineering cannot be fully discussed without an assessment of the trends among graduate programs, including what is going on at the Doctoral level. Lack of qualified teachers in numbers needed for a growing number of undergraduate programs is also a concern. The panel will focus on Master Level Curriculum Models and Pragmatics of Instruction in form of Lessons Learned in direct experience with Master Programs in Software Engineering and Software Engineering Management..

Professional societies in IT and accreditation bodies of engineering and computer science may be in dispute while international recognition of professionals is necessary. Can a possibly independent accreditation body, aligned with the proposed IFIP Standard on IT Professionalism, help the software engineering profession?.

Non-coherent detectors for initial code synchronization (acquisition) of BPSK direct sequence spread spectrum signals on an AWGN channel are analyzed. In addition to the thermal noise, in many applications such detectors are faced with the "self-noise", due to the partial period correlations. Under the random code sequences assumption, in this paper an exact analysis of the non-coherent correlator's detection performance is carried out by using the theory of circularly symmetric random variables. The exact analysis shows that the familiar Gaussian approximation to the distribution function of the code self-noise is justified for all cases of practical interest. Furthermore, the overall detection performance was found to be determined asymptotically by the sum of the thermal and correlator's self-noise. In most cases of practical interest, this asymptotic result provides a very good approximation to the actual detection performance of a non-coherent correlator, improving the approximations devised previously.>

This paper describes a set of measurements performed in five existing cells in the Toronto area, in order to assess the impact of multipath propagation on the performance of the CTIA IS-54 digital standard. A sweeping correlator apparatus with a 0.1 mu s resolution and 910 MHz carrier frequency was used. Generally, the measurements exhibit multipath propagation with considerably smaller excess delays than some reported recently but are consistent with earlier results obtained in the U.S. and Europe. In view of the results, it appears that the long delay (high selectivity) problem has been somewhat over-emphasized in the past, at least for areas like Toronto. Problems associated with short delays (flat fading), on the contrary, appear to have been underestimated, although these would be typical in any dense urban environment.>

By using the direct approach to the analysis of the serial-search spread-spectrum code acquisition, the author presents the approximate analysis of the cumulative probability density function (CDF) of the acquisition time. This approach is based on the binomial approximation to the distribution of the partial acquisition times, instead of the Gaussian one used previously. The binomial approximation gives very accurate results but, more importantly, it shows that the analysis of the arbitrary detection/verification scheme can be reduced to the much simpler analysis of the equivalent single-dwell system, whose parameters depend only on the mean test times and not on their distribution. Based on the exact results, simple closed-form approximations are derived for the CDF in the case of the straight-line serial search with uniform a priori distribution, which might be useful in practice.>

A 'direct' approach to obtain statistics of the code acquisition time for serial-search spread-spectrum receivers is presented, which combines the idea of algebraic characterization of the search with transform domain methods. This is a very general unified technique, yielding many other known results as special cases. One of the major advantages of the direct approach is that the effect of the search strategy on moments of the acquisition times can be isolated from the effect of the detection/verification logic. This fact will permit one both to analyze all known search strategies-confirming several conclusions regarding their comparative performance-and to propose two novel strategies (alternate search) which outperform the conventional ones when the code rewinding time is small in comparison to the dwell times. Optimum search strategy based on the maximum a posteriori criterion (MAP) is analyzed, thus ensuring an absolute and uniform basis of comparison. The two new strategies perform well by this measure.>

For some time it has been known that, for fixed code lengthn, binary BCH codes appear to be most efficient when the number of information bitskis between1/4 nand3/4 n[1, p. 443], [2, p. 219]. In this correspondence the efficiency of block codes on an binary-quantized additive white Gaussian noise channel is analyzed as a function of the code rater = k/nfor hard decision decoding. A closed form analytical expression for the upper and lower bounds on block code performance is derived for large code lengthsn. They show that, for best codes, a relatively broad maximum occurs for rates of approximately 0.4. The performance of the BCH codes is also compared with the bounds.

In this paper a new modulator for a broad class of continuous phase modulations (CPM) is proposed that is more flexible and less complex than conventional quadrature modulators, while achieving the same or better performance. Being all-digital it is more suitable for one-chip VLSI implementation. Some design parameters are also discussed and experimental results are presented.

The coding gain of linear binary block codes on the AWGN channel is studied. Antipodal signaling and hard decision demodulation are assumed. Simple asymptotic expressions for the gain at high and low energy to noise spectral density ratios are derived. Monotonicity of the coding gain is also discussed.