Miracle-dz/UniFAR-FTUs huggingface dataset:
Classification and Grading Rice Using Multi-Class SVM

This paper proposes machine algorithm to grade (Premium, Grade A, Grade B and Grade C) the rice kernels using Multi-Class SVM. Maximum Variance method was applied to extract the rice kernels from background, then, after the chalk has been extracted from rice. The percentage of Head rice, broken rice and Brewers in rice samples were determined using ten geometric features. Multi-Class SVM classified the rice kernel by examining the Shape, Chalkiness and Percentage of Broken (Head Rice, Broken and Brewers) kernels. The SVM classify accurately more than 86% . Based on the results, it was concluded that the system was enough to use for classifying and grading the different varieties of rice grains based on their interior and exterior quality.
Tabled Evaluation with Delaying for General Logic Programs

The semantics of predicate logic as a programming language. Every logic program has a natural stratiication and an iterated least xed point model. Magic sets and bottom-up evaluation of well-founded models. Query restricted bottom-up evaluation of normal logic programs. Completeness of a top-down query evaluation procedure for stratiied databases. 42 LPM(PP(S j) J)(B) for some j < i and for every B A 2 HB Prog , M(B A) = LPM(PP(S j) J)(B A) for some j < i such that A is a subgoal of S j. By inductive hypothesis, every S j (j < i) is a symmetric system and so every LPM(PP(S j) J) is a symmetric interpretation. Thus M is well deened and is also a symmetric interpretation. Furthermore it can be veriied that M = LPM(PProg J). The program P(S i) can be obtained by deleting rules from Prog. Sometimes a deleted rule is replaced by another rule, but there is no innnite chain of the replacement relationship. Let (A :) be an arbitrary pair in S i. Let G A 1 and G A 2 be arbitrary rules in Prog, where for some ordinals k 1 and k 2 , G 1 is the X-rule of a subgoal A corresponding to k 1 and G 2 is the X-rule of a subgoal A corresponding to k 2 in S i. G A 1 is said to be a parent of G A 2 , denoted by G A 1 > G A 2 , if (k 2) = G 2 hk 1 i or (k 2) = G 2 hk 1 ; Hi for some atom H. There is no innnite descending chain of the relation > since G 2 has either fewer literals that are not delayed or fewer literals that are delayed. The number of literals in G 1 and G 2 is bounded by the maximum number of literals in a rule body in a nite program P. Every rule in Prog that is not in P(S i) corresponds to an X-rule of a subgoal that is disposed when S j+1 is derived from S j for some j + 1 < i. By inductive hypothesis, LPM(PP(S j+1)
The Electrophysiological Properties of Spontaneously Beating Pacemaker Cells Isolated from Mouse Sinoatrial Node

In order to examine the phenotypic consequences of genetic manipulation in the function of the sinoatrial (SA) node, it is a prerequisite to record the electrical activities of a single pacemaker cell of the SA node of mouse heart. In the present study, we isolated spontaneously beating pacemaker cells from the SA node by enzymatic digestion. The rate of spontaneous action potential firing was 294 ± 59 min−1 at 33–34 °C. The maximal diastolic potential (MDP) was −56.7 ± 7.4 mV and the overshoot was 22.7 ± 6.2 mV. With hyperpolarizing voltage clamp pulses, the hyperpolarization‐activated, cyclic nucleotide‐sensitive cation current (Ih or If) was recorded. Ih started to activate at −70 to ≈−80 mV, more negative than MDP. The half‐maximal activation of Ih was obtained at −107.9 ± 10.4 mV. The inward‐rectifier K+ current (IK1) was also recorded in spontaneously beating myocytes. However, the amplitude of outward IK1 was negligibly small (9.1 ± 3.4 pA at −60 mV). With depolarization, voltage‐gated Na+ current, L‐type Ca2+ current and T‐type Ca2+ current were consistently observed. The sustained inward current (Ist) was also recorded in spontaneously beating pacemaker cells. E4031‐sensitive, rapidly activating delayed rectifier K+ current (IKr) was activated by depolarization, although the amplitude was no more than 38.3 ± 22.2 pA at 0 mV. The chromanol 293B‐sensitive, slowly activating delayed rectifier K+ current (IKs) was not present. The major repolarizing current was the slowly inactivating, 4‐aminopyridine‐insensitive outward current. We concluded that mouse pacemaker cells possess similar membrane currents, including Ist, to those of other species.
Efficient 3 D Macromolecular Reconstruction with Electron Cryomicroscopy

Introduction Discovering the 3D atomic structure of molecules such as proteins and viruses is a fundamental research problem in biology and medicine. The ability to routinely determine the 3D structure of such molecules would potentially revolutionize the process of drug development and accelerate research on fundamental biological processes. Electron Cryomicroscopy (Cryo-EM) is a visionbased approach to 3D macromolecular structure determination which works with medium to large-sized molecules in their native state. The Cryo-EM reconstruction task is to estimate the 3D density of a target molecule from a large set of images of the molecule (called particle images). The problem is similar in spirit to multi-view scene carving [2, 7], large-scale, uncalibrated multi-view reconstruction [1] and computed tomography (CT) [6, 4] which uses a similar imaging model (orthographic integral projection). However in CT the projection direction of each image is known whereas with single particle Cryo-EM this is unknown. Existing Cryo-EM techniques, e.g., [5, 12], can be extremely slow and require good initialization to converge to good solutions. We introduce a framework for CryoEM density estimation, formulating the problem as one of stochastic optimization to perform maximum-a-posteriori (MAP) estimation in a probabilistic model. The approach is efficient and insensitive to initialization, providing useful low resolution density estimates in an hour on a single workstation. To demonstrate our method, we perform reconstructions on two real datasets.
CRITERIA FOR RDMs FOUND IN THE LITERATURE

In this chapter we will define the design criteria for a requirements determination method (RDM). When studying the literature on criteria for requirements specification (methods) we have found a number of criteria that have been derived for software and requirements determination methods (Hevner and Mills, 1995). The former references differ to a large extent in the level of detail and granularity of the criteria that are given. A number of authors make a distinction into criteria for the product (i.e. the requirements specification) and the criteria for the process (i.e. the requirements determination technique or procedure) (Moody and Shanks, 1995; Khwaja and Urban, 2002). In section 2.1 we will list a number of criteria for software requirements specifications, information system development methodologies and requirements determination methods as found in the literature. In this chapter we will ask ourselves the following question: What are according to the existing requirements determination literature, the quality criteria for a requirements determination method that can be used for eliciting, verifying and specifying the complete domain requirements for a given business application subject area in a wide range of business organizations, in an efficient and formal way ? In table 2.1 we have given the criteria for software requirements specification, information system development methodologies and requirements determination methods as found in our literature survey.
Indoor Positioning with Radio Location Fingerprinting

An increasingly important requirement for many novel applications is sensing the positions of people, equipment, etc. GPS technology has proven itself as a successfull technology for positioning in outdoor environments but indoor no technology has yet gained a similar wide-scale adoption. A promising indoor positioning technique is radio-based location fingerprinting, having the major advantage of exploiting already existing radio infrastructures, like IEEE 802.11, which avoids extra deployment costs and effort. The research goal of this thesis is to address the limitations of current indoor location fingerprinting systems. In particular the aim is to advance location fingerprinting techniques for the challenges of handling heterogeneous clients, scalability to many clients, and interference between communication and positioning. The wireless clients used for location fingerprinting are heterogeneous even when only considering clients for the same technology. Heterogeneity is a challenge for location fingerprinting because it severely decreases the precision of location fingerprinting. To support many clients location fingerprinting has to address how to scale estimate calculation, measurement distribution, and distribution of position estimates. This is a challenge because of the number of calculations involved and the frequency of measurements and position updates. Positioning using location fingerprinting requires the measurement of, for instance, signal strength for nearby base stations. However, many wireless communication technologies block communication while collecting such measurements. This interference is a challenge because it is not desirable that positioning disables communication. An additional goal is to improve the conceptual foundation of location fingerprinting. A better foundation will aid researchers to better survey and design location fingerprinting systems.
Electronic Communications of the EASST Volume 37 ( 2011 ) Workshops der wissenschaftlichen Konferenz Kommunikation in V erteilten Systemen 2011 ( WowKiVS 2011 ) Towards Swarm-based Federated Web Knowledgebases

Internet knowledgebases are more and more described using ontological vocabularies. However, efficient coherent solutions for both federated storage and reasoning upon widely distributed web repositories are rarely explored. We present a self-organized, distributed storage and reasoning approach based on swarm intelligence exploiting the strong applicability of swarm algorithms to distributed environments. While centralized reasoning has problems in scalability, swarm intelligence has the potential to reach Web scalability. Our concept comprises two layers of swarm algorithms storage and reasoning layer for information storage and inference of new statements, respectively. We present for the former our concepts with first evaluation results and give for the latter a general swarm-based concept for forward-chaining assertional reasoning in the description logic A L C .
Relevance distributions across Bradford Zones: Can Bradfordizing improve search?

The purpose of this paper is to describe the evaluation of the effectiveness of the bibliometric technique Bradfordizing in an information retrieval (IR) scenario. Bradfordizing is used to re-rank topical document sets from conventional abstracting & indexing (A&I) databases into core and more peripheral document zones. Bradfordized lists of journal articles and monographs will be tested in a controlled scenario consisting of different A&I databases from social and political sciences, economics, psychology and medical science, 164 standardized IR topics and intellectual assessments of the listed documents. Does Bradfordizing improve the ratio of relevant documents in the first third (core) compared to the second and last third (zone 2 and zone 3, respectively)? The IR tests show that relevance distributions after re-ranking improve at a significant level if documents in the core are compared with documents in the succeeding zones. After Bradfordizing of document pools, the core has a significant better average precision than zone 2, zone 3 and baseline. This paper should be seen as an argument in favour of alternative non-textual (bibliometric) re-ranking methods which can be simply applied in text-based retrieval systems and in particular in A&I databases.
Herpes Simplex Virus in Febrile Neutropenic Children Undergoing Chemotherapy for Cancer: A Prospective Cohort Study

Background: The primary objective of this study was to determine the prevalence of oral herpes simplex virus (HSV) as detected by polymerase chain reaction, in pediatric oncology patients with febrile neutropenia. Our secondary objectives were to describe the association between oral HSV and prolonged fever, neutropenia, mucositis, and response to initial antimicrobial therapy. Methods: In this prospective cohort study, we obtained a mouth swab and blood specimen from oncology patients with febrile neutropenia, and tested them for HSV by polymerase chain reaction. Prolonged fever was defined as the presence of fever 48 hours after initiation of broad-spectrum antibiotic therapy. Results: Of the 75 oral and blood specimens obtained, only 7 oral swabs (9%) and 2 blood samples (3%) were positive for HSV. Oral HSV was not associated with prolonged fever or neutropenia. However, oral HSV was associated with longer median duration of mucositis (8 days; interquartile range, 0–12 days) compared with negative episodes (0 days; interquartile range, 0–2.5 days); P = 0.005. Oral HSV also was associated with inferior successful response to initial antimicrobial therapy (1 of 7, 14.3%) compared with negative episodes (51 of 67, 76.1%); P = 0.002. Conclusions: The prevalence of HSV infection in pediatric oncology patients with febrile neutropenia was low and was not associated with prolonged fever. However, oral HSV was associated with prolonged mucositis and poorer response to initial therapy. It is unknown whether early intervention with acyclovir can alter these associations.
Filtering Insertions into a Small Instruction Cache in Embedded Processors

In this paper, we propose and discuss a novel technique which can filter cache insertions to avoid 'slashing' on small size caches. The proposed filter technique add control bits to each cache block which is based on the number of references on each memory block which can be obtained by preliminary execution. When the miss handling, exploiting the control bits, busy-status of cache sets can be detected. Using this mechanism, the proposed mechanism can dynamically detect whether or not the cache set is busy, and can obstruct inserting memory blocks to busy cache set. By this effect, the proposed mechanism can make it possible to alleviate drastic performance degradation by executing large program binary in small size caches.
Privacy Preserving Data Mining Techniques: Current Scenario and Future Prospects

Privacy preserving has originated as an important concern with reference to the success of the data mining. Privacy preserving data mining (PPDM) deals with protecting the privacy of individual data or sensitive knowledge without sacrificing the utility of the data. People have become well aware of the privacy intrusions on their personal data and are very reluctant to share their sensitive information. This may lead to the inadvertent results of the data mining. Within the constraints of privacy, several methods have been proposed but still this branch of research is in its infancy. The success of privacy preserving data mining algorithms is measured in terms of its performance, data utility, level of uncertainty or resistance to data mining algorithms etc. However no privacy preserving algorithm exists that outperforms all others on all possible criteria. Rather, an algorithm may perform better than another on one specific criterion. So, the aim of this paper is to present current scenario of privacy preserving data mining tools and techniques and propose some future research directions.
Convolutional Virtual Electric Field for Image Segmentation Using Active Contours

Gradient vector flow (GVF) is an effective external force for active contours; however, it suffers from heavy computation load. The virtual electric field (VEF) model, which can be implemented in real time using fast Fourier transform (FFT), has been proposed later as a remedy for the GVF model. In this work, we present an extension of the VEF model, which is referred to as CONvolutional Virtual Electric Field, CONVEF for short. This proposed CONVEF model takes the VEF model as a convolution operation and employs a modified distance in the convolution kernel. The CONVEF model is also closely related to the vector field convolution (VFC) model. Compared with the GVF, VEF and VFC models, the CONVEF model possesses not only some desirable properties of these models, such as enlarged capture range, u-shape concavity convergence, subject contour convergence and initialization insensitivity, but also some other interesting properties such as G-shape concavity convergence, neighboring objects separation, and noise suppression and simultaneously weak edge preserving. Meanwhile, the CONVEF model can also be implemented in real-time by using FFT. Experimental results illustrate these advantages of the CONVEF model on both synthetic and natural images.
Peptide libraries: Determination of relative reaction rates of protected amino acids in competitive couplings

In the solid phase preparation of synthetic peptide libraries, equimolarity of the resultant peptides in the mixture simplifies the identification of active compounds. Two primary methods for the preparation of combinatorial peptide mixtures are currently used. In the first method, the starting resin is divided into equal aliquots, individual amino acids are coupled to each aliquot, and the resin is then recombined. This process is repeated for each position. However, due to the physical process, each resin bead contains only one peptide sequence. Statistically, for mixtures of longer sequences, an ever‐increasing amount of resin is necessary to ensure complete representation of each peptide in the library. Thus, each peptide will be represented in the library if a sufficient number of resin beads are used. In addition, the concentration of each peptide in the library depends on both the number of mixture positions in the library and the amount of resin used. In the second method, mixtures of amino acids are coupled simultaneously at each addition step. The proportion of each amino acid in the reaction mixture is varied inversely to its reaction rate such that, ideally, an equimolar mixture of each peptide is synthesized. An advantage of this method over the previous method is that each peptide is ensured to be represented in the library, although not necessarily in equimolar amounts. It is known that not only do the coupling rates of each amino acid vary, but the coupling rates of individual amino acids also change when coupled to different amino acid resins. Consequently, in order to obtain equimolar peptide mixtures through the use of mixtures of protected amino acids, the ratio of reaction rates of one amino acid over another must be constant irrespective of the resin‐bound amino acid. If this premise is true, this method of synthesis offers a significant advantage over the previous method since, theoretically, equimolar peptide libraries could be synthesized. The influence of the resin‐bound amino acid on the relative reaction rates of incoming amino acids was investigated in the current study. © 1994 John Wiley & Sons, Inc.
Inflammatory markers and extent and progression of early atherosclerosis: Meta-analysis of individual-participant-data from 20 prospective studies of the PROG-IMT collaboration

Background Large-scale epidemiological evidence on the role of inflammation in early atherosclerosis, assessed by carotid ultrasound, is lacking. We aimed to quantify cross-sectional and longitudinal associations of inflammatory markers with common-carotid-artery intima-media thickness (CCA-IMT) in the general population. Methods Information on high-sensitivity C-reactive protein, fibrinogen, leucocyte count and CCA-IMT was available in 20 prospective cohort studies of the PROG-IMT collaboration involving 49,097 participants free of pre-existing cardiovascular disease. Estimates of associations were calculated within each study and then combined using random-effects meta-analyses. Results Mean baseline CCA-IMT amounted to 0.74 mm (SD = 0.18) and mean CCA-IMT progression over a mean of 3.9 years to 0.011 mm/year (SD = 0.039). Cross-sectional analyses showed positive linear associations between inflammatory markers and baseline CCA-IMT. After adjustment for traditional cardiovascular risk factors, mean differences in baseline CCA-IMT per one-SD higher inflammatory marker were: 0.0082 mm for high-sensitivity C-reactive protein (p < 0.001); 0.0072 mm for fibrinogen (p < 0.001); and 0.0025 mm for leucocyte count (p = 0.033). ‘Inflammatory load’, defined as the number of elevated inflammatory markers (i.e. in upper two quintiles), showed a positive linear association with baseline CCA-IMT (p < 0.001). Longitudinal associations of baseline inflammatory markers and changes therein with CCA-IMT progression were null or at most weak. Participants with the highest ‘inflammatory load’ had a greater CCA-IMT progression (p = 0.015). Conclusion Inflammation was independently associated with CCA-IMT cross-sectionally. The lack of clear associations with CCA-IMT progression may be explained by imprecision in its assessment within a limited time period. Our findings for ‘inflammatory load’ suggest important combined effects of the three inflammatory markers on early atherosclerosis.
Thrombosis Increases Circulatory Hepatocyte Growth Factor by Degranulation of Mast Cells

Background—Plasma concentrations of hepatocyte growth factor (HGF), a powerful angiogenic growth factor inducible by heparin, increase in thrombus-associated disorders such as myocardial infarction and unstable angina. The mechanism of this thrombus-associated HGF release, however, is unknown. Methods and Results—Wistar rats received through the tail vein (1) normal saline (NS), (2) 50 &mgr;g of the mast cell–degranulating agent CP48/80, or (3) 1000 U/kg heparin. Blood samples were collected at 10 minutes or 30 minutes after the injections, or from untreated rats, for measurements of HGF. The same experiments were performed in mast cell–deficient white spotting (Ws) rats. Ws rats have a small deletion of the c-kit gene and are deficient in mast cells. Intravenous heparin immediately increased plasma HGF in both Wistar (38.02±2.08 ng/mL versus 1.11±0.70 ng/mL in untreated rats, P <0.0001) and Ws rats (36.39±4.15 ng/mL versus 0.66±0.18 ng/mL in NS-treated rats, P <0.0001). Injection of CP48/80 also increased plasma HGF in Wistar rats (9.12±1.11 ng/mL versus 0.65±0.24 ng/mL in NS group, P =0.004) but not in Ws rats (0.67±0.27 ng/mL versus 0.66±0.18 ng/mL in NS group, P =0.997). In a rat carotid artery microthrombus model, intra-arterial thrombus formation increased circulating HGF in Wistar rats (2.12±0.70 ng/mL versus sham 0.61±0.15 ng/mL in sham-operated Wistar rats, P =0.0064) but not in Ws rats (0.76±0.33 ng/mL versus 0.21±0.04 ng/mL in sham-operated Ws rats, P =0.29). In addition, in vitro stimulation of rat peritoneal mast cells with thrombin rapidly induced degranulation in a dose-dependent manner. Conclusions—These observations indicate that mast cell degranulation stimulated by thrombin is necessary for the rapid induction of plasma HGF in intravascular thrombus-associated disorders.
Modeling Community Influence in Social Networks with Markov Chains

Social network analysis has been one of the research focuses with the developing of social media services. Social influence also attracts ever-increasing attention and interests from both the sociology and the data mining scholars, but the research of influence is mainly limited in the user level, the community level influence is rarely involved. In this paper, we develop a novel model to analyze and evaluate the community level influence and help the decision maker to comprehend the disparity in influence of different communities. This paper also proposes a simple heuristic node-selection strategy considering the community influence to spread influence, and the experiments of the spread of influence through the social network datasets prove the rationality of the proposed community influence analysis model.