The Current Status of Historical Preservation Law in Regularory Takings Jurisprudence: Has the Lucas Missile Dismantled Preservation Programs?

This paper describes our NIHRIO system for SemEval-2018 Task 3 "Irony detection in English tweets". We propose to use a simple neural network architecture of Multilayer Perceptron with various types of input features including: lexical, syntactic, semantic and polarity features.  Our system achieves very high performance in both subtasks of binary and multi-class irony detection in tweets. In particular, we rank at fifth in terms of the accuracy metric and the F1 metric. Our code is available at: https://github.com/NIHRIO/IronyDetectionInTwitte

Improving Texture Categorization with Biologically Inspired Filtering

Within the domain of texture classification, a lot of effort has been spent on local descriptors, leading to many powerful algorithms. However, preprocessing techniques have received much less attention despite their important potential for improving the overall classification performance. We address this question by proposing a novel, simple, yet very powerful biologically-inspired filtering (BF) which simulates the performance of human retina. In the proposed approach, given a texture image, after applying a DoG filter to detect the "edges", we first split the filtered image into two "maps" alongside the sides of its edges. The feature extraction step is then carried out on the two "maps" instead of the input image. Our algorithm has several advantages such as simplicity, robustness to illumination and noise, and discriminative power. Experimental results on three large texture databases show that with an extremely low computational cost, the proposed method improves significantly the performance of many texture classification systems, notably in noisy environments. The source codes of the proposed algorithm can be downloaded from https://sites.google.com/site/nsonvu/code.Comment: 11 page

Some problems related to keys and the Boyce-Codd normal form

The aim of this paper is to investigate the connections between minimal keys and antikeys for special Sperner-systems by hypergraphs. The Boyce-Codd normal form and some related problems are also studied in this paper

On Armstrong relations for strong dependencies

The strong dependency has been introduced and axiomatized in [2], [3], [4], [5]. The aim of this paper is to investigate on Armstrong relations for strong dependencies. We give a necessary and sufficient condition for an abitrary relation to be Armstrong relation of a given strong scheme. We also give an effective algorithm finding a relation r such that r is Armstrong relation of a given strong scheme G = (U,S) (i.e. Sr = S+, where Sr is a full family of strong dependencies of r, and S+ is a set of all strong dependencies that can be derived from S by the system of axioms). We estimate this algorithm. We show that the time complexity of this algorithm is polynomial in |U| and |S|

Some results related to dense families of database relations

The dense families of database relations were introduced by Järvinen [7]. The aim of this paper is to investigate some new properties of dense families of database relations, and their applications. That is, we characterize functional dependencies and minimal keys in terms of dense families. We give a necessary and sufficient condition for an abitrary family to be R— dense family. We prove that with a given relation R the equality set ER is an R—dense family whose size is at most m(m-1)/2, where m is the number of tuples in R. We also prove that the set of all minimal keys of relation R is the transversal hypergraph of the complement of the equality set ER. We give an effective algorithm finding all minimal keys of a given relation R. We also give an algorithm which from a given relation R finds a cover of functional dependencies that holds in R. The complexity of these algorithms is also esimated

Optimality conditions in terms of Bouligand generalized differentials for a nonsmooth semilinear elliptic optimal control problem with distributed and boundary control pointwise constraints

We prove a novel optimality condition in terms of Bouligand generalized differentials for a local minimizer of optimal control problems governed by a nonsmooth semilinear elliptic partial differential equation with both distributed and boundary unilateral pointwise control constraints, in which the nonlinear coefficient in the state equation is not differentiable at one point. Therefore, the Bouligand subdifferential of this nonsmooth coefficient in every point consists of one or two elements that will be used to construct the two associated Bouligand generalized derivatives of the control-to-state operator in any admissible control. We also establish the optimality conditions in the form of multiplier existence. There, in addition to the existence of the adjoint state and of the nonnegative multipliers associated with the pointwise constraints as usual, other nonnegative multipliers exist and correspond to the nondifferentiability of the control-to-state mapping. The latter type of optimality conditions shall be applied to the optimal control problems without distributed and boundary pointwise constraints to derive the so-called \emph{strong} stationarity conditions, where the sign of the associated adjoint state does not vary on the level set of the corresponding optimal state at the value of nondifferentiability.Comment: 33 page

On the Interference Alignment Designs for Secure Multiuser MIMO Systems

In this paper, we propose two secure multiuser multiple-input multiple-output transmission approaches based on interference alignment (IA) in the presence of an eavesdropper. To deal with the information leakage to the eavesdropper as well as the interference signals from undesired transmitters (Txs) at desired receivers (Rxs), our approaches aim to design the transmit precoding and receive subspace matrices to minimize both the total inter-main-link interference and the wiretapped signals (WSs). The first proposed IA scheme focuses on aligning the WSs into proper subspaces while the second one imposes a new structure on the precoding matrices to force the WSs to zero. When the channel state information is perfectly known at all Txs, in each proposed IA scheme, the precoding matrices at Txs and the receive subspaces at Rxs or the eavesdropper are alternatively selected to minimize the cost function of an convex optimization problem for every iteration. We provide the feasible conditions and the proofs of convergence for both IA approaches. The simulation results indicate that our two IA approaches outperform the conventional IA algorithm in terms of average secrecy sum rate.Comment: Updated version, updated author list, accepted to be appear in IEICE Transaction

Statistical binary patterns for rotational invariant texture classification

International audienceA new texture representation framework called statistical binary patterns (SBP) is presented. It consists in applying rotation invariant local binary pattern operators (LBP riu2) to a series of moment images, defined by local statistics uniformly computed using a given spatial support. It can be seen as a generalisation of the commonly used complementation approach (CLBP), since it extends the local description not only to local contrast information, but to higher order local variations. In short, SBPs aim at expanding LBP self-similarity operator from the local gray level to the regional distribution level. Thanks to a richer local description, the SBPs have better discrimination power than other LBP variants. Furthermore, thanks to the regularisation effect of the statistical moments, the SBP descriptors show better noise robustness than classical CLBPs. The interest of the approach is validated through a large experimental study performed on five texture databases: KTH-TIPS, KTH-TIPS 2b, CUReT, UIUC and DTD. The results show that, for the four first datasets, the SBPs are comparable or outperform the recent state-of-the-art methods, even using small support for the LBP operator, and using limited size spatial support for the computation of the local statistics

Zooplankton Composition in Super-Intensive Whiteleg Shrimp, Litopenaeus vannamei (Boone, 1931) Culture Tanks

This study aimed to determine the zooplankton species composition in super-intensive whiteleg shrimp, Litopenaeus vannamei (Boone, 1931) tanks. The research was conducted from January to May 2021 in Bac Lieu City, Bac Lieu province, Vietnam. Eleven sampling times were divided into two periods, the nursery phase (six times) and the grow-out phase (five times) of shrimp culture. The results showed that water quality parameters fluctuated dramatically during the culture period, in which some nutrient concentrations tended to increase at the end of the shrimp culture period. Nine zooplankton species were recorded, of which five species belonged to Protozoa, three Rotifera species, and one Copepoda species. The number of zooplankton species did not differ significantly among the sampling periods. Protozoa had the highest species composition and density during most of the shrimp culture period. Copepoda was only identified in the nursery stage of shrimp culture. The species component of zooplankton had a close positive correlation with temperature, but their abundance did not have a significant relationship with water quality parameters because each species was affected by the different water quality parameters. Zoothamnium sp. had significantly positive correlations with total ammonia nitrogen (TAN), nitrate (NO3)-, total phosphorus (TP), and total nitrogen (TN) concentrations. The rotifer Brachionus plicatilis had a strong relationship with TP content, whereas Dartintinnus alderae had a strong relationship with alkalinity. Protozoa dominance in shrimp tanks could affect shrimp growth, decreasing the economic efficiency of shrimp farming. Therefore, the results of this study contribute to water quality and natural food management to improve shrimp productivity