Miracle-dz/UniFAR-FTUs huggingface dataset:
A MODEL-BASED MONITORING ARCHITECTURE FOR HETEROGENEOUS ENTERPRISE SERVICES AND INFORMATION SYSTEMS

Runtime management of distributed information systems is a complex and costly activity. One of the main challenges that must be addressed is obtaining a complete and updated view of all the managed runtime resources. This article presents a monitoring architecture for heterogeneous and distributed information systems. It is composed of two elements: an information model and an agent infrastructure. The model negates the complexity and variability of these systems and enables the abstraction over non-relevant details. The infrastructure uses this information model to monitor and manage the modeled environment, performing and detecting changes in execution time. The agents infrastructure is further detailed and its components and the relationships between them are explained. Moreover, the proposal is validated through a set of agents that instrument the JEE Glassfish application server, paying special attention to support distributed configuration scenarios.
An analysis of pilot symbol assisted 16QAM for digital mobile communications

An analytical investigation of PSAM (pilot symbol assisted modulation) 16 QAM (quadrature amplitude modulation) is presented. Closed-form expressions for the optimized receiver coefficients, and a tight upper bound for the resulting symbol error rate in PSAM 16 QAM are given. The performance is within 2.4 dB of that of a perfect reference system when the Doppler spread is 5% of the symbol rate. At 1% Doppler, the loss is only 1 dB, and it can be further reduced at lower Doppler values. <<ETX>>
Hierarchical Transparent Programming for Heterogeneous Computing

Parallel computing and the development of parallel programs is a way to reduce the time of the program execution. During many years, sequential optimization was designed without thinking about parallel tasks. Currently, multi-core devices have arrived, making code parallelization more important. The parallel computing is closely related with both hardware and software point of view, in both cases, many calculations are carried out simultaneously. The final objective of parallel computing is the improvement in computing capacity. The rapid increase in the performance of Graphics Processing Units (GPUs), coupled with recent improvements in its ease of programming, have made graphics hardware a compelling platform for High Performance Computing field (HPC) in a wide kind of applications. For this impressive processing potential, a single GPU has the sufficient power to compete with many super-scalar CPUs. The heterogeneous computing notion has emerged few years ago. This concept references to exploit a system composed by multiple mixed compute devices. A Heterogeneous system can be composed by commodity multi-core processors, graphics processors and reconfigurable processors among others. Although the use of heterogeneous systems to take maximum advantage of all computing capabilities may seem a natural idea, their programming complexity is also one step beyond of the intrinsically complex parallel programming. Two main problems appear. First, the need of writing specialized code for both the CPUs cores and GPUs or other accelerators that are present in the system. Second, the problems related with data distribution among devices, and the associated load-balancing problem since heterogeneous systems do not share a common address space and present different computing powers. During the last decade, different programming models have been proposed to handle the complexity of multilevel data partition and mapping. These programming models roughly falls into two categories: Those that hide the underlying communications, and those where the explicit communication is driven by the partition made by the user. These parallel programming models do not help the programmer to explicitly express the communication pattern needed by the algorithm regardless of the data partition chosen. Tiling is a well-known technique used to distribute data and task in parallel programs and to improve the locality of nested loops in sequential code. The use of data structures to support tiles allows to better exploit the memory hierarchy, since data is often reused withing a tile. Trasgo is a programming framework that is being developed by our Trasgo research group at the University of Valladolid (Spain). Trasgo is based on high-level and nestedparallel specifications allowing easily express several complex combinations of data and parallelism tasks with a common scheme. One of the most important features is that
Making Real Virtual Labs

Francis Bacon began defining scientific methodology in the early 17 th century, and secondary school science classes began to implement science labs in the mid-19 th century. By the early 20 th century, leading educators were suggesting that science labs be used to develop scientific thinking habits in young students, and at the beginning of the 21 st century, educators are still seeking to achieve this goal. Technology offers one path to success. Yet, the numerous “virtual labs” available offer little, or no, practice in scientific thinking. This paper presents a new approach to using technology, one that uses real experiments and provides students with the opportunity to think like scientists.
Using Triangularly Weighted Interpolation to Get 13-Bit PCM from a Sigma-Delta Modulator

We present and analyze a method of interpolation that improves the amplitude resolution of an analog-to-digital converter. The technique requires feedback around a quantizer that operates at high speed and digital accumulation of its quantized values to provide a PCM output. We show that use of appropriate weights in the accumulation has important advantages for providing finer resoution, less spectral distortion, and white quantization noise. The theoretical discussion is supplemented by the report of a practical converter designed especially to show up the strengths and weaknesses of the technique. This converter comprises a sigma-delta modulator operating at 8 MHz and an accumulation of the 1-bit code with triangularly distributed weights. 13-bit resolution at 8 kwords/s is realized by periodically dumping the accumulation to the output. We present a practical method for overcoming a thresholding action that distorts low-amplitude input signals.
On a Problem of Formal Logic

This paper is primarily concerned with a special case of one of the leading problems of mathematical logic, the problem of finding a regular procedure to determine the truth or falsity of any given logical formula*. But in the course of this investigation it is necessary to use certain theorems on combinations which have an independent interest and are most conveniently set out by themselves beforehand.
Detecting semantic relations in texts and their integration with external data resources

We present a strategy to automate the extraction of semantic relations from texts. Both machine learning and rule-based techniques are investigated and the impact of different linguistic knowledge is analyzed for the various approaches. To implement the extraction system RExtractor, several natural language processing tools have been improved: from sentence splitting and tokenization modules to dependency syntax parsers. Furthermore, we created the Czech Legal Text Treebank with several layers of linguistic annotation, which is used to train and test each stage of the proposed system. As a result of the performed work, new Semantic Web resources and tools are available for automatic processing of texts.
About One way of Encoding Alphanumeric and Symbolic Information

The number of letters and various symbols in the computers do not exceed 256 symbols, which caused a problem in a different encryption codes in various languages around the world, that's why in this article proposes a new way to increase the number of symbols, A new coding method for alphanumeric information is described, It is based on the M-form of the Fibonacci code, which allows to increase, the number of coded characters and provides the control of the characters formation storage and transmission.
Architecture d'un service de partage de données modifiables sur une infrastructure pair-à-pair

Ce rapport propose une architecture hierarchique pour un service de partage de donnees modifiables pour une federation de grappes. Cette architecture est illustree par une plate-forme logicielle appelee JuxMem, qui permet un acces transparent aux donnees tout en assurant leur persistance en environnement dynamique. Nous introduisons les principaux concepts de cette architecture, et tout particulierement les mecanismes permettant de gerer la volatilite des ressources. Un prototype de la plate-forme \JuxMem a ete mis en \oeuvre sur la plate-forme pair-a-pair JXTA. Nous presentons une evaluation experimentale preliminaire de ce prototype a l'aide d'une application synthetique
Performances of beamforming in downlink with smart antenna testbed

This paper describes field trials with a smart antenna testbed system for IMT-2000 to evaluate the beamforming performance in the downlink. In the testbed system, a method to fit the transmit beam pattern to the virtual beam pattern, which is formed virtually for the downlink beamforming with correlation matrices measured in the uplink, was employed as the criterion of the downlink beamforming. Also, in consideration of the difference of antenna element radiation characteristics in uplink and downlink frequencies, the transmit and receive beam pattern calibration (TR-BPCal) algorithm was employed. The results of field trials confirmed the downlink beam/null-steering to the desired/undesired user, the transmit power reduction in the base transceiver station due to the null-steering to the interference signal and an improvement of the reduction when using the TR-BPCal algorithm.
An agent-based evolutionary computing approach to memory-based syntactic parsing of natural language

This thesis introduces GrAEL (grammar evolution) as one of the first research efforts that investigates an agent-based evolutionary computing approach as a possible machine learning method for data-driven grammar optimization and induction. Using the same architecture, but different information sources, GrAEL can be shown to handle a diverse range of grammar engineering tasks, which can help resolve common issues in corpus-based parsing systems, such as insufficient grammar coverage and the suboptimal distribution of probability mass. After describing a memory-based data-driven parser that applies structure to sentences by direct reference to grammatical information stored in memory, we apply different instantiations of GrAEL to alleviate its aforementioned inherent problematic issues. GrAEL is a distributed system, a computational environment in which agent communicate and co-evolve according to neo-darwinist principles. In the GrAEL environment, each agent is given a partial solution to a problem. By interacting with each other in an evolutionary context, the grammars are optimized in a practical context, on the basis of pre-defined fitness functions. The first instantiation GrAEL-1 does not alter the content of the corpus-induced grammar and therefore only serves to redistribute the probability mass of the statistical weights of the grammar rules. Experiments show that a careful selection of parameters pertaining to the evolutionary aspects of the environment, can improve performance significantly. The redistributed probability mass can be considered to reflect useful statistics for the task of parsing, rather than mirror the distribution of the original training set. Grammar-rule discovery can be implemented by allowing the agents in the society to make minor alterations to the rules in the corpus-induced grammar. The evolutionary computing approach then not only serves as a way to redistribute the probability mass, but also to evaluate the validity of newly created grammar rules. Unsupervised grammar induction can likewise be performed in a GrAEL environment if we allow the agents to build up their own structures, using a minimalist grammar induction approach that employs concepts of information theory to bootstrap structure. By further reducing the information source, we can leave the engineering aspect behind and transform GrAEL into a computational environment in which we can simulate the emergence of grammatical principles in an artificial language of a group of communicating agents. In this view, GrAEL provides a computational simulation of a possible model for the emergence of grammar in early hominids.
Statistical Properties of Timing Jitter in a PAM Timing Recovery Scheme

A new technique is presented for evaluating the per- formince of a popular type of timing recovery circuit for baseband synchronous pulse amplitude modulation (PAM) data signals. The timing circuit consists of a square-law device followed by a narrow- band filter tuned to the pulse repetition frequency along with pro- vision for reshaping the pulses entering the timing path @refiltering). The output of the timing, circuit is a nearly sinusoidal timing wave whose zero crossings indicate the appropriate sampling instants for demodulation of the PAM signal. For a random data sequence, the timing wave exhibits phase fluctiations which are strongly de- pendent on the pulse shapes entering the timing path and the pass- band shape of the narrow-band filter. Expressions for rms phase fluctuation in the timing wave as a function of the prefiltering and postfiltering characteristics of the filters preceding and following the square-law device are presented. These expressions have a form which is, especially . -. suitable for studying the case where the-kas+d , tion frequency. , A condition on prefiltering and postfiltering which gives error-free timing recovery is, presented. Results obtained from some specific examples serve to illustrate several aspects of the timing recovery problem. -_-_- PAM signal is band-limited to freciuencics l&stliah tliepulse repeti- . 4- -
Combining Ontology and Rules as Service Constraint Policy for P2P Systems

We are going to address several important challenges and is- sues on Semantic Web Service Constraint Satisfaction Prob- lem (SWSCSP) for P2P systems. The marriage of semantic web and web services has been considered as one of the most important research areas to lift ofi semantic web vi- sion on the WWW. The (semantic) web services will be a runaway train if we do not have any constraint and control mechanisms for the entire service process. Unfortunately people did not pay attention on this issue until recently so the results are very scarce and primitive (20). The service constraints are deflned as policies that can be specifled by combination of ontology and rules. Therefore the OWL Rule Language (ORL) will be the best candidate to declare se- mantic web service constraints. Furthermore, our SWSCSP research will focus on P2P systems and this infrastructure is more complex and dynamic than the WWW on policy management and enforcement.
Deadlock Detection and Recovery in Distributed Databases

As the need of distributed processing increases, the complexity in handling of deadlocks also increases. In distributed databases, the conditions for the deadlocks are same as that in centralized but harder to detect, avoid and prevent. Therefore special procedures are required to resolve the deadlock. In this paper we propose a new distributed deadlock detection and recovery algorithm that not only detects deadlock but also resolve them efficiently by aborting less number of transactions. We also present comparative analysis of the proposed algorithm and observed that the proposed algorithm reduces the number of transactions that are to be aborted to resolve the deadlocks, thus improving the performance of the system. General Terms Databases, distributed, deadlocks, detection and resolution.
Report on the Evaluation of 2D Still-Image Face Recognition Algorithms

Background ― Facial recognition algorithms from seven commercial providers, and three universities, were tested on one laboratory dataset and two operational face recognition datasets, one comprised of visa images, the other law enforcement mugshots. The population represented in these sets approaches 4 million, such that this report documents the largest public evaluation of face recognition technology to date. The project attracted participation from a majority of the known providers of FR technology including the largest commercial suppliers. ― Accuracy was measured for three applications: One-to-one verification (e.g. of e-passport holders); one-to-one verification against a claimed identity in an enrolled database (e.g. for driver's license re-issuance); and one-to-many search (e.g. for criminal identification or driver's license duplicate detection). ― Face images have been collected in law enforcement for more than a century, but their value for automated identification remains secondary to fingerprints. In a criminal investigation setting, face recognition has been used both in an automated mode and for forensic investigation. However, the limits of the technology have not previously been quantified publicly, and, in any case, are subject to improvement over time, and to the properties of the images in use. ― Core algorithmic capability is the major contributor to application-level recognition outcomes. A second critical factor is the quality of the input images; this is influenced by design of, and adherence to, image capture protocols (as codified by face recognition standards) and also by the behavior of the person being photographed (e.g. whether they face the camera). Some data collection protocols can embed a human adjudication of quality (e.g. of a visa image by a consular official) while others cannot maintain such tight quality controls (e.g. because of non-cooperative subjects in police booking processes). ― This is the first time NIST has reported accuracy of face identification algorithms. Prior tests have assumed an equivalence of a 1:N search as N 1:1 comparisons. This new protocol formally supports use of fast search algorithms such as indexing, partitioning and binning. The benefits are more accurate predictions of scalability to national-size populations. ― The project used archival imagery to assess core algorithmic capability of algorithms. It did not do an instrumented collection of images as might be used in a scenario or operational test. It therefore did not measure human-camera transactional performance parameters such as duration of use and outcome. These would be of vital interest in, for example, e-Passport gate applications. …
A Coordination Theory Approach to Organizational Process Design

An important practical problem for many managers is finding alternative processes for performing a desired task, for example, one that is more efficient, cheaper, or that is automated or enhanced by the use of information technology. Improving processes also poses theoretical challenges. Coordination theory provides an approach to the study of processes. In this view, the design of a process depends on the coordination mechanisms chosen to manage dependencies among tasks and resources involved in the process.In this paper, I use coordination theory to analyze the software change process of a large mini-computer manufacturer. Mechanisms analyzed include those for task assignment, resource sharing, and managing dependencies between modules of source code. For each, I suggest alternative mechanisms and thus alternative designs for the process. The organization assigned problem reports to engineers based on the module that appeared to be in error, since engineers only worked on particular modules. Alternative task assignment mechanisms include assignment to engineers based on workload or market-like bids. Modules of source code were not shared, but rather “owned” by one engineer, thus reducing the need for coordination. An alternative resource sharing mechanism would be needed to manage source code if multiple engineers could work on the same modules. Finally, engineers managed dependencies between modules informally, relying on their personal knowledge of which other engineers used their code; alternatives include formally defining the interfaces between modules and tracking their users.Software bug fixing provides a microcosm of coordination problems and solutions. Similar coordination problems arise in most processes and are managed by a similar range of mechanisms. For example, diagnosing bug reports and assigning them to engineers may have interesting parallels to diagnosing patients and assigning them to specialists.While the case presented does not formally test coordination theory, it does illustrate the potential of coordination theory for exploring the space of organizational processes. Future work includes developing more rigorous techniques for such analyses, applying the techniques to a broader range of processes, identifying additional coordination problems and mechanisms and developing tools for collecting and comparing processes and automatically suggesting potential alternatives.
Data mining for path traversal patterns in a web environment

In this paper, we explore a new data mining capability which involved mining path traversal patterns in a distributed information providing environment like world-wide-web. First, we convert the original sequence of log data into a set of maximal forward references and filter out the effect of some backward references which are mainly made for ease of traveling. Second, we derive algorithms to determine the frequent traversal patterns, i.e., large reference sequences, from the maximal forward references obtained. Two algorithms are devised for determining large reference sequences: one is based on some hashing and pruning techniques, and the other is further improved with the option of determining large reference sequences in batch so as to reduce the number of database scans required. Performance of these two methods is comparatively analyzed.
Shape retrieval and recognition

Shape recognition has been an attractive research area with both theoretical and practical importance in the fields of computer vision, pattern analysis and object classification. However, to the best of our knowledge, there is as yet not one unique technique of general validity to measure shape similarity and robust to noise. In this research, we aim to propose and investigate one shape recognition system which can tackle different types of input data, such as logos, fingerprints, work tools and characters. To achieve the desired accuracy and efficiency, the proposed system employs a three stage hierarchy, i.e. polygonal approximation, indexing and matching. In the first stage, the raw images are transformed into line representation from Edge Map (LEM). In the second stage, effective line pattern features are extracted to support indexing so as to prune the model space with respect to a test image. Meanwhile, the alignment problem can be solved as a byproduct. In the third stage, a new scheme Curve segment Hausdorff Distance (CsHD), which measures the dissimilarity (distance) between two images, is proposed to screen further and generate the best matches. The proposed polygonal approximation approach is based on robust shape feature and tends to generate more consistent LEM, while the indexing and alignment are based on local distribution of the extracted features, which is relatively insensitive to noise. The proposed CsHD works on the line segments extracted from the edge information of the images and organizes them in a more proper way by regrouping the consecutive line segments into a curve segment. Then the distances between two ATTENTION: The Singapore Copyright Act applies to the use of this document. Nanyang Technological University Library