Miracle-dz/UniFAR-FTUs huggingface dataset:
PD-Sparse : A Primal and Dual Sparse Approach to Extreme Multiclass and Multilabel Classification

We consider Multiclass and Multilabel classification with extremely large number of classes, of which only few are labeled to each instance. In such setting, standard methods that have training, prediction cost linear to the number of classes become intractable. State-of-the-art methods thus aim to reduce the complexity by exploiting correlation between labels under assumption that the similarity between labels can be captured by structures such as low-rank matrix or balanced tree. However, as the diversity of labels increases in the feature space, structural assumption can be easily violated, which leads to degrade in the testing performance. In this work, we show that a margin-maximizing loss with l1 penalty, in case of Extreme Classification, yields extremely sparse solution both in primal and in dual without sacrificing the expressive power of predictor. We thus propose a Fully-Corrective Block-Coordinate Frank-Wolfe (FC-BCFW) algorithm that exploits both primal and dual sparsity to achieve a complexity sublinear to the number of primal and dual variables. A bi-stochastic search method is proposed to further improve the efficiency. In our experiments on both Multiclass and Multilabel problems, the proposed method achieves significant higher accuracy than existing approaches of Extreme Classification with very competitive training and prediction time.
Association between Genetic Variations Affecting Mean Telomere Length and the Prevalence of Hypertension and Coronary Heart Disease in Koreans

In this study, we investigated whether the single nucleotide polymorphisms (SNPs) associated with telomere length (TL) were associated with the incidence of hypertension (HTN)/coronary heart disease (CHD) and cardiovascular risk factors in the Korean population. Data from 5,705 (ages 39–70) participants in the Korean Genome Epidemiology Study (rural Ansung and urban Ansan cohorts) were studied. Twelve SNPs known to be associated with telomere biology were tested for an association with HTN/CHD. As results, no significant associations were found between the selected TL-related SNPs and prevalence of HTN and CHD. Among non-alcohol users, subjects with minor alleles in rs1269304 and rs10936601 (TERC and LRRC34, respectively) exhibited a higher rate of CHD occurrence (odds ratio [OR], 1.862; 95% confidence intervals [CIs], 1.137, 3.049; OR, 1.855; 95% CIs, 1.111, 2.985; respectively). However, alcohol users with minor alleles in rs398652 (PELI2) were significantly associated with higher HTN prevalence (OR, 1.179; 95% CIs, 1.040, 1.336). Of the 3 SNPs related to disease outcomes, rs1296304 was significantly associated with increased levels of diastolic blood pressure (β estimate, 0.470; 95% CIs, 0.013, 0.926). The minor allele in rs398652 was significantly associated with higher levels of body mass index (OR, 0.128; 95% CIs, 0.010, 0.246) and γ-glutamyl transpeptidase (OR, 0.013; 95% CIs, 0.001, 0.024). In conclusion, there were no significant associations between the selected TL-related SNPs and the occurrence of HTN/CHD in Koreans. However, the results suggest the presence of a possible interaction between related SNPs and alcohol behavior associated with HTN/CHD occurrence.
Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem

Capacitated vehicle routing problem (CVRP) is an NP-hard problem. For large-scale problems, it is quite difficult to achieve an optimal solution with traditional optimization methods due to the high computational complexity. A new hybrid approximation algorithm is developed in this work to solve the problem. In the hybrid algorithm, discrete particle swarm optimization (DPSO) combines global search and local search to search for the optimal results and simulated annealing (SA) uses certain probability to avoid being trapped in a local optimum. The computational study showed that the proposed algorithm is a feasible and effective approach for capacitated vehicle routing problem, especially for large scale problems.
Applying decentralized trust management to DNS dynamic updates

DNS dynamic updates can be used to modify the data of a DNS zone. This can be used to update DNS records of hosts with dynamic IP addresses, for example. DNS dynamic updates can be authenticated using the DNSSEC transaction signatures or the TSIG mechanism. While there are existing mechanisms for authenticating the source of update requests, mechanisms for authorization, i.e. specifying who is allowed to change what, are inadequate in many cases. In this paper, we propose a solution for authorizing DNS dynamic updates, based on the decentralized trust management approach, and more specifically, the KeyNote 2 system. We have also modified the BIND 9 name server to use this approach. Our solution supports the separation of DNS server administration and update authorization, and also allows the specification of more flexible access restrictions than the use of access control lists.
Obituary of Bernhard J. Wolf the Perceptual Cognitive Processes Underpinning Skilled Performance in Volleyball: Evidence from Eye-movements and Verbal Reports of Thinking Involving an in Situ Representative Task……………..…………………………………………………………………. 8 Dual-processes in Learning and Judgment: Evidence fro

Many thanks to all authors for their contributions To get information about future Newsletters, you are welcome to join (free of charge) the email list of the Brunswik Society at:-2-Today's social mobility and information exchange between different social and cultural contexts have increased demands on individuals' adaption to trans-cultural values such as openness, mutual understanding, ability to cooperate, respect and empathy in interpersonal relations. These demands require compromises, adjustment to norms, to ambiguity and uncertainty as well as awareness of consequences, corresponding to our decisions and choices. Brunswik's conceptual world, theory and lens model paradigm are well-suited for empirical studies of these adaptive processes. The contributions to this year's Brunswik Society Newsletter cover a wide range of topics: judgements when no beforehand, agreed upon criterion exists, emotional communication, sport, crime, medical risk communication, just to mention some examples. On the theoretical side, the validity concept is discussed and Brunswik's representativeness-concept illustrated against the background of the subjective probability concept. During the last 6 years I have been the editor of the annual Brunswik Society Newsletter. I have learnt a lot, inspired by the correspondence and always enjoyed the contacts with colleagues. I also wish to extend my very grateful thanks to Esther Kaufmann who with her considerable knowledge of Brunswikian research has directed my attention to interesting work and presumptive contributors. She has, moreover, taken on the responsibility for the layout of the Newsletter. I am also indebted to my wife, Gillian, for IT and language support. Due to advanced age, family commitments and a multitude of other rather time-consuming interests I have decided to make this issue my swansong. The Brunswik Society has kept up a long, unbroken flow of information about Brunswikian research by means of our annual Newsletter. I sincerely hope that one or some of you will take up the torch and keep our Newsletter going. he worked as a psychologist and educational scientist at the University of Koblenz-Landau. His fields of research and teaching were wide, encompassing: socio-scientific research and statistics, pedagogic psychology, development psychology, pedagogics of infancy, Egon Brunswik's work. Bernhard was well attuned to the scientific language of Brunswik who aimed at precision when explaining complex ideas. In Bernhard's Habilitation work, " Brunswik und Ökologische Perspectiven in der Psychologie " , (1993, published 1995) Brunswik's key-concepts and theoretical framework are presented against a background of manifold ways of describing and modeling human beings' …
End-to-end packet-scheduling in wireless ad-hoc networks

Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstraction here, and we study packet routing and scheduling under this model. The main focus of our work is the development of fully-distributed (decentralized) protocols. We present polylogarithmic/constant factor approximation algorithms for various families of disk graphs (which capture the geometric nature of wireless-signal propagation), as well as near-optimal approximation algorithms for general graphs. The packet-scheduling work by L eighton, Maggs and Rao (Combinatorica, 1994) and a basic distributed coloring procedure, originally due to Luby (J. Computer and System Sciences, 1993), underlie many of our algorithms. Experimental work of Finocchi, Panconesi, and Silvestri (SODA 2002) showed that a natural modification of Luby's algorithm leads to improved performance, and a rigorous explanation of this was left as an open question; we prove that the modified algorithm is provably better in the worst-case. Finally, using simulations, we study the impact of the routing strategy and the choice of parameters on the performance of our distributed algorithm for unit disk graphs.
The Relevance of a Probabilistic Mindset in Risky Choice

Choice preferences can shift depending on whether outcome and probability information about the options are provided in a description or learned from the experience of sampling. We explored whether this description-experience "gap" could be explained as a difference in probabilistic mindset, that is, the explicit consideration of probability information in the former but not the latter. We replicated the gap but found little evidence to support our main hypothesis. Nevertheless, the data inspired a number of interesting proposals regarding experimental design, preference for probability information, sampling strategies, optimal presentation format, and the probability judgment probe.
Variable stars in the field of the old open cluster Melotte 66

We report the results of photometric monitoring of the Melotte 66 field in BVI filters. 10 variables were identified with nine being new discoveries. The sample includes eight eclipsing binaries of which four are W UMa type stars and one star is a candidate blue straggler. All four contact binaries are likely the members of the cluster based on their estimated distances. 10 blue stars with U - B < -0.3 were detected inside a 14.8 x 22.8 arcmin 2 field centred on the cluster. Time series photometry for seven of them showed no evidence for any variability. The brightest object in the sample of blue stars is a promising candidate for a hot subdwarf belonging to the cluster. We show that the anomalously wide main sequence of the cluster, reported in some earlier studies, results from a combination of two effects: variable reddening occurring across the cluster field and the presence of a rich population of binary stars in the cluster itself. The density profile of the cluster field is derived and the total number of the member stars with 16 < V < 21 or 2.8 < M v < 7.8 is estimated conservatively at about 1100.
The influence of verbal elaboration on subsequent learning: an experimental study in a PBL-setting

Problem-based group discussions are expected to enhance activation of and elaboration on prior knowledge. Some experiments reported improved recall after problem-based group discussions. However, these experiments did not control for individual differences in prior knowledge and quality of discussions. This experiment aimed to keep these variables under control. 62 students were trained on a physical topic (waves). One week later, they observed a video-recorded problem-based group discussion. In the experimental condition, students observed a discussion relevant to the trained material and verbally participated. In two control conditions, students either observed the relevant or an irrelevant discussion, without participating verbally. Then, all participants studied a relevant text. Immediate and delayed cued recall measures were taken. The experimental group was expected to recall more correct propositions than both control groups. A preliminary analysis with a one-way ANOVA showed a significant difference between the conditions on the delayed, but not on the immediate measure. A tentative conclusion therefore is that the verbal participation improved long-term recall.
Comparison of Different Neural Augmentations for the Fault Tolerant Control Laws of the WVU YF-22 Model Aircraft

A fault tolerant neurally augmented control scheme based on non-linear dynamic inversion is designed for the WVU YF-22 aircraft model. The parameters of the model following adaptive flight controller are determined at a single flight condition and a neural network is used to compensate for inversion errors and changes in aircraft dynamics, including actuator failures. Three different neural networks are used: the extended minimal resource allocating network, the single hidden layer network, and the sigma pi. Numerical simulations are performed at nominal flight conditions and failure conditions affecting the stabilator or the aileron. Performance assessment parameters are defined based on the angular rate tracking errors. The performance of the three neural networks is compared in terms of these parameters
Analog Signal Processing for Pulse Compression Radar in 90-nm CMOS

This paper presents a pulse-compression radar baseband analog signal processing integrated in a silicon process for low cost and power dissipation. The analog signal-processing circuitry exhibits the autocorrelation properties of the polyphase codes, maximizes the sensitivity and resolution of a pulse radar system, and alleviates speed and resolution requirements of the analog-to-digital converter (ADC) via an analog correlator. The circuitry includes a two-stage variable gain amplifier (VGA) for high dynamic range, a correlator/integrator circuit, a comparator, and offset calibration circuits. The differential 6-bit VGA is designed to adaptively track the Friis path loss through rapid change of the VGA gain and offset calibration, relaxing the dynamic range requirements of the correlator. The measured performance shows a VGA gain variation of 52 dB and a VGA group-delay imbalance of 50 ps over 64 states. The high-speed pulse compression/correlation is performed in analog current domain and the speed requirement on the ADC is reduced by a factor equal to the duty cycle lowering the ADC power consumption. The chip is fabricated in a 90-nm process, wire bonded on the FR4 printed circuit board, and tested with a Stratix IV field-programmable gate-array board to evaluate the system performance for different radar polyphase codes.
Cooperative caching techniques for mobile ad hoc networks

Data caching can remarkably improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. The cache placement problem minimizes total data access cost in ad hoc networks with multiple data items. The ad hoc networks are multi hop networks without a central base station and are resource constrained in terms of channel bandwidth and battery power. By data caching the communication cost can be reduced in terms of bandwidth as well as battery energy. As the network node has limited memory the problem of cache placement is a vital issue. This paper attempts to study the existing cooperative caching techniques and their suitability in mobile ad hoc networks.
Low-energy self-organization scheme for wireless ad hoc sensor networks

We propose in this paper a low-energy self-organization scheme (LEGOS), a simple event-driven and leader-based self-organization. It provides and maintains a communication structure for wireless ad hoc sensor networks with low energy consumption. To achieve low power operation, LEGOS employs a quick join procedure with low message cost for newly arrived sensor nodes. The use of periodic Hello messages is avoided in the design of LEGOS, which has a strong impact on energy saving. LEGOS guarantees a low-cardinality dominating node set selection in the network. The resulting communication structure can adapt itself with the growth of the network service area. LEGOS is a completely localized algorithm. We also prove that LEGOS has low computation complexity and low message cost through simply analysis. Through simulations, we show that LEGOS provides up to 20% of extra energy savings compared to other self-organization schemes when using the same distributed MAC scheduling. Our results illustrate the need for simple and low-energy self-organization to effectively realize energy efficient sensor network applications
A Deterministic Construction of Projection matrix for Adaptive Trajectory Compression

Compressive Sensing, which offers exact reconstruction of sparse signal from a small number of measurements, has tremendous potential for trajectory compression. In order to optimize the compression, trajectory compression algorithms need to adapt compression ratio subject to the compressibility of the trajectory. Intuitively, the trajectory of an object moving in starlight road is more compressible compared to the trajectory of a object moving in winding roads, therefore, higher compression is achievable in the former case compared to the later. We propose an in-situ compression technique underpinning the support vector regression theory, which accurately predicts the compressibility of a trajectory given the mean speed of the object and then apply compressive sensing to adapt the compression to the compressibility of the trajectory. The conventional encoding and decoding process of compressive sensing uses predefined dictionary and measurement (or projection) matrix pairs. However, the selection of an optimal pair is nontrivial and exhaustive, and random selection of a pair does not guarantee the best compression performance. In this paper, we propose a deterministic and data driven construction for the projection matrix which is obtained by applying singular value decomposition to a sparsifying dictionary learned from the dataset. We analyze case studies of pedestrian and animal trajectory datasets including GPS trajectory data from 127 subjects. The experimental results suggest that the proposed adaptive compression algorithm, incorporating the deterministic construction of projection matrix, offers significantly better compression performance compared to the state-of-the-art alternatives.
Misbehavior Resistant Fair Scheduling in Wireless Backhaul Mesh Networks

IYER, VARAGUR K. Misbehavior Resistant Fair Scheduling in Wireless Backhaul Mesh Networks. (Under the direction of Dr. Peng Ning). Wireless Mesh Networks (WMNs) are increasingly becoming popular as a means to realizing cost-effective and efficient public area networks. WMNs provide improved coverage with relatively cheaper infrastructure and are easy to deploy and expand as compared to Wireless LANs. This is possible due to the use of wireless multihop routing to forward traffic from nodes to a Gateway (GW) that has a wired connection to the Internet. However, there are several issues that need to be addressed to realize the practical deployment of large scale mesh networks serving a vast number of clients. Fairness is one such key issue of concern in WMNs, however, WMNs based on existing 802.11 technology exhibit severe unfairness. Several TDMA based bandwidth scheduling schemes have been proposed as an alternative to ensure fairness in WMNs. Such schemes implicitly trust the nodes in the network and as a result, are vulnerable to threats due to misbehavior by nodes participating in the scheduling. These threats are further amplified in public area mesh networks where nodes have highly varying demand and are vulnerable to capture. While a lot of research has been done on securing routing and topology control protocols against misbehavior, the effects of misbehavior on fair scheduling have not been considered. In this thesis, we address the threats to fair scheduling in wireless backhaul mesh networks from node misbehavior and present a generic verification framework to detect such misbehavior. The verification framework is based on the argument that, while the actions of an individual node might not be trusted, the collective action of all the nodes in the network can be trusted since an attacker is assumed to be incapable of compromising every node in the network. We propose two verification schemes based on this framework, each designed for a particular deployment environment. We conduct an experimental evaluation of the verification schemes by using them to extend an existing fair scheduling scheme. The experimental results show that a fair scheduling scheme relying on the exchange of demand information can be extended by an instance of the verification framework to ensure misbehavior detection while incurring a relatively small amount of overhead. Misbehavior Resistant Fair Scheduling in Wireless Backhaul Mesh Networks by Varagur Karthik Iyer A thesis submitted to the Graduate Faculty of North Carolina State University in partial fullfillment of the requirements for the Degree of Master of Science
Implementation of Crossrealm Referral Handling in the MIT Kerberos Client

The Windows 2000 Kerberos implementation [1, 2] uses a di erent approach to solve the Kerberos realm resolution problem than has traditionally been used by MIT Kerberos implementations. In this paper, we present the details of the two approaches and compare them. To facilitate more e ective use of the Kerberos ticket cache, we propose a new format for referral data that includes a list of alias names as part of the returned referral information. We include the pseudocode for the algorithm that we have implemented in the MIT Kerberos client that allows a MIT Kerberos client to request and follow referrals from a Windows 2000 Kerberos KDC, thus removing the need for management and administration of DNS to realm mapping les on Kerberos client hosts. We conclude with a discussion of issues that are applicable to any mutual authentication protocol.
Physical mapping of the conjugative plasmid pMB1‐1 of Enterococcus faecalis

The sexpheromone system of Enterococcus faecalis is a form of bacterial conjugation that plays an important role in the horizontal dissemination of genes. The ecological significance of 'sexual' plasmids is to permit a rapid mobilization of genes of interest for the species (e.g. those encoding haemolysins, bacteriocins or antibiotic resistance). The physical mapping of pMB1-1, a conjugative plasmid of Ent. faecalis that responds to cCF10 pheromone, has been undertaken. By means of hybridization with conserved sequences of pCF10 plasmid, the regions harbouring the genes responsible for the pheromone inhibitor and the aggregation and exclusion proteins of this plasmid have been identified. The results demonstrated that plasmids pMB1-1 and pCF10 only show homology in the region involved in the conjugative response, suggesting that this region may be transferred in an independent way to that of the rest of the plasmid.