Miracle-dz/UniFAR-FTUs huggingface dataset:
Аналіз FREAK атаки через вразливість «CVE-2015-0204»

Дослідники з INRIA (національний дослідницький інститут у Франції, що працює в галузі комп'ютерних наук, теорії управління та прикладної математики) і Microsoft повідомили про виявлення уразливості під номером CVE-2015-0204, яка, імовірно, існувала протягом більш ніж 15 років і яка робить технічно можливим перехоплення HTTPS-трафіку, який йде між певними сайтами і пристроями під керуванням Apple iOS і MacOS, а також Google Android. FREAK це абревіатура від Factoring attack on RSAEXPORT Keys. Атака спрацьовує, коли вразливі пристрої підключаються до сайтів, на яких стоїть морально застаріле програмне забезпечення для шифрування, яке, як вважалося, вже давно ніким не використовується. Зловмисник, який має можливість перехоплювати трафік між вразливим пристроєм і вразливим сервісом, може впровадити в нього свої спеціальним чином створені пакети, які змусять обидві сторони використовувати "для спілкування" слабкий 512-розрядний ключ для шифрування. Змусити браузер і сайт перейти на більш низький рівень шифрування ключовий момент FREAK-атаки. Після цього зловмисник може використовувати орендовані на, наприклад, Amazon, обчислювальні потужності для того, щоб легко дешифрувати слабкий за нинішніми мірками ключ, схований у перехопленій трафіку. За оцінками фахівців, вартість потужностей, потрібних для такої операції складає близько 100 доларів, що робить FREAK привабливим для хакеріваматорів, а професіоналам дозволяє поставити злом "на потік". Розкривши ключ, зловмисник може "підняти" в локальній мережі або, наприклад, в Wi-Fiмережі кафе, копію даного його сайту і збирати різну інформацію логіни і паролі від соціальних мереж, ключі від інтернет-банків і так далі. Попутно вимальовується кілька додаткових проблем, які роблять FREAK дуже ефективною атакою. По-перше, генерувати нові RSA-ключі дороге задоволення, тому багато веб-сервери, стартуючи, генерують один єдиний ключ, який потім використовують для захисту всіх з'єднань. Якщо зловмисник його перехоплює він може ним користуватися "всю дорогу". По-друге, HTTPS-протокол не вимагає від учасників з'єднання відмови від використання 512бітних ключів, в результаті чого останній є цілком "валідним" для спілкування між сервером і клієнтом. Навіть, незважаючи на те, що сучасні обчислювальні потужності дозволяють його зламати хакерамлюбителям за розумний час.
A Java based Distributed Approach to Genetic Programming on the Internet

This paper presents a distributed approach to parallelise Genetic Programming on the Internet. The motivation for the approach is to harness the wealth of computing resources available on the Internet to provide the computing power required for solving diicult problems. A distributed genetic programming system termed DGP is developed in the Java programming language to demonstrate the feasibility of distributing genetic programming on the Internet. Unique features of the DGP system include the use of Java Servlets to handle the communication between DGP clients, the use of a population pool to neutralise diierences in speeds of hosts, the interactive user interface and graphical displays of the evolution process. The DGP system has been implemented over the Internet and the results are favourable. Experiments were conducted to determine the performance of the DGP system. Results showed that the DGP system has a much higher probability of nding solutions as compared to the distributed approaches taken in our previous studies and the single population Genetic Programming.
Infotop - An Information and Communication Infrastructure for Knowledge Work

The desktop metaphor has been helpful as long as the types, formats and amounts of contents to be administered were limited. Due to the increase in size and complexity of contents, much of the original desktop's functionality has moved into applications, replacing the desktop as the central view to collections of contents. We will outline an environment based on knowledge management (KM) concepts, that can better cope with the requirements of knowledge workers. We will analyze shortcomings of the desktop for supporting KM-related tasks and motivate its replacement by what we call infotop, a new metaphor to interact with personal knowledge environments.
Graphical Models for Gene Expression Profile Analyses

The recent sequencing of complete genomes and the accumulation of genomic data have induced the drastic changes of the analysis forms in the field of computational biology. In particular, statistical analyses are indispensable for processing large amounts of data in the post-genomic era. One of the most challenging issues for statistical analysis is the network inference from expression profiles, which mean the data of expression degrees of many genes that are simultaneously monitored under dierent conditions. Among the various approaches for the network inference, here we describe an approach based on graphical models: graphical Gaussian model, graphical chain model, and path consistency algorithm. First, the mathematical framework of the graphical models is briefly described from a graph-theoretic perspective, and then the models and the procedures for their applications to the network inference are explained. Finally, some examples of actual profile data analyses by the three models are illustrated.
Panoptic Expert: Searching for experts not just for documents

In large organisations, particularly those spread over multiple offices, undergoing organisational change or experiencing high staff turnover, it can be difficult to keep track of employee expertise. P@NOPTIC Expert is a Web based system which automatically identifies experts in an area, based on the documents already published on an organisation’s intranet. The system can be queried like a standard Web search engine, but instead of returning documents it returns a list of experts. Each expert listing includes contact details and supporting evidence. The prototype shows the benefit of integrating Web data with structured data (a list all of employees) to deliver more valuable corporate information.
ECOSIMPRO CODE GENERATION FROM THE PHYSICAL ANALYSIS OF OBJECT-ORIENTED MODELS

To cope with the growing demands for simulation models of ever increasing complex industrial systems, the research community effort has been mainly focused in creating different software tools which simplify the modeling process. This work describes how the Object-Oriented Modeling language PML automates the modeling process by using physical knowledge in order to set the mathematical model of the system. The modeling language introduces a new modularization of the physical knowledge required to model a system, making a clear separation between the physical behavior representation (declarative knowledge) and the computational aspects of model simulation (procedural knowledge). The mathematical model can be formulated by means of an equation based language like EL or Modelica.
Dynamic computational complexity

Dynamic computational complexity is the study of resource-bounded ongoing computational processes. We consider the general problem of processing a sequence of inputs, instead of a single input. We introduce a new model for dynamic computation, and investigate the computational complexity of various dynamic problems. The field of computational complexity has previously studied static computation, which takes a single fixed input and computes the desired result. We define a dynamic problem to be the function mapping a stream of data to the desired stream of output, and we investigate the complexity of the dynamic computation required to compute that function. We describe complexity classes of dynamic problems, reductions between dynamic problems, and complete problems for dynamic complexity classes.
A PEDAGOGICALLY DRIVEN, DIRECTED LEARNING ENVIRONMENT

This paper describes work that has been undertaken at the Department of Computer Science, University of Wales, Aberystwyth in developing a generic, integrated, directed learning environment. This is an environment that has evolved from a coherent model of pedagogy rather than, as is often the case, technology for technologies sake or a system developed in an ad-hoc manner in response to immediate pressure. It has been designed to be student driven, interactive, provide frequent testing with rapid feedback and to encourage reflective learning, all features recognized to be pedagogically important. Although the system is still under development, it has already been introduced into large parts of the curriculum.
The Java Programming Language" The Java Series

In molten metal handling using a stopper rod to close a nozzle in the base of a ladle, the end of the rod is covered by a sleeve of 45 - 94% by weight of particulate refractory, 5 - 50% fibrous refractory and 1 - 15% of binder.
Liberal or Conservative: Evaluation and Classification with Distribution as Ground Truth.

The ability to classify the political leaning of a large number of articles and items is valuable to both academic research and practical applications. The challenge, though, is not only about developing innovative classification algorithms, which constitutes a “classifier” theme in this thesis, but also about how to define the “ground truth” of items’ political leaning, how to elicit labels when labelers do not agree, and how to evaluate classifiers with unreliable labeled data, which constitutes a “ground truth” theme in the thesis. The “ground truth” theme argues for the use of distributions (e.g., 0.6 conservative, 0.4 liberal) instead of labels (e.g, conservative, liberal) as the underlying ground truth of items’ political leaning, where disagreements among labelers are not human errors but rather useful information reflecting the distribution of people’s subjective opinions. Empirical data demonstrate that distributions are dispersed: there are many items upon which labelers simply do not agree. Therefore, mapping distributions into single labels requires more than just majority vote. Also, one can no longer assume the labels from a few labelers are reliable because a different small sample of labelers might yield a very different picture. However, even though individual labeled items are not reliable, simulation suggests that we may still reliably evaluate and rank classifiers, as long as we have a large number of labeled items for evaluation. The optimal way is to obtain one label per item with many items (e.g., 1000~3000) for evaluation. The “classifier” theme proposes the LabelPropagator algorithm that propagates the political leaning of known articles and users to the target nodes in order to classify them. LabelPropagator achieves higher accuracy than the alternative classifiers based on text analysis, suggesting that a relatively small number of labeled people and stories, together with a large number of people to item votes, can be used to classify the other people and items. An article’s source is useful as an input for propagation, while text similarities, users’ friendship, and “href” links to articles are not.
A Step towards Software Requirements Elicitation from Unstructured Documents

Good requirements have to be gathered for software development. Most of the requirements from the client of a proposed software system are available in informal or unstructured documents. Most often requirements are ill defined. Deficiencies in software requirements are mostly identified only after deployment. Most software requirements data available to software engineers are expressed in natural language & 90% of data are unstructured. Customers might not be able to provide all the requirements since they are not sure of what they want. Also they are unable to state the requirements due to incomplete knowledge of the applications functionality. This paper proposes methods to derive formal specifications from informal or unstructured documents using techniques from natural language processing & text mining. The purpose of using natural language processing techniques is that sentences should be understood without human intervention and to understand the document in a way how human beings interpret & understand. The objective is to elicit the requirements from informal documents without using any strict template & to keep human intervention to the minimum. A parser or POS tagger is to be used to find the nouns, verbs. Transform free form text into an Intermediate Form (IF), Extract Entities & Relations then cluster Entities & Relations. Natural language transcripts contain lots of user requirements specified in their own language without any technicalities. For program development these informal requirements have to be derived, studied for their feasibility and then built into the software which would satisfy the requirements of the customer. Capture the requirements for the system and generate specifications from the captured requirements so that the software engineers and customers can understand them.
Dynamic Music Lessons on a Collaborative Score Annotation Platform

The recent progress in Information and Communication Technologies gave birth to advanced applications in the field of instrumental e-learning. However, most of these applications only propose a limited number of lessons on predetermined pieces, according to the vision of a single music expert. Thus, this article introduces a web platform to create music lessons dynamically and collaboratively, with the assistance of a semi-automatic score annotation module: @-MUSE. To do so, we first describe a new methodology to design such a platform: Sign Management. Then, we detail its general architecture as an Iterative Sign Base System based on a common practice in music learning: score annotation. Lastly, we give various algorithms to generate relevant annotations (explanations) on a score, based on the analysis of musical patterns difficulty.
Researching intuitive interaction

Intuitive interaction is based on past experience and is fast and often non conscious. We have conducted ten studies into this issue over the past ten years, involving more than 400 participants. Data collection methods have included questionnaires, interviews, observations, concurrent and retrospective protocols, and cognitive measures. Coding schemes have been developed to suit each study and involve robust, literature based heuristics. Some other researchers have investigated this issue and their methods are also examined. The paper traces the development of the methods and compares the various approaches used over the years.
Proceedings of the 2013 International News Recommender Systems Workshop and Challenge

News article recommendation differs in several ways from other well-known types of recommender systems such as for music and movies. First, freshness represents an important aspect. Sometimes, freshness is deemed more important than relevancy. Second, similarity between news articles does not necessarily reflect their relatedness. For instance, two news articles might share a majority of words. Still, their actual topic might differ. Third, news are typically published in a rather unstructured format. In contrast, structured data such as social graphs facilitate pre-processing steps. Fourth, news readers might have special preferences on some particular events which recommender systems can barely predict. Fifth, serendipities (i. e., variety in recommended news articles) represent a crucial property of a news recommender system. Contrarily to music recommendations, users avoid to re-consume an item. Thus, news recommender systems are required to provide diverse sets of items in order to assure not to recommend monotonously. Sixth, breaking or trendy news might have a high relevance even though the appear completely unrelated to the individual user profile. Seventh, the has not yet established consensus on how to evaluate news recommender systems. We typically observe implicit preferences as users interact with news portals. Those preferences do not exhibit a graded relevance. Thus, well-established evaluation criteria based on ratings (e.g., root mean squared error) cannot be applied. Another set of challenges arises from the context of news recommendation. Recommender systems are known to struggle with so-called "cold-start users" (i. e., users form whom no preferences are available yet). News portals typically refrain to require users to login prior to read news articles. Hence, there is a large fraction of users who appear to be "cold-start users". The lack of sufficiently many interaction to established trustworthy user profiles entails further challenges. Inferring interest signals suffers from incomplete profiles. Additionally, items' relevance is time dependent and diminishes with time progressing. Another challenge related to the context arises from the increasingly frequent use of mobile devices to read news articles such as tablets and smart phones. Those have a limited space available to display news and related recommendations. News recommender systems have to deal with this issue thus applying suited layout mechanisms to fit the content to the available screen. Finally, news recommender systems face numerous technical challenges. Those challenges include minimizing response time improve user experience, scaling to the large amount of requests to avoid time outs, providing flexibility to incorporate new recommendation methods or adjust parameter settings for existing implementations, and guarantee a reliable service whom user can access at any time.
Fast high accuracy volume rendering

In computer graphics, color calculations for volumes can be significantly more computationally intensive than that for surfaces. Consequently, until now no interactive volume rendering system performs these calculations for even linearly interpolated luminance and opacity without resorting to rough approximations or a finite set of precomputed values. In this dissertation, I describe an unstructured grid volume renderer. The renderer is interactive, yet it can produce artifact free images that traditionally would take minutes to render. I employ a projective technique that takes advantage of the expanded programmability of the latest 3D graphics hardware. I analyze also an optical model commonly used for scientific volume rendering and derive new approximations that are exceptionally accurate but computationally feasible in real time. I demonstrate a system that can accurately produce a volume rendering of an unstructured grid with any piecewise linear transfer function. Furthermore, my algorithm is capable of rendering over 300 thousand tetrahedra per second yet is not limited by pre-integration techniques.
Verification and Synthesis of Hybrid Systems

This thesis proposes a practical framework for the verification and synthesis of hybrid systems, that is, systems combining continuous and discrete dynamics. The lack of methods for computing reachable sets of continuous dynamics has been the main obstacle towards an algorithmic verification methodology for hybrid systems. We develop two effective approximate reachability techniques for continuous systems based on an efficient representation of sets and a combination of techniques from simulation, computational geometry, optimization, and optimal control. One is specialized for linear systems and extended to systems with uncertain input, and the other can be applied for non-linear systems. Using these reachability techniques we develop a safety verification algorithm which can work for a broad class of hybrid systems with arbitrary continuous dynamics and rather general switching behavior. We next study the problem of synthesizing switching controllers for hybrid systems with respect to a safety property. We present an effective synthesis algorithm based on the calculation of the maximal invariant set and the approximate reachability techniques. Finally, we describe the experimental tool "d/dt" which provides automatic safety verification and controller synthesis for hybrid systems with linear differential inclusions. Besides numerous academic examples, we have successfully applied the tool to verify some practical systems.
Portfolio optimization using data analysis techniques

In this paper we propose an algorithm for hierarchical classification, based on an ultrametric distance. We study its properties and develop an application in Microsoft Visual Studio, based on the algorithm proposed, using C# language. The software obtained will be used to classify the shares from Bucharest Stock Exchange which had profit during the last two years, in order to find similarities and differences between these shares and build a diversified portfolio. We prove that this portfolio is representative for the shares from Bucharest Stock Exchange and we study its evolution at different moments of time. We demonstrate the performance of the proposed algorithm by comparing the results obtained with the evolution of BET index, BET-C index or BET-XT index, which are representative for the capital market.
Detecting disfluency in spontaneous speech

This thesis reports a study of the perception of disfhiency in spontaneous, con¬ versational speech. Disfluent speech presents problems for both computational and psycholinguistic models of speech processing. The surface strings produced when speech is interrupted by disfluency require complex editing processes from computational models in order to produce well-formed strings for parsers. There is little em¬ pirical evidence about how the human speech processing mechanism deals with disfluencies, but our everyday experience of listening to speech suggests that we can deal with disfluencies very smoothly and efficiently. One of the first prob¬ lems for a speech processor is to detect that disfluency has occurred. No reliable acoustic or prosodic cues have been identified which signal the presence of a discontinuity. In this thesis, the main aims are address this problem by first es¬ tablishing detection points for a set of disfluent utterances and then finding out what acoustic and prosodic cues are available at these points. The main part of the study consists of a series of 5 perceptual experiments, followed by acoustic and prosoodic analyses. The first 3 experiments establish detection points for disfluencies and relate these points to recognition points of the words in the vicinity of the interruption. The last 2 experiments examine the role of prosodic information in detecting disfluency. , first over whole utterances and then focussing in on the region of the interruption. The acoustic and prosodic analyses of the experimental stimuli match responses indicating disfluency detec¬ tion to events in the speech signal which might act as cues. The results of the first 3 experiments show that disfluency can be recognised very early, usually within the first word after the interruption point. Importantly, it is also shown that the detection of disfluency can be achieved before the word is recognised non-syntactic information is used. The last two experiments confirm that prosodic information can be used to distinguish fluent from disfluent utter¬ ances. The acoustic and prosodic analyses suggest that a combination of cues can be of use. In the absence of "ungrammatical pause" and broken-off words, a break in the signal is signalled by the absence of phonological linking between the words on either side of the interruption. It may be possible to identify other cues in future studies with larger data sets.