Miracle-dz/UniFAR-FTUs huggingface dataset:
An Independent Rough Set Approach Hybrid with Artificial Bee Colony Algorithm for Dimensionality Reduction

Problem statement: Dimensionality reduction is viewed as an important pre-processing step for pattern recognition and data mining. As the classical rough set model considers the entire attribute set as a whole to find the subset, comparing all possible combinations of sets of attributes is difficult. Approach: In this study, we have introduced an improved Rough Set-based Attribute Reduction (RSAR) namely Independent RSAR hybrid with Artificial Bee Colony (ABC) algorithm, which finds the subset of attributes independently based on decision attributes (classes) at first and then finds the final reduct. Initially the instances are grouped based on decision attributes. Then the Quick Reduct algorithm is applied to find the reduced feature set for each class. To this set of reducts, the ABC algorithm is applied to select a random number of attributes from each set, based on the RSAR model, to find the final subset of attributes. Results: The performance is analyzed with five different medical datasets namely Dermatology, Cleveland Heart, HIV, Lung Cancer and Wisconsin and compared with six other reduct algorithms. The reduct from the proposed approach reaches greater accuracy of 92.36, 86.54, 86.29, 83.03 and 88.70 % respectively. Conclusion: The experiments states that the proposed approach reduces the computational cost and improves the classification accuracy when compared to some classical techniques.
Local appearance for robust object recognition

We present an approach to appearance-based object recognition using single camera images. Our approach is based on using an attention mechanism to obtain visual features that are generic, robust and informative. The features themselves are recognized using principal components an the frequency domain. In this paper we show how the visual characteristics of only a small number of such features can be used for appearance-based object recognition that is not confounded by planar rotations or background clutter.
Sialic acid: a sweet swing between mammalian host and Trypanosoma cruzi

Commonly found at the outermost ends of complex carbohydrates in extracellular medium or on outer cell membranes, sialic acids play important roles in a myriad of biological processes. Mammals synthesize sialic acid through a complex pathway, but Trypanosoma cruzi, the agent of Chagas’ disease, evolved to obtain sialic acid from its host through a trans-sialidase (TcTS) reaction. Studies of the parasite cell surface architecture and biochemistry indicate that a unique system comprising sialoglycoproteins and sialyl-binding proteins assists the parasite in several functions including parasite survival, infectivity, and host–cell recognition. Additionally, TcTS activity is capable of extensively remodeling host cell glycomolecules, playing a role as virulence factor. This review presents the state of the art of parasite sialobiology, highlighting how the interplay between host and parasite sialic acid helps the pathogen to evade host defense mechanisms and ensure lifetime host parasitism.
NFGEL 2000-2001 Annual Report

Lewisia kelloggii isozyme variation was studied in six Idaho and seven California populations. Lewisia kelloggii is polyploid, and was treated in analysis as an allotetraploid. The species is highly variable genetically (85% of loci polymorphic, 3.3 alleles per locus) and populations are highly differentiated (Fst = 0.77). All California and the Greencreek Lake populations are diverse, but most sampled Idaho populations have relatively little within-population variation. Isozyme data support the hypothesis that the Idaho and California populations may be two different, though related, species. For example, genetic identities between the Idaho and California populations (0.47 0.70) are typical of cogeneric species rather than conspecific populations.
Separate and Simultaneous Adjustment of Light Qualities in a Real Scene

Humans are able to estimate light field properties in a scene in that they have expectations of the objects’ appearance inside it. Previously, we probed such expectations in a real scene by asking whether a “probe object” fitted a real scene with regard to its lighting. But how well are observers able to interactively adjust the light properties on a “probe object” to its surrounding real scene? Image ambiguities can result in perceptual interactions between light properties. Such interactions formed a major problem for the “readability” of the illumination direction and diffuseness on a matte smooth spherical probe. We found that light direction and diffuseness judgments using a rough sphere as probe were slightly more accurate than when using a smooth sphere, due to the three-dimensional (3D) texture. We here extended the previous work by testing independent and simultaneous (i.e., the light field properties separated one by one or blended together) adjustments of light intensity, direction, and diffuseness using a rough probe. Independently inferred light intensities were close to the veridical values, and the simultaneously inferred light intensity interacted somewhat with the light direction and diffuseness. The independently inferred light directions showed no statistical difference with the simultaneously inferred directions. The light diffuseness inferences correlated with but contracted around medium veridical values. In summary, observers were able to adjust the basic light properties through both independent and simultaneous adjustments. The light intensity, direction, and diffuseness are well “readable” from our rough probe. Our method allows “tuning the light” (adjustment of its spatial distribution) in interfaces for lighting design or perception research.
High Mobility NMOSFET Structure With High- Dielectric

HighNMOSFET structures designed for enhancement mode operation have been fabricated with mobilities exceeding 6000 cm Vs. The NMOSFET structures which have been grown by molecular beam epitaxy on 3-in semi-insulating GaAs substrate comprise a 10 nm strained InGaAs channel layer and a highdielectric layer ( = 20). Electron mobilities of 6000 and 3822 cm Vs have been measured for sheet carrier concentrations of 2–3 10 and = 5 85 10 cm , respectively. Sheet resistivities as low as 280 sq have been obtained.
Public–private joint ventures: mixing oil and water?

The use of public–private partnerships (PPPs) is one of the most distinctive features of strategic management in the public sector. One of the most significant, yet understudied, forms of PPP to emerge in recent years is the public–private joint venture (PPJV). Unlike contractual PPPs, in which public organizations specify the service to be provided under contract by private sector organizations, PPJVs involve the creation of a new institutional entity that is governed by all of the parties in the alliance. This paper examines the distinctive character of PPJVs and draws on documentary and case study evidence to evaluate the ways in which the mixing of public and private within this important collaborative form can be managed best.
Towards Multifield Scalar Topology Based on Pareto Optimality

How can the notion of topological structures for single scalar fields be extended to multifields? In this paper we propose a definition for such structures using the concepts of Pareto optimality and Pareto dominance. Given a set of piecewise‐linear, scalar functions over a common simplical complex of any dimension, our method finds regions of “consensus” among single fields’ critical points and their connectivity relations. We show that our concepts are useful to data analysis on real‐world examples originating from fluid‐flow simulations; in two cases where the consensus of multiple scalar vortex predictors is of interest and in another case where one predictor is studied under different simulation parameters. We also compare the properties of our approach with current alternatives.
Image auto-annotation by exploiting web information

We consider the image auto-annotation problem by exploiting information from Internet. Given a collection of semantically similar images and a keyword that accurately describes these images, our goal is to find a set of popular tags to annotate each image, conforming to those used for similar images found on the web. We propose a novel framework to exploit classification based learning and bipartitioning clustering algorithms for extracting meaningful tags from semantical images on the web. Specifically, we adopt multiple kernel learning (MKL) to first select relevant images with their associated tags, which are obtained from the web based on keyword search, and then build a bipartite graph to model the relation between related tags and images. Finally, we partition over the bipartite graph to produce a set of significant tags for each image. We evaluate our proposed method by using the colorful Natural Scene and Events datasets to generate related images and tags from the Flickr website. The experimental results show that our proposed method has superior performance compared with baseline methods.
Formalizing and Enhancing Verilog *

Hardware description languages (HDL) suffer from inconsistencies between their simulation and synthesis semantics: A program successfully compiled and simulated might fail to synthesize. In this work, we propose the usage of statically typed two-level languages (STTL) to eliminate such inconsistencies. Languages like VHDL and Verilog have constructs (loops, parameters, and other abstractions) that helps the digital circuit designer in writing more generic code. These constructs are eliminated during elaboration and replaced by appropriate expansions. In many cases synthesis failure is effectively due to failure to achieve this step. Capturing the mechanics of that preprocessing stage can be formalized using STTLs that allow us to define corresponding expansion semantics. We can therefore statically verify the synthesis feasibility of a certain program by type checking against rules specifically designed for that purpose. In this paper, we show how this STTL approach can be applied to Verilog. To do so, we define the syntax, first-stage expansion semantics, and type system for a representative subset of the Verilog language that we call (Featherweigth SV). We also prove that according to our model, expansion preserves well-typedness of a program, that it results in an obviously synthesizable program (free from first stage constructs) and finally that it does not depend on wire values.
Adaptive Application-specific Cooperative Relay for Wireless Video Sensor Networks

In this paper, we propose an adaptive application-specific cooperative relaying mechanism for delivering layered coded multimedia data over wireless sensor networks. The proposed approach is to optimally map source data layers of different perceptual importance to relay nodes, so that the most important data layer can be transmitted in high quality. Each relay node only needs to detect and forward the assigned sub-streams (layers) of multimedia data. The distinctive benefit of this approach is to minimize the video distortion induced by buffer overflow and delay violation, while reducing transmission processing requirements on each relay node and providing significant savings in transmit and receive energy. Experimental results show that, compared with other cooperative methods, the proposed algorithm achieves significant performance improvement.
Penetration Testing Tool for Web Services Security

XML-based SOAP Web Services are a widely used technology, which allows the users to execute remote operations and transport arbitrary data. It is currently adapted in Service Oriented Architectures, cloud interfaces, management of federated identities, eGovernment, or millitary services. The wide adoption of this technology has resulted in an emergence of numerous - mostly complex - extension specifications. Naturally, this has been followed by a rise in large number of Web Services attacks. They range from specific Denial of Service attacks to attacks breaking interfaces of cloud providers [1], [2] or confidentiality of encrypted messages [3]. By implementing common web applications, the developers evaluate the security of their systems by applying different penetration testing tools. However, in comparison to the wellknown attacks as SQL injection or Cross Site Scripting, there exist no penetration testing tools for Web Services specific attacks. This was the motivation for developing the first automated penetration testing tool for Web Services called WS-Attacker. In this paper we give an overview of our design decisions and provide evaluation of four Web Services frameworks and their resistance against WS-Addressing spoofing and SOAPAction spoofing attacks.
Shareholder voting rights and practices in Europe and the United States

Editors' Preface. 1. Austria H. -G. Koppensteiner,F. Ruffler. 2. Belgium E.Wymeersch. 3. Denmark B. Gomard. 4. Finland H. Toiviainen. 5. France Y. Guyon. 6. Germany T. Baums, R. Schmitz. 7. Greece L.N. Georgakopoulos 8. Ireland D. Murphy. 9. Italy P. Marchetti, et al. 10. Luxembourg A. Prum, I. Corbisier 11. The Netherlands L. Timmerman. 12. Portugal J.E. Antunes. 13. Spain A.J.T. Hermida. 14. Sweden R. Skog. 15. Switzerland P. Nobel. 16. United Kingdom P.L. Davies. 17. United States S.M. Davis, J. Elfenbein. 18. General Report J.N. Druey. Index.
The break minimization problem is solvable in polynomial time when the optimal value is less than the number of teams ?

The break minimization problem is to find a home-away assignment that minimizes the number of breaks for a given timetable of a round-robin tournament. In a recent paper, Elf, Jünger and Rinaldi conjectured that the break minimization problem is solvable in polynomial time when the optimal value is less than the number of teams. This paper proves their conjecture affirmatively by showing that a problem related to the break minimization problem is solvable in polynomial time. Our approach is to transform an instance of the related problem into instances of the 2-satisfiability problem. In this paper, we prove a previously proposed conjecture about the break minimization problem in sports timetabling. We consider a round-robin tournament with the following properties: • the number of teams is 2n (n ∈ IN), and the number of slots, i.e., the days when matches are held, is 2n− 1; • each team plays one match in each slot; • each team plays every other team once; • each team has its home, and each match is held at the home of one of the corresponding two teams. Figure 1 is a timetable of a round-robin tournament satisfying these properties. In the figure, each match with ‘@’ means that the match is held at the home of the opponent; without ‘@’ is held at the home of the team corresponding to the row. For example, in slot 5 team 2 plays team 3 at the home of team 2. In other words, team 3 plays at away in slot 5, whereas team 2 plays at home. If a team plays either both at home or both at away in slots s− 1 and s, it is said that the team has a break at slot s. In Fig. 1, team 3 plays at home in slots 1 and 2, and thus team 3 has a break at slot 2. In total, the timetable has six breaks, each of which is represented as a line under the corresponding entry. Given a timetable not assigned where to play, one should decide a homeaway assignment to complete a timetable (Fig. 2). In most of practical sports ? Supported by Superrobust Computation Project of the 21st Century COE Program “Information Science and Technology Strategic Core,” Japan.
Intrinsic Properties of the Magnetically Collimated H2O Maser Jet of W43A

Water maser polarization observations in the precessing jet of W43A have revealed that it is magnetically collimated. Here we present a detailed description of the physical properties of the water maser environment in the jet. We discuss the maser saturation level and beaming angle as well as the intrinsic temperatures and densities. In addition, we show that the polarization angle of the strongest redshifted maser feature undergoes a fast rotation of 90° across the maser. Along with the variation of linear polarization fraction, this strongly supports the current theoretical description of maser linear polarization.
The Impact of International Migration and Remittances on the Labor-Supply Behavior of Those Left Behind: Evidence from Egypt

We analyze in this paper the impact of male-dominated migration and remittance income on the participation and hours worked decisions of adults left behind, including the hours spent by women in subsistence and domestic work. We differentiate between a 'pure' migration ("M") effect and the joint effect of migration and remittance income ("MR") and evaluate these effects for men and women separately. Additionally, we examine the labor supply behavior of wives whose husband migrated. We draw on the 2006 cross section using an instrumental variable approach as well as on the 1998/2006 panel of the Egypt Labor Market Panel Survey (ELMPS06). In line with the literature, women in MR households (albeit not in M households) tend to reduce their wage and salary work. We find evidence for both intra-household specialization and an increase in women's (and wives') total work load. Men are generally less affected. Our results suggest that it is important to differentiate between these two effects and between the different forms of market and non-market work as well as to consider the relationship between remitter and recipient.
Finding robust solutions to multi-objective optimisation problems using polynomial chaos

If an optimal solution is very sensitive to perturbations, then it may not be the most appropriate solution to use. In situations where natural variation is inevitable, it is therefore necessary to find a robust optimal solution. This paper examines emerging techniques for finding robust solutions to multiobjective optimisation problems. One of the major concerns in robust optimisation is that accounting for the robustness of solutions makes the problem much more computationally expensive. It is shown that the polynomial chaos approach addresses this key issue by decomposing the stochastic process into its deterministic and random process parts. A practical problem, design of an electrical RLC circuit, is used to illustrate the effectiveness of the approach.
Applicability of a computational design approach for synthetic riboswitches

Abstract Riboswitches have gained attention as tools for synthetic biology, since they enable researchers to reprogram cells to sense and respond to exogenous molecules. In vitro evolutionary approaches produced numerous RNA aptamers that bind such small ligands, but their conversion into functional riboswitches remains difficult. We previously developed a computational approach for the design of synthetic theophylline riboswitches based on secondary structure prediction. These riboswitches have been constructed to regulate ligand-dependent transcription termination in Escherichia coli. Here, we test the usability of this design strategy by applying the approach to tetracycline and streptomycin aptamers. The resulting tetracycline riboswitches exhibit robust regulatory properties in vivo. Tandem fusions of these riboswitches with theophylline riboswitches represent logic gates responding to two different input signals. In contrast, the conversion of the streptomycin aptamer into functional riboswitches appears to be difficult. Investigations of the underlying aptamer secondary structure revealed differences between in silico prediction and structure probing. We conclude that only aptamers adopting the minimal free energy (MFE) structure are suitable targets for construction of synthetic riboswitches with design approaches based on equilibrium thermodynamics of RNA structures. Further improvements in the design strategy are required to implement aptamer structures not corresponding to the calculated MFE state.
Development of a scintillating reference grid for spatial-phase-locked electron-beam lithography

Spatial-phase-locked electron-beam lithography (SPLEBL) promises significant improvement in the pattern fidelity and placement accuracy of electron-beam lithography by the introduction of feedback into the writing loop. In the planned formulation of SPLEBL, the feedback signal is produced by a reference grid which is bleached into a thin scintillating layer integrated into the electron-beam stack. Formulation and testing of a wide variety of material for use as the scintillating layer are described, in addition to a number of techniques to improve the contrast of the bleached grid. Production of fiducial gratings imaged in a SPLEBL-compatible electron beam system is described, and possible resist stacks that integrate the scintillator for use in SPLEBL are discussed. Thesis Supervisor: Henry I. Smith Title: Keithley Professor of Electrical Engineering
Fast Implementation of Scale Invariant Feature Transform Based on CUDA

Scale-invariant feature transform (SIFT) was an algorithm in computer vision to detect and describe local features in images. Due to its excellent performance, SIFT was widely used in many applications, but the implementation of SIFT was complicated and time-consuming. To solve this problem, this paper presented a novel acceleration algorithm for SIFT implementation based on Compute Unified Device Architecture (CUDA). In the algorithm, all the steps of SIFT were specifically distributed and implemented by CPU or GPU, accroding to the step's characteristics or demandings, to make full use of computational resources. Experiments showed that compared with the traditional implementation of SIFT, this paper's acceleration algorithm can greatly increase computation speed and save implementation time. Furthermore, the acceleration ratio had linear relation with the number of SIFT keypoints.
Ringed Filters for Peer-to-Peer Keyword Searching

Distributed hash tables (DHTs) are a class of decentralized distributed systems that can efficiently search for objects desired by the user. However, a lot of communication traffic comes from multi-word searches. A lot of work has been done to reduce this traffic by using bloom filters, which are space-efficient probabilistic data structures. There are two kinds of bloom filters: fixed-size and variable-size bloom filters. We cannot use variable- size bloom filters because doing so would mean wasting time to calculating hash values. On the other hand, when using fixed- size bloom filters, all the nodes in a DHT are unable to adjust their false positive rate parameters. Therefore, the reduction of traffic is limited because the best false positive rate differs from one node to another. Moreover, in related works, the authors took only two-word searches into consideration. In this paper, we present a method for determining the best false positive rate for three- or more word searches. We also used a new filter called a ringed filter, in which each node can set the approximately best false positive rate. Experiments showed that the ringed filter was able to greatly reduce the traffic.
Heuristic Joins to Integrate Structured Hetrogeneous Data

Heterogeneous data sources often exhibit semantic heterogeneity at the data level; that is, the same entity in the world is referred to in different ways both within and across sources. This paper discusses a framework for combining information from such sources, called heuristic join, that is an extension of the familiar equi-join for homogeneous sources. Heuristic join uses heuristic match operators rather than simple equality to determine whether tuples refer to the same entity. The inexactness of heuristic matching introduces a number of parameters into heuristic join that are not present in equi-joins. Our work is motivated by a real-world data integration problem that required the use of heuristic joins.