Miracle-dz/UniFAR-FTUs huggingface dataset:
Antenna Refurbishment for use in a Low-Earth-Orbit Satellite Earth Station

Abtract This paper presents as a case study the refurbishment of a parabolic dish antenna that had been optimised with a particular end use in mind to serve in another different application at a much different frequency, carried out against tight time and budgetary constraints that dictated achieving the simplest solution that could provide the required grade of service. The refurbishment involved, first, a critical evaluation of the optics of the dish and its Gregorian sub-reflector to prove the possibility of what was being sought, and then the design of a new feed system to achieve it. This revolved about the somewhat unconventional use of a plain conical horn, and involved extensions to the theory of this device to expose problems with its lack of precisely equal beamwidths in each of its principal planes and its astigmatism. Final validation of the refurbishment was carried out by measurement of the radiation diagram of the dish. Because of its size, both physically and in terms of the free space wavelength, and equipment constraints, this required the unconventional solution of using the satellite that it was being refurbished to track as a beacon by means of which to carry out the measurement. The result is to show excellent agreement between theory and practice.
Efficient clustering-based routing protocol in mobile ad-hoc networks

The paper proposes a new routing protocol for mobile ad-hoc networks. It is a kind of hybrid routing protocol (HRP). It lies somewhere between proactive and reactive routing protocols (PRP and RRP). The former requires every node to maintain the full routing information, while the latter typically relies on the flooding of queries to discover a destination. The proposed routing protocol works on the basis of a virtual cluster, consisting of a collection of those nodes that are only one-hop distance away. The idea is to reduce significantly control overheads, such as route query packets, as well as the flooding time for collecting the network topology information at a destination. The key feature of the proposed scheme is that it draws on the short packet transfer delay of PRP and the small control overhead performance of RRP. A backup route is intended to improve the delay performance further. A disconnected route can be replaced by a backup route, if available. Computing the backup route does not increase computational overheads. Computer simulation studies demonstrate the superior performance of the proposed scheme. In particular, it is not sensitive to changing network topology, has shorter transfer delay, reasonable control overheads and appreciable throughput. It exhibits all these desirable characteristics without compromising on other important performance measures.
The Impact of Topology and Communication Models on Connectivity in Networks

Autonomous routing algorithms are intended to reach a global solution after nodes independently process and share information. However, the role of the mechanism used to share information has been previously overlooked in previous analyses of these algorithms and network connectivity. In this paper, I explicitly study how these network-communication models affects network connectivity. In addition, I examine properties of connectivity in robotic networks with a defined communication topology. I show that network connectivity depends on the communication model by using a taxonomy of communication models and identifying models of interest. I will then analyze how network connectivity is preserved or not guaranteed through different models. These results are important for studying the connectivity of distributed autonomous routing protocols because certain models are best for proving model-independent conditions that guarantee connectivity, while other models are best for proving model-independent conditions that do not guarantee network connectivity.
Comparison between Possibilistic c-Means (PCM) and Artificial Neural Network (ANN) Classification Algorithms in Land use/ Land cover Classification

There are several statistical classification algorithms available for land use/land cover classification. However, each has a certain bias or compromise. Some methods like the parallel piped approach in supervised classification, cannot classify continuous regions within a feature. On the other hand, while unsupervised classification method takes maximum advantage of spectral variability in an image, the maximally separable clusters in spectral space may not do much for our perception of important classes in a given study area. In this research, the output of an ANN algorithm was compared with the Possibilistic c-Means an improvement of the fuzzy c-Means on both moderate resolutions Landsat8 and a high resolution Formosat 2 images. The Formosat 2 image comes with an 8m spectral resolution on the multispectral data. This multispectral image data was resampled to 10m in order to maintain a uniform ratio of 1:3 against Landsat 8 image. Six classes were chosen for analysis including: Dense forest, eucalyptus, water, grassland, wheat and riverine sand. Using a standard false color composite (FCC), the six features reflected differently in the infrared region with wheat producing the brightest pixel values. Signature collection per class was therefore easily obtained for all classifications. The output of both ANN and FCM, were analyzed separately for accuracy and an error matrix generated to assess the quality and accuracy of the classification algorithms. When you compare the results of the two methods on a per-class-basis, ANN had a crisper output compared to PCM which yielded clusters with pixels especially on the moderate resolution Landsat 8 imagery.
The systematic exploration of pipelined array multiplier performance

The throughput of a combinational array multiplier is shown to be asymptotically suboptimal using performance measures derived from VLSI models of computation. Applying a systematic transformation called retiming, a class of asymptotically optimal pipelined array multipliers is obtained. The optimum circuit performance within this class must be deternmined empirically through repeated iterations of multiplier layout generation, circuit extraction, and electrical simulation. The structure of these pipelined multipliers facilitates such an empirical investigation by admitting very regular layouts that can be generated quickly and interactively.
Sistemas Recomendadores: Un enfoque desde los algoritmos genéticos

This work presents an alternative approach (Evolutionary Algorithms approach) to traditional treatment of Recommender Systems (RSs). The work examines genetic algorithms possibilities to offer adaptive characteristics to this systems trough learning. The main goal, in addition to give a general view about RSs capabilities and possibilities, it is to provide an example mechanism for to extend RSs learning
Interactive Manipulation of Musical Melody in Audio Recordings

The objective of this project is to develop an interactive technique to manipulate melody in musical recordings. The proposed methodology is based on the use of melody detection methods combined with the invertible constant Q transform (CQT), which allows a high-quality modification of musical content. This work will consist of several stages, the first of which will focus on monophonic recordings and subsequently we will explore methods to manipulate polyphonic recordings. The long-term objective is to alter a melody of a piece of music in such a way that it may sound similar to another. We have set, as and end goal, to allows users to perform melody manipulation and experiment with their music collection. To achieve this goal, we will devise approaches for high quality polyphonic melody manipulation, using a dataset of melodic content and mixed audio recordings. To ensure the system's usability, a listening test or user-study evaluation of the algorithm will be performed.
Secure Sharing of Personal Health Record in Server with On-track ECG Monitoring

Personal Health Record (PHR) paved the way to the patient centric model of health information exchange. This service allows a patient to create, manage, and control her personal health data in one place through the web, which has made the storage, retrieval, and sharing of the medical information more efficient. But there have been wide privacy concerns about whether the patients could actually control the sharing of their sensitive Personal Health Information (PHI). This paper proposes a new patient centric framework and mechanisms for data access control to PHRs stored in semi-trusted servers using Attribute Based Encryption (ABE) technique. It focuses on the multiple data owner scenario, and divides the users in the PHR system into multiple security domain that greatly reduces the key management complexity for owners and users. It also proposes a new application for the on-track monitoring of patient's health data with the help of ECG device where communication between client and server is achieved through the GPRS network. The utilization of electrocardiogram transmission will improve efficiency of medical care and service for patients if they could be monitored constantly by health care providers. AES and ABE encryption techniques are used in my work. Keywords: Attribute based encryption (ABE), ECG, GPRS, Personal health record (PHR), secure sharing.
ON THE REED-SOLOMON CODES

Mã Reed-Solomon (mã RS) là một trong những phương pháp mạnh mẽ nhất để bảo vệ tính toàn vẹn của dữ liệu khỏi các lỗi có thể xảy ra trong quá trình lưu trữ hoặc truyền tải. Kỹ thuật mã hóa này đã được chứng minh đạt được hiệu suất cao với chi phí hợp lý. Trong khi các kỹ thuật mã hóa khác truyền dữ liệu dưới dạng một chuỗi số nhị phân, mã Reed-Solomon mã hóa thông điệp dưới dạng một chuỗi ký hiệu. Điều này đem lại cho mã Reed-Solomon lợi thế trong việc xử lý lỗi hàng loạt hoặc thậm chí là lỗi xóa. Nó đóng vai trò quan trọng trong các hệ thống thông tin liên lạc hiện đại và nhiều ứng dụng khác trong cuộc sống. Một số ứng dụng có thể kể đến như là hệ thống chịu lỗi trong đĩa CD và giao thức truyền thông trong vệ tinh và tàu vũ trụ. Trong bài viết này, chúng tôi đưa ra các thuộc tính và cấu trúc cơ bản của mã Reed-Solomon bằng cách thảo luận về các mô hình toán học của nó. Quá trình mã hóa với cách tiếp cận ban đầu và cách tiếp cận BCH hiện đại. Đối với quá trình giải mã, chúng tôi nghiên cứu một loạt các thuật toán và kỹ thuật, chẳng hạn như giải mã hội chứng, thuật toán RiBM, Chien và Forney. Kết quả là một bộ mã hóa và giải mã Reed-Solomon sử dụng nền tảng MATLAB. Chúng tôi đưa ra các ví dụ về mã hóa và giải mã với các thông điệp khác nhau.
Security Visualization Analytics Model in Online Social Networks Using Data Mining and Graph-based Structure Algorithms

The rise of the Internet accelerates the creation of various large-scale online social networks, which can be described the relationships and activities between human beings. The online social networks relationships in real world are too big to present with useful information to identify the criminal or cyber-attacks. This research proposed new information security analytic model for online social networks, which called Security Visualization Analytics (SVA) Model. SVA Model used the set of algorithms (1) Graph-based Structure algorithm to analyze the key factors of influencing nodes about density, centrality and the cohesive subgroup to identify the influencing nodes of anomaly and attack patterns (2) Supervised Learning with oneR classification algorithm was used to predict new links from such influencing nodes in online social networks on discovering surprising links in the existing ones of influencing nodes, which nodes in online social networks will be linked next from the attacked influencing nodes to monitor the risk. The results showed 42 influencing nodes of anomaly and attack patterns and can be predict 31 new links from such nodes were achieved by SVA Model with the accuracy of confidence level 95.0%. The new proposed model and results illustrated SVA Model was significance analysis. Such understanding can lead to efficient implementation of tools to links prediction in online social networks. They could be applied as a guide to further investigate of social networks behavior to improve the security model and notify the risk, computer viruses or cyber-attacks for online social networks in advance.
Program Synthesis of Parallel Scans

We consider the problem of synthesis of data parallel and task parallel implementations of the scan also known as prefix sum. The user provides an example scan network as an input along with a partial program with missing array index expressions. We then manually extract the constraints for index expressions from the partial program such that the given example network is satisfied. Finally, the generated constraints are solved using linear programming solver. We found that our method is general enough to synthesize data parallel implementations of previously described parallel scan networks.
New Efficient Certificateless Aggregate Signature Scheme

Certificateless aggregate signature (CLAS) scheme has been widely adopted in resource-constrained wireless mobile networks, because it not only solves the problems of the certificate management and private key escrow, but also achieves batch validation. In this paper, we first analyze the security for Kang et al.’s CLAS scheme which was claimed to be secure against various types of attacks. Unfortunately, we find that their scheme can not resist malicious KGC’s attack and present a concrete attack method. To enhance security, we propose a new certificateless aggregate signature scheme. Furthermore, we formally prove the security of the scheme in the random oracle model. Finally, we evaluate the performance of our proposed scheme. Compared with the original scheme, our new scheme fixes the security flaw, while reducing the total computational costs, so that is more practical and adoptable in real life.
Note---The Logic of Policy as Argument

This paper is a review and evaluation of a policy argument in a recent issue of Management Science. Mitroff, Mason and Barabba presented a case study of a policy model, built around the problem of undercounting minorities in the U.S. Census, in a Toulmin format. We restructure this model as a Boolean system with both conditional and unconditional statements, preserving both the MMB arguments and the Toulmin format. It is shown that there is an error in the buildup of the MMB model. This error does not change the end result that their model is a contradiction, however it is much earlier to see this fact with the Boolean formulation than with a verbal presentation only. We discuss the potential usefulness of this type of modelling for policy capture, including some of the difficulties of employing the Toulmin format.
Effectiveness of Rules for Format Conversion Analysis

In this paper, a rule-based format conversion approach is proposed. A super resolution topic is of much interest and some applications of super resolution are format converting of TV signals, face recognition, camera surveillance, and digital camera color interpolation. The main goal of super resolution is to raise the resolution of image via upsampling. This paper proposes an image upsampling method by rule. The proposed method provides better performance than conventional methods.
Approaching User Experience: Moving between Modelling and In-Depth

Approaching User Experience: Moving between Modelling and In-Depth ! Introduction User experience (UX) research in the field of Human-Computer Interaction tries to understand how humans experience the interaction with technological artefacts (e.g. mobile phones). This field of research is quite young and there is significant debate about what the concept is and how to research it. Two movements are competing against each other: Hassenzahl’s model of UX [1] and McCarthy & Wright’s framework of experience centred design [2]. Hassenzahl stays grounded in cognitive psychology and focuses on uncovering the objective in the subjective, on the precise and the formal. McCarthy & Wright take a humanist approach, stress the ambiguous and suggest to live with the subjectivity that is inherent in the concept of UX. Only few studies try to integrate both views. This situation in UX is not unique. A discussion between first person and third person approaches also happens in other disciplines (e.g. cognitive science) and there are efforts to integrate both perspectives with each other. Method I am trying to compare both approaches by using them in the user evaluation of a website with two user groups, one for each method. Despite comparing results (type of data, what has been discovered and missed out & why) I also reflect on conducting both approaches. This includes looking at required knowledge & skill, training, preparations, difficulty of recruiting participants and time exposure of conduction & analysis. A focus group with the clients of the evaluation also tries to incorporate their view and answer the question what type of data & which results are most helpful for them. Results Results suggest that Hassenzahl's model is easy to employ, gives a broad overview and results are easy to visualise. But its results have to be classified into practical relevant categories and detailed explanations are missing. On the other hand, the method based on McCarthy & Wright's framework provides detailed and informative insights, but its results do not generalise easily. It is at least twice as costly to employ than the model and requires a skilled researcher. Conclusion Regarding methods, Hassenzahl's model misses context information and the here used Descriptive Experience Sampling should be easier to employ. Generally, a methodological stance should not be emphasised too much and an integrated view from different perspectives seems to be more valuable than a unified view. In UX research there should be a more pragmatic use of methodologies. They should be viewed as tools with strengths and weaknesses that are able to advance knowledge when used appropriately. References [1] M. Hassenzahl, "Experience design: technology for all the right reasons" in Synthesis Lectures on Human-Centered Informatics, vol. 3, pp. 1-95, 2010. [2] P. Wright and J. McCarthy, "Experience-Centered Design: Designers, Users, and Communities in Dialogue" in Synthesis Lectures on Human-Centered Informatics, vol. 3, pp. 1-123, 2010.
A REVIEW ON AUTOMATED IMAGE MOSAIC USING PCA

When image capturing devices are not able to accommodate image in a single frame then the technique used to join number of images taken sequentially is called image mosaicing. In other words, it is normally used to make up a seamless and high resolution image with a set of partial images. So the image mosaic is an increasingly popular field of research. In general, there are two basic steps of image mosaicing. First is Image Alignment and second is Image Stitching. This project introduces an emerging image mosaicing technology based on PCA i.e. Phase Correlation Algorithm. In this paper, correlation-based scheme is used which operates in the Fourier domain for finding the transformed coordinates (translational parameters) and use it for Image Mosaicing.
VLSI Implementation and Analysis of Parallel Adders for Low Power Applications

Carry select adder (CSLA) is known to be the fastest adder among the conventional adder structures. Due to the rapidly growing mobile industry not only the faster arithmetic unit but also less area and low power arithmetic units are needed. The modified CSLA architecture has developed using Binary to Excess-1 converter (BEC). The efficient CSLA architecture has developed using D latch. In this paper an analysis has been made between Regular and Conventional CSLA adders like modified, Efficient CSLA. Designs were developed using structural VHDL and synthesized in Altera Quartus II with reference to FPGA device EP2C35F672C6. Experimental results are compared in-terms of area, power, delay and PDP. Results shows that modified carry select adders are better in area and power consumption.
DESIGN AND ANALYSIS OF NAND GATE USING BODY BIASING TECHNIQUE

Dynamic domino logic circuits are widely used in modern digital VLSI circuits. These dynamic circuits are often favored in high performance designs because of the speed advantage over static CMOS logic circuits. Dynamic CMOS Circuits, featuring a high speed operation are used in high performance VLSI designs. The main drawbacks of dynamic logic are a lack of design automation, a decreased tolerance to noise and increased power Consumption. In this work, domino gate is designed with various body biasing and high performance circuit was specified.
Delay-Constrained Video Transmission: A Power-Efficient Resource Allocation Approach for Guaranteed Perceptual Quality

In this paper we investigate power-efficient resource allocation for transmission of perceptual quality guaranteed video over LTE downlink under delay quality of service (QoS) constraints. We formulate the resource allocation problem as the minimization of sum power in the downlink under user perceived quality and statistical delay QoS provisioning. We solve the problem using dual decomposition and employ the ellipsoid method to update dual variables. Experimental results have shown significant performance enhancement of the proposed system in terms of power efficiency while satisfying the statistical delay-bounded QoS and perceptual quality requirements.
Treebank Annotation in the Light of the Meaning-Text Theory

A treebank may contain the annotation of different phenomena such as word order, morphological features, syntactic and semantic relations, etc., which are rather different in their nature. Quite often, the annota- tion of these phenomena is combined in a single structure, which leads to low-quality training results and is verifiably deficient from a theoretical (linguistic) perspective. We argue that the annotation of corpora requires a well-defined linguistic model which supports multi-level annotation, with one type of phenomenon per level. Our experience with dependency treebanks created or adjusted for surface-oriented natural language generation and based on the Meaning-Text Theory, a multi-level linguistic model, supports this argumentation.