Economic Impacts of Rules-based vs Risk-based Cybersecurity Regulations in Critical Infrastructure Providers (Bulk Electricity Providers)

Economics of Cybersecurity Part 2. SPSI-2015-01-0024.

Dissection of De Novo Membrane Insertion Activities of Internal Transmembrane Segments of ATP-Binding-Cassette Transporters: Toward Understanding Topological Rules for Membrane Assembly of Polytopic Membrane Proteins

The membrane assembly of polytopic membrane proteins is a complicated process. Using Chinese hamster P-glycoprotein (Pgp) as a model protein, we investigated this process previously and found that Pgp expresses more than one topology. One of the variations occurs at the transmembrane (TM) domain including TM3 and TM4: TM4 inserts into membranes in an Nin-Cout rather than the predicted Nout-Cin orientation, and TM3 is in cytoplasm rather than the predicted Nin-Cout orientation in the membrane. It is possible that TM4 has a strong activity to initiate the Nin-Cout membrane insertion, leaving TM3 out of the membrane. Here, we tested this hypothesis by expressing TM3 and TM4 in isolated conditions. Our results show that TM3 of Pgp does not have de novo Nin-Cout membrane insertion activity whereas TM4 initiates the Nin-Cout membrane insertion regardless of the presence of TM3. In contrast, TM3 and TM4 of another polytopic membrane protein, cystic fibrosis transmembrane conductance regulator (CFTR), have a similar level of de novo Nin-Cout membrane insertion activity and TM4 of CFTR functions only as a stop-transfer sequence in the presence of TM3. Based on these findings, we propose that 1) the membrane insertion of TM3 and TM4 of Pgp does not follow the sequential model, which predicts that TM3 initiates Nin-Cout membrane insertion whereas TM4 stops the insertion event; and 2) “leaving one TM segment out of the membrane” may be an important folding mechanism for polytopic membrane proteins, and it is regulated by the Nin-Cout membrane insertion activities of the TM segments.

On a common circle: Natural scenes and Gestalt rules

To understand how the human visual system analyzes images, it is essential to know the structure of the visual environment. In particular, natural images display consistent statistical properties that distinguish them from random luminance distributions. We have studied the geometric regularities of oriented elements (edges or line segments) present in an ensemble of visual scenes, asking how much information the presence of a segment in a particular location of the visual scene carries about the presence of a second segment at different relative positions and orientations. We observed strong long-range correlations in the distribution of oriented segments that extend over the whole visual field. We further show that a very simple geometric rule, cocircularity, predicts the arrangement of segments in natural scenes, and that different geometrical arrangements show relevant differences in their scaling properties. Our results show similarities to geometric features of previous physiological and psychophysical studies. We discuss the implications of these findings for theories of early vision.

Toward rules for 1:1 polyamide:DNA recognition

Polyamides composed of four amino acids, imidazole (Im), pyrrole (Py), hydroxypyrrole (Hp), and β-alanine (β), are synthetic ligands that form highly stable complexes in the minor groove of DNA. Although specific pairing rules within the 2:1 motif can be used to distinguish the four Watson⋅Crick base pairs, a comparable recognition code for 1:1 polyamide:DNA complexes had not been described. To set a quantitative baseline for the field, the sequence specificities of Im, Py, Hp, and β for the four Watson⋅Crick base pairs were determined for two polyamides, Im-β-ImPy-β-Im-β-ImPy-β-Dp (1, for Im, Py, and β) and Im-β-ImHp-β-Im-β-ImPy-β-Dp (2, for Hp), in a 1:1 complex within the DNA sequence context 5′-AAAGAGAAGAG-3′. Im residues do not distinguish G,C from A,T but bind all four base pairs with high affinity. Py and β residues exhibit ≥10-fold preference for A,T over G,C base pairs. The Hp residue displays a unique preference for a single A⋅T base pair with an energetic penalty.

An A-DNA triplet code: thermodynamic rules for predicting A- and B-DNA.

The ability to predict macromolecular conformations from sequence and thermodynamic principles has long been coveted but generally has not been achieved. We show that differences in the hydration of DNA surfaces can be used to distinguish between sequences that form A- and B-DNA. From this, a "triplet code" of A-DNA propensities was derived as energetic rules for predicting A-DNA formation. This code correctly predicted > 90% of A- and B-DNA sequences in crystals and correlates with A-DNA formation in solution. Thus, with our previous studies on Z-DNA, we now have a single method to predict the relative stability of sequences in the three standard DNA duplex conformations.

Expansible Computable Aggregation Rules

The aggregation operator have been considered from a computable point of view. The important condition that the computation is friendly when portions of data are inserted o deleted to the list of values to aggregate is considered.

Staying in the Delaware Corporate Governance Lane: Fee Shifting Bylaws and a Legislative Reaffirmation of the Rules of the Road

The Delaware legislature has taken steps towards the adoption of amendments to the Delaware General Corporation Law (DGCL) that would prohibit fee shifting provisions in the articles and bylaws. The language in the legislative proposal, however, addresses fee shifting provisions only in the context of "internal corporate claims." Some have raised concerns that this language would allow for fee shifting provisions that applied to other types of actions, including at least some cases brought under the securities laws. This piece suggests that in fact the Delaware General Corporation Law already prohibits the adoption of bylaws and certificate provisions that apply to causes of action unrelated to internal corporate claims. As a result, there was no reason for the Delaware legislature to expressly bar fee shifting provisions in these types of actions.

Representing Clients in the Marijuana Industry: Navigating State and Federal Rules

As the number of states legalizing medicinal and recreational marijuana increases and marijuana emerges as a growing lawful industry, lawyers find themselves in an awkward position. In most states, lawyers who represent clients in the marijuana industry risk discipline for assisting clients in the commission of a (federal) crime. Even in jurisdictions like Colorado, where the rules of professional conduct have been amended to permit lawyers to assist clients who comply with marijuana state laws, lawyers who are admitted to practice in federal courts risk being disciplined by these tribunals for assisting clients in the commission of a crime pursuant to the courts’ local rules of conduct. This short article explores the thorny issue of navigating state and federal rules of professional conduct while representing clients in the marijuana industry.

Constraint qualifications in linear vector semi-infinite optimization

Linear vector semi-infinite optimization deals with the simultaneous minimization of finitely many linear scalar functions subject to infinitely many linear constraints. This paper provides characterizations of the weakly efficient, efficient, properly efficient and strongly efficient points in terms of cones involving the data and Karush–Kuhn–Tucker conditions. The latter characterizations rely on different local and global constraint qualifications. The global constraint qualifications are illustrated on a collection of selected applications.

Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty

The multiobjective optimization model studied in this paper deals with simultaneous minimization of finitely many linear functions subject to an arbitrary number of uncertain linear constraints. We first provide a radius of robust feasibility guaranteeing the feasibility of the robust counterpart under affine data parametrization. We then establish dual characterizations of robust solutions of our model that are immunized against data uncertainty by way of characterizing corresponding solutions of robust counterpart of the model. Consequently, we present robust duality theorems relating the value of the robust model with the corresponding value of its dual problem.

Three-dimensional planar model estimation using multi-constraint knowledge based on k-means and RANSAC

Plane model extraction from three-dimensional point clouds is a necessary step in many different applications such as planar object reconstruction, indoor mapping and indoor localization. Different RANdom SAmple Consensus (RANSAC)-based methods have been proposed for this purpose in recent years. In this study, we propose a novel method-based on RANSAC called Multiplane Model Estimation, which can estimate multiple plane models simultaneously from a noisy point cloud using the knowledge extracted from a scene (or an object) in order to reconstruct it accurately. This method comprises two steps: first, it clusters the data into planar faces that preserve some constraints defined by knowledge related to the object (e.g., the angles between faces); and second, the models of the planes are estimated based on these data using a novel multi-constraint RANSAC. We performed experiments in the clustering and RANSAC stages, which showed that the proposed method performed better than state-of-the-art methods.

Constraint qualifications in convex vector semi-infinite optimization

Convex vector (or multi-objective) semi-infinite optimization deals with the simultaneous minimization of finitely many convex scalar functions subject to infinitely many convex constraints. This paper provides characterizations of the weakly efficient, efficient and properly efficient points in terms of cones involving the data and Karush–Kuhn–Tucker conditions. The latter characterizations rely on different local and global constraint qualifications. The results in this paper generalize those obtained by the same authors on linear vector semi-infinite optimization problems.