Reviewerly/exHarmony huggingface dataset:
Insiders Dissected: New Foundations and a Systematisation of the Research on Insiders

The insider threat is often cited as one of the most challenging threats for security practitioners. Even though this topic is receiving considerable attention, two main problems remain unsolved. First, research on insider threats is focusing on many different insiders without being able to actually identify and consistently entitle the key aspects of the insiders. As a result, this research can neither be identified by practitioners as being relevant for their real-world insider problems, nor can it be compared with other research targeting the same insider aspects. Second, a clear understanding of insiders is vital for analysing, which insider properties are responsible for the peculiarity of insider threats . In this article, a systematic approach to dissect the defining aspects of insiders is proposed, which includes specific allocatable insider characteristics. Additionally, the insider characteristics are extended toward insider types, which establish universal and unambiguous names for different insiders and which are related with each other to form a new and simple insider taxonomy . The new foundations on insiders allow the comparison of different insider research in a structured manner. Furthermore, the new approach facilitates the identification of specific features of insider threats in future work.
Information and Communication Technologies as Components of Effective Training Forms for Higher Education Applicants

The relevance of the issues regarding information and communication technologies as components of effective training forms for higher education applicants is determined by the need to introduce information and communication applications into the educational process. Accordingly, the purpose of the article is to provide theoretical justification and experimental verification of the impact that information and communication technologies have on improving the higher education quality for applicants. To achieve this purpose, a complex of modern general scientific methods was used: theoretical (analysis, synthesis, generalisation, comparison); empirical (questionnaires, conversations, interviews, observations, expert assessment); statistical research methods that facilitated the study of scientific sources on information and communication technologies. Based on the theoretical and methodological analysis of the studied issue, it is determined that information and communication technology is a means of joint activity for a teacher and a higher education applicant, which is characterised, primarily, by the consistency of actions (algorithmicity), constant and systematic evaluation of educational achievements and the development of educational qualities (diagnostics), the relationship of the main technology elements, namely the purpose, content, forms, methods, means of interaction, and the results (consistency) of participants in the educational process. It was discovered that to present the material more interestingly and motivate applicants for higher education, it is necessary to use innovative teaching forms and methods, one of which is information and communication applications that contribute to enhanced logical thinking, cognitive activity, the creativity of students and the comprehensive personality development of the future pedagogical specialist. It is proved that these applications contribute to the easier assimilation of new educational material, the creative performance of practical tasks, and productive cooperation between teachers and applicants for higher education. The practical value of the research lies in the fact that the results obtained can be used in further studies on the influence of information and communication technologies on the communication of the educational process subjects
Design and Fabrication of Kayak Carrier

Abstract Kayak has become the most popular outdoor activities among the community of UiTM Cawangan Terengganu, Kampus Bukit Besi. It is due to the location of this campus is situated near Tasik Puteri. During kayak activities, the users need to bring the kayak from campus to the lake. The distance from the storage area to the lake is about 800 m. A minimum of two persons is required to carry the kayak due to its size and weight. Where the average recreational kayak weighs 16kg for a single kayak and 27kg for a tandem kayak. Therefore, this study is focused on designing the kayak carrier to overcome these problems. There are several stages involved in producing the kayak carrier, which are concept generation and evaluation, CAD design, fabrication, and testing. In a conclusion, by using this kayak carrier, only one person needed to carry the kayak from the storage area to the lake, and the traveling time also can be reduced as the person need to cycle instead of walking.
Comparison of Algorithms for W orkflow Applications in C loud C omputing

Cloud computing model has evolved to deliver resources on pay per use model to businesses, service providers and end-users. Workflow scheduling has become one of the research trends in cloud computing as many applications in scientific, business, and big data processing can be expressed in the form of a workflow. The scheduling aims to execute scientific or synthetic workloads on the cloud by utilizing the resources by meeting QoS requirements, makespan, energy and cost. There has been extensive research in this area to schedule workflow applications in a distributed environment, to execute background tasks in IoT applications, event-driven and web applications. This paper focuses on the comprehensive survey and classification of workflow scheduling algorithms designed for the cloud.
Hidden Danger and Control of Construction Safety of Internet of Things Based on Cognition

The development of scientific research, industrial production and residents’ life all need to use various types of buildings, so the development of the construction industry at this stage is very fast. In the construction management, the importance of safety management is self-evident, it is not only the need of the sustainable development of the construction industry, but also the guarantee of social stability and economic development. Therefore, this paper analyzes the construction safety risks and control countermeasures based on association rules. With a sound and reasonable safety management system to effectively regulate all aspects of construction, reduce the incidence of safety accidents to the minimum, so as to realize the sustainable development of the construction industry and make contributions to the construction of a harmonious society.
SCSA: A Solution for Key Leakage in Cloud Storage Auditing

SCSA is the abbreviation of secure cloud storage auditing. Cloud storage auditing is a mechanism to ensure the integrity of data stored in cloud. Many Individuals and organizations depend on cloud to store their vast amount of data. After storing their data, client loses the control over their data, So it is natural that client become doubtful about the existence of their data which is stored in the cloud. Thus, this auditing scheme is introduced. This scheme helps the client to check whether their data is altered by any other third party, But this auditing scheme is also vulnerable to attacks. A secret key is required to prove the existence of original data in cloud. But that secret key is not secured properly, so in case if the key is lost, an attacker can make fake proofs of the data and thus data loss incidents can be made hidden from the clients, To avoid that, a solution is presented in this paper that is periodic key update. More efficient algorithm is used for updating key, and also this paper proposes two new algorithm for auditing purposes, In addition duplication of data is also avoided.
Preserving the Temporal Consistency of Video Sequences for Surgical Instruments Segmentation

Temporal consistency information plays an important role in video segmentation. Some previous automatic annotation methods inevitably caused the temporal consistency information loss of sequential frames when processing sparse labeled frames. Thus, as a supplement, interpolation method was proposed to compensate motion flows between two frames via interpolating high-precision frames and corresponding labels, but its quality is remained to be improved. We propose a new interpolation module to smooth the large motion between frames and preserve temporal consistency. First, we use an optical flow estimator to directly estimate the optical flow, and then refine the interpolation frame by combining the features of the original frames. We evaluate our method on the MICCAI EndoVis Robotic Instrument Segmentation Challenge dataset. Experimental results demonstrate our method can well preserve the temporal consistency information and outperform the state-of-the-art method in segmentation accuracy.
Strudel: A fast and accurate learner of structured-decomposable probabilistic circuits

Probabilistic circuits (PCs) represent a probability distribution as a computational graph. Enforcing structural properties on these graphs guarantees that several inference scenarios become tractable. Among these properties, structured decomposability is a particularly appealing one: it enables the efficient and exact computations of the probability of complex logical formulas, and can be used to reason about the expected output of certain predictive models under missing data. This paper proposes Strudel, a simple, fast and accurate learning algorithm for structured-decomposable PCs. Compared to prior work for learning structured-decomposable PCs, Strudel delivers more accurate single PC models in fewer iterations, and dramatically scales learning when building ensembles of PCs. It achieves this scalability by exploiting another structural property of PCs, called determinism, and by sharing the same computational graph across mixture components. We show these advantages on standard density estimation benchmarks and challenging inference scenarios.
Quantum approximate optimization of the coset leader problem for binary linear codes

The security of a broad family of coding-based cryptographic techniques relies on the hardness of the Syndrome Decoding Problem (SDP). In this problem, the aim is to find a word with a given syndrome and of Hamming weight smaller than a prefixed bound. If this last condition is replaced by “of minimum weight,” then we have the Coset Leader Problem (CLP), being Finding Low Weight Codewords (FLWC) a particular case (when the zero syndrome is considered). An algorithm that has been proposed in order to obtain approximate solutions of problems of these kind (NP-complete) is the Quantum Approximate Optimization Algorithm (QAOA), a variational hybrid quantum-classical algorithm. In this paper, we apply the QAOA to the CLP for binary linear codes. We model the problem, make the theoretical analysis the case of the first level, and introduce some experiments to test its performance. The experiments have been carried out on quantum computer simulators with codes of different lengths and QAOA of different depth.
Romanian Lexical Resources Interconnection

Great efforts are being made to increase the utility of linguistic resources in applications related to language processing by interconnecting them. This study is focused on the Romanian language, which is a young language in this domain, for which it has to be made big steps until it is considered well resourced - both qualitatively and quantitatively. The CoRoLa corpus has been developed for 4 years and since 2017 it is visible for research. It cumulates about one billion words, annotated (tokenized, lemmatized, morphologically and syntactically processed). Other two resources used in this study are the eDTLR (the electronic version of the Thesaurus Dictionary of the Romanian Language) and Romanian WordNet. In this study it is described a technology that unifies these resources and brings them to a common standard, which leads the way for an efficient coupling of these resources. With this new obtained standardized resource, a series of test and case studies were performed, with the benefit of a much more diverse exposure on using the Romanian language.
Alcohol and Handwritings

Handwriting requires coordination of motor skills and cognitive skills which reflects the pictorial effect of the writer and their social and cultural patterns. It creates a unique combination of graphics and motor control of hands which is accepted by the society. Personality traits and characteristics are defined and have the unique handwriting, which gives the writer its individuality. Every writer is individual in their own way based on the handwriting features which can undergo variation when the writer shows commotion and disruptions in its normal neurological and muscular control. This paper reviews and focuses on the natural variation of the writing and also if these variations are caused under the influence of any externally induced elements, such as alcohol.
Adversarial Text Generation for Personality Privacy Protection

Protecting the user's personality privacy can effectively interfere with or deceive the attacker's personality analysis, avoid the attacker's use of personality vulnerability, and reduce the success rate of social engineering attacks. However, the current research on personality privacy protection is at a blank stage. To solve this problem, we propose a personality privacy protection method based on adversarial text generation. This paper mainly uses gradient-based adversarial method and cosine similarity to generation adversarial text. We formed a set of replacement words to test the impact of the number of replacement words on the performance of the model. Experiments show that the method proposed in this paper has achieved good effects on model attacks (reducing the performance of the model), and can well complete the task of protecting personality privacy.
Towards Designing Human-Centered Time Management Interfaces

The widespread awareness of the functional role of time in human behaviors has opened up diverse research opportunities for “human-centered” time management mobile interfaces. Although a wide range of time management systems has been researched and developed, there is a need for integrated perspectives to be represented in a more systematic way to allow better implementation of extant findings. To develop human-centered time management interfaces, this paper presents the set-up of the development of UX design guidelines for time-related experiences. We investigate extant design approaches through a systematic literature review. Furthermore, we present the first version of UX design guidelines by synthesizing 31 reviewed articles and 150 relevant design considerations. We expect that our first iteration of the guidelines, which will be reviewed and revised for our next deployment study, will serve as a source of inspiration for further academic and professional research initiatives on users’ time-related experiences.
Formalizing an Architectural Model of a Trustworthy Edge IoT Security Gateway

Today’s edge networks continue to see an increasing number of deployed IoT devices. These IoT devices aim to increase productivity and efficiency; however, they are plagued by a myriad of vulnerabilities. Industry and academia have proposed protecting these devices by deploying a “bolt-on” security gateway to these edge networks. The gateway applies security protections at the network level. While security gateways are an attractive solution, they raise a fundamental concern: Can the bolt-on security gateway be trusted? This paper identifies key challenges in realizing this goal and sketches a roadmap for providing trust in bolt-on edge IoT security gateways. Specifically, we show the promise of using a micro-hypervisor driven approach for delivering practical (deployable today) trust that is catered to both end-users and gateway vendors alike in terms of cost, generality, capabilities, and performance. We describe the challenges in establishing trust on today’s edge security gateways, formalize the adversary and trust properties, describe our system architecture, encode and prove our architecture trust properties using the Alloy formal modeling language. We foresee our trustworthy security gateway architecture becoming a practical and extensible formal foundation towards realizing robust trust properties on today’s edge security gateway implementations.
Fundamentals of Digital Optimal Filtering

This chapter provides the fundamentals of optimum filtering and shows different applications of this important theory in seismic data processing.
Regrouped design in privacy analysis for multinomial microdata

Abstract In this paper, we are dealing with the dual goals for protecting privacy and making statistical inferences from the disseminated data using the regrouped design. It is not difficult to protect the privacy of patients by perturbing data. The problem is to perturb the data in such a way that privacy is protected, and also, the released data are useful for research. By applying the regrouped design, the dataset is released with the dummy groups associated with the actual groups via a pre‐specified transition probability matrix. Small stagnation probabilities of regrouped design are recommended to reach a small disclosure risk and a higher power of hypothesis testing. The power of test statistic in the released data increases as the stagnation probabilities depart from 0.5. The disclosure risk can be reduced further if more quasi‐identifiers are relocated. An example of National Health Insurance Research Database is given to illustrate the use of the regrouped design to protect the privacy and make the statistical inference.
Automatic summarization of New Testament exegesis texts

In this paper we present two algorithms that can be used for EATS (Extractive Automatic Text Summarization) of theological New Testament exegesis texts. Both algorithms represent input text as sentence embeddings (i.e. they do not rely on the classical bag-of-words TF-IDF model), the first algorithm is based on graph clustering and the other one is an evolutionary algorithm. In the graph-based algorithm, the sentence embeddings are represented as vertices in a graph, then the graph is clusterized and the best sentence from each cluster is extracted as candidate for the text summary. In the second algorithm, the sentences from the initial text are represented in a binary model and they are evolved based on a fitness function that encompasses various desired qualities of the text summary. We have tested both algorithms on a theological texts dataset, but also on general, standard, dataset DUC2002 and we have obtained good ROUGE scores.
Attention-based Feature Enhanced Dehazing Network

Presence of haze in images obscures underlying information, which is undesirable in applications requiring accurate environment information. To recover such an image, a dehazing algorithm should enhance the feature information of the background while weakening the feature information of haze. In this paper, we propose an end-to-end attention-based feature enhanced dehazing network (AEDNet), which integrates enhancement strategy and attention mechanism, to achieve haze removal. The network is based on U-Net, which has the advantages of retaining information, obtaining multi-scale features and so on. In the training of the network, pixel loss and perceptual loss are used to preserve feature information and improve the overall quality of results. The extensive evaluation shows that the proposed model performs significantly better than previous dehazing methods on various benchmarks.
A Privacy-Preserving Attribute-Based Encryption System for Data Sharing in Smart Cities

Information leakage and efficiency are the two main concerns of data sharing in cloud-aided IoT. The main problem is that smart devices cannot afford both energy and computation costs and tend to outsource data to a cloud server. Furthermore, most schemes focus on preserving the data stored in the cloud but omitting the access policy is typically stored in unencrypted form. In this paper, we proposed a fine-grained data access control scheme based on CP-ABE to implement access policies with a greater degree of expressiveness as well as hidden policies from curious cloud service providers. Moreover, to mitigate the extra computation cost generated by complex policies, an outsourcing service for decryption can be used by data users. Further experiments and extensive analysis show that we significantly decrease the communication and computation overhead while providing a high-level security scheme compared with the existing schemes.
Text-Independent Speaker Recognition Using Deep Learning

Speaker recognition is the process of recognizing the speaker by using speaker-specific information. A speaker recognition system can be classified into text-dependent speaker recognition and text-independent speaker recognition systems. In a text-dependent system, the recognition phrases are fixed (known beforehand). The user can be prompted to read a randomly selected sequence of numbers. However, in a text-independent speaker recognition system, there are no constraints on the words which the speakers are allowed to use. What is spoken in training and what is uttered in actual use may have completely different content. The entire domain of speaker recognition can be further categorized into speaker identification and speaker verification. Speaker verification evaluates whether the voice belongs to some person, while speaker identification tries to find out the person it belongs to. In this paper, Mel-frequency cepstral coefficients (MFCC) were extracted from the audio files. These features were then fed a convolutional neural network (CNN). This CNN was then optimized in order to increase model accuracy. Over the span of six runs of varying parameters, a maximum accuracy of approx. 97% was achieved.
Encoding Induction Proof in Dafny

Formal verification plays an important role in proving the correctness of safety-critical systems such as cache coherence protocols and security protocols. However, it usually involves rather complicated proofs which demand profound techniques in theorem proving. These techniques are too hard for those programmers with no experience in formal verification to grasp. The induction proof is a good way to reason about the properties of systems. Our work proposes a feasible approach to encode induction proof in Dafny which helps programmers to verify the systems. First, we revisit induction proof and proof dependency. Then, we decompose the complicated proof obligation into induction proof and encode the proof dependency into Dafny. Finally, we present case studies in cache coherence protocols, loop invariants and security protocols to illustrate our approach.