Miracle-dz/UniFAR-FTUs huggingface dataset:
SRW/U as a Lingua Franca in Managing the Diversified Information Resources

The rapid evolution of information technology and internet has made explosive growth of information resources. The results from different resources are provided in different formats, which make them difficult to search and subsequently merge for providing a federated framework. eXtensible Markup Language (XML) is the 'Lingua Franca': a common language that two computers can use to efficiently speak with one another. Z39.50 protocol was initially developed for bridging the search of the diversified heterogeneous information resources. As the advancement in the technology, Z39.50 protocol has evolved into Search Retrieval Webservices/Uniform resource identifier (SRW/U) protocol. In this paper an SRW/U interface is discussed for providing a common search platform in the diversified heterogeneous applications. The methodology used is the Contextual Query Language (CQL) in the searching technique. The diversified information resources discussed in this paper are KOHA (library automation software), GreenStone Digital Library Software (GSDL) (digital library software) and the pool of information resources created by WAMP (Windows, Apache, Mysql, Php) search.
A password authentication method for remote users based on smart card and biometrics

Abstract Das has improved the biometric-based remote user authentication using smart card [13]. This scheme is based on biometric, password, and the random nonce generated by the user and the server. It is very efficient as far as the computational cost is concerned. This scheme however has some security weaknesses such as replay and offline password guessing attacks. In this paper, we present a review of the Das’s scheme and discuss its weaknesses. In this paper, we develop a new scheme that overcomes all its weaknesses.
Reliability of scrubbing recovery-techniques for memory systems

The authors analyze the problem of transient-error recovery in fault-tolerant memory systems, using a scrubbing technique. This technique is based on single-error-correction and double-error-detection (SEC-DED) codes. When a single error is detected in a memory word, the error is corrected and the word is rewritten in its original location. Two models are discussed: (1) exponentially distributed scrubbing, where a memory word is assumed to be checked in an exponentially distributed time period, and (2) deterministic scrubbing, where a memory word is checked periodically. Reliability and mean-time-to-failure (MTTF) equations are derived and estimated. The results of the scrubbing techniques are compared with those of memory systems without redundancies and with only SEC-DED codes. A major contribution of the analysis is easy-to-use expressions for MTTF of memories. The authors derive reliability functions and mean time to failure of four different memory systems subject to transient errors at exponentially distributed arrival times. >
Scalable distributed data fusion

Measurement and track fusion in decentralised sensor network architectures is investigated. The investigation employs FLAMES/sup TM/, an advanced military scenario generator. This was specifically customised for distributed data fusion experiments and involves a model of the delays in a realistic communication system. Here the delays were used to modify communication bandwidth and evaluate how this affected the performance of the fusion architectures/algorithms. Under certain scenario conditions, it was found that the decentralised measurement fusion system was severely affected by reduced bandwidth. This is because it does not scale: each node loads its communication buffer with every measurement and consequently some measurements are never transmitted. The decentralised track fusion system is a better performer because it does scale: measurements are fused into tracks prior to transmission and thereby more effective use of bandwidth is made. Moreover, it was found that a partially connected decentralised track fusion system achieved almost optimal fused track performance.
Evaluation of communication bandwidth control mechanism by regulating program execution speed

With the spread of the Internet, services that communicate to other services are increasing. Multimedia applications such as video on demand also ask for network Quality of Service (QoS). Thus, operating systems have to guarantee the allocation of computer resources to services. The computer resources are CPU, disk, network devices and so on. We suppose that the communications have to be controlled well, because services using network are increasing. This paper proposes the communication bandwidth control mechanism by regulating program execution speed. Our proposed mechanism is based on the process schedule method for regulating program execution speed. In the process schedule method, the operating system reserves the amount of CPU time of target processes and guarantees the allocation of CPU time on a sending host. Our proposed mechanism can guarantee a required data rate of target processes by allocating enough CPU time for communications. Because operating systems manage computer resources, they guarantee the allocation of CPU time if the process schedule method is implemented. The allocation of CPU time is not almost affected by non-target processes. This paper introduces the process schedule method and the implementation of it. This paper also shows how to control the communication bandwidth of target processes. Then this paper describes about an evaluation of our proposed mechanism.
Virtual Network Protection Strategy to Ensure the Reliability of SFC in NFV

Under the environment1 of network function virtualization (NFV), the response to the network request is realized by the service function chain (SFC) mapping which is connected with the required virtual network function (VNF), so it is particularly important to ensure high reliability in processing the service request. In this paper, the problem of VNF fault in NFV environment is studied. Firstly, we propose the virtual network function node fault protection problem (Function Node Protection Problem, FNPP) and establish the model. Secondly, IR-SFC algorithm is designed to solve the problem and two algorithms are proposed respectively according to the number of VNF fault node to search and redundant the key VNFs, so that even if non-protected nodes fail, it can be guaranteed the virtual network connectivity is not less than the threshold. Simulation results show that the IR-SFC algorithm can improve the reliability of SFC and reduce the resource consumption compared with the existing methods.
RETRAN: a recurrent paradigm for massively parallel array computing

An applicative paradigm of parallel array processing based on recurrence relations and a data-parallel overloading of constants is presented. It is shown that the suggested principle of anti-currying together with introduction of function-based, eager arrays result in a denotational system superior to array extensions of pragmatic languages in that it can exploit spatial symmetries of arrays to unify the notation. The main novelty here is completely asynchronous treatment of arrays of arrow types (arrays of possibly array-valued functions) which lends itself nicely to a massively parallel data-flow implementation with yet static scheduling due to the imposed strictness of the array constructor. The evolution of data is defined in the tradition form of stream transformation. <<ETX>>
An improved second-order power control iterative algorithm

The paper proposes an improved second-order power control (ISOPC) algorithm for code division multiple access (CDMA) systems. The ISOPC uses current and previous power levels for power updates and it has fast convergence speed. Convergence analysis is performed and the condition of ISOPC convergence is provided for feasible systems. The ISOPC algorithm is then simulated in a DS-CDMA system. The results indicate that the new algorithm has faster convergence speed compared to the SOPC algorithm.
Effects of living in a target language country on the acquisition of English : Proficiency in production of rhythmic patterns and TOEIC score

This study investigated the eSects of living in the country of a target language on learners' acquisi- tion of English durational patterns with respect to interstress intervals (ISIs) . W e were interested in ˆnding out what kind of eSects the experience of living abroad had and how much eSect it exerted on the learners' prociency level. We were also interested in investigating whether the age of arrival in the country of a target language could be a factor aSecting the acquisition of spoken language. Production experiments were carried out to investigate the durational patterns used by four groups of speakers: adult native speakers of American English (AMR), American third graders (G3), Japanese learners of English who had lived in the U.S. (RTN), and Japanese learners of English who had neither lived nor studied in the U.S. (JPN). Two sets of English sentences were devised as the linguistic material, and the sentences in each set diSered in the number of nominally unstressed syllables that intervened between a target stressed syllable and the next stressed syllable. The results showed the eSect of living in the U.S. on the acquisition of English in respect to not only the prociency measured by the TOEIC scores but also the acquisition of English durational patterns. We also observed the eSect of the age of arrival on the level of prociency. In addition, we observed the eSect of diSerent factors on the production patterns with respect to therst language and the sec- ond language. The factors related to the level of acquisition for JPN were whether the target ISI was within a word or between words. The G3 exhibited the eSect of utterance style, i.e., conversational style vs. reading style, in the durational control of ISIs.
Mapping performer parameters to synthesis engines

This paper considers the issues involved in the design of electronic and computer interfaces, specifically mapping - the designed link between an instrument's playing interface and its sound source. It defines the problem area, reviews the literature, and gives examples of specific system mappings. A general model is presented, with the aim of providing a framework for future discussions on what makes an effective mapping. Several guidelines for mapping strategies are given, based on existing work.
The Bayesian Algorithm for Microwave Precipitation Retrieval (BAMPR): potential and application to TRMM data

The Bayesian Algorithm for Microwave Precipitation Retrieval (BAMPR) is a cloud resolving model (CRM)-based retrieval technique for estimating surface rainfall and precipitating cloud profiles by means of microwave radiometric measurements from space. In this paper is illustrated the version of BAMPR tailored for the multi-frequency microwave radiometer aboard of the Tropical Rainfall Measuring Mission (TRMM), called TRMM Microwave Imager (TMI). Since the inversion procedure is based on a cloud-radiation database (CRD) pre-generated by performing radiative transfer calculations on the CRM numerical outputs, the important aspect of CRD representativeness is described. Results of applying BAMPR to a selected event observed by TRMM are finally discussed.
Legal Case Document Classification Application Based on an Improved Hybrid Approach

— The automatic classification of legal case documents has become very important, owing to the justice denials, delays and failures observed in the judicial case management systems. Our hybrid text classification model employed extensive pre-processing techniques to prepare the document features, the probabilistic nature of the Naïve Bayes algorithm was integrated to generate vectorized data from the document features for the classifier, and the most important features was selected by feature ranking using the Chi Square method for final classification using the Support Vector Machine. The hybrid text classifier application was implemented using the Object Oriented Analysis and Design Methodology and developed using the Java programming language and MySQL. Results showed that best features were selected and the documents were accurately classified to their right categories using this hybrid application, as proven using standard performance measure metrics.
Refactoring or Up-front Design?

Among supporters and detractors of XP, the debate rages whether up-front design or incremental design combined with refactoring is the optimal method of implementing systems. This chapter argues that neither method is clearly better in every circumstance. Instead, the experienced software engineer uses a combination of both methods. This chapter also argues that the “cost of change” curve presented in Extreme Programming Explained [Beck1999] does not replace the classic “cost of fixing errors” curve presented by Barry Boehm in [Boehm1981]. Instead, XP is a method of attacking the costs described by this curve. XP, as an incremental method of software engineering, is only applicable in circumstances where the cost of implementing functionalities does not grow rapidly as development progresses. Some heuristics and examples for deciding when to use each technique are presented.
A Study on the Vulnerability of Security Keypads in Android Mobile Using Accessibility Features

As the fintech industry is growing at an incredible rate, mobile phones are positioned as the most important tool for financial transaction. However, with a rising number of malware applications, the types of attack and illegal access to mobile device are becoming more diverse and sophisticated. This paper studies the potential keylogger attack by exploiting the Accessibility Service in Android framework. This type of attack allows the malicious individual to use keylogger on the victim`s Android mobile phone to steal passwords during mobile financial transaction regardless of security keypad setting. Lastly the paper proposes solutions to counter these types of attack by verifying the accessibility usage and amending the application guideline for accessibility.
A tiny, high-speed, wide-band, voltage-feedback amplifier stable with all capacitive load

A tiny, high-speed, wide-band, voltage-feedback operational amplifier capable of driving unlimited capacitive load is described. A class AB input stage is combined with a modified dynamic Witch-Hazel current mirror to provide high slew rate and wide bandwidth with a small die area and small idle current. An RC network couples part of the capacitive load into the high-impedance node, therefore lowering the dominant pole and increasing stability as a function of capacitive load. The part was fabricated on a 3 GHz, 40 V complementary bipolar process. The quiescent current of the chip is 4.5 mA with 1500 V//spl mu/m slew rate and a -3 dB bandwidth of 235 MHz. The part is operational from /spl plusmn/2.5 V to /spl plusmn/18 V supply range. Die size is 38 mils by 46 mils and it fits into a tiny surface outline transistor (SOT) package.
The Efficacy of Computer Assisted Instruction (CAI): A Meta-Analysis

There has been a long-standing dispute about the efficacy of computer assisted instruction (CAI) with regard to the interpretation of effect size estimates in reviews using techniques of meta-analysis. It has been claimed that the data used to calculate these estimates come from studies which are methodologically flawed. The aim of this study was to provide an updated meta-analysis on the learning effect of (CAI) over a broad range of study features with particular attention focused on the effectiveness debate. Using standard procedures, the results and estimates were similar to previous reviews and showed a learning benefit for CAI. The mean effect size for CAI was (.24) for the years 1987–1992, with more recent studies showing an average of (.33). Although moderate, these estimates tended to raise the average student from at least the 50th and 60th percentile. However, studies which controlled for teacher and materials, and were of longer duration, and studies using pencil and paper equivalents of CAI showed no learning advantage over traditional forms of instruction. It is suggested that what accounts for the typical learning advantage of CAI in this meta-analysis and others is the better quality instruction provided by CAI materials. These materials seem versatile enough to be used effectively over a broad range of subjects and educational settings. While the materials did not seem to improve substantially over the past two decades as reflected by effect sizes, these estimates did not include the newer multimedia technology. It is concluded that educational approaches should be judged by a number of criteria including achievement gains and when this is done CAI may far surpass other forms of instruction.
Wavelength assignment algorithms for WDM optical networks

The explosive growth of the Internet and bandwidth-intensive applications such as videeondemand and multimedia conferences require high-bandwidth networks. The current highspeed electronic networks cannot provide such capacity. Optical networks offer much higher bandwidth than traditional networks. When employed with the wavelength division multiplexing (WDM) technology, they can provide the huge bandwidth needed. The tree of rings is a popular topology which can often be found in WDM networks. In this thesis, we first study wavelength assignment (WA) algorithms for trees of rings. A tree of rings is a graph obtained by interconnecting rings in a tree structure such that any two rings intersect in at most one node and any two nodes are connected by exactly two edge-disjoint paths. The WA problem is that given a set of paths on a graph, assign wavelengths to the paths such that any two paths sharing a common edge are assigned different wavelengths and the number of wavelengths is minimized. The WA problem on trees of rings is known to be NP-hard. A trivial lower bound on the number of wavelengths is the maximum number L of paths on any link. In this thesis, we propose a greedy approximation algorithm which uses at most 3L wavelengths on a tree of rings with node degree at most 8. This improves the previous 4L upper bound. Our algorithm uses at most 4L wavelengths for a tree of rings with node degree greater than 8. We also show that 3L is the lower bound for some instances of the WA problem on trees of rings. In addition, we show that our algorithm achieves approximation ratios of 2h and 2& for trees of rings with node degrees at most 4 and 6, respectively. Optical switches, which keep the data stream transmitted in optical form from source to destination to eliminate the electreoptic conversion bottleneck at intermediate nodes, are key devices in realizing the huge bandwidth of optical networks. One of the common ways to build large optical switches is to use directional couplers (DCs). However, DCs suffer from an intrinsic crosstalk problem. In this thesis, we study the nonblocking properties of Benes networks and Banyan-type networks with extra stages under crosstalk constraints.
Bilingual Speech: A Typology of Code-Mixing

1. The study of code-mixing 2. Differences and similarities between languages 3. Insertion 4. Alternation 5. Congruent lexicalization 6. Function words 7. Bilingual verbs 8. Variation in mixing patterns 9. Bilingual speech and language contact.
On the problems of Monte Carlo method based simulation models for mobile radio channels

Propagation models for mobile radio channels are often derived by using Gaussian noise processes with given Doppler power spectral density shapes. Such stochastic processes can efficiently be realized by employing Rice's sum of sinusoids. In the meantime, the Monte Carlo principle is widespread in use for designing the parameters of the sinusoids. This paper investigates the (higher order) statistical properties of Monte Carlo method based simulation models for Rice and Rayleigh channels. It will be shown analytically and experimentally that a single realization of the output sequence of the simulation model does in general not contain the aspired statistical information. Moreover, an alternative parameter computation method will be discussed, which avoids the disadvantages of the Monte Carlo method.
Speaker dependent connected speech recognition via phonetic Markov models

In this paper, a method for speaker dependent connected speech recognition based on phonemic units is described. In this recognition system, each phoneme is characterized by a very simple 3-state Hidden Markov Model (HMM) which is trained on connected speech by a Viterbi algorithm. Each state has associated with it a continuous (Gaussian) or discrete probability density function (pdf). With the phonemic models so obtained, the recognition is then performed either directly at word level (by the reconstruction of reference words from the models of the constituting phonemes) or via a phonemic labelling. Good results are obtained as well with a German ten digit vocabulary (20 phonemes) as with a French 80 word vocabulary (36 phonemes).
A non-blocking parallel spatial join algorithm

Interest in incremental and adaptive query processing has led to the investigation of equijoin evaluation algorithms that are non-blocking. This investigation has yielded a number of algorithms, including the symmetric hash join, the XJoin, the Ripple Join, and their variants. However, to our knowledge no one has proposed a nonblocking spatial join algorithm. In this paper, we propose a parallel non-blocking spatial join algorithm that uses duplicate avoidance rather than duplicate elimination. Results from a prototype implementation in a commercial parallel object-relational DBMS show that it generates answer tuples steadily even in the presence of memory overflow, and that its rate of producing answer tuples scales with the number of processors. Also, when allowed to run to completion, its performance is comparable with the state-of-the-art blocking parallel spatial join algorithm.
Towards a (better) Definition of Annotated MIR Corpora

Today, annotated MIR corpora are provided by various re- search labs or companies, each one using its own annota- tion methodology, concept definitions, and formats. This is not an issue as such. However, the lack of descriptions of the methodology used--how the corpus was actually an- notated, and by whom--and of the annotated concepts, i.e. what is actually described, is a problem with respect to the sustainability, usability, and sharing of the corpora. Ex- perience shows that it is essential to define precisely how annotations are supplied and described. We propose here a survey and consolidation report on the nature of the an- notated corpora used and shared in MIR, with proposals for the axis against which corpora can be described so to enable effective comparison and the inherent influence this has on tasks performed using them.
On testing GPU memory for hard and soft errors

NVIDIA GPUs are becoming increasingly popular in scientific computation as a way to accelerate the execution of computationally demanding codes. The graphics memory used in GPUs is not protected against soft errors that may be caused by cosmic radiation and thus is a source of concern for the scientific computing community. In this short paper we report on an attempt to test GPU memory for both permanent memory errors due to manufacturing defects and prolonged use and soft errors due to single radiation events. We present a new GPU memory test methodology and show results of error measurements on two large GPU clusters. Keywords-GPU, memory test