Miracle-dz/UniFAR-FTUs huggingface dataset:
Challenges and Development of Electronic Voting Research

Electronic voting is a challenging application of cryptography technology.In order to replace the traditional voting system,This paper proposes voting protocols that satisfy a variety of security requirements.However,much room for improvements remains,regarding efficiency,participation of trusted authorities,prevention of vote buying and coercion,and formulation of admissible ballots.This paper surveys the security requirements,voting schemes and ballot formats of the current electronic voting system.It puts forward four main challenges faced with electronic voting protocols and introduces with detailed analysis several typical solutions,including visual cryptography,self-tallying election,vector-ballot voting and divisible voting.
Acid properties of zinc(II) and cadmium(II) in complexation with macrocyclic oxo polyamine ligands

The pH-metric titration study of the interaction of Zn II and Cd II ion with dissociable (acidic) hydrogen-containing macrocyclic polyamines has served to distinguish inherent acid and coordination properties of these two metal ions. In complexation with monooxocyclam Zn II ion can replace the amide hydrogen and forms a planar 1:1 monooxocyclam complex [ZnH -1 L] + containing the hitherto unknown deprotonated amide N - -Zn II coordination
Designed Synthesis of Uniformly Sized Iron Oxide Nanoparticles for Efficient Magnetic Resonance Imaging Contrast Agents

هزورما تاقیقحت یدایز هب یسیطانغم تارذ ونان عاونا یور یسیطانغم یرادرب ریوصت رد تسارتنک لماوع ناونع ( MRI ) ماجنا نیادوش یم یگژیو تلع هب نم یاه اه نآ درف هب رصح ، دننام : تنک تارثا تسار لااب ، یراگزاس تسیز و، ندرک راد لماع تیلباق دشاب یم اه نآ حطس ناسآ . ییلااب ییریذپ شیاسآ هک یتارذ ونان تحص شیازفا ثعاب نوچ دنشاب یم بولطم رایسب دنراد MRI دنوش یم . MRI دراد یددعتم یایازم یرادرب ریوصت یاه شور ریاس هب تبسن ناوت یم هلمج زا نشولوزر لااب یحطس ، ویدار هب زاین مدع اه پوتوزیا ، و درب مان ار سکیا یاه وترپ یلو ، نیا تیساسح شور نییاپ یموتانآ دراد یغت ندیشک ریوصت هب هک رد ار زیچان تاری دنک یم دودحم تفاب ، رد ینیلک یاه دربراک یک اراپ یاه سکلپمک ، رد تسارتنک لماع ناونع هب موینیلوداگ سیطانفم MRI روط هب ، دوش یم هدافتسا تیساسح دوبهب یارب یا هدرتسگ . سکلپمک رتشیب موینولوداگ یاه دنراد یهاتوک شخرچ نامز هکنیا لیلد هب MRI اب دنک یم دودحم ام یارب ار لااب نشولوزر .
Making Search Engines Notice: An Exploratory Study on Discoverability of DSpace Metadata and PDF Files

ABSTRACT This study analyzed the search results of four main Internet search engines on three newly created digital collections at Texas Tech University Libraries, in order to assess the search engine indexing on metadata and PDF files of digital items that are published in the institutional repository. The exploratory study found that only one search engine discovered PDF files, while the others only discovered metadata. The results of the study also suggested that metadata and PDF files can supplement each other to facilitate discoverability of the digital collections on search engines, and revealed some findings that are contradictory to conclusions in previous research.
Data Science with Graphs: A Signal Processing Perspective

A massive amount of data is being generated at an unprecedented level from a diversity of sources, including social media, internet services, biological studies, physical infrastructure monitoring and many others. The necessity of analyzing such complex data has led to the birth of an emerging framework, graph signal processing. This framework offers an unified and mathematically rigorous paradigm for the analysis of high-dimensional data with complex and irregular structure. It extends fundamental signal processing concepts such as signals, Fourier transform, frequency response and filtering, from signals residing on regular lattices, which have been studied by the classical signal processing theory, to data residing on general graphs, which are called graph signals. In this thesis, we consider five fundamental tasks on graphs from the perspective of graph signal processing: representation, sampling, recovery, detection and localization. Representation, aiming to concisely model shapes of graph signals, is at the heart of the proposed techniques. Sampling followed by recovery, aiming to reconstruct an original graph signal from a few selected samples, is applicable in semi-supervised learning and user profiling in online social networks. Detection followed by localization, aiming to identify and localize targeted patterns in noisy graph signals, is related to many real-world applications, such as localizing virus attacks in cyber-physical systems, localizing stimuli in brain connectivity networks, and mining traffic events in city street networks, to name just a few. We illustrate the power of the proposed tools on two real-world problems: fast resampling of 3D point clouds and mining of urban traffic data.
Modeling of SACK-based Fast Retransmission and Recovery

Selective acknowledgment (SACK)-based retransmission and recovery mechanism has been implemented in most of current transmission control protocol (TCP) stacks. A new SACK-based loss recovery algorithm is defined in RFC6675 under standard track. Existing models in literatures on modeling TCP SACK, which usually use SACK-based retransmission and recovery mechanism, is no longer accurate for two reasons: 1) they ignore transmission of new packets before retransmission of the last loss; 2) they are based on the strategy that pipe is decreased by 2 upon receipt of a partial ACK, where pipe is the estimated number of outstanding packets. This paper develops a new method to derive the expected number of new packets transmitted between retransmission of the first loss and the last, proposes a model that estimates the expected number of packets transmitted during fast retransmission and recovery phase (FRR) and the corresponding expected duration based on RFC6675. The numerical results show that the proposed model can accurately estimate the expected number of packets transmitted during FRR and the corresponding expected duration based on RFC6675.
Novel Efficient Micro strip Antenna Design for Satellite C-band Downlink Applications

* Assistant Professor, Department of Electronics and Communication Engineering, Punjabi University Patiala, India Abstract— This paper presents a novel microstrip patch antenna design for C-band satellite downlink communication applications. In the proposed antenna design, the substrate is of FR4 (Flame Retardant 4) material having dielectric constant 4.4 and the patch and ground are of copper material. The proposed antenna is resonant at 4.2 GHz and has bandwidth of 727.3 MHz (3.74 GHz 4.46 GHz) which can be used for reception of C-band satellite downlink signals at earth station. The proposed antenna has a return loss of -71 dB at resonant frequency of 4.2GHz. The antenna has a gain of 5.68 dB and directivity of 5.55 dBi at resonant frequency of 4.2GHz. The performance of the antenna has been analysed in terms of return loss (dB), directivity (dBi), gain (dB), smith chart and VSWR.
CHAPTER 15 A Look around at What Lies Ahead: Prediction and Predictability in Language Processing

Traditionally, prediction has been considered an ineffi cient and cognitively expensive processing mechanism in the domain of language comprehension, where there are many possible ways for relaying a single thought, meaning or desire and the chances of mispredicting are accordingly high. Predictive linguistic processing, however, does not seem untenable given its similarity to other neural processing domains that are contextually grounded and appear to implement knowledgeand experience-based mental representations anticipatorily. Here, we examine linguistic prediction from multiple perspectives, ranging from theoretical models that analyze predictability at the level of ambiguity resolution, to experimental evidence primarily from event-related brain potentials (ERPs) that supports a “strong” model of prediction in which items are not just incrementally integrated, but are wholly or featurally pre-activated via accruing mental sentential representations. We also explore possible consequences of a neural language parser (aka, brain) that may be prone to mispredicting, and what electrophysiological evidence for such processing may look like. We conclude by arguing for the importance of investigating such linguistic eff ects as yet another example of a neural system in which probability estimation is inherent, with a proposal to move beyond the debate of whether there is linguistic prediction, toward focusing research eff orts on how pre-activation may occur and what is pre-activated. POTENTIAL BENEFITS OF LINGUISTIC
Implementation of simulation system based on TE process

TE process is a real simulation of a chemical process that has been widely used in process control study. Simulation system based on MATLAB, Excel and ForceControl is designed for TE process. MATLAB designs control strategy and implements simulation, ForceControl implements friendly user interface and Excel plays as the database of MATLAB and ForceControl. MATLAB connects Excel through Excel Link. And Excel exchanges data with ForceControl through DDE. The simulation system has been used, which provides a well basic platform for process control researchers.
A Decade of Using Hybrid Inference Systems in NLP (2005-2015) : A Survey

In today’s world of digital media, connecting millions of users, large amounts of information is being generated. These are potential mines of knowledge and could give deep insights about the trends of both social and scientific value. However, owing to the fact that most of this is highly unstructured, we cannot make any sense of it. Natural language processing (NLP) is a serious attempt in this direction to organise the textual matter which is in a human understandable form (natural language) in a meaningful and insightful way. In this, text entailment can be considered a key component in verifying or proving the correctness or efficiency of this organisation. This paper tries to make a survey of various text entailment methods proposed giving a comparative picture based on certain criteria like robustness and semantic
Distributed Autonomous Navigation System Based on VANET

In light of the issues of serious traffic congestion and urgent road safety,this paper presents a distributed intelligent transport service system based on optimization and implementation of a Vehicular Ad-hoc Network(VANET)routing protocol.It provides adjacent area dynamic traffic information,urgent traffic accident warning and information distribution of traffic images/videos.Compared with the traditional methods,VANET plays its advantages in the direct interaction between vehicles of traffic,security,entertainment etc.real-time information.
Deliverable D2.1 Closed loop fuzzing algorithms

The techniques and tools described in this report propose a way to measure the impact of a fuzzer on a running system. The work focuses on protocols fuzzing. So tested systems are protocol entities and inputs protocol messages. Therefore the elementary measure assesses the impact of a crafted protocol message injected into the running system under test. From this point several interesting uses can be derived: • The overall impact, the coverage of a sequence generated by a the fuzzer can be calculated. • Then two fuzzers can be compared. • One or several sequences can be optimized: only messages introducing the best coverage can be selected to limit the cost (duration) to apply the test. • The process, the strategy that generates sequences can itself take advantage of this impact measurement to directly produce new optimized sequences. The Session Initiation Protocol (SIP) is the target protocol of the study.
3D - Playfair Cipher with Message Integrity using MD5

In growing digital world, Cryptography plays an important role to secure confidential information. The objective of the paper is to implement encryption and message digest of information. 3D (6X4X4) Playfair cipher is multiple letter encryption cipher. In this, tri-graphs of plaintext are treated as single units and converted into corresponding cipher text tri-graphs. 3D (6X4X4) -Playfair cipher supports all 52 alphabets (upper and lower case), 10 digits and 34 special characters. The theme of research is to furnish security to data which contains alphabets numerals and special characters during transmission that‟s why message-digest algorithm are introduced and applied on the cipher text of 3D-Playfair cipher with a random key. It makes use of alphabets both lower and uppercase characters, number and special characters for constructing the contents of the matrix.
A Review of Big Graph Mining Research

Big Graph Mining” is a continuously developing research that was started in 2009 until now. After 7 years, there are many researches that put this topic as the main concern. However, there is no mapping or summary concerning the important issues and solutions to explain this topic. This paper contains a summary of researches that have been conducted since 2009. The result is grouped based on the algorithms, built system and also preprocess techniques that have been developed. Based on survey, there are 11 algorithms and 6 distributed systems to analyse the Big Graph have been improved. While improved pre-process algorithm only covers: sampling and compression technique. These improving algorithms are usually aimed to frequent sub graphs discovery, whereas slightly those of is aimed to cluster Big Graph, and there is no algorithm to classify Big Graph. As a conclusion of this survey, there is a need for more researches to be conducted to improve a comprehensive Graph Mining System, especially for very big Graph.
Context-aware Framework for Personalized Service

Abstract The development of mobile devices and the spread of wireless network help share and exchange information and resources more easily. The bond them to Cloud Computing technology help pay attention to “Mobile Cloud” service, so there have been being a lot of studies on “Mobile Cloud” service. Especially, the important of ‘Personalization Service’ which is customized for each user’s preference and context has been increasing. In order to provide appropriate personalization services, it enables to recognize user’s current state, analyze the user’s profile like user’s tendency and preference, and draw the service answering the user’s request. Most existing frameworks, however, are not very suitable for mobile devices because they were proposed on the web-based. And other context information except location information among user’s context information are not much considered. Therefore, this paper proposed the context-aware framework, which provides more suitable services by using user’s context and profile.
Ultra High Frequency Sigmoid and Trigonometric Higher Order Neural Networks for Data Pattern Recognition

This chapter develops a new nonlinear model, Ultra high frequency siGmoid and Trigonometric Higher Order Neural Networks (UGT-HONN), for data pattern recognition. UGT-HONN includes Ultra high frequency siGmoid and Sine function Higher Order Neural Networks (UGS-HONN) and Ultra high frequency siGmoid and Cosine functions Higher Order Neural Networks (UGC-HONN). UGS-HONN and UGC-HONN models are used to recognition data patterns. Results show that UGS-HONN and UGC-HONN models are better than other Polynomial Higher Order Neural Network (PHONN) and Trigonometric Higher Order Neural Network (THONN) models, since UGS-HONN and UGC-HONN models to recognize data pattern with error approaching 0.0000%.
Program Similarity Detection Tool

—Plagiarism is copying another’s work. Copying source code frequently happens in programming assignments in colleges. Direct copying does constitute academic dishonesty. So the student should be motivated to gain more understanding by typing independently than by copying code directly. The work in this paper presents a tool which would be used for detecting plagiarism in the programs performed by students. Also this would be used to detect whether the source code is copied from internet. Input to the tool would be the programs that need to be checked for plagiarism. The tool would give output as percentage of plagiarism detected between each pairs.
Mechanism of nucleotide exchange by guanine nucleotide exchange factors on the Ras superfamily of small G-proteins.

Abstract The Ras superfamily of small G-proteins cycle between an ‘active’ GTP bound form and an ‘inactive’ GDP bound form. This cycle is controlled by GTPase activating proteins (GAPs) and guanine nucleotide exchange factors (GEFs). Sos, a GEF for Ras proteins, is a ubiquitously expressed 150 kDa protein that is recruited to the cell membrane by Grb2 on phosphorylation of a receptor, where it promotes GDP release from Ras, enabling formation of the active Ras.GTP complex. Study of the interaction of the catalytic domain of mSosl (CmSosl) with N-Ras in vitro was hampered by low expression levels of CmSosl in E.coli. The gene for CmSosl, coding for residues 577-1076, was reconstructed following codon optimisation and expressed in E.coli. Yields for a 4 Litre culture were 120 mg of pure CmSosl protein, an -100 fold enhancement in expression levels. This enabled the interaction of CmSosl with N-Ras to be studied, using the fluorescent analogue of GDP, 2’-deoxy-3’-0-N-methlyanthraniloylGDP (mdGDP) for transient kinetic and equilibrium measurements. The mechanism of nucleotide exchange has been proposed to be a substituted mechanism, exchange factors stabilising a nucleotide free binary complex of GEF.Gprotein allowing rebinding of nucleotide via a transient ternary complex. The formation of a weak ternary N-Ras.mdGDP. CmSosl complex has been studied using fluorescence anisotropy measurements. Addition of excess GDP to NRas.mdGDP. CmSosl enabled the release of mdGDP from the ternary complex to be analysed. These processes have been followed over millisecond time scales using stopped-flow apparatus. The nucleotide free N-Ras.CmSosl complex has been purified and characterised. The reverse reaction, analysing the association of nucleotide to the N-Ras.CmSosl complex, has been studied. Computer simulation of this data has led to rate and equilibrium constants for the steps of the reaction being proposed. The interaction of different nucleotides and nucleotide bound states has also been observed. The interaction of the proposed catalytic domain of aPIX (a Dbl homology exchange factor) with Racl has been studied. Low exchange activity has been observed, leading to the proposal that other factors are required for the observed in vivo activity of PIX on Rho family proteins.
Computational issues in compound processing

Understanding compounds is a challenging computational task, cutting across multiple levels of linguistic analysis and touching upon intricate issues of representation, grammar architecture and algorithmic processing. At the same time, compounds raise all these problems in the most direct and exemplar way. From this perspective, they are an ideal probe into core issues of language architecture, making us pause about the need for advanced processing models and multi-disciplinary approaches to long-lasting linguistic cruces . This chapter reviews some of the lessons that can be learned from reading twenty years of computational literature on the topic and assesses them against the background of germane theoretical and cognitive issues.
Research on personal hybrid recommendation overcoming data sparse problem

Collaborative filtering is one of the typical personal recommendations,but some difficulties exist,such as the data sparse problem,cold starting problem,scaling expanding problem.Two respects of work are done:on one hand,an improved similarity measure is presented to overcome the data sparse problem,on the other hand,the SVD based special user erasing method is presented to overcome the noise-sample problem.The experiments show that the improved method increases 4.30% in terms of MAE,and the combined model,which adopts the weighted average method,further increases 1.26%.
Squaring The Circle Geometry In Art And Architecture

Thank you very much for reading squaring the circle geometry in art and architecture. As you may know, people have search hundreds times for their chosen novels like this squaring the circle geometry in art and architecture, but end up in infectious downloads. Rather than enjoying a good book with a cup of coffee in the afternoon, instead they are facing with some infectious bugs inside their laptop.
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications

'Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic, applied areas such as planning, scheduling, operations research and combinatorial optimization, but also theoretical issues on the theme of complexity and much more, they all are connected through SAT. My personal interest in SAT stems from actual solving: The increase in power of modern SAT solvers over the past 15 years has been phenomenal. It has become the key enabling technology in automated verification of both computer hardware and software. Bounded Model Checking (BMC) of computer hardware is now probably the most widely used model checking technique. The counterexamples that it finds are just satisfying instances of a Boolean formula obtained by unwinding to some fixed depth a sequential circuit and its specification in linear temporal logic. Extending model checking to software verification is a much more difficult problem on the frontier of current research. One promising approach for languages like C with finite word-length integers is to use the same idea as in BMC but with a decision procedure for the theory of bit-vectors instead of SAT. All decision procedures for bit-vectors that I am familiar with ultimately make use of a fast SAT solver to handle complex formulas. Decision procedures for more complicated theories, like linear real and integer arithmetic, are also used in program verification. Most of them use powerful SAT solvers in an essential way. Clearly, efficient SAT solving is a key technology for 21st century computer science. I expect this collection of papers on all theoretical and practical aspects of SAT solving will be extremely useful to both students and researchers and will lead to many further advances in the field. ' Edmund Clarke (FORE Systems University Professor of Computer Science and Professor of Electrical and Computer Engineering at Carnegie Mellon University)
A Review of Image Retrieval Techniques in the Compressed Domain

The advent of compression standards, such as JPEG and MPEG, has led to the popularity of the compressed form of image data, and that has brought on the proliferation of image retrieval techniques in the compressed domain. In this paper, we make a comprehensive review and discussions on the compressed domain retrieval techniques proposed in the literature, including the lastest achievements in this field. First, we give the general concepts of the image retrieval technology. Secondly, we analyze different retrieval techniques, including transform domain techniques using Fourier transform, discrete cosine transform, subbands and wavelets, and spatial domain techniques using vector quantization and fractals. Thirdly, we discuss and compare these image retrieval techniques and draw some useful conclusions. In addition, an example application of image retrieval in the compressed domain is presented. Finally, we make a discussion on some open problems and point out possible directions for further research.