Miracle-dz/UniFAR-FTUs huggingface dataset:
Simulation Data Management Approach for Developing Adaptronic Systems – The W-Model Methodology

— Existing proceeding-models for the development of mechatronic systems provide a largely parallel action in the detailed development. This parallel approach is to take place also largely independent of one another in the various disciplines involved. An approach for a new proceeding-model provides a further development of existing models to use for the development of Adaptronic Systems. This approach is based on an intermediate integration and an abstract modeling of the adaptronic system. Based on this system-model a simulation of the global system behavior, due to external and internal factors or Forces is developed. For the intermediate integration a special data management system is used. According to the presented approach this data management system has a number of functions that are not part of the "normal" PDM functionality. Therefore a concept for a new data management system for the development of Adaptive system is presented in this paper. This concept divides the functions into six layers. In the first layer a system model is created, which divides the adaptronic system based on its components and the various technical disciplines. Moreover, the parameters and properties of the system are modeled and linked together with the requirements and the system model. The modeled parameters and properties result in a network which is analyzed in the second layer. From this analysis necessary adjustments to individual components for specific manipulation of the system behavior can be determined. The third layer contains an automatic abstract simulation of the system behavior. This simulation is a precursor for network analysis and serves as a filter. By the network analysis and simulation changes to system components are examined and necessary adjustments to other components are calculated. The other layers of the concept treat the automatic calculation of system reliability, the "normal" PDM-functionality and the integration of discipline-specific data into the system model. A prototypical implementation of an appropriate data management with the addition of an automatic system development is being implemented using the data management system ENOVIA SmarTeam V5 and the simulation system MATLAB.
Toward General Type-2 Fuzzy Logic Systems Based on zSlices

Higher order fuzzy logic systems (FLSs), such as interval type-2 FLSs, have been shown to be very well suited to deal with the high levels of uncertainties present in the majority of real-world applications. General type-2 FLSs are expected to further extend this capability. However, the immense computational complexities associated with general type-2 FLSs have, until recently, prevented their application to real-world control problems. This paper aims to address this problem by the introduction of a complete representation framework, which is referred to as zSlices-based general type-2 fuzzy systems. The proposed approach will lead to a significant reduction in both the complexity and the computational requirements for general type-2 FLSs, while it offers the capability to represent complex general type-2 fuzzy sets. As a proof-of-concept application, we have implemented a zSlices-based general type-2 FLS for a two-wheeled mobile robot, which operates in a real-world outdoor environment. We have evaluated the computational performance of the zSlices-based general type-2 FLS, which is suitable for multiprocessor execution. Finally, we have compared the performance of the zSlices-based general type-2 FLS against type-1 and interval type-2 FLSs, and a series of results is presented which is related to the different levels of uncertainty handled by the different types of FLSs.
Rhyme and the Reinterpretation of Hip Hop in Japan

Japan has an active and diverse Hip Hop scene with widespread popularity among the younger generation. is is re" ected in recent # gures cited by Manabe (2006, pp. 3–4) who notes that 15% of all singles classi# ed as gold or above in the # rst half of 2005 were rap-oriented and that rap is an integral part of the Japanese music scene. e history of Hip Hop in Japan has been delineated in a series of articles by Condry (2000, 2001a, 2001b) and in his 2006 book, Hip-Hop Japan. Condry (2001a, p. 228) traces the beginnings of Hip Hop in Japan to the mid1980s with the release of the # lm Wild Style, a low-budget # lm featuring the # rst generation of U.S. rappers, DJs, and breakdancers, and the subsequent release of the # lm Breakdance in 1985 which launched the # rst of several breakdance booms in Japan. A club called Hip Hop opened in 1986 in the Shibuya district of Tokyo, the district that is the center for fashion, entertainment, and youth culture in Japan. Condry notes that in the period from 1988 to 1992 there was a growing number of clubs sponsoring rappers, DJs, and breakdancers. Specialty magazines began covering the Hip Hop scene in detail from the midto late 1980s. e # rst produced million-selling rap hits in Japan appeared in 1994 and 1995 and the term J-rap was coined to represent this new genre (Condry, 2001a, p. 233). In the midto late 1990s, Condry divides the J-rap scene into two camps: party rap and underground Hip Hop. According to Condry (2000, p. 177), “Party rap tends to have light, funny lyrics that speak to themes from everyday life (e.g., video games, dating, teenage love songs). In contrast, underground hip-hop tends to be more abstract, darker, and at times in opposition to mainstream Japanese society. ” ! e two camps had very di$ erent followings and were critical of one another. e current Hip Hop scene in Japan, since 2000, according to Condry (2006) is more diverse:
Speed Determination of Moving Vehicles using Lucas-Kanade Algorithm

This paper presents a novel velocity estimation method for ground vehicles. The task here is to automatically estimate vehicle speed from video sequences acquired with a fixed mounted camera. The vehicle motion is detected and tracked along the frames using Lucas-Kanade algorithm. The distance traveled by the vehicle is calculated using the movement of the centroid over the frames and the speed of the vehicle is estimated. The average speed of cars is determined from various frames. The application is developed using MATLAB and SIMULINK.
A Self-Adaptive Particle Swarm Optimization Algorithm

To combat the problem of premature convergence observed in many applications of PSO, a novel self-adaptive particle swarm optimization algorithm-SAPSO is proposed in this paper. There exist two states for each particle in the SAPSO algorithm and a metric to measure a particlepsilas activity is defined which is used to choose which state it would reside. In order to balance a particlepsilas exploration and exploitation capability for different evolving phase, a self-adjusted inertia weight which varies dynamically with each particlepsilas evolution degree and the current swarm evolution degree is introduced into SAPSO algorithm. Simulation and comparisons based on several well-studied non-noisy problems and noisy problems demonstrate the effectiveness, efficiency and robustness of the proposed algorithm.
Network Connectivity Graph for Malicious Traffic Dissection

Malware is a major threat to security and privacy of network users. A huge variety of malware typically spreads over the Internet, evolving every day, and challenging the research community and security practitioners to improve the effectiveness of countermeasures. In this paper, we present a system that automatically extracts patterns of network activity related to a specific malicious event, i.e., a seed. Our system is based on a methodology that correlates network events of hosts normally connected to the Internet over (i) time (i.e., analyzing different samples of traffic from the same host), (ii) space (i.e., correlating patterns across different hosts), and (iii) network layers (e.g., HTTP, DNS, etc.). The result is a Network Connectivity Graph that captures the overall "network behavior" of the seed. That is a focused and enriched representation of the malicious pattern infected hosts exhibit, purified from ordinary network activities and background traffic. We applied our approach on a large dataset collected in a real commercial ISP where the aggregated traffic produced by more than 20,000 households has been monitored. A commercial IDS has been used to complement network data with alerts related to malicious activities. We use such alerts to trigger our processing system. Results shows that the richness of the Network Connectivity Graph provides a much more detailed picture of malicious activities, considerably enhancing our understanding.
An Integrated Natural Language Processing Approach for Conversation System

Abstract —The main aim of this research is to investigate anovel technique for implementing a more natural and intelligentconversation system. Conversation systems are designed to converselike a human as much as their intelligent allows. Sometimes, we canthink that they are the embodiment of Turing’s vision. It usually toreturn a predetermined answer in a predetermined order, but con-versations abound with uncertainties of various kinds. This researchwill focus on an integrated natural language processing approach.This approach includes an integrated knowledge-base constructionmodule, a conversation understanding and generator module, anda state manager module. We discuss effectiveness of this approachbased on an experiment. Keywords —Conversation System; integrated knowledge-base con-struction; conversation understanding and generator; state manager. I. I NTRODUCTION A Conversation system is a computer system intended toconverse with a human, with a coherent structure. Con-versation systems have employed text, image, speech, emotion,gestures and other modes for communication on both the inputand output channel.Man-machine-conversation system has become more im-portant in 21 century. Several speech dialogue systems andweb agent have been developed in order to provide a veryeaseful interaction for dissimilar users. The primary aim isto satisfy the user without or at least with reduced humaninvolvement [1]. A few well known scientists believe thatcomputers will achieve capabilities comparable to humanreasoning and understanding of languages by 2020 [2]. Wethink a more humanoid interactive system will be achievedalong with recent advances in Natural Language Processing(NLP) and Artiﬁcial Intelligence (AI) ﬁeld. II. R
A Ubiquitous Processor Built-in a Waved Multifunctional Unit

In developing cutting edge VLSI processors, parallelism is one of the most important global standard strategies to achieve power conscious high performance. These features are more critical for ubiquitous systems with great demands for multimedia mobile processing. Then, one of most important issues for ubiquitous systems is instruction scheduling, because floating point units indispensable for multimedia mobile applications take longer latency than integer units. Although software parallelism has been inevitable to fully utilize hardware parallelism between regular scalar units, it has been really awkward. Thus, we describe in this article a double scheme to achieve instruction scheduling free ILP (instruction level parallelism) and apply the double scheme to a ubiquitous processor HCgorilla we have so far developed. The double scheme is the multifunctionalization of scalar units and making a resultant multifunctional unit (MFU) wave-pipeline. The multifunctionalization frees the instruction scheduling, and the wave-pipelining recovers the reduction of clock speed to be caused by the scale up of a multifunctional circuit. HCgorilla built-in the waved MFU is promising for wide-range dynamic ILP at a rate higher than regular processors.
Improving the recall of decentralised linked data querying through implicit knowledge

Aside from crawling, indexing, and querying RDF data centrally, Linked Data principles allow for processing SPARQL queries on-the-fly by dereferencing URIs. Proposed link-traversal query approaches for Linked Data have the benefits of up-to-date results and decentralised (i.e., client-side) execution, but operate on incomplete knowledge available in dereferenced documents, thus affecting recall. In this paper, we investigate how implicit knowledge - specifically that found through owl:sameAs and RDFS reasoning - can improve the recall in this setting. We start with an empirical analysis of a large crawl featuring 4 m Linked Data sources and 1.1 g quadruples: we (1) measure expected recall by only considering dereferenceable information, (2) measure the improvement in recall given by considering rdfs:seeAlso links as previous proposals did. We further propose and measure the impact of additionally considering (3) owl:sameAs links, and (4) applying lightweight RDFS reasoning (specifically {\rho}DF) for finding more results, relying on static schema information. We evaluate our methods for live queries over our crawl.
Di erent Boosting Algorithms and Underlying Optimization Problems

Boosting is an ensemble based method which attempts to boost the accuracy of any given learning algorithm by applying it several times on slightly modi ed training data and then combining the results in a suitable manner. The boosting algorithms that we covered in class were AdaBoost, LPBoost, TotalBoost, SoftBoost, and Entropy Regularized LPBoost. The basic idea behind these boosting algorithms is that at each iteration, a weak learner learns the training data with respect to a distribution. The weak learner is then added to the nal strong learner. This is typically done by weighting the weak learner in some manner, which is typically related to the weak learner's accuracy. After the weak learner is added to the nal strong learner, the data is reweighted: examples that are misclassi ed gain weight and examples that are classi ed correctly lose weight. Thus, future weak learners will focus more on the examples that previous weak learners misclassi ed.
MXD1 localizes in the nucleolus, binds UBF and impairs rRNA synthesis

MXD1 is a protein that interacts with MAX, to form a repressive transcription factor. MXD1-MAX binds E-boxes. MXD1-MAX antagonizes the transcriptional activity of the MYC oncoprotein in most models. It has been reported that MYC overexpression leads to augmented RNA synthesis and ribosome biogenesis, which is a relevant activity in MYC-mediated tumorigenesis. Here we describe that MXD1, but not MYC or MNT, localizes to the nucleolus in a wide array of cell lines derived from different tissues (carcinoma, leukemia) as well as in embryonic stem cells. MXD1 also localizes in the nucleolus of primary tissue cells as neurons and Sertoli cells. The nucleolar localization of MXD1 was confirmed by co-localization with UBF. Co-immunoprecipitation experiments showed that MXD1 interacted with UBF and proximity ligase assays revealed that this interaction takes place in the nucleolus. Furthermore, chromatin immunoprecipitation assays showed that MXD1 was bound in the transcribed rDNA chromatin, where it co-localizes with UBF, but also in the ribosomal intergenic regions. The MXD1 involvement in rRNA synthesis was also suggested by the nucleolar segregation upon rRNA synthesis inhibition by actinomycin D. Silencing of MXD1 with siRNAs resulted in increased synthesis of pre-rRNA while enforced MXD1 expression reduces it. The results suggest a new role for MXD1, which is the control of ribosome biogenesis. This new MXD1 function would be important to curb MYC activity in tumor cells.
Measuring Verb

The way we model semantic similarity is closely tied to our understanding of linguistic representations. We present several models of semantic similarity, based on diiering representational assumptions, and investigate their properties via comparison with human ratings of verb similarity. The results ooer insight into the bases for human similarity judgments and provide a testbed for further investigation of the interactions among syntactic properties, semantic structure, and semantic content .
On-demand multicast routing protocol with local repair and quality of service support

In this paper we propose a mesh based“on demand” multicast routing protocol for Ad-Hoc networks with QoS (quality of service) and reliable multicast support. The proposed scheme has five key features: (a) it is based on the forwarding group concept (i.e., a subset of nodes is in charge of forwarding the multicast packets); (b) it dynamically refreshes the forwarding group members using a procedure similar to on demand routing;(c) it significantly reduces control overhead, and make the scalability of multicast routing protocol possible in mobile ad hoc networks by consolidation of control packets;(d) it supports QoS routing using good estimation of available and required bandwidth, and reserving required bandwidth on the end to end active routes in multicast mode;(e) it provides local recovery mechanism, which aims to reduce the control overhead and achieve fast recovery when route breakage happens.
Improved boosting algorithm through weighted k-nearest neighbors classifier

AdaBoost is known as an effective method for improving the performance of base classifiers both theoretically and empirically. However, previous studies have shown that AdaBoost is prone to overfitting, especially in noisy domains. On the other hand, the k-nearest neighbors (kNN) rule is one of the oldest and simplest methods for pattern classification, when cleverly combined with prior knowledge, it often yields competitive results. In this paper, an improved boosting algorithm is proposed where AdaBoost and kNN naturally complement each other. First, AdaBoost is run on the training data to capitalize on some statistical regularity in the data. Then, a weighted kNN algorithm designed in this paper is run on the feature space composed of classifiers produced by AdaBoost to achieve competitive results. AdaBoost is then used to enhance the classification accuracy and avoid overfitting by editing the data sets using the weighted kNN algorithm for improving the quality of training data. Experiments performed on ten different UCI data sets show that the new Boosting algorithm almost always achieves considerably better classification accuracy than AdaBoost.
Role of perceived parental involvement and control in university student adjustment

Adjustment to university can be challenging for students and can create significant emotional, interpersonal and academic problems which can be explained with different factors. Studies have confirmed a correlation between parental involvement and academic achievement in school aged children but less is known about this relation in university students. The aim of this study was to explore the differences in student adjustment in regard to perceived mother’ s and father’ s involvement and control of student academic functioning. Participants were 312 university students (135 males and 177 females) from 19 to 26 years. Anxiety and academic problems were assessed with College adjustment scales. Perception of parental involvement (parental support and interest) and control (intrusion and complaints from parents) were measured with questionnaire designed for this study. Students perceive mothers as more involved in their academic life and more controlling in regard to fathers. Girls perceived both parent as more involved and less controlling than boys. Two parenting dimensions have different relations with adjustment outcomes. For anxiety only parental control is important. Students who perceived more control in academic functioning from both parents were more anxious. This result is in accordance with general findings about parental control as significant determinant in the development of anxiety disorders. More difficulties in academic performance have students who perceived their parent less involved and more controlling which confirms that perception of parental involvement and control play significant role in adjustment not just in school aged children but also in university students.
The combined effects of nitrification inhibitor and biochar incorporation on yield-scaled N 2 O emissions from an intensively managed vegetable field in southeastern China

Abstract. An experiment was conducted to study the influences of nitrification inhibitor (NI) and biochar incorporation on yield-scaled N2O using the static chamber method and gas chromatography in an intensively managed vegetable field with seven consecutive vegetable crops from 2012 to 2014 in southeastern China. With an equal annual nitrogen (N) application rate (1217 kg N ha-1 yr-1), six treatments under three biochar amendment rates – namely, 0 t ha-1 (C0), 20 t ha-1 (C1) and 40 t ha-1 (C2) – with compound fertilizer (CF) or urea mixed with NI of nitrapyrin as chlorinated pyridine (CP) were studied in these field experiments. The results showed that, although there was no significant influence on soil organic carbon (SOC) content or total nitrogen (TN), nitrapyrin could result in a significant increase in soil pH during the experimental period. Nitrapyrin significantly decreased cumulative N2O emissions by 15.9–32.1% while increasing vegetable yield by 9.8–41.9%. Thus, it also decreased yield-scaled N2O emissions significantly. In addition to the differential responses of the soil pH, biochar amendment significantly increased SOC and TN. Compared with the treatments without biochar addition, the cumulative N2O emissions showed no significant difference in the CF or the CP group treatments but increased slightly (not significantly) by 7.9–18.3% in the CP group treatments. Vegetable yield was enhanced by 7.1–49.5% in the CF group treatments compared with the treatments without biochar amendment, while there was no significant difference in the CP group treatments, and the yield-scaled N2O emissions were thus decreased significantly. Furthermore, treatments involving with nitrapyrin and biochar incorporation slightly increased yield-scaled N2O emissions by 9.4%, on average, compared with CP-C0. Therefore, the application of nitrapyrin could serve as an appropriate practice for increasing vegetable yield and mitigating N2O emissions in intensively managed vegetable fields and should be further examined in various agroecosystems.
Names for free: polymorphic views of names and binders

We propose a novel technique to represent names and binders in Haskell. The dynamic (run-time) representation is based on de Bruijn indices, but it features an interface to write and manipulate variables conviently, using Haskell-level lambdas and variables. The key idea is to use rich types: a subterm with an additional free variable is viewed either as forallν. ν → Term(ɑ + ν) or ϶ν. ν x Term(ν.ν) depending on whether it is constructed or analysed. We demonstrate on a number of examples how this approach permits to express term construction and manipulation in a natural way, while retaining the good properties of representations based on de Bruijn indices.