Miracle-dz/UniFAR-FTUs huggingface dataset:
Concept to Enrichen Lightweight, Neutral Data Formats with CAD-based Feature Technology

AbstractThe need of feature information in CAD-systems is undisputed. In order to accelerate the product development process, the use of features should be considered to its full extent. With neutral, lightweight data formats becoming more popular in terms of replacing native CAD-data in many follow up processes in the scope of Product Lifecycle Management (PLM), a consistent use of feature information in such formats must be adapted. By the example of JT, we present a concept to combine neutral, lightweight data formats with a respective XML schema/dataset, enriching the format’s application potentials.
A metaphysics for the classification of chemical reactions in practice

This thesis investigates the classification of chemical reactions in practice. It is motivated by the lack of discussion in the natural kind literature on the classification of reactions and other non-entity like things. I appeal to the discipline of chemoinformatics and study a new approach to the classification of reactions which is aimed specifically at meeting the needs of chemists in industry. I show that this methodology consists of three stages; the identification of a type of reaction of interest, the identification of a quantitative structural activity reaction and the importing of this data into a neural network. The output of classification is a reaction landscape which represents the similarity relations that hold between the different reactions. My aim is to outline a metaphysics that is descriptively fit for purpose with respect to my case study. I argue that such a metaphysics must be descriptively accurate, capture appropriate similarity relations and promote explanatory unification. I evaluate the entities and activities ontology proposed by Machamer, Darden and Craver, an ontology consisting on entities and dispositional properties and causal dispositionalism, against my criteria. I argue that none of these accounts are descriptively fit for purpose and that commitment to an ontological category of processes is required alongside commitment to entities and dispositional properties. I suggest that the types of reactions revealed in classification fall in the category of processes. From my analysis of reaction classification throughout the course of my thesis, I generate a list of characteristics associated with reactions and use this to provide an account of the metaphysics underlying the category of processes. My proposal focuses on the relationship between potentiality and actuality in a given chemical reaction.
Computer control : task synchronisation in dynamic priority scheduling

Due to common resource protection, most real-time tasks have non-preemptive sections. Such sections, called critical sections, rise several problems to real-time scheduling theory. Namely, deadlock avoidance and bounded blocking time. Different and widely mentioned solutions exist for this problem in the context of fixed priority scheduling. However, solutions for the same problem but in the context of totally dynamic scheduling, although much more interesting, are seldom referred in the current literature. This paper surveys those solutions and illustrates their philosophies, providing thus a considerable help for real-time systems designers who develop or intent to develop their applications upon EDF or other totally dynamic scheduling algorithm.
Representación de fractales con L-Sistemas

El siguiente documento presenta un estudio de los diferentes algoritmos usados para construir algunos fractales clasicos, pasando por el lenguaje natural y matematico, luego una estructura codificada como los L-Sistemas, y finalmente un lenguaje estructurado (lenguaje de programacion) para la construccion de los codigos que se representan mediante el uso del programa Turtle Graphics Renderer que es un programa gratuito y en linea para la generacion de L-Sistemas creado por Kevin Roast en el ano 2012. Se presenta una descripcion general del programa asi como las instrucciones basicas para realizar representaciones graficas de algunos fractales clasicos y esquemas simples de plantas.
An icon preferences study on colors

Icon is one part of UX (user experience system), which determines how users feel when they use a product, and even leads to user loyalty. The use of colors is one way to improve user experience and eventually makes users to be loyalty towards a product. Therefore, the purpose of this study was to investigate users’ icon color preferences, in order to assist designers creating appropriate and widely preferred icons. This study explored how colors and display polarity affected on icon preferences. The results shown that blue, green, and red icons were more preferred over yellow, orange, and purple colored icons. And negative-displayed icons were generally more preferred than positive-displayed icons.
Specification and Solution of Dependability Models of Fault-tolerant Systems

The modeling and analysis methodology consists of three main phases: model specification, model generation, and model solution. We consider some specific problems in each of these areas. First, we establish a hierarchy of dependability model types according to their modeling power. Algorithms to convert one model type into another are provided. We show that fault-trees with repeated events (FTRE) are the most powerful combinatorial model type. Then we show how Petri-net based models can be used for dependability modeling. Algorithms to convert a FTRE model to equivalent generalized stochastic Petri net (GSPN) and stochastic reward net (SRN) models are presented. Our comparison reveals that SRNs permit a much more concise description of dependability models than GSPNs do. We then present a methodology for formal expression of hierarchy in model specification and solution that offers a unified view of various kinds of hierarchical modeling techniques including iterative hierarchical modeling based on fixed-point iteration, non-iterative hierarchical modeling, reward-based performability modeling, behavioral decomposition, and approximate model decomposition. Model generation consists of converting from the specification-model-type to solution-model-type. We consider the conversion of semi-Markov models to Markov models using the technique of phase approximations. We describe a complete approach to phase-approximations, including choice of phase-approximation class, estimation of the selected parameters, and implementation of the approximation approach in a modeling toolkit. We also describe a new hybrid approach for parameter estimation that combines moment-matching with least squares fitting. Model solution is the next step after model generation. We describe an approach to design efficient methods for numerical transient solution of stiff Markov chains. Our approach uses a combination of explicit and implicit ODE methods. Finally we describe an application of dependability modeling and analysis. We model and analyze dependability of disk array systems. We develop detailed models and introduce new measures to compare various RAID (Redundant Arrays of Inexpensive Disks) architectures. The coverage of disk failures is analytically computed based on the error detection and correction mechanism. Models that take into account placement strategies of support hardware are also developed.
Automated 3D Reconstruction of Interiors from Point Clouds

We present a new technique for the fully automated 3D modelling of indoor environments from a point cloud. The point cloud is acquired with several scans and is afterwards processed in order to segment planar structures, which have a noticeable architectural meaning (floor, ceiling and walls) in the interior. The basic approach to data segmentation is plane sweeping based on a hypothesis-and-test strategy. From the segmentation results, the ground plan is created through cell decomposition by trimming the two-dimensional ground space using half-space primitives. An extension in height of the ground contours makes the generation of the 3D model possible. The so-reconstructed indoor model is saved in CAD format for analysis and further applications or, simply, as a record of the interior geometry.
Millimeter-Wave Integrated Circuits

Monolithic millimeter-wave integrated circuits have been designed and fabricated on semi-insulating GaAs substrates using microstrip transmission lines. Circuits using hybrid techniques have also been constructed on quartz and ceramics. This paper shows that microstrip-line integrated circuits are feasible at millimeter-wave frequencies. Circuit functions have been constructed and tested in the 25- to 100-GHz range. The loss in microstrip line on semi-insulating GaAs was found to be less than 0.3 dB/ /spl lamda/. Couplers from waveguide to microstrip have been made with transmission losses less than 0.5 dB. Monolithic integrated detectors showed 5-dB better sensitivity than a 1N53 diode in a Philips detector mount. Monolithic diodes delivered 1.5 mW at 28 GHz. The results are encouraging and a fully monolithic integrated receiver is under development.
KAJIAN BOLA-LUAR DAN BOLA-DALAM PADA BIDANG-EMPAT

Tujuan skripsi ini adalah untuk menunjukkan eksistensi bola-luar dan bola-dalam pada bidang-empat. Bola-dalam suatu bidang-empat adalah bola yang melalui keempat titik sudut bidang-empat. Bola–dalam suatu bidang-empat adalah bola yang menyinggung keempat bidang sisi suatu bidang-empat. Skripsi ini juga bertujuan menunjukkan sifat-sifat yang berkaitan dengan bola-luar dan boladalam pada bidang-empat. Dengan mengkaji analogi segitiga dan lingkaran pada bidang dengan bidang-empat dan bola pada ruang diselidiki eksistensi bola-luar dan bola-dalam pada bidang-empat seperti halnya lingkaran-luar dan lingkaran dalam. Dikaji pula sifat-sifatnya dari bola-luar dan bola-dalam pada bidang-empat. Sifat-sifat tersebut juga berdasarkan dari analogi sifat lingkaran-luar dan lingkaran-dalam pada segitiga. Setiap bidang-empat memiliki bola-luar. Sifat-sifat bola-luar pada bidangempat meliputi: 1) garis-garis sumbu suatu bidang-empat berpotongan di sebuah titik yang merupakan pusat bola-luar bidang-empat tersebut; 2) pusat bola-luar suatu bidang-empat siku-siku tidak terletak pada bidang miringnya; 3) jika titik O merupakan pusat lingkaran-luar dari , titik D pada sedemikian hingga dan terdapat titik E yang tidak koplanar dengan A, B, C sedemikian hingga DEA merupakan sudut siku-siku maka O merupakan titik pusat bola-luar bidang-empat A.BCE. Setiap bidang-empat juga memiliki bola-dalam. Sifat-sifat bola-dalam pada bidang-empat meliputi: 1) bidang-bidang bagi sudut dua bidang sisi suatu bidang-empat bertemu di sebuah titik yang merupakan pusat bola-dalam bidang-empat tersebut; 2) pusat bola-luar suatu bidang-empat teratur juga merupakan pusat bola-dalam bidang-empat tersebut. Kata kunci: lingkaran-luar, lingkaran-dalam, segitiga, bola-luar, bola-dalam, bidang-empat
Modelling Turn-taking in a Simulation of Small Group Discussion

The organization of taking turns at talk is an important part of any verbal interaction such as conversation, particularly in groups. Sociologists and psycholinguists have been studying turn-taking in conversation through empirical and statistical analysis, and identified some systematics in it. But to my knowledge no detailed computational modelling of verbal turn-taking has yet been attempted. This thesis describes one such attempt, for a simulation of small group discussion— that is, engaged conversation in groups of up to seven participants, which researchers have found to be much like two-person dialogues with overhearers. The group discussion is simulated by a simple multi-agent framework with a blackboard architecture, where each agent represents a participant in the discussion and the blackboard is their channel of communication, or ‘environment’ of the discussion. Agents are modelled with just a set of probabilistic parameters that give their likelihood of doing the various turn-taking decisions in the simulation: when to talk, when to continue talking, when to interrupt, when to give feedback (“uh huh”), and so on. The simulation, therefore, consists of coordinating a one-at-a-time talk (symbolic talk) with speaker transitions, hesitation, yielding or keeping the floor, and managing simultaneous talk which occurs mostly around speaker transitions. The turn-taking modelling considers whether participants are talking or not, and when they reach points of possible completion in their utterances that correspond to the places of transition-relevance, TRPs, where others could start to speak in attempts to take a new turn of talk. The agent behaviours (acts), their internal states and procedures are then described. The model is expanded with elaborate procedures for the resolution of simultaneous talk, for speaking hesitations and their potential interruption, and for the constraints of the different ‘sorts’ of utterance with respect to turn-taking: whether the TRP is free, or the speaker has selected someone to speak next, has encouraged anyone to speak, or has indicated the course of an extended multi-utterance turn at talk as in sentence beginnings like “first of all,” or “let me tell you something:. ”. The model and extensions are then comprehensively analysed through a series of large quantitative evaluations computing various aggregate statistics such as: the total times of single talk, multiple talk and silences; total occurrences of utterances, silences, simultaneous talk, multiple starts, middle-of-utterance attempts at talking, false-starts, abandoned utterances (interrupted by others), and more.
A KNOWLEDGE MANAGEMENT PROTOTYPE

As organizations become increasingly competitive, they recognize the capital inherent in the accumulated knowledge of their members. In a rapidly growing organization, it becomes ever more important to encapsulate and store this knowledge and invent ways to make it available to newer members of the team. We describe a Knowledge Management prototype, dubbed Avocado, a project that grew out of the need to provide sophisticated document analysis as an aid to retrieving more useful data from a technical document collection. It has evolved from earlier incarnations with different names [3, 4].
Sprzętowo-programowa realizacja algorytmu RANSAC do estymacji macierzy fundamentalnej

The paper describes hybrid, hardware/software implementation of RANSAC algorithm, enabling the robust mathematical model estimation from measurement data containing a significant amount of outliers. The implemented system, based on the Microblaze microprocessor along with a dedicated hardware coprocessor, performs the task of fundamental matrix estimation. The matrix encodes the relationship between two views of the same scene. This enables e.g. the reconstruction of the scene structure. The system (implemented in a Virtex 5 PFGA) is capable of working with a clock speed of 100MHz. Applying the hardware coprocessor cuts the overall algorithm execution time by approximately half. The part of the algorithm that was chosen for hardware implementation (checking the consistency of measurement data with the computed model) is sped up 50 times when compared to software implementation. The resource usage is kept low by using a custom 23-bit floating point representation (see Fig. 2). Table 1 presents the summary of resources used for implementation. Fig. 1 outlines the system architecture, while Figs. 3 and 4 present the detailed coprocessor structure. The 8-point algorithm based model generation is harder to translate into hardware, because it relies on singular value decomposition for finding least-squares solution of a linear system of equations [1][2]. The future work will therefore be focused on this subject, and on integration of the described system with the processor for image feature detection [3], description and matching. The resulting solution will be targeted at applications, in which small size, weight and power consumption are critical.
Strategic Warfare in Cyberspace

Imagine that you get such certain awesome experience and knowledge by only reading a book. How can? It seems to be greater when a book can be the best thing to discover. Books now will appear in printed and soft file collection. One of them is this book strategic warfare in cyberspace. It is so usual with the printed books. However, many people sometimes have no space to bring the book for them; this is why they can't read the book wherever they want.
MSYS: A System for Reasoning About Scenes.

Abstract : MSYS is a system for reasoning with uncertain information and inexact rules of inference. Its major application, to date, has been to the interpretation of visual features (such as regions) in scene analysis. In this application, features are assigned sets of possible interpretations with associated likelihoods based on local attributes (e.g., color, size, and shape). Interpretations are related by rules of inference that adjust the likelihoods up or down in accordance with the interpretation likelihoods of related features. An asynchronous relaxation process repeatedly applies the rules until a consistent set of likelihood values is attained. At this point, several alternative interpretations still exist for each feature. One feature is chosen and the most likely of its alternatives is assumed. The rules are then used in this more precise context to determine likelihoods for the interpretations of remaining features by a further round of relaxation. The selection and relaxation steps are repeated until all features have been interpreted.
Fast analysis of metallic antennas by parallel moment method implemented on CUDA

In this paper a modeling technique enabling the fast analysis of antenna arrangements built-up from metallic parts is presented in detail. A calculation method which accelerates the solution of integral equations discretized by the Method of Moments have been implemented in a massively parallel computing environment, a general purpose video card (GPU). Rao-Wilton-Glisson edge basis functions are used to expand surface currents, while radiated field is computed using the dipole model. Since the entire computation takes place on the GPU exclusively, the overall computational time could be significantly reduced. To obtain such an acceleration, a novel computational technique is proposed for the filling of the impedance matrix, which takes full advantage of the given platform. Analysis of antenna structures can be made very efficiently using the frequency domain (FD) integral equationformulation, discretizedby the Methodof Moments (MoM) (1). The FD-MoM implementation employing surface patch modeling (2) of the (infinitesimally thin) metal surfaces lacks the incorporation of the surrounding air. This is a major advantage over Finite Element Method (FEM), where the surrounding air is part of the model and therefore must be discretized as well. As the computational complexity (demand) is proportional to the number of discrete geometrical elements constituting the model, in the latter case the Degrees of Freedom (DoF) of the resulting linear equation system to be finally solved is significantly higher than in the preceding one. Furthermore, as the correct behavior for the radiation condition is automatically incorporated in the moment method, there is no need for special termination -by e.g., a Perfectly Matched Layer (PML) or Absorbing Boundary Condition (ABC)- of the problem domain, as in FEM. Unfortunately, the advantagesof MoM are spoiled by its well-known high demands for computational resources in terms of memory capacity and CPU time. Although spectacular reduction techniques like the so-called multi-level fast multiple Method (MLFMM) exist, these can not be applied to all practical problems, hence often the tedious standard MoM formulation is to be utilized. In this paper the acceleration of the standard MoM method is carried out using a massively parallel computing environment, the GPU. Although several similar works have already been published (3,4),
The Changing Nature of Teaching and Learning in Computer-Based Classrooms

AbstractThe study reported in this article provides evidence that the use of computers can change the nature of teaching and learning at its most basic level—the level of interactions between students and teachers. The study compared interactions between high school students and teachers involved in computer-based instruction with interactions between the same students and teachers during traditional classroom instruction. Its findings reveal that student-teacher interactions were more student-centered and individualized during computer-based teaching and learning than during traditional teaching and learning. We argue that such changes may be a McLuhanesque reflection of the computer’s inherent interactivity, and suggest that more profound changes are likely if computers become more fully integrated into our schools.
Control of spam: a comparative approach with special reference to India

Spam and other related online threats are a real concern to all Internet users as they can lead to online fraud involving counterfeit websites, the theft of personal data such as credit card information, personal information through illicit access to computer systems and false or misleading representations in the market place. These are not imaginary threats but are supported by empirical evidence. This wastes time to users opening spam with misleading subject lines, wastes Internet resources trying to block it, consumes storage and bandwidth, and costs money in fighting it. E-commerce cannot flourish in an uncertain environment where security of personal data is not guaranteed. With the aim of boosting confidence in online commerce and protecting the interests of consumers, governments have introduced anti-spam legislation to protect consumers and businesses. This legislation has introduced different parameters. However, legislation alone cannot prevent spam. It is to be combined with technological measures. There is no separate legislation in India to deal with this problem. This paper analyses technological solutions and legal measures in the light of trans-national developments to provide background for any judicial decision making or legislative policy in India.
Frame Optimization and Speaker Recognition through Full Distance Matrix Approach

Speaker recognition is one of the major fields of research which deals with recognizing the speaker, having applications mainly in authentication purposes. The paper presents a simple full distance matrix feature matching technique besides frame optimization as pre-processing stage in feature extraction module. The results in the last section show that the performance is better than that of the existing algorithms which use complex feature matching techniques.
Anomaly Detection System by Mining Frequent Pattern using Data Mining Algorithm from Network Flow

In recent year technology in computer with the development of internet technology, intrusion detection system has become a universal focus on the world. Intrusion detection techniques can be categorized into signature detection and anomaly detection. Signature detection lacks to detect the newly invented attacks. Anomaly detection is an important dilemma that has been researched within diverse research areas and application domains. Number of anomaly detection systems is developed with a high false alarm rate; fail in real -time detection, poor in detection while network traffic is high. So, a safe, stable and efficient network is necessary for today’s society. We address these issues, first, by proposing an anomaly detection method providing a data mining algorithm that overcomes the common drawbacks of anomaly detectors based on statistical analysis, second, by providing both a benchmark tool that compares the results from historical normal data. Sliding window model and clustering is used to reduce complexity. The results show that algorithms are effective and system can definitely identify a lot of potentially very information in time which is useful to detect network anomalies with high detection rate.