Miracle-dz/UniFAR-FTUs huggingface dataset:
Knowledge Extraction from a Computational Consumer Model Based on Questionnaire Data Observed in Retail Service

In service industries, matching the level of demand of the consumer and the level of service of the provider is important because it requires the service provider to have knowledge of consumer-related factors. Therefore, an intelligent model of the consumer is needed to estimate such factors because they cannot be observed directly by the service provider. This paper describes a method for computational modeling of the consumer by understanding his or her behavior based on datasets observed in real services. The proposed method constructs a probabilistic structure model by integrating questionnaire data and a Bayesian network, which incorporates nonlinear and non-Gaussian variables as conditional probabilities. The proposed method is applied to an analysis of the requested function from customers regarding the continued use of an item of interest. The authors obtained useful knowledge for function design and marketing from the constructed model by a simulation and sensitivity analysis.
Value of Three-Dimensional Maximum Intensity Projection Display to Assist in Magnetic Resonance Imaging (MRI)-Based Grading in a Mouse Model of Subarachnoid Hemorrhage

Background Subarachnoid hemorrhage (SAH) is one of the most devastating cerebrovascular disorders. We report on the diagnostic value of three-dimensional (3-D) maximum intensity projection (MIP) reconstruction of T2*-weighted magnetic resonance images (MRI), processed using graphical user interface-based software, to aid in the accurate grading of endovascular-perforation-induced SAH in a mouse model. Material/Methods A total of 30 mice were subjected to SAH by endovascular perforation; three (10%) were scored as grade 0, six (20%) as grade 1, six (20%) as grade 2, eight (27%) as grade 3, and seven (23%) as grade 4 according to T2*-weighted coronal slices. In comparison, none of mice were scored as grade 0, eight (27%) as grade 1, five (17%) as grade 2, nine (30%) as grade 3, and eight (27%) as grade 4 based on subsequent evaluation using reconstructed 3-D MIP images. Results Mice scored as grade 0 (10%; no visible SAH) on T2*-coronal images were categorized as grades 1 (thin/localized SAH) and 3 (thick/diffuse SAH) according to 3-D MIP images. Grades based on T2* 3-D MIP images were more closely correlated with conventional SAH score (r2=0.59; P<0.0001) and neurological score (r2=0.25; P=0.005) than those based on T2*-coronal slices (r2=0.46; P<0.0001 for conventional score and r2=0.15; P=0.035 for neurological score). Conclusions These results suggest that 3-D MIP images generated from T2*-weighted MRI data may be useful for the simple and precise grading of SAH severity in mice to overcome the weakness of the current MRI-based SAH grading system.
Using OpenWordnet-PT for Question Answering on Legal Domain

In order to practice a legal profession in Brazil, law graduates must be approved in the OAB national unified bar exam. For their topic coverage and national reach, the OAB exams provide an excellent benchmark for the performance of legal information systems, as it provides objective metrics and are challenging even for humans, as only 20% of its candidates are approved. After constructing a new data set on the exams and doing shallow experiments on it, we now employ the OpenWordnet-PT to verify whether using word senses and relations we can improve previous results. We discuss the results, possible future ideas and the additions to the OpenWordnet-PT that we made.
Molecular characterisation and similarity relationships among iranian basil ( Ocimum basilicum L . ) accessions using inter simple sequence repeat markers 1 Caracterização molecular de acessos de Ocimum basilicum L . por meio de marcadores ISSR

The study of genetic relationships is a prerequisite for plant breeding activities as well as for conservation of genetic resources. In the present study, genetic diversity among 50 Iranian basil (Ocimum basilicum L.) accessions was determined using inter simple sequence repeat (ISSR) markers. Thirty-eight alleles were generated at 12 ISSR loci. The number of alleles per locus ranged from 1 to 5 with an average of 3.17. The maximum number of alleles was observed at the A7, 818, 825 and 849 loci, and their size ranged from 300 to 2500 bp. A similarity matrix based on Jaccard’s coefficient for all 50 basil accessions gave values from 1.00-0.60. The maximum similarity (1.00) was observed between the “Urmia” and “Shahr-e-Rey II” accessions as well as between the “Urmia” and “Qazvin II” accessions. The lowest similarity (0.60) was observed between the “Tuyserkan I” and “Gom II” accessions. The unweighted pairgroup method using arithmetique average UPGMA clustering algorithm classified the studied accessions into three distinct groups. All of the basil accessions, with the exception of “Babol III”, “Ahvaz II”, “Yazd II” and “Ardebil I”, were placed in groups I and II. Leaf colour was a specific characteristic that influenced the clustering of Iranian basil accessions. Because of this relationship, the results of the principal coordinate analysis (PCoA) approximately corresponded to those obtained through cluster analysis. Our results revealed that the geographical distribution of genotypes could not be used as a basis for crossing parents to obtain high heterosis, and therefore, it must be carried out by genetic studies.
Seamless and continuous user identification for interactive tabletops using personal device handshaking and body tracking

Touch-based tabletops are a form of embedded device for group collaboration. This work tackles two key problems for effective use of such tabletops: there is currently no easy way for people to identify themselves to the table; and most current hardware does not link a person's touches to their identity. This paper presents a system which tackles these problems as it can identify users and keeps track of their actions around interactive tabletops. To start the user identification, a user puts their personal device onto the interactive surface. Once this is paired with the tabletop, linking the device owner's identity to the table, the system continuously tracks any touch by that user. The system seamlessly and continuously associates each user touch with an identity.
The notion of variability in software architecture: results from a preliminary exploratory study

Context: In the software product line domain, the concept of variability is well recognized. However, variability in the context of software architecture still seems to be poorly understood. Objective: In this paper, we aim at contributing to the development of a basic understanding of the notion of variability in the software architecture domain, beyond the idea of product lines. Method: We perform a preliminary exploratory study which consists of two parts: an expert survey among 11 subjects, and a mini focus group with 4 participants. For both parts, we collect and analyze mostly qualitative data. Results: Our observations indicate that there seems to be no common understanding of "variability" in the context of software architecture. On the other hand, some challenges related to variability in software architecture are similar to challenges identified in the product line domain. Conclusions: Variability in software architecture might require more theoretical foundations in order to establish "variability" as an architectural key concept and first-class quality attribute.
Reducing traffic generated by conflict misses in caches

Off-chip memory accesses are a major source of power consumption in embedded processors. In order to reduce the amount of traffic between the processor and the off-chip memory as well as to hide the memory latency, nearly all embedded processors have a cache on the same die as the processor core. Because small caches dissipate less power and are cheaper than large caches, a small cache is preferable to a large cache. Furthermore, because set-associative caches consume more power than direct-mapped caches, a direct-mapped cache is preferable to a set-associative one. Small, direct-mapped caches generally incur many conflict misses, however. In this paper we propose and evaluate a structure called the Conflict Detection Table (CDT). This table can be used to determine if a memory access is expected to hit the cache. If a hit is expected and a miss occurs, then a conflict is detected and appropriate action can be taken. In addition, we propose two cache structures that employ this technique: the Bypass in Case of Conflict (BCC) cache and the Sub-block in Case of Conflict (SCC) cache. The BCC cache bypasses the cache when a conflict is detected, whereas the SCC cache fetches a sub-block of the missing cache block in such a case. Experimental results using several embedded workloads show that the BCC and SCC cache reduce the amount of traffic significantly in many cases. Furthermore, overall they incur the same number of cache misses as the direct-mapped cache. This shows that the BCC and SCC cache reduce the amount of power consumed with a negligible reduction in performance.
Cooperative output synchronization of networked systems in semi-strict feedback form

This paper considers the cooperative output synchronization of networked SISO nonlinear systems that can be transferred into semi-strict feedback form. Moreover, the dynamics of agents may possess parametric uncertainty, due to that,the agents in the network may have heterogeneous dynamics. Combined Backstepping method together with Graph Theory, a distributed adaptive controller is designed recursively for each agent to drive its output synchronized to its neighbors in the network. It is proved that under some topology condition that the graph is connected, all agents' outputs in the network can be synchronized, i.e., cooperative output synchronization is achieved. Be distinct from existing works which solve the problem by transmitting virtual agents' states through network, the information transmitted in our method are the actual agents' states and there is no virtual agent in our work, due to that, calculation burden on each agent is reduced. Simulation result verified the effectiveness of the proposed controller.
Effects of Eye Contact, Posture and Vocal Inflection upon Credibility and Comprehension.

In order to test whether constant eye contact, formal posture, and varied vocal inflection increase source credibility and listener comprehensiOn, 144 College students in an introductory speeck communication course were placed in groups of equal size that . listened to the same informative speech. The speaker presented to each group a different combination cf the independent variables, and, after the subjects were tested for their comprehension of the speech, they'rated the speaker's credibility. Analysis of the effects of the three independent Veriableh led to the following conclusions: Eye . contact seeps to enhance both listener comprehension and speaker credibility, though inconsistencies"between'eye contact and vocal inflection may lower the speaker's believability; the speaker's posture has little effect on either-cadibility or comprehension; varied or limited vocal lefiection has no-significant effect"dpon the speaker's credibility, except for the likability factor of credibility; and differences invocal inflection do not _affect listener comprehension. Tables of 'the analyzed data illustrate the text. (RL)* . ABSTRACT
Initiation of Epstein-Barr Virus Lytic Replication Requires Transcription and the Formation of a Stable RNA-DNA Hybrid Molecule at OriLyt

ABSTRACT The genetic elements of herpesvirus origins of lytic replication have been characterized in detail; however, much remains to be elucidated concerning their functional role in replication initiation. In the case of the Epstein-Barr virus (EBV), we have found that in addition to the two well-defined critical elements required for lytic replication (the upstream and downstream essential elements, UEE and DEE), the origin of lytic replication (OriLyt) also requires the presence of a GC-rich RNA in cis. The BHLF1 transcript is similar to the essential K5 transcript identified at the Kaposi's sarcoma-associated herpesvirus OriLyt. We have found that truncation of the BHLF1 transcript or deletion of the TATA box, but not the putative ATG initiation codon, reduce OriLyt function to background levels. By using an antibody specific for RNA-DNA hybrid molecules, we found the BHLF1 RNA stably annealed to its DNA template during the early steps of lytic reactivation. Furthermore, expression of human RNase H1, which degrades RNA in RNA-DNA hybrids, drastically reduces OriLyt-dependent DNA replication as well as recruitment of the viral single-stranded DNA binding protein BALF2 to OriLyt. These studies suggest that a GC-rich OriLyt transcript is an important component of gammaherpesvirus lytic origins and is required for initial strand separation and loading of core replication proteins.
Traumatic Optic Neuropathy: A Review of 61 Patients

The outcome of traumatic optic neuropathy was evaluated following penetrating and blunt injuries to assess the effect of treatment options, including high‐dose steroids, surgical intervention, and observation alone. Factors that affected improvement in visual acuity were identified and quantified. Sixty‐one consecutive, nonrandomized patients presenting with visual loss after facial trauma between 1984 and 1996 were assessed for outcome. Pretreatment and posttreatment visual acuities were compared using a standard ophthalmologic conversion from the values of no light perception, light perception, hand motion, finger counting, and 20/800 down to 20/15 to a logarithm of the minimum angle of resolution (log MAR). The percentage of patients showing visual improvement and the degree of improvement were calculated for each patient group and treatment method. Measurements of visual acuity are in log MAR units ± standard error of the mean. Patients who sustained penetrating facial trauma (n = 21) had worse outcomes than patients with blunt trauma (n = 40). Improvement in visual acuity after treatment was seen in 19 percent of patients with penetrating trauma compared with 45 percent of patients with blunt trauma (p < 0.05). Furthermore, patients with penetrating trauma improved less than those with blunt trauma, with a mean improvement of 0.4 ± 0.23 log MAR compared with 1.1 ± 0.24 in blunt‐trauma patients (p = 0.03). The patients with blunt trauma underwent further study. There was no significant difference in improvement of visual acuity in patients treated with surgical versus nonsurgical methods; however, 83 percent of patients without orbital fractures had improvement compared with 38 percent of patients with orbital fractures (p < 0.05). The mean improvement in patients without orbital fractures was 1.8 ± 0.65 log MAR compared with 0.95 ± 0.26 in patients with orbital fractures (p = 0.1). Twenty‐seven percent of patients who had no light perception on presentation experienced improvement in visual acuity after treatment compared with 100 percent of patients who had light perception on admission (p < 0.05). The mean improvement in patients who were initially without light perception was 0.85 ± 0.29 log MAR compared with 1.77 ± 0.35 in patients who had light perception (p < 0.05). There were no significant differences in improvement of visual acuity when analyzing the effect of patient age and timing of surgery. Patients who sustain penetrating trauma have a worse prognosis than those with blunt trauma. The presence of no light perception and an orbital fracture are poor prognostic factors in visual loss following blunt facial trauma. It seems that clinical judgment on indication and timing of surgery, and not absolute criteria, should be used in the management of traumatic optic neuropathy. (Plast. Reconstr. Surg. 107: 1655, 2001.)
Intelligence System for Diagnosis Level of Coronary Heart Disease with K-Star Algorithm

Objectives Coronary heart disease is the leading cause of death worldwide, and it is important to diagnose the level of the disease. Intelligence systems for diagnosis proved can be used to support diagnosis of the disease. Unfortunately, most of the data available between the level/type of coronary heart disease is unbalanced. As a result system performance is low. Methods This paper proposes an intelligence systems for the diagnosis of the level of coronary heart disease taking into account the problem of data imbalance. The first stage of this research was preprocessing, which included resampled non-stratified random sampling (R), the synthetic minority over-sampling technique (SMOTE), clean data out of range attribute (COR), and remove duplicate (RD). The second step was the sharing of data for training and testing using a k-fold cross-validation model and training multiclass classification by the K-star algorithm. The third step was performance evaluation. The proposed system was evaluated using the performance parameters of sensitivity, specificity, positive prediction value (PPV), negative prediction value (NPV), area under the curve (AUC) and F-measure. Results The results showed that the proposed system provides an average performance with sensitivity of 80.1%, specificity of 95%, PPV of 80.1%, NPV of 95%, AUC of 87.5%, and F-measure of 80.1%. Performance of the system without consideration of data imbalance provide showed sensitivity of 53.1%, specificity of 88,3%, PPV of 53.1%, NPV of 88.3%, AUC of 70.7%, and F-measure of 53.1%. Conclusions Based on these results it can be concluded that the proposed system is able to deliver good performance in the category of classification.
An Adaptable Framework for Ontology-based Content Creation on the Semantic Web

Creation of rich, ontology-based metadata is one of the major challenges in developing the Semantic Web. Emerging applications utilizing semantic web techniques, such as semantic portals, cannot be realized if there are no proper tools to provide metadata for them. This paper discusses how to make provision of metadata easier and cost-effective by an annotation framework comprising of annotation editor combined with shared ontology services. We have developed an annotation system Saha supporting distributed collaboration in creating annotations, and hiding the complexity of the annotation schema and the domain ontologies from the annotators. Saha adapts flexibly to different metadata schemas, which makes it suitable for different applications. Support for using ontologies is based on ontology services, such as concept searching and browsing, concept URI fetching, semantic autocompletion and linguistic concept extraction. The system is being tested in various practical semantic portal projects.
Algebrization: a new barrier in complexity theory

Any proof of P! =NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does not have linear-size circuits) that overcome both barriers simultaneously. So the question arises of whether there is a third barrier to progress on the central questions in complexity theory. In this paper we present such a barrier, which we call algebraic relativization or algebrization. The idea is that, when we relativize some complexity class inclusion, we should give the simulating machine access not only to an oracle A, but also to a low-degree extension of A over a finite field or ring. We systematically go through basic results and open problems in complexity theory to delineate the power of the new algebrization barrier. First, we show that all known non-relativizing results based on arithmetization -- both inclusions such as IP=PSPACE and MIP=NEXP, and separations such as MAEXP not in P/poly -- do indeed algebrize. Second, we show that almost all of the major open problems -- including P versus NP, P versus RP, and NEXP versus P/poly -- will require non-algebrizing techniques. In some cases algebrization seems to explain exactly why progress stopped where it did: for example, why we have superlinear circuit lower bounds for PromiseMA but not for NP. Our second set of results follows from lower bounds in a new model of algebraic query complexity, which we introduce in this paper and which is interesting in its own right. Some of our lower bounds use direct combinatorial and algebraic arguments, while others stem from a surprising connection between our model and communication complexity. Using this connection, we are also able to give an MA-protocol for the Inner Product function with O(sqrt(n) log n) communication (essentially matching a lower bound of Klauck).
Automated discrimination of lower and higher grade gliomas based on histopathological image analysis

Introduction: Histopathological images have rich structural information, are multi-channel in nature and contain meaningful pathological information at various scales. Sophisticated image analysis tools that can automatically extract discriminative information from the histopathology image slides for diagnosis remain an area of significant research activity. In this work, we focus on automated brain cancer grading, specifically glioma grading. Grading of a glioma is a highly important problem in pathology and is largely done manually by medical experts based on an examination of pathology slides (images). To complement the efforts of clinicians engaged in brain cancer diagnosis, we develop novel image processing algorithms and systems to automatically grade glioma tumor into two categories: Low-grade glioma (LGG) and high-grade glioma (HGG) which represent a more advanced stage of the disease. Results: We propose novel image processing algorithms based on spatial domain analysis for glioma tumor grading that will complement the clinical interpretation of the tissue. The image processing techniques are developed in close collaboration with medical experts to mimic the visual cues that a clinician looks for in judging of the grade of the disease. Specifically, two algorithmic techniques are developed: (1) A cell segmentation and cell-count profile creation for identification of Pseudopalisading Necrosis, and (2) a customized operation of spatial and morphological filters to accurately identify microvascular proliferation (MVP). In both techniques, a hierarchical decision is made via a decision tree mechanism. If either Pseudopalisading Necrosis or MVP is found present in any part of the histopathology slide, the whole slide is identified as HGG, which is consistent with World Health Organization guidelines. Experimental results on the Cancer Genome Atlas database are presented in the form of: (1) Successful detection rates of pseudopalisading necrosis and MVP regions, (2) overall classification accuracy into LGG and HGG categories, and (3) receiver operating characteristic curves which can facilitate a desirable trade-off between HGG detection and false-alarm rates. Conclusion: The proposed method demonstrates fairly high accuracy and compares favorably against best-known alternatives such as the state-of-the-art WND-CHARM feature set provided by NIH combined with powerful support vector machine classifier. Our results reveal that the proposed method can be beneficial to a clinician in effectively separating histopathology slides into LGG and HGG categories, particularly where the analysis of a large number of slides is needed. Our work also reveals that MVP regions are much harder to detect than Pseudopalisading Necrosis and increasing accuracy of automated image processing for MVP detection emerges as a significant future research direction.