Miracle-dz/UniFAR-FTUs huggingface dataset:
Vehicle lateral dynamics control

This document deals with the controlled system of l ateral vehicle dynamics regulated in terms of a ref erence model outputs. The reference model means a simplified mathematical vehicle model, which describes the desired lateral movements of a vehicle. The output of the r eference model produces the most optimal trajectory in various driving conditions. The target of the control s trategy is to hold the vehicle on this trajectory. Mathematical model of the vehicle and the reference model were c reated in the Matlab ‐ Simulink software. The final product of the regulation was the corrective torque that ha d the stabilization effect on the controlled vehicl e. By the simulations there were used user-defined maneuvres such as curve driving, avoidance maneuvre together with maneuvres defined by directives. The result was the c omparison of the produced corrective torques of the control strategy for the defined driving states. © 2007 University of West Bohemia. All rights reser ved.
A 600-year-old Boomerang fragment from Riwi Cave(South Central Kimberley, Western Australia)

Abstract A small fragment of a carefully shaped wooden artefact was recovered from Riwi Cave (south central Kimberley, Western Australia) during 2013 excavations. Directly dated to 670 ± 20 BP, analysis of the artefact’s wood taxon, morphology, manufacturing traces, use wear, and residues, in addition to comparison with ethnographic examples of wooden technology from the Kimberley region, allowed for the identification of the tool from which it originated: a boomerang. In particular, this artefact most closely resembles the trailing tip of a hooked boomerang, providing rare insights into the presence of these iconic fighting and ceremonial items in the Kimberley some 600 years ago.
A Framework for Managing Predictable and Unpredictable Threats: The Duality of Information Security Management

Information systems security is a challenging research area in the context of Information Systems. In fact, it has strong practical implications for the management of IS and, at the same time, it gives very interesting insights into understanding the process of social phenomena when communication information technologies are deployed in organizations. Current standards and best practices for the design and management of information systems security, recommend structured and mechanistic approaches, such as risk management methods and techniques, in order to address security issues. However, risk analysis and risk evaluation processes have their limitations, when security incidents occur, they emerge in a context, and their rarity and even their uniqueness give rise to unpredictable threats. The analysis of these phenomena which are characterized by breakdowns, surprises and sideeffects, requires a theoretical approach which is able to examine and interpret subjectively the detail of each incident. The aim of this paper is to highlight the duality of information systems security, providing an alternative view on the management of those aspects already defined in the literature as intractable problems and this is pursued through a formative context (Ciborra, Lanzara, 1994) that supports bricolage, hacking and improvisation .
Methodological Principles of Pyramidal and Parallel-Hierarchical Image Processing on the Base of Neural-Like Network Systems

54 Abstract—The scientific research deals with organization principles of parallel-hierarchical transform for multistage perception and processing, compression and recognition of information in informational structure and computational systems which make use of computational scheme similar to neural. Unified methodological approach was developed for analysis of parallel processes. This approach considers influence of structural hierarchy in dynamics, in other words it tracks processes of spatial areas transformation of correlated and generation of uncorrelated in time elements of generated network, at the time of transition of the network from one stable stage to another.
Experience on Comparison of Operating Systems Scalability on the Multi-core Architecture

Multi-core processor architectures have become ubiquitous in today's computing platforms, especially in parallel computing installations, with their power and cost advantages. While the technology trend continues towards having hundreds of cores on a chip in the foreseeable future, an urgent question posed to system designers as well as application users is whether applications can receive sufficient support on today's operating systems for them to scale to many cores. To this end, people need to understand the strengths and weaknesses on their support on scalability and to identify major bottlenecks limiting the scalability, if any. As open-source operating systems are of particular interests in the research and industry communities, in this paper we choose three operating systems (Linux, Solaris and FreeBSD) to systematically evaluate and compare their scalability by using a set of highly-focused micro benchmarks for broad and detailed understanding their scalability on an AMD 32-core system. We use system profiling tools and analyze kernel source codes to find out the root cause of each observed scalability bottleneck. Our results reveal that there is no single operating system among the three standing out on all system aspects, though some system(s) can prevail on some of the system aspects. For example, Linux outperforms Solaris and FreeBSD significantly for file-descriptor- and process-intensive operations. For applications with intensive sockets creation and deletion operations, Solaris leads FreeBSD, which scales better than Linux. With the help of performance tools and source code instrumentation and analysis, we find that synchronization primitives protecting shared data structures in the kernels are the major bottleneck limiting system scalability. Empowered by the knowledge obtained through targeted experiments and analysis on a small-scale system, we are able to project the scalability of an application on any of the investigated operating systems running on a system of a larger number of cores.
A Constitutive Shade-Avoidance Mutant Implicates TIR-NBS-LRR Proteins in Arabidopsis Photomorphogenic Development[W]

In plants, light signals caused by the presence of neighbors accelerate stem growth and flowering and induce a more erect position of the leaves, a developmental strategy known as shade-avoidance syndrome. In addition, mutations in the photoreceptors that mediate shade-avoidance responses enhance disease susceptibility in Arabidopsis thaliana. Here, we describe the Arabidopsis constitutive shade-avoidance1 (csa1) mutant, which shows a shade-avoidance phenotype in the absence of shade and enhanced growth of a bacterial pathogen. The csa1 mutant has a T-DNA inserted within the second exon of a Toll/Interleukin1 receptor–nucleotide binding site–leucine-rich repeat (TIR-NBS-LRR) gene, which leads to the production of a truncated mRNA. Arabidopsis plants transformed with the truncated TIR-NBS-LRR gene recapitulate the mutant phenotype, indicating that csa1 is a dominant-negative mutation that interferes with phytochrome signaling. TIR-NBS-LRR proteins have been implicated in defense responses in plants. RPS4, the closest homolog of CSA1, confers resistance to Pseudomonas syringae and complements the csa1 mutant phenotype, indicating that responses to pathogens and neighbors share core-signaling components in Arabidopsis. In Drosophila melanogaster and Caenorhabditis elegans, TIR domain proteins are implicated in both development and immunity. Thus, the dual role of the TIR domain is conserved across kingdoms.
Migration via a Ras-MEK Kinase 1 Pathway Lysophosphatidic Acid Stimulates Ovarian Cancer Cell

Lysophosphatidic acid (LPA) is present at high concentrations in ascites and plasma of ovarian cancer patients. Studies conducted in experimental models demonstrate that LPA promotes ovarian cancer invasion/ metastasis by up-regulating protease expression, elevating protease activity, and enhancing angiogenic factor expression. In this study, we investigated the effect of LPA on ovarian cancer migration, an essential component of cancer cell invasion. LPA stimulates both chemotaxis and chemokinesis of ovarian cancer cells and LPA-stimulated cell migration is GI dependent. Moreover, constitutively active H-Ras enhances ovarian cancer cell migration, whereas dominant negative H-Ras blocks LPAstimulated cell migration, suggesting that Ras works downstream of Gi to mediate LPA-stimulated cell migration. Interestingly, H-Ras mutants that specifically activate Raf-1, Ral-GDS, or phosphatidylinositol 3 -kinase are unable to significantly enhance ovarian cancer cell migration, suggesting that a Ras downstream effector distinct from Raf-1, Ral-GDS, and phosphatidylinositol 3 -kinase is responsible for LPA-stimulated cell migration. In this article, we demonstrate that LPA activates mitogen-activated protein kinase kinase 1 (MEKK1) in a Gi-Ras-dependent manner and that MEKK1 activity is essential for LPA-stimulated ovarian cancer cell migration. Inhibitors that block MEKK1 downstream pathways, including MEK1/2, MKK4/7, and nuclear factorB pathways, do not significantly alter LPA-stimulated cell migration. Instead, LPA induces the redistribution of focal adhesion kinase to focal contact regions of the cytoplasm membrane, and this event is abolished by pertussis toxin, dominant negative H-Ras, or dominant negative MEKK1. Our studies thus suggest that the Gi-Ras-MEKK1 signaling pathway mediates LPA-stimulated ovarian cancer cell migration by facilitating focal adhesion kinase redistribution to focal contacts.
Finding Dense Subgraphs for Sparse Undirected , Directed , and Bipartite Graphs

This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subgraphs are interpreted as communities, as in, e.g., soci al networks. The problem of identifying dense subgraphs helps analyze graph structures and complex networks and it is known to be challenging. It bears some similarities with the probl em of reordering/blocking matrices in sparse matrix techniques. We exploit this link and adapt the idea of recognizing matrix column similarities, in order to compute a partial clustering of the vertices in a graph, where each cluster represents a dense subgraph. In contrast to existing subgraph extractio n techniques which are based on a complete clustering of the gr aph nodes, the proposed algorithm takes into account the fact th at not every participating node in the network needs to belong to a community. Another advantage is that the method does not require to specify the number of clusters; this number is usually not known in advance and is difficult to estimate. The computational process is very efficient, and the effectiven ess of the proposed method is demonstrated in a few real-life examp les.
Neuraminidase inhibitors for influenza.

he impact of influenza infection is felt globally each year when the disease develops in approximately 20 percent of the world’s population. In the United States, influenza infections occur in epidemics each winter, generally between late December and early March. Recent events, including human cases of avian influenza, have heightened awareness of the threat of a pandemic and have spurred efforts to develop plans for its control. Although vaccination is the primary strategy for the prevention of influenza, there are a number of likely scenarios for which vaccination is inadequate and effective antiviral agents would be of the utmost importance. During any influenza season, antigenic drift in the virus may occur after formulation of the year’s vaccine has taken place, rendering the vaccine less protective, and outbreaks can more easily occur among highrisk populations. In the course of a pandemic, vaccine supplies would be inadequate. Vaccine production by current methods cannot be carried out with the speed required to halt the progress of a new strain of influenza virus; therefore, it is likely that vaccine would not be available for the first wave of spread of virus. 1 Antiviral agents thus form an important part of a rational approach to epidemic influenza and are critical to planning for a pandemic. Four drugs are currently available for the treatment or prophylaxis of influenza infections: the adamantanes (amantadine and rimantadine) and the newer class of neuraminidase inhibitors (zanamivir [Relenza] and oseltamivir [Tamiflu]). The adamantanes interfere with viral uncoating inside the cell. They are effective only against influenza A and are associated with several toxic effects and with rapid emergence of drug-resistant variants. Adamantane-resistant isolates of influenza A are genetically stable, can be transmitted to susceptible contacts, are as pathogenic as wild-type virus isolates, and can be shed for prolonged periods in immunocompromised patients taking the drug. This potential for the development of resistance especially limits the use of the adamantanes for the treatment of influenza, although the drugs still have a place in planning for prophylaxis during an epidemic. The neuraminidase inhibitors zanamivir and oseltamivir interfere with the release of progeny influenza virus from infected host cells, a process that prevents infection of new host cells and thereby halts the spread of infection in the respiratory tract (Fig. 1). Since replication of influenza virus in the respiratory tract reaches its peak between 24 and 72 hours after the onset of the illness, drugs such as the neuraminidase inhibitors that act at the stage of viral replication must be administered as early as possible. In contrast to the adamantanes, the neuraminidase inhibitors are associated with very little toxicity and are far less likely to promote the development of drug-resistant influenza. As a class, the neuraminidase inhibitors are effective against all neuraminidase subtypes t
HCC: generalized hierarchical completely-connected networks

In this paper, a new network structure called generalized Hierarchical Completely-Connected networks (HCCs) is proposed, and its properties and features are evaluated. Simple routing strategies for HCCs are also developed for shortest-paths routing algorithms. A set of HCCs constructed by the proposed method includes some conventional hierarchical networks, then it is called generalized one. The construction of an HCC starts from a basic block (a level-1 block) which consists of n nodes of constant degree. Then a level-h block for h ≥ 2 is constructed recursively by interconnecting any pair of macro nodes (n level-(h−1) blocks) completely. An HCC has a constant node-degree regardless of an increase in its size (the number of nodes). Furthermore, since an HCC has a hierarchically structured topology and the feature of uniformity, a wide variety of inter-cluster connections is possible. Evaluation results show that an HCC is suitable for very large computer systems. key words: interconnection networks, generalized network, hierarchical network, completely-connected network, routing strategy
Formal Verification of the CRC Algorithm Properties

This paper presents verification of the CRC algorithm properties. We examine a way of verifying the CRC algorithm using exhaustive state space exploration by model checking method. The CRC algorithm is used for the calculation of the hash value of a message and we focused to verify the property of finding minimum Hamming distance between two messages having the same hash value. We deal with some of 16, 32 and 64 bits CRC generator polynomials, especially with one used in the Liberouter project, for comparison with others used in the ethernet networking.
Automatic Text Summarization of Newswire: Lessons Learned from the Document Understanding Conference

Since 2001, the Document Understanding Conferences have been the forum for researchers in automatic text summarization to compare methods and results on common test sets. Over the years, several types of summarization tasks have been addressed--single document summarization, multi-document summarization, summarization focused by question, and headline generation. This paper is an overview of the achieved results in the different types of summarization tasks. We compare both the broader classes of baselines, systems and humans, as well as individual pairs of summarizers (both human and automatic). An analysis of variance model is fitted, with summarizer and input set as independent variables, and the coverage score as the dependent variable, and simulation-based multiple comparisons were performed. The results document the progress in the field as a whole, rather then focusing on a single system, and thus can serve as a future reference on the work done up to date, as well as a starting point in the formulation of future tasks. Results also indicate that most progress in the field has been achieved in generic multi-document summarization and that the most challenging task is that of producing a focused summary in answer to a question/topic.
Selecting Computer-Mediated Interventions to Support the Social and Emotional Development of Individuals with Autism Spectrum Disorder

This chapter is designed to provide parents, professionals, and individuals with Autism Spectrum Disorder (ASD) with tools to help them evaluate the effectiveness of computer-mediated interventions to support the social and emotional development of individuals with ASD. Starting with guidelines for selecting computer-mediated interventions, we highlight the importance of identifying target skills for intervention that match an individual’s needs and interests. We describe how readers can assess the degree to which an intervention is evidence-based, and include an overview of different types of experiments and statistical methods. We examine a variety of computer-mediated interventions and the evidence base for each: computer-delivered instruction (including games), iPad-type apps, virtual environments, and robots. We describe websites that provide additional resources for finding educational games and apps. We conclude by emphasizing the uniqueness of each individual with ASD and the importance of selecting interventions that are well-matched to the specific needs of each individual. Selecting Computer-Mediated Interventions to Support the Social and Emotional Development of Individuals with Autism Spectrum Disorder
Determination of Location and Path Planning Algorithms for Industrial Robots

Before path planning, it is significant to determine the robot location, which very few researches have addressed in this topic. Determination of a suitable robot location is influential to prepare for the subsequent path search with bet-ter solution or even to ensure the possibility of finding a path. In particular, the environment with complex obstacles, the inspection is demanding. In this arti-cle, a method by use of the intersection theorem (Danielle & Mark, 2001) is proposed to determine the robot location. Path planning has been studied with numerous researches on the topics of minimum time, minimum energy, and obstacle avoidance, etc. Obstacle avoid-ance is probably the most distinguished one investigated for many application purposes. Distance maps is one of the earlier method to divide the space by grids with equal distance. The obstacle is mapped in this 2D diagram. The rest of the area is considered to be passable and marked with integer numbers, which indicates the distance to the obstacle (Latombe, 1991; Pobil et al., 1992; Jarvis, 1993). Wave expansion method is derived based on the distance maps. It starts to mark the passable nodes with sequential integer numbers from the selected initial position to expand outward, and then begins the path search at the final position (Barraquand et al., 1992; Ralli & Hirzinger, 1994). Configuration space concept is proposed by (Lozano-Perez, 1987; Banski, 1996; Red & Truong-Cao, 1996). It attempts to illustrate the robot manipulation ge-ometry in terms of the joint space. For an n degree-of-freedom robot, there is n dimensional vector in the configuration space, where the collision occurs in the workspace can be expressed. In this study, three path-planning methods, the neighboring search method, the depth-first search method, and the extensile search method, are developed. The path searching capability, manipulation steps and time are discussed with comparison. A practical automobile baggage trunk welding process in association with an industrial robot, ABB IRB1400, is selected as an example to be investigated with simulation on the Robot Studio S4-lite software. The proposed extensile
Designing a Bioengine for Detection and Analysis of Base String on an Affected Sequence in High-Concentration Regions

We design an Algorithm for bioengine. As a program are enable optimal alignments searching between two sequences, the host sequence (normal plant) as well as query sequence (virus). Searching for homologues has become a routine operation of biological sequences in 4 × 4 combination with different subsequence (word size). This program takes the advantage of the high degree of homology between such sequences to construct an alignment of the matching regions. There is a main aim which is to detect the overlapping reading frames. This program also enables to find out the highly infected colones selection highest matching region with minimum gap or mismatch zones and unique virus colones matches. This is a small, portable, interactive, front-end program intended to be used to find out the regions of matching between host sequence and query subsequences. All the operations are carried out in fraction of seconds, depending on the required task and on the sequence length.
Mechanisms behind variation in the Clostridium difficile 16S–23S rRNA intergenic spacer region

Clostridium difficile infection is an increasing problem in hospitals worldwide, mainly due to the recent emergence of a hypervirulent C. difficile strain. C. difficile PCR ribotyping, based on size variation of the 16S–23S rRNA intergenic spacer region (16S–23S ISR), is widely used in Europe for molecular epidemiological investigation. The mechanism underlying the 16S–23S ISR size variations in the genome of C. difficile is currently not completely understood. To elucidate this mechanism, isolates of six different PCR ribotypes were analysed by cloning and sequencing the 16S–23S ISR. A direct repeat, IB, of 9 bp was detected up to five times in the 16S–23S ISR in all 47 clones investigated. Thirty-five clones displayed differences either by ribotype or by nucleotide sequence. The sequences of the 16S–23S ISR of C. difficile showed a uniformly organized structure, composed of a tRNAAla gene and spacers of 33 and 53 bp separated by the 9 bp direct repeat IB. The results of the study support the hypothesis that this composition is responsible for the length variations seen in the 16S–23S ISR, and indicate that these length variations result from slipped-strand mispairing and intra- and possibly interchromosomal homologous recombination.