Miracle-dz/UniFAR-FTUs huggingface dataset:
The Dynamics of Value Creation: The Case of the Surinamese Government

The purpose of this paper is to demonstrate the time dependent value creation by the Surinamese government. There is a significant discrepancy between what the political leadership promises and plans, and what is realized. What matters first is not competitive advantage of the nation, but the creation of value. Based on the idea of the dynamic management performance concept, a thorough study of primary and secondary sources was conducted within the context of how value creation develops by strategy and innovation. The drivers behind this process are public governance and both, human and social capital. The most essential finding is that the governing political leadership heads the country downward into an unhealthy socio-economic system. Although, not yet well developed, both human capital as well as social capital must have the priority in order to safeguard the country from a serious existential crisis. This paper may to contribute to a triple loop learning process related to value creation (the return on strategy).
Magnetic properties of DyB2C, HoB2C, and ErB2C

Magnetic properties of layered borocarbides $R{\mathrm{B}}_{2}\mathrm{C}$ $(R=\mathrm{Dy},$ Ho, and Er) have been studied by the magnetization and specific heat measurements at 1.8\char21{}300 K under the field up to 5 T. ${\mathrm{ErB}}_{2}\mathrm{C}$ has a basic two-sublattice antiferromagnetic order below ${T}_{\mathrm{N}}=16.3\mathrm{K}. $ ${\mathrm{HoB}}_{2}\mathrm{C}$ and ${\mathrm{DyB}}_{2}\mathrm{C}$ show the three-dimensional magnetic order below ${T}_{\mathrm{C}}=7.0\mathrm{K}$ and 8.5 K, respectively. However, they have still large magnetic fluctuations below ${T}_{\mathrm{C}}. $ The magnetic ordering temperatures of $R{\mathrm{B}}_{2}\mathrm{C}$ $(R=\mathrm{Dy},$ Ho, and Er) do not follow the de Gennes relation, where the ordering temperatures of ${\mathrm{HoB}}_{2}\mathrm{C}$ and ${\mathrm{DyB}}_{2}\mathrm{C}$ are suppressed. The suppressions of ordering temperature and the unconventional fluctuating ground states of ${\mathrm{HoB}}_{2}\mathrm{C}$ and ${\mathrm{DyB}}_{2}\mathrm{C}$ originate from the spin frustration effects. The instability of the unconventional magnetic phase associated with the frustration is significant in this series; the fluctuating ground state results from the complex spin\char21{}spin interactions or spin\char21{}quadrupole interactions.
Information Distortion and Neural Coding

Our main interest is the question of how neural ensemble activity represents sensory stimuli. In this paper we discuss a new approach to characterizing neural coding schemes. It attempts to describe the specific stimulus parameters encoded in the neural ensemble activity and at the same time determines the nature of the neural symbols with which that information is encoded. This recently developed approach for the analysis of neural coding [7, 9] minimizes an intrinsic information-theoretic cost function (the information distortion) to produce a simple approximation of a coding scheme, which can be refined as more data becomes available. We study this optimization problem. The admissible region is a direct product of simplices. We show that the optimal solution always occurs at a vertex of the admissible region. This allows us to reformulate the problem as a maximization problem on the set of vertices and develop an algorithm, which, under mild conditions, always finds a local extremum. We compare the performance of this new algorithm to standard optimization schemes on synthetic cases and on physiological recordings from the cricket cercal sensory system.
char-Polygon Decomposition: a procedure for using remotely sensed data to supplement GIS forest inventories

Forest inventory data are typically composed of polygons that have been generalized from air photographs to represent homogeneous forest conditions. Forest management is based on the use of these maps that have been generalized from the interpretation of air photographs. The areas generalized from the air photos form polygons in digital map data stored in a geographic information system (GIS). These polygons represent an interpreted homogeneity of local stand conditions. Satellite remotely sensed data can be used to make measurements, or aggregate information, in a meaningful way within those generalized areas. Polygon decomposition is the process of analyzing previously delineated polygon areas using ancillary digital information acquired from an independent source, such as remotely sensed data. In polygon decomposition, the polygon areas provide a context for assessing the presence or absence of expected conditions. Polygon decomposition enables forest management (inventory) data to be used with remotely sensed data both require spatially referenced datasets.
Geometry and dynamics in Hamiltonian lattices

E. Fermi, J. Pasta and S. Ulam introduced the Fermi-Pasta-Ulam lattice in the 1950s as a classical mechanical model for a mono-atomic crystal or a one-dimensional continuum. The model consisted of a discrete number of equal point masses that interact with their nearest neighbours only. On the basis of statistical mechanics, they expected that when the interparticle forces were anharmonic, the lattice would reach a thermal equilibrium. This means that averaged over time, its initial energy would be equipartitioned among all its Fourier modes. The famous computer experiment that they performed in Los Alamos in 1955, was intended to investigate in what manner and at what time-scale the equipartitioning would take place. The result was astonishing: the lattice did not come close to thermal equilibrium, but behaved more or less quasi-periodically. Only when the initial energy was larger than a certain threshold, did the lattice seem to `thermalise'. This paradox is nowadays known as the `Fermi-Pasta-Ulam problem'. The observations of Fermi, Pasta and Ulam were a great impulse for nonlinear dynamics. One possible explanation for the quasi-periodic behaviour of the FPU system, is based on the Kolmogorov-Arnol'd-Moser theorem, which states that most of the invariant Lagrangean tori of a Liouville integrable Hamiltonian system survive under small perturbations. It is required though for the KAM theorem that the integrable system satisfies a nondegeneracy condition. Unfortunately, it has for a long time been unclear how the Fermi-Pasta-Ulam lattice can be viewed as a perturbation of a nondegenerate integrable system. Nishida in 1971 and Sanders in 1977, investigated a Birkhoff normal form for the FPU lattice. Under the assumption of a rather strong nonresonance condition on the linear frequencies $\omega_k = 2 \sin (k\pi/n)$ of the lattice, they showed that this Birkhoff normal form is integrable and nondegenerate. This means that the KAM theorem can indeed be applied. The problem is of course that their required nonresonance condition is usually not met. This leaves a large gap in the proofs. The new idea in this thesis is to incorporate the discrete symmetries of the lattice in the argument. It turns out that this enables us to show that the nonresonance condition of Nishida and Sanders is not needed: every resonance is overruled by a symmetry. Hence the Birkhoff normal form is integrable and this proves the applicability of the KAM theorem. Moreover, much attention is paid to the analysis of exact and approximate solutions of the lattice equations. New exact solutions and invariant manifolds are found in the fixed point sets of the symmetries of the lattice. Also, the Birkhoff normal reveals approximate integrals and solutions in the low energy domain of the phase space. The analysis makes use of invariant theory and singular reduction. One of the conclusions is that the lattice with an even number of particles contains travelling wave solutions that change their direction. Moreover the integrable normal form contains nontrivial monodromy, meaning that it does not allow global action-angle variables
Advanced Energy Flow Control Concept of an MMC for Unrestricted Operation as a Multiport Device

An advanced approach of the internal energy flow control of a multiport device based on a modular multilevel converter (MMC) was proposed. Such a multiport device offers various connecting points as ac terminals, the main dc terminal as well as the dc terminals of the MMC modules. State-of-the-art multiport concepts have restrictions concerning the flexibility of connecting the available ports. The proposed concept makes an unrestricted energy interchange between all ports possible without affecting the ac grid and the main dc terminal. It contains a microscopic and macroscopic view of the entire system and an analytic description in a double synchronous reference frame. This approach allows the identification of degrees of freedom for the internal energy flow control to overcome the mentioned restrictions of state-of-the-art multiport devices. Beyond numerous simulations calculations, the proposed concept has been implemented to a prototype of a multiport device which consists of an MMC with integrated batteries in power electronics laboratory. The approach has been successfully tested and verified with measurement results.
NOTES ON NORTH AMERICAN EPHEMEROPTERA WITH DESCRIPTIONS OF NEW SPECIES

THE CAK.4DI. \N ENT0310LOGIST AUG., 1926. with thein, where ever they came froin, their own particular parasite. I t is possible, however, that a native species of 'l'achinid is attacking them, th'ougl~ 1 could not find any flies on the shore at any time. Eggs were laid in July and thc females exhibited the typical earwig care of them-stroking tliem all over with the pnlpi and carrying thein from one side of tbe brood chamber to another. i n fact this stroking and shifting seeined continuous and niade tne wonder if the eggs ivould not be glad of a rest. I t is possible, however, tliat this nianipulation. or should it be called palpipulation. is necessary for the hatching of the eggs. In October I returned to Nanaimo and paid a flying trip to the earwig beaches. Large females, such as were c o i ~ ~ i l ~ o ~ i in sumnler, were quite rare; large nlales could not be found. About three quarter grown specimens of both sexes were quite common and very small ones n-ere abundant. The total earwig population in October far exceeded that of mid-su~nmer, but their range on sliorc had not increaed at all; tliey still occupied only the Orchestia or Amphipod line of high-tide illark and still occurred only in si~iall detached areas in this line. The shore is broken and very rcclq so perhaps if long stripes of coarse gravc-1 such as these insects frequent, were available, their range night he greater than it is. So far I have found thein o111y in two places, each some 30 yards long, and ncn-here else in the neighborhood. On account of this restricted habitat, I doubt i f tlley ill hcconie sufficiently abundant to develop into a pest, although in one instance only, did I Ilappcn to find one ui~dcr a planlr on a dry slope 30 yards fro111 the sea. 'They can~lot survive if the gravel in n-hich they live is allowed to dry out even for 24 hours, so I an? at a loss to account for this lcne one so f? r from water. As time permits, further observations are being iliade on this earwig, parallel with an intensive study of F. czlricwla7-iu wh'ich is so abulldant and sp obnoxious in this vicinity. The results of this study wili be publish'ed next year.
Interpreting and using heterogeneous choice and generalized ordered logit models

The assumptions of the ordered logit/probit models estimated by ologit and oprobit are often violated. When an ordinal regression model incorrectly assumes that error variances are the same for all cases, the standard errors are wrong and (unlike OLS regression) the parameter estimates are biased. Heterogeneous choice/ location-scale models, which can be estimated with the user-written program oglm, explicitly specify the determinants of heteroskedasticity in an attempt to correct for it. Further, these models can be used when the variance/variability of underlying attitudes is itself of substantive interest. In other instances, the parallel lines assumption of the ordered logit/probit model is violated; in such cases, a generalized ordered logit/probit model (estimated via gologit2) may be called for. This paper talks about how to interpret and use the models that are estimated by oglm and gologit2. We talk about key assumptions behind the models, when each type of model may be appropriate, when the models may be problematic, and how to interpret the results and make them easier to understand.
Advanced Microeconomic Theory 521B

The following notes contain the main material of the second part of 521b 2008. 1 Bayesian Games Information / Knowledge / Uncertainty There are two important contributions in the literature 1. Harsanyi (1967-68) Models without common knowledge are transformed into games of incomplete information, and then into imperfect information games. The idea is to introduce a notion of type which represents private information. 2. Mertens and Zamir (1985) Type information is represented by an hierarchical construction.  1.1 Appliedmodels Let i denote agent is type, and let ui(x; i; i) be the payo¤ relevant types. We say i is payo¤ relevant if 9 i; i; x such that ui(x; i; i) 6= ui(x; i; i). Agents have some common knowledge regarding the distribution of types, p( ), i.e., common prior. Let pi( ij i) be is belief about other agentstypes. 1.1.1 Type space : primitives of the model (payo¤ relevant states) ti 2 Ti: agent is type Agent is private info: i : Ti ! ( T i). For the moment, we will assume nite, and T i countable. A type space is a collection T = ((Ti)i=1; ( i)i=1) 1.1. 2 Example: Envelopes Two agents: Alice and Bob. Both receive a closed envelope. It is common knowledge that the number of dollars in Alices envelope is odd, and the number of dollars in Bobs envelope is even, and that both amounts are $1 apart, i.e., they are adjacent numbers. Before opening the envelopes the information can be represented as in Table 1, where the stars denote the possible states of the world.
Interior-point polynomial algorithms in convex programming

Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynomial time methods, interior point methods, interior point methods for linear and quadratic programming, polynomial time methods for nonlinear convex programming, efficient computation methods for control problems and variational inequalities, and acceleration of path-following methods are covered. In this book, the authors describe the first unified theory of polynomial-time interior-point methods. Their approach provides a simple and elegant framework in which all known polynomial-time interior-point methods can be explained and analyzed; this approach yields polynomial-time interior-point methods for a wide variety of problems beyond the traditional linear and quadratic programs. The book contains new and important results in the general theory of convex programming, e.g., their "conic" problem formulation in which duality theory is completely symmetric. For each algorithm described, the authors carefully derive precise bounds on the computational effort required to solve a given family of problems to a given precision. In several cases they obtain better problem complexity estimates than were previously known. Several of the new algorithms described in this book, e.g., the projective method, have been implemented, tested on "real world" problems, and found to be extremely efficient in practice. Contents : Chapter 1: Self-Concordant Functions and Newton Method; Chapter 2: Path-Following Interior-Point Methods; Chapter 3: Potential Reduction Interior-Point Methods; Chapter 4: How to Construct Self- Concordant Barriers; Chapter 5: Applications in Convex Optimization; Chapter 6: Variational Inequalities with Monotone Operators; Chapter 7: Acceleration for Linear and Linearly Constrained Quadratic Problems
REVISION OF THE TRIBE QUEDIINI OF AMERICA NORTH OF MEXICO (COLEOPTERA: STAPHYLINIDAE). SUPPLEMENTUM

Abstract The following new taxa of Quediini (Staphylinidae) are described: Heterothops arizonicus spec. nov. (Arizona), H. aeneiventris spec. nov. (Huachuca Mts. in Arizona), H. marmotae spec. nov. (Ontario), Quedius leechi neomexicanus subsp. nov. (Sacramento Mts. and Sierra Blanca in New Mexico), and Q. leechi chiricahuensis subsp. nov. (Chiricahua Mts. in Arizona).
On the synthesis and complexity of feedforward networks

A method for synthesis of one hidden layer feedforward neural networks approximating functions of several variables to the desired degree of accuracy is presented. The method fully determines the network architecture including the values of all weights. In the first step, the inverse Radon transform is used to decompose a problem of of approximating a function of several variables into several problems of approximating a function of one variable. In the second step, each of the obtained one-dimensional functions is approximated by a sub-network. Then sub-networks are combined to construct the network approximating the original function. The upper bound of the final approximation error /spl epsi/ and errors at each step are estimated. The complexity of the network, or the number of neurons in the hidden layer, is O/sub /spl epsi//(1//spl epsi//sup n/), where n is the dimension of the space. <<ETX>>
LARVAL REARING BY WORKER HONEY BEES LACKING THEIR MANDIBULAR GLANDS: I. REARING BY SMALL NUMBERS OF WORKER BEES

Abstract Experiments were done in an attempt to ascertain the significance of the mandibular glands of nurse bees in female caste differentiation. Groups of 30 or 75, 10-day-old nurse bees, with their mandibular glands removed, were caged in the laboratory. Each group was provided with female larvae in plastic queen cell cups. The treated nurse bees were able to rear a few pupae, from these larvae, which were classified as queenlike intermediates while the untreated nurse bees reared pupae or adults which were classified as queens or queenlike intermediates.
Neurofibromatosis-1 Gene Mutational Profiles Differ Between Syndromic Disease and Sporadic Cancers

Objectives Variants in the neurofibromatosis type 1 (NF1) gene are not only responsible for the NF1 cancer predisposition syndrome, but also frequently identified in cancers arising in the general population. While germline variants are pathogenic, it is not known whether those that arise in cancer (somatic variants) are passenger or driver variants. To address this question, we sought to define the landscape of NF1 variants in sporadic cancers. Methods NF1 variants in sporadic cancers were compiled using data curated on the c-Bio database and compared with published germline variants and Genome Aggregation Database data. Pathogenicity was determined using Polyphen and Sorting Intolerant From Tolerant prediction tools. Results The spectrum of NF1 variants in sporadic tumors differ from those most commonly seen in individuals with NF1. In addition, the type and location of the variants in sporadic cancer differ from germline variants, where a high proportion of missense variants were found. Finally, many of the sporadic cancer NF1 variants were not predicted to be pathogenic. Discussion Taken together, these findings suggest that a significant proportion of NF1 variants in sporadic cancer may be passenger variants or hypomorphic alleles. Further mechanistic studies are warranted to define their unique roles in nonsyndromic cancer pathobiology.
Visualization of IoT Security Requirements using CC-Case

IoT, Internet of Things, systems are expected to be in widespread use rapidly all over the world. However, the connected world using the Internet has various risks. The security design technology becomes more important in such the connected world. Depending on increasing a variety of connected targets, IoT security requirements becomes even more complicated. Therefore, the visualization of IoT security requirements become a important issue. We propose a visualization method of IoT security requirements by applying the CC-Case which realizes security requirement analysis and assurance by using the Common Criteria (CC) and the assurance case. This method has simpler, and plainer diagrammatic representation than conventional threat analyses. In this paper, We show the drafting process and merits of CC-Case from threat analysis to countermeasure are planning using a concrete example of IoT security.
Implication of the sidereal anisotropy of ∼5 TeV cosmic ray intensity observed with the Tibet III air shower array

We show that the large‐scale anisotropy of ∼5 TeV galactic cosmic ray (GCR) intensity observed by Tibet Air Shower experiment can be reproduced by the superposition of a bi‐directional and uni‐directional flows (UDF and BDF) of GCRs. The heliosphere is located inside the local interstellar cloud (LIC) very close to the inner edge of the LIC. If the GCR population is lower inside the LIC than outside, the BDF flow is expected from the parallel diffusion of GCRs into LIC along the local interstellar magnetic field (LISMF) connecting the heliosphere with the region outside the LIC, where the GCR population is higher. A type of the UDF, on the other hand, is expected from the B×∇n drift flux driven by a gradient of GCR density (n) in the LISMF (B). The LISMF orientation deduced from the best‐fit direction of the BDF is almost parallel to the galactic plane and more consistent with the suggestion of Frisch (1996) than that of Lallement et al. (2005). We note that the model, if holds, yields the LISMF polarity .
Algorithms for clustering problems

Clustering problems arise in various contexts. Roughly speaking, clustering refers to partitioning a set of objects into groups of similar objects. The objects (e.g. documents or images) are usually represented as points in some space with a distance measure and the objective is to obtain clusters of points that are close to each other. Problems of this flavor also occur in discrete location theory, where the goal is to locate a set of facilities (e.g. factories or warehouses) so as to serve a given set of clients. In this thesis, we consider several algorithmic aspects of clustering problems, viewed as optimization questions. The quality of a clustering is typically measured by an objective function and the goal of an algorithm is to minimize this. For most natural objective functions, the corresponding optimization problem turns out to be NP-hard. In the face of this fundamental intractability, researchers have shifted their focus from exact solutions to obtaining approximate solutions that are guaranteed to be close to the optimal. The first part of the thesis focuses on the approximability of several natural clustering objectives. We describe approximation algorithms for classical clustering and location problems such as k-median and facility location. We use both linear programming based approaches as well as purely combinatorial approaches such as local search to achieve the currently best known approximation factors for these problems. Further, the ideas behind these algorithms extend to other problems such as minsum clustering. The second part of the thesis examines other algorithmic issues that arise in clustering. We study clustering problems in the presence of outliers which must be identified and excluded prior to clustering. We also formulate problems and describe results related to the incremental maintenance of clusters in a dynamic point set. Such problems arise when the data set is frequently updated and re-clustering is prohibitively expensive. Finally, we look at algorithmic techniques to deal with clustering large data sets, motivated by a real life application—that of clustering near duplicate documents in the AltaVista index.