LLukas22/scidocs huggingface dataset:
Generic Red-Black Tree and its C# Implementation

The focus of this installment of the Educator's Corner is on tree construction – red-black trees. Some of the material for this column is taken from Chapter 13 of the forthcoming book " Modern Software Development Using C#/.NET " by Richard Wiener. This book will be published by Thomson, Course Technology in the Fall, 2005. A fascinating and important balanced binary search tree is the red-black tree. Rudolf Bayer invented this important tree structure in 1972, about 10 years after the introduction of AVL trees. He is also credited with the invention of the B-tree, a structure used extensively in database systems. Bayer referred to his red-black trees as " symmetric binary B-trees. " Red-black trees, as they are now known, like AVL trees, are " self-balancing ". Whenever a new object is inserted or deleted, the resulting tree continues to satisfy the conditions required to be a red-black tree. The computational complexity for insertion or deletion can be shown to be O(log 2 n), similar to an AVL tree. Red black trees are important in practice. They are used as the basis for Java's implementation of its standard SortedSet collection class. There is no comparable collection in the C# standard collections so a C# implementation of red-black trees might be useful. The rules that define a red-black tree are interesting because they are less constrained than the rather strict rules associated with an AVL tree. Each node is assigned a color of red or black. This can be accomplished using a field of type bool in class Node (true if the node is red and false if it is black). The formal rules that define a red-black binary search tree are the following: 1. Every node is colored either red or black. 2. The root node is always black. 3. Every external node (null child of a leaf node) is black. 4. If a node is red, both of its children are black. 5. Every path from the root to an external node contains the same number of black nodes.
Negotiation-based layer assignment for via count and via overflow minimization

Layer assignment determines on which layer the wires or vias should be placed; and the assignment results influence the circuit's delay, crosstalk, and via counts. How to minimize via count and via overflow during layer assignment has received considerable attention in recent years. Traditional layer assignment to minimize via count tends to produce varying qualities of assignment results using different net orderings. This work develops a negotiation-based via count minimization algorithm (NVM) that can achieve lower via counts than in previous works, and experimental results indicate that net assignment ordering only slightly influences the quality of NVM's results. As for via overflow minimization, we observe via overflow can be well minimized if via overflow minimization is performed following stacked via minimization. The stacked via minimization adopts the proposed NVM, while via overflow minimization adopts a modified NVM by replacing via cost with via overflow cost. Experimental results reveal that the proposed NVM yields a lower additional via cost than [1] and [2] by 10.8%, 2.5%, respectively, in the via count minimization problem. As for via overflow minimization, the proposed two-stage algorithm improves via overflow by 11.5% and lowers the via cost by 6.5% than the one-stage algorithm [3].
Multi-user video streaming over multi-hop wireless networks: A distributed, cross-layer approach based on priority queuing

Emerging multi-hop wireless networks provide a low-cost and flexible infrastructure that can be simultaneously utilized by multiple users for a variety of applications, including delay-sensitive multimedia transmission. However, this wireless infrastructure is often unreliable and provides dynamically varying resources with only limited quality of service (QoS) support for multimedia applications. To cope with the time-varying QoS, existing algorithms often rely on non-scalable, flow-based optimizations to allocate the available network resources (paths and transmission opportunities) across the various multimedia users. Moreover, previous research seldom optimizes jointly the dynamic routing with the adaptation and protection techniques available at the medium access control (MAC) or physical (PHY) layers. In this paper, we propose a distributed packet-based cross-layer algorithm to maximize the decoded video quality of multiple users engaged in simultaneous real-time streaming sessions over the same multi-hop wireless network. Our algorithm explicitly considers packet-based distortion impact and delay constraints in assigning priorities to the various packets and then relies on priority queuing to drive the optimization of the various users' transmission strategies across the protocol layers as well as across the multi-hop network. The proposed solution is enabled by the scalable coding of the video content (i.e. users can transmit and consume video at different quality levels) and the cross-layer optimization strategies, which allow priority-based adaptation to varying channel conditions and available resources. The cross-layer strategies - application layer packet scheduling, the policy for choosing the relays, the MAC retransmission strategies, the PHY modulation and coding schemes - are optimized per packet, at each node, in a distributed manner. The main component of the proposed solution is a low-complexity, distributed, and dynamic routing algorithm, which relies on prioritized queuing to select the path and time reservation for the various packets, while explicitly considering instantaneous channel conditions, queuing delays and the resulting interference. Our results demonstrate the merits and need for end-to-end cross-layer optimization in order to provide an efficient solution for real-time video transmission using existing protocols and infrastructures. Importantly, our proposed delay-driven, packet-based transmission is superior in terms of both network scalability and video quality performance to previous flow-based solutions that statically allocate resources based on predetermined paths and rate requirements. In addition, the results provide important insights that can guide the design of network infrastructures and streaming protocols for video streaming.
Comparison of transient behaviors of wind turbines with DFIG considering the shaft flexible models

In order to investigate the impacts of the integration of wind farms into utilities network, it is necessary to analyze the transient performances of wind power generation systems. In this paper, an assessment of the impact that the different representations of drive-train dynamics have on the electrical transient performances of doubly fed induction generator (DFIG) wind turbines with different operationally states is investigated. In order to compare the transient performances of DFIG wind turbines during electrical transients, a DFIG model with simple one-mass lumped model and a two-mass shaft flexible model of wind turbine drive train systems are presented including the control strategies of the grid side and rotor side converters. The transient performances of DFIG wind turbines are evaluated under super- and sub-synchronous operation during different grid voltage dips. Simulation results have shown that it is needed to consider two mass shaft flexible model for the sake of exact analysis of transient behavior of DFIG wind turbines, especially when a more serious grid voltage dips occurs in power system and DFIG is at super-synchronous operation.
Medical marijuana laws and suicides by gender and age.

OBJECTIVES
We estimated the association between legalizing medical marijuana and suicides.


METHODS
We obtained state-level suicide data from the National Vital Statistics System's Mortality Detail Files for 1990-2007. We used regression analysis to examine the association between medical marijuana legalization and suicides per 100 000 population.


RESULTS
After adjustment for economic conditions, state policies, and state-specific linear time trends, the association between legalizing medical marijuana and suicides was not statistically significant at the .05 level. However, legalization was associated with a 10.8% (95% confidence interval [CI] = -17.1%, -3.7%) and 9.4% (95% CI = -16.1%, -2.4%) reduction in the suicide rate of men aged 20 through 29 years and 30 through 39 years, respectively. Estimates for females were less precise and sensitive to model specification.


CONCLUSIONS
Suicides among men aged 20 through 39 years fell after medical marijuana legalization compared with those in states that did not legalize. The negative relationship between legalization and suicides among young men is consistent with the hypothesis that marijuana can be used to cope with stressful life events. However, this relationship may be explained by alcohol consumption. The mechanism through which legalizing medical marijuana reduces suicides among young men remains a topic for future study.
Y-chromosomal DNA haplogroups and their implications for the dual origins of the Koreans

We have analyzed eight Y-chromosomal binary markers (YAP, RPS4Y711, M9, M175, LINE1, SRY+465, 47z, and M95) and three Y-STR markers (DYS390, DYS391, and DYS393) in 738 males from 11 ethnic groups in east Asia in order to study the male lineage history of Korea. Haplogroup DE-YAP was found at a high frequency only in Japan but was also present at low frequencies in northeast Asia, including 2.5% in Korea, suggesting a northern origin for these chromosomes. Haplogroup C-RPS4Y711 was present in Korea and Manchuria at moderate frequencies: higher than in populations from southeast Asia, but lower than those in the northeast, which may imply a northern Asian expansion of these lineages, perhaps from Mongolia or Siberia. The major Y-chromosomal expansions in east Asia were those of haplogroup O-M175 (and its sublineages). This haplogroup is likely to have originated in southern east Asia and subsequently expanded to all of east Asia. The moderate frequency of one sublineage in the Koreans, haplogroup O-LINE1 (12.5%), could be a result of interaction with Chinese populations. The age of another sublineage, haplogroup O-SRY+465, and Y-STR haplotype diversity provide evidence for relatively recent male migration, originally from China, through Korea into Japan. In conclusion, the distribution pattern of Y-chromosomal haplogroups reveals the complex origin of the Koreans, resulting from genetic contributions involving the northern Asian settlement and range expansions mostly from southern-to-northern China.
Automated Attendance System in College Using Face Recognition and NFC

An almost every institution and organization, attendance monitoring is a very important process. The current method involves the use of sheets of paper, books in taking student attendance. This method could easily allow for proxy and the attendance sheet could be lost or damaged. Taking attendance is thus time consuming using this traditional approach and hence there is a need of an reliable and a automated system. The Attendance monitoring system (AMS) will provide the needed solution. This system uses NFC along with Face Recognition to realize the functionalities. This system uses Face Recognition for the attendance of student at the college gate. The NFC Tag is used to tap on the NFC Reader while entering Classrooms, Labs, etc. The attendance taken at gate through face recognition is accessible to the Principal, HOD and class teacher. Attendance at gate through face recognition Mapped with attendance which is generated through NFC. This mapping is used to avoid fake attendance and to increase accuracy. The system consists of APK file, which contain two logins one for student and one for parent which is installed on their android devices. The AMS will be used to mark the attendance of the student and will also be used to generate weekly, monthly attendance report of student and thus will enable the teachers to keep track of students records. Rather than signing on the attendance sheets or taking attendance manually the student will mark the attendance by just a single click on his device. Also, the teachers has the facility to generate reports, and provide details of student like attendance, marks etc. to parent and also provide details to student like timetable, notes etc. on android application. Student can give feedback to the teacher using same android application Keywords— Image Processing, NFC (Near Field Communication) Card, NFC Reader, Face Recognition, AMS (Attendance monitoring system), APK (Android Application Package) file.
Black-body radiation of noncommutative gauge fields

The black-body radiation is considered in a theory with noncommutative electromagnetic fields; that is noncommutativity is introduced in field space, rather than in real space. A direct implication of the result on cosmic microwave background map is argued.
Wavelet filter for noise reduction and signal compression in an artificial nose

This work presents results of the use of a wavelet filter for noise reduction and data compression of signals generated by artificial nose sensors. To verify the performance of the wavelet analysis in the treatment of odor patterns, we compare two widely used artificial nose classifiers, multi-layer perceptron neural network and time delay neural network in the analysis of signals generated by eight conducting polymer sensors exposed to gases derived from the petroliferous industry. # 2005 Elsevier B.V. All rights reserved.
Preparation and Growth Mechanism of Gold Nanorods (NRs) Using Seed-Mediated Growth Method

A method is used for preparing gold NRs with aspect ratios ranging from 1.5 to 10 for which the surface plasmon absorption maxima are between 600 and 1300 nm. This method has been adapted from a previously published seed-mediated growth method (Jana et al. Adv. Mater. 2001, 13, 1389). The disadvantages and limitations of the earlier method (i.e., formation of noncylindrical NRs, φ-shaped particles, and formation of a large fraction of spherical particles) have been overcome by use of a hexadecyltrimethylammonium bromide (CTAB)-capped seed instead of a citrate-capped one. In a single-component surfactant system, the silver content of the growth solution was used to grow NRs to a desired length. This results in reproducible formation of NRs with aspect ratios ranging from 1.5 to 4.5. To grow longer NRs with aspect ratios ranging from 4.6 to 10, a binary surfactant mixture composed of benzyldimethylhexadecylammoniumchloride (BDAC) and CTAB was used. NRs are grown in this mixture either by aging or by addition of a growth solution suitable to shorter NRs. Effects of the silver ion and the cosurfactant along with the growth mechanism of NRs are discussed.
Analysis of a Denial of Service Attack on TCP

This paper analyzes a network-based denial of service attack for IF (Inteme.t Protocol) based networks. It is popularly called SYN flooding. It works by an attacker sending many TCP (1ransmission Control Protocol) COIlllection requests with spoofed source addresses to a victim's machine. Each single request causes the targeted host to instantiate data structures out of a limited pool of resources. Once the target host's resources are exhausted, no more incoming TCP connections can be established, thus denying further legitimate access. The paper contributes a detailed analysis of the SYN flooding attack and a discussion of existing and proposed countermeasures. Furthermore, we introduce a new solution approach, explain its design, and evaluate its perfonnance. Our approach offers protection against SYN flooding for all hosts connected to the same local area network, independent of their operating system or networking stack implementation. It is highly portable, configurable, extensible, and neither requires special hardware, nor modifications in routers or protected end systems. attacks cun be launched with little effort. Presently, it is difficult to trace an attack uack to its originator. Several possible solutions to this attack have been proposed by others, und some implemented. We have developed an active monitoring tool that classifies IP source addresses with high probability as being falsified or genuine. Our approach finds connection establishment protocol messages that are coming from forged IP addresses, and takes actions to ensure that the resulting illegitimate half-open connections arc reset immediately. This paper is organized as follows. Section 2 describes backgroWld material, such as the IP and TCP protocols. Section 3 explains the SYN flooding attack. Section 4 discusses existing approaches to solve this problem, such as configuration improvements and firewall-based approaches. The technical details of our approach are described in Section 5, followed by a performance evaluation in Section 6. Sections 7 and B outline future work issues and present conclusions.
Program slicing enhances a verification technique combining static and dynamic analysis

Recent research proposed efficient methods for software verification combining static and dynamic analysis, where static analysis reports possible runtime errors (some of which may be false alarms) and test generation confirms or rejects them. However, test generation may time out on real-sized programs before confirming some alarms as real bugs or rejecting some others as unreachable.
 To overcome this problem, we propose to reduce the source code by program slicing before test generation. This paper presents new optimized and adaptive usages of program slicing, provides underlying theoretical results and the algorithm these usages rely on. The method is implemented in a tool prototype called sante (Static ANalysis and TEsting). Our experiments show that our method with program slicing outperforms previous combinations of static and dynamic analysis. Moreover, simplifying the program makes it easier to analyze detected errors and remaining alarms.
A flexible pH sensing smart bandage with wireless CMOS readout for chronic wound monitoring

In this paper, we present a pH sensing bandage constructed with pH sensing smart threads for chronic wound monitoring. The bandage is integrated with custom CMOS readout electronics for wireless monitoring and data transmission and is capable of continuously monitoring wound pH. Threads exhibit pH sensitivity of 54mV/pH and reach their steady state value within 2 minutes.
Regenerative endodontic treatment of an immature tooth with a necrotic pulp and apical periodontitis using platelet-rich plasma (PRP) and mineral trioxide aggregate (MTA): a case report.

AIM
To report the successful clinical and radiographic outcome of a regenerative endodontic treatment.


SUMMARY
A 16-year-old male patient presented with a discoloured, maxillary left lateral incisor with a necrotic pulp. Radiographic examination revealed an incompletely developed root with an open apex. Under local anaesthesia and rubber dam isolation, an access cavity was prepared and the necrotic pulpal remnants were removed. The canal was disinfected without mechanical instrumentation with 5.25% NaOCl solution and dried with sterile paper points. A triple antibiotic (metronidazole, ciprofloxacin and minocycline) mixed with distilled water was packed in the canal and left for 28 days. Ten millimetres of whole blood was drawn by venipuncture from the patients antecubital vein for preparation of platelet-rich plasma (PRP). After removal of the antibiotic mixture, the PRP was injected into the canal space up to the cementoenamel junction level. Three millimetres of white MTA was placed directly over the PRP clot. Two days later, the tooth was restored with permanent filling materials. The patient was recalled for 3, 6, 12, 24 and 36 months clinical/radiographic follow-up. A 3-year follow-up radiograph revealed resolution of the periapical lesion, increased thickening of the root walls, further root development and continued apical closure of the root apex. The tooth was not responsive to cold tests; however, sensitivity tests with an electric pulp tester (EPT) elicited a delayed positive response.


KEY LEARNING POINTS
Regeneration is a viable treatment modality that allows continued root development of immature teeth with open apices and necrotic pulps. Platelet-rich plasma appears to be a suitable scaffold for regeneration of vital tissues in teeth with a necrotic pulps and an associated periapical lesion. Regenerative endodontic procedures may offer an effective treatment option to save teeth with compromised structural integrity.
MAD: a flexible system for authoring mathematical documents

MAD (Mathematical Abstract Document) is a document preparation system integrated with MAPLE. MAD provides a simplified model for describing a collection of logically structured documents with mathematical content. MAD also provides routines for manipulating the data structure that represents such documents and for exporting this data structure into standard formats, such as IbTEEX, PostScript, PDF and HTML. Integrating MAD into a computer algebra system such as MAPLE brings the following original features: 1) the automation of the computation and of the typesetting of mathematical formulae, graphs and tables; 2) the automation of the building of documents thanks to the underlying programming language. The system MAD was created in order to generate the interface of the Encyclopedia of Special Functions (ESF, h t t p : / / a 1 go . i n r i a . f r / e s f) [2]. The ESF is an automatically generated encyclopedia, where all mathematical formulae and graphs are computed by generic algorithms. The ESF can be compared up to some extent with the Abramowitz and Stegun's Handbook of Mathematical Functions [1] and the DLMF project 2. This kind of mathematical document sets the following requirements for it to be easily used: pretty display (human readable format) and semantics (machine understandable format) of the mathematical formulae, cross references for browsing and quoting, paper version in several formats. The system MAD is designed to automate the edition and the production of such mathematical documents.
Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model

Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) have emerged as a valuable tool for verifiable computation and privacy preserving protocols. Currently practical schemes require a common reference string (CRS) to be constructed in a one-time setup for each statement. Ben-Sasson, Chiesa, Green, Tromer and Virza [5] devised a multi-party protocol to securely compute such a CRS, and an adaptation of this protocol was used to construct the CRS for the Zcash cryptocurrency [7]. The scalability of these protocols is obstructed by the need for a “precommitment round” which forces participants to be defined in advance and requires them to secure their secret randomness throughout the duration of the protocol. Our primary contribution is a more scalable multi-party computation (MPC) protocol, secure in the random beacon model, which omits the precommitment round. We show that security holds even if an adversary has limited influence on the beacon. Next, we apply our main result to obtain a two-round protocol for computing an extended version of the CRS of Groth’s SNARK [11]. We show that knowledge soundness is maintained in the generic group model when using this CRS. We also contribute a more secure pairing-friendly elliptic curve construction and implementation, tuned for use in zk-SNARKs, in light of recent optimizations [13] to the Number Field Sieve algorithm which reduced the security estimates of existing pairing-friendly curves used in zk-SNARK applications.