Miracle-dz/UniFAR-FTUs huggingface dataset:
Trellis-coded modulation and transmit diversity: design criteria and performance evaluation

This paper presents the selection criteria for trellis codes used with the simple transmit diversity scheme proposed in Alamouti (1998) and reviewed in this paper. The optimum metrics for soft decision Viterbi decoding are derived and the asymptotic coding gains are calculated. The design method achieves both coding gain and a diversity order of 2 using 2 transmit antennas and 1 receive antenna. It is also demonstrated that trellis codes optimized for AWGN are also optimal for use in conjunction with the transmit diversity scheme in Rayleigh fading.
Reliable Reasoning: Induction and Statistical Learning Theory

In Reliable Reasoning, Gilbert Harman and Sanjeev Kulkarni -- a philosopher and an engineer -- argue that philosophy and cognitive science can benefit from statistical learning theory (SLT), the theory that lies behind recent advances in machine learning. The philosophical problem of induction, for example, is in part about the reliability of inductive reasoning, where the reliability of a method is measured by its statistically expected percentage of errors -- a central topic in SLT. After discussing philosophical attempts to evade the problem of induction, Harman and Kulkarni provide an admirably clear account of the basic framework of SLT and its implications for inductive reasoning. They explain the Vapnik-Chervonenkis (VC) dimension of a set of hypotheses and distinguish two kinds of inductive reasoning. The authors discuss various topics in machine learning, including nearest-neighbor methods, neural networks, and support vector machines. Finally, they describe transductive reasoning and suggest possible new models of human reasoning suggested by developments in SLT.
On the application of hierarchical cluster analysis for synthesizing low‐level wind fields obtained with a mesoscale boundary layer model

Hierarchical clustering is applied to a boundary layer model output that describes the low‐level wind field over the La Plata River region of South America. The model output consists of 180 17‐dimensional vectors per season that include wind direction frequencies, calms and mean wind speeds per wind sector. The cluster approach is intended to assist the discussion of meteorological phenomena, and is also employed to define regionality. Results show that the 180 original vectors can be well represented by a small number of vectors, and the 18, 12 and 6 group cluster solutions share a similar layout. However, the 12 and the 6 group clusters seem both appropriate solutions when a threshold of 10% in wind direction frequency, including calms, is taken as a reference in order to decide significant differences between groups. All solutions show more groups along the northeastern than along the southwestern river shore, evidencing a complex sea‐land breeze circulation pattern. The analysis of the observations at nine weather stations supports the findings of the cluster analysis conducted with the model outputs. The advantage of the hierarchical cluster analysis in synthesizing information becomes clearly evident when compared to the traditional method of visual inspection. Besides, the actual distribution of weather stations in the region is not very far from the regionality that suggests the obtained cluster distribution. However, in order to match the latter, more observing points would be needed particularly over the river and towards the northeastern shore.
The LEAPS Algorithm

LEAPS is a state of the art production system compiler that produces the fastest sequential executable OPS5 rule sets. The performance of LEAPS is due to its reliance on complex data structures and search algorithms to speed rule processing. In this paper, we explain the LEAPS algorithms in terms of the programming abstractions of the P2 data structure compiler. THIS PAPER IS NOT AVAILABLE IN HARD COPY.
Enhanced convolution approach for CAC in ATM networks, an analytical study and implementation

The characteristics of service independence and flexibility of ATM networks make the control problems of such networks very critical. One of the main challenges in ATM networks is to design traffic control mechanisms that enable both economically efficient use of the network resources and desired quality of service to higher layer applications. Window flow control mechanisms of traditional packet switched networks are not well suited to real time services, at the speeds envisaged for the future networks. In this work, the utilisation of the Probability of Congestion (PC) as a bandwidth decision parameter is presented. The validity of PC utilisation is compared with QOS parameters in buffer-less environments when only the cell loss ratio (CLR) parameter is relevant. The convolution algorithm is a good solution for CAC in ATM networks with small buffers. If the source characteristics are known, the actual CLR can be very well estimated. Furthermore, this estimation is always conservative, allowing the retention of the network performance guarantees. Several experiments have been carried out and investigated to explain the deviation between the proposed method and the simulation. Time parameters for burst length and different buffer sizes have been considered. Experiments to confine the limits of the burst length with respect to the buffer size conclude that a minimum buffer size is necessary to achieve adequate cell contention. Note that propagation delay is a no dismiss limit for long distance and interactive communications, then small buffer must be used in order to minimise delay. Under previous premises, the convolution approach is the most accurate method used in bandwidth allocation. This method gives enough accuracy in both homogeneous and heterogeneous networks. But, the convolution approach has a considerable computation cost and a high number of accumulated calculations. To overcome this drawbacks, a new method of evaluation is analysed: the Enhanced Convolution Approach (ECA). In ECA, traffic is grouped in classes of identical parameters. By using the multinomial distribution function instead of the formula-based convolution, a partial state corresponding to each class of traffic is obtained. Finally, the global state probabilities are evaluated by multi-convolution of the partial results. This method avoids accumulated calculations and saves storage requirements, specially in complex scenarios. Sorting is the dominant factor for the formula-based convolution, whereas cost evaluation is the dominant factor for the enhanced convolution. A set of cut-off mechanisms are introduced to reduce the complexity of the ECA evaluation. The ECA also computes the CLR for each j-class of traffic (CLRj), an expression for the CLRj evaluation is also presented. We can conclude that by combining the ECA method with cut-off mechanisms, utilisation of ECA in real-time CAC environments as a single level scheme is always possible.
DESAIN BOOTH DISPLAY RAMAH LINGKUNGAN UNTUK PEMASARAN PRODUK OLAHAN HASIL TAMBAK

Permasalahan yang ada pada pengrajin produk olahan hasil tambak di Desa Tambak Oso Sidoarjo adalah dari segi pemasaran. Pengembangan industri produk olahan hasil tambak saat ini masih terbatas pada lingkup pasar lokal karena penggunaan strategi pemasaran yang masih sederhana . Salah satu media pemasaran yang dinilai cukup efektif adalah pameran produk baik dalam event tertentu ataupun mendisplay di rumah mereka masing masing karena dapat menawarkan secara langsung kepada masyarakat atau konsumen dan bisa langsung merespon produk tersebut. Didalam proses mendisplay tersebut dibutuhkan stand atau booth untuk bisa memajang produk mereka dengan menarik dan praktis. Menarik dalam arti mempunyai bentuk yang indah yang bisa menunjang produk mereka, praktis dalam arti dapat digunakan berulang kali serta mudah dalam hal pemasangan dan pembongkarannya . Sistem model booth display yang akan dikenalkan adalah sistem teknologi knockdown yaitu menggunakan beberapa bagian yang terpisah dan dapat dipasang langsung di lokasi secara cepat sehingga bisa menghemat waktu dan biaya , bisa digunakan untuk memfasilitasi beberapa produk yang berbeda sehingga lebih efektif dan efisien , m udah dalam pemasangan dan pembongkaran dan memudahkan dalam packaging. Sedangkan material yang digunakan adalah material yang ramah lingkungan dengan karakter material yang bisa diperbaharui, didaur ulang dan rendah penghabisan energi. Dengan adanya desain booth display ramah lingkungan ini diharapkan penjualan produk hasil olahan tambak di Desa Tambak Oso Sidoarjo semakin meningkat sehingga akan meningkatkan pendapatan para pengrajin serta menjadikan desa Tambak Oso lebih dikenal dan nantinya bisa menjadi desa wisata. Kata kunci : pameran, booth display, tambak DOI : https://doi.org/10.33005/envirotek.v10i1. 1168
Orthographic and phonological processing in English word learning

This thesis investigates the process of orthographic and phonological word learning in adults. Speed of reading aloud is used as the main measure, specifically the reduction in naming reaction times (RTs) to short and long novel words through repetition and the convergence of RTs to short and long items. The first study (Chapter 2) fully described this fundamental learning paradigm and it is then used to compare various types of training in different groups of readers in the following chapters. Second, the role of phonology in visual word learning was investigated in Chapter 3. Novel words that received the training of both orthography and phonology (reading aloud condition) was found to be more efficient and effective compared to solely training the phonology of the novel words (hear-and-repeat with and without distractors). Yet, all three experiments in Chapter 3 also showed that the establishment of a phonological representation of a novel word can be sufficient of result in representations in the mental lexicon even without any encounter with the orthographic form of the novel word. Linear mixed effect modelling also found that literacy and phonological awareness made a significant contribution to nonwords naming speed when vocabulary and rapid digit naming were taken into account. Expressive vocabulary was found to be a significant predictor of the change in naming speed across the learning session when the effects of literacy, phonological awareness were controlled. Third, Chapter 4 then involved the repeated presentation of interleaved high-frequency words, low-frequency words and nonwords to native speakers of English in two testing sessions 28 days apart. Theoretical interest lies in the relative effects of length on naming latencies for high-frequency words, low-frequency words and nonwords, the extent to which those latencies (RTs) converge for shorter and longer words and nonwords, and the persistence of training/repetition effects over a 28-day retention interval. Finally, Chapters 5 and 6 try to bring these theories in a more applied context to understand orthographic word learning in adults with dyslexia and in bilingual speakers.
Evaluation of TCP Congestion Control Algorithms on the Windows Vista Platform

CTCP, an innovative TCP congestion control algorithm developed by Microsoft, is evaluated and compared to HSTCP and StandardTCP. Tests were performed on the production Internet from Stanford Linear Accelerator Center (SLAC) to various geographically located hosts to give a broad overview of the performances. We find that certain issues were apparent during testing (not directly related to the congestion control algorithms) which may skew results. With this in mind, we find that CTCP performed similarly to HSTCP across a multitude of different network environments. However, to improve the fairness and to reduce the impact of CTCP upon existing StandardTCP traffic, two areas of further research were investigated. Algorithmic additions to CTCP for burst control to reduce the aggressiveness of its cwnd increments demonstrated beneficial improvements in both fairness and throughput over the original CTCP algorithm. Similarly, {gamma} auto-tuning algorithms were investigated to dynamically adapt CTCP flows to their network conditions for optimal performance. While the effects of these auto-tuning algorithms when used in addition to burst control showed little to no benefit to fairness nor throughput for the limited number of network paths tested, one of the auto-tuning algorithms performed such that there was negligible impact upon StandardTCP. With thesemore » improvements, CTCP was found to perform better than HSTCP in terms of fairness and similarly in terms of throughput under the production environments tested. « less
A solution to the robust flow control problem for networks with multiple bottlenecks

The flow control problem in multi-bottleneck networks is considered. An optimization problem is formulated in order to design decentralized controllers which are robust to time-varying uncertain multiple time-delays. It is shown that this optimization problem can be decomposed into a number of subproblems, where each subproblem can be solved as in the single-bottleneck case, which had been considered previously (Ataslar et al. (2000)).
Consensus control for high-order multi-agent systems [Brief Paper]

In this study, the lth order (l ≥ 2) consensus problem for multi-agent systems is considered, which generalises the existing second-order consensus algorithm. A linear consensus protocol is proposed for solving such a consensus problem, which includes two parts: a feedback controller and interactions from the neighbours. A sufficient and necessary condition for consensus in high-order systems is obtained. As special cases, criteria for second- and third-order systems are given, in which the exact relationship between feedback gain and system parameters is established. Finally, numerical simulations are reported to illustrate the effectiveness of this protocol.
A Framework for Knowledge Derivation Incorporating Trust and Quality of Data

Today, across all major industries gaining insight from data is seen as an essential part of business. However, while data gathering is becoming inexpensive and relatively easy, analysis and ultimately deriving knowledge from it is increasingly difficult. In many cases, there is the problem of too much data such that important insights are hard to find. The problem is often not lack of data but whether knowledge derived from it is trustworthy. This means distinguishing “good” from “bad” insights based on factors such as context and reputation. Still, modeling trust and quality of data is complex because of the various conditions and relationships in heterogeneous environments. The new TrustKnowOne framework and architecture developed in this dissertation addresses these issues by describing an approach to fully incorporate trust and quality of data with all its aspects into the knowledge derivation process. This is based on Berlin, an abstract graph model we developed that can be used to model various approaches to trustworthiness and relationship assessment as well as decision making processes. In particular, processing, assessment, and evaluation approaches are implemented as graph expressions that are evaluated on graph components modeling the data. We have implemented and applied our framework to three complex scenarios using real data from public data repositories. As part of their evaluation we highlighted how our approach exhibits both the formalization and flexibility necessary to model each of the realistic scenarios. The implementation and evaluation of these scenarios confirms the advantages of the TrustKnowOne framework over current approaches.
A probability-based adaptive algorithm for call admission control in wireless network

A probability-based adaptive algorithm for call admission control in wireless network is proposed and validated. The algorithm is somewhat similar to that of RED (random early detection), which is based on probability to control the guard channels according to controlled QoS measure. The QoS measures studied are call-blocking probability, handoff-call blocking probability and system utility. Simulations are compared to study the performance of the probability-based algorithm, the guard channel algorithm, and the adaptive algorithm devised by Yi Zhang. And results show that the probability-based algorithm outperforms the latter two algorithms in QoS measures.
Real-time scattering compensation for time-of-flight camera

3D images from time-of-flight cameras may suffer from false depth readings caused by light scattering. In order to reduce such scattering artifacts, a scattering compensation procedure is proposed. First, scattering is analysed and expressed as a linear transform of a complex image. Then, a simple scattering model is formulated. Assuming a space invariant point spread function as a model for the scattering leads to a solution in a form of a deconvolution scheme whose computational feasibility and practical applicability are further discussed in this paper.
Inverse Methods for Atmospheric Sounding: Theory and Practice

Remote sounding of the atmosphere has proved to be a fruitful method of obtaining global information about the atmospheres of the earth and planets. This book treats the inverse problem of remote sounding comprehensively, and discusses a wide range of retrieval methods for extracting atmospheric parameters of interest from the quantities such as thermal emission that can be measured remotely. Inverse theory is treated in depth from an estimation-theory point of view, but practical questions are also emphasized, for example designing observing systems to obtain the maximum quantity of information, efficient numerical implementation of algorithms for processing of large quantities of data, error analysis and approaches to the validation of the resulting retrievals, The book is targeted at both graduate students and working scientists.
BBOB 2009: Comparison Tables of All Algorithms on All Noiseless Functions

This document presents the results in the form of tables from the Black-Box Optimization Benchmarking (BBOB) workshop of the Genetic and Evolutionary Computation Conference (GECCO), Montreal Canada, 2009. Each table presents the comparative performances of the algorithms submitted to BBOB 2009 on one problem from the function testbed.
On Colour Categorisation

This thesis presents research that explores some of the issues in colour categorisation. The main issues explored are, firstly, the nature of the coding processes involved in representing colour categories and making colour judgements and secondly, the role of language in colour categorisation. It is shown that colour categories seem to be represented as separate internal codes; the influence of colour categories on colour judgements is partly a junction of the task requirements. For both category-identity and physicalidentity judgements, decisions about colours separated by inter-stimulus delay were more likely to show effects of categorisation than decisions about simultaneously presented colours. However, it was found that for visual search, category effects could be found with simultaneously presented colours. Evidence from the effects of interference on colour judgements suggested that categorical perception (CP) of colour is dependent on the availability of category labels and suggests that CP in colour at least, is a direct language effect. However, category identity judgements of colour showed no selective effect of verbal interference suggesting that a non-verbal category code is involved in making these decisions. Consistent with this claim was the finding of no hemispheric advantage for category identity judgements. Comparisons on three colour tasks (sorting, triads and visual search) were made between English and Ndonga speakers to further test the role of language in colour categorisation. While English has all eleven universal categories (Berlin & Kay, 1969), the Ndonga language lacks unique terms for some of these basic categories. Effects of this difference were found on all three tasks consistent with language being involved in colour category representation although it was unclear whether this was a direct language effect or whether there were genuine differences in perception between the two groups acquired as a result of colour language.
E-Government Readiness Assessment Model

This study presents a general framework model for E-Government Readiness Assessment. There are six necessary key factors to implement any E-government initiative worldwide. These factors represent the basic components to be assessed before launching the "e-initiative" to guarantee the right implementation in the right direction. The organization building blocks need to be assessed are: Organizational Readiness, Governance and leadership Readiness, Customer Readiness, Competency Readiness, Technology Readiness and Legal Readiness[1]. In the Organizational readiness, bureaucratic nature of E-Governments, business process, long process delay and need for re-engineering will be discussed. In the Governance and Leadership Readiness, the importance of leadership and governance for the e-initiative, the importance of procedures, service level agreement, the way public officials perform, commitment and accountability for public jobs, all will be shown. In the Customer readiness, the main public concerns regarding accessibility, trust and security will be highlighted. In the Competency readiness, the lack of qualified personnel in the public sector and the different alternatives to overcome this issue will be discussed. In the Technology readiness, too many issues worth to be considered, such as hardware, software, communication, current technology, legacy systems, sharing applications and data and setting secure infrastructure to exchange services. The last factor is the Legal readiness where the adoption of the Jordanian Temporary law No 85 in the year 2001 "Electronic Transaction Law" ETL paved the road towards the big shift for e-initiative and privacy. Some of these will be discussed in detail. The need for this detail arises from the fact that all government activities are governed by law. For this reason, it is important to start from this key factor