Miracle-dz/UniFAR-FTUs huggingface dataset:
Ductal carcinoma in situ diagnosed using an ultrasound-guided 14-gauge core needle biopsy of breast masses: can underestimation be predicted preoperatively?

Purpose: This study was designed to determine the rate of ductal carcinoma in situ (DCIS)underestimation diagnosed after an ultrasound-guided 14-gauge core needle biopsy (US-14G-CNB) of breast masses and to compare the clinical and imaging characteristics between trueDCIS and underestimated DCIS identified following surgical excision. Methods: Among 3,124 US-14G-CNBs performed for breast masses, 69 lesions in 60 patients were pathologically-determined to be pure DCIS. We classified these patients according to the final pathology after surgical excision as those with invasive ductal carcinoma (underestimated group) and those with DCIS (non-underestimated group). We retrospectively reviewed and compared the clinical and imaging characteristics between the two groups. Results: Of the 69 lesions, 21 were shown after surgery to be invasive carcinomas; the rateof DCIS underestimation was 30.4%. There were no statistically significant differences withrespect to the clinical symptoms, age, lesion size, mammographic findings, and ultrasonographic findings except for the presence of abnormal axillary lymph nodes as detected on ultrasound. The lesions in 2 patients in the non-underestimated group (2/41, 4.9%) and 5 patients in the underestimated group (5/19, 26.3%) were associated with abnormal lymph nodes on axillary ultrasound, and the presence of abnormal axillary lymph nodes on ultrasound was tatistically significant (P=0.016). Conclusion: We found a 30.4% rate of DCIS underestimation in breast masses based on a US-14G-CNB. The presence of abnormal lymph nodes as detected on axillary ultrasound may be useful to preoperatively predict underestimation.
A Secure Network Admission and Routing Model Based on Trust Theory

This paper presents a trust-based model for secure network admission and trustworthy routing. Firstly, a dynamic routing trust model based on trust relationship and routing behaviors is brought forward. The model not only supports trust network connection, but also gives a comprehensive assessment to the network security and efficiency affected by router access according to routers' interactive behaviors. Secondly, the trust degree between any two routers can be notified to all by a dependable flooding algorithm. Finally, a new routing strategy called by "minimal trust routing entropy" is proposed, which is good at avoiding nodes with low trust while taking into account the routing efficiency. This model can be used for the next-generation connection-oriented Internet which is controllable and trustworthy.
Convergence Results of Combining Synchronism and Asynchronism for Discrete-State Discrete-Time Dynamic Network

This article proves a convergence result in discrete-state discrete-time networks combining synchronism and asynchronism conjectured in [1]. The interest of that combination in terms of global convergence times is emphasized. The purpose is illustrated with a representative non obvious running example. A direct application of the approach is given in the field of neural networks. Key-words: Discrete dynamical systems, Asynchronous iterations, Pure parallel iterations, Discrete Jacobian matrix, Connection graph, Stability Laboratoire d’Informatique de l’Université de Franche-Comté, Antenne de Belfort — IUT Belfort-Montbéliard, rue Engel Gros, BP 527, 90016 Belfort Cedex (France) Téléphone : +33 (0)3 84 58 77 86 — Télécopie : +33 (0)3 84 58 77 32 Résultats de convergence pour la combinaison d’iterations synchrones et asynchrones de Systèmes Dynamiques Discrets Résumé : Ce travail donne une preuve de convergence d’un système dynamique discret itéré selon un mode combinant synchronisme et asynchronisme. Il complète un travail précédent [1] où cette propriété était conjecturée. L’intéret d’une telle combinaison en terme de temps d’exécution est mis en avant. Le propos est illustré à l’aide d’un exemple non trivial représentatif de la classe de systèmes étudiés. Une application directe au réseaux de neuronnes est aussi donnée dans ce travail. Mots-clés : systèmes dynamiques discrets, iterations (a)synchrones, matrice jacobienne discrète, graphe de connexion, convergence Laboratoire d’Informatique de l’Université de Franche-Comté, Antenne de Belfort — IUT Belfort-Montbéliard, rue Engel Gros, BP 527, 90016 Belfort Cedex (France) Téléphone : +33 (0)3 84 58 77 86 — Télécopie : +33 (0)3 84 58 77 32 8 J. Bahi S. Contassot-Vivier J.-F. Couchot Convergence Results of Combining Synchronism and Asynchronism for Discrete-State Discrete-Time Dynamic Network J. M. Bahi, S. Contassot-Vivier, J.-F. Couchot
Supplementary Screening Sonography in Mammographically Dense Breast: Pros and Cons

Sonography is an attractive supplement to mammography in breast cancer screening because it is relatively inexpensive, requires no contrast-medium injection, is well tolerated by patients, and is widely available for equipment as compared with MRI. Sonography has been especially valuable for women with mammographically dense breast because it has consistently been able to detect a substantial number of cancers at an early stage. Despite these findings, breast sonography has known limitations as a screening tool; operator-dependence, the shortage of skilled operators, the inability to detect microcalcifications, and substantially higher false-positive rates than mammography. Further study of screening sonography is still ongoing and is expected to help establish the role of screening sonography.
Tracking control for mobile robots with uncertain parameters based on Model Reference Adaptive Control

The paper presents a Model Reference Adaptive Control algorithm for mobile robots with parameter uncertainties and unstructured dynamics to guarantee that a robot can track to desired trajectory asymptotically and avoid jerky. The controller has been designed in two consecutive parts; one is a nonlinear kinematic controller and the other is the model reference adaptive controller using the feedback signal from the mobile robot's actuator. The simulation results show the efficiency and the application ability of the proposed controller.
Statistics-Driven Localization of Dissimilarities in Data

The identification of dissimilar regions in spatial and temporal data is a fundamental part of data exploration. This process takes place in applications, such as biomedical image processing as well as climatic data analysis. We propose a general solution for this task by employing well-founded statistical tools. From a large set of candidate regions, we derive an empirical distribution of the data and perform statistical hypothesis testing to obtain p-values as measures of dissimilarity. Having p-values, we quantify differences and rank regions on a global scale according to their dissimilarity to user-specified exemplar regions. We demonstrate our approach and its generality with two application scenarios, namely interactive exploration of climatic data and segmentation editing in the medical domain. In both cases our data exploration protocol unifies the interactive data analysis, guiding the user towards regions with the most relevant dissimilarity characteristics. The dissimilarity analysis results are conveyed with a radial tree, which prevents the user from searching exhaustively through all the data.
Executable denotations for concurrent languages using Concurrent Transaction Logic

Department of Computer Science,Ryerson UniversityM5B 2K3, Toronto, Canadap: (+1) 416.979. 500 x 7062; f: (+1) 416.979. 5064m3santos@ryerson.caAbstract. This paper presents an approach based on a Horn fragment of Concurrent Transaction Logic(CTR) for semantic description and execution of programming languages. The Horn notation is usedin much the same way that plain Horn logic is used to specify semantics of programming languages.However, CTRextends that framework a deductive database language which provides a declara-tive, logic programming framework that naturally accommodates the notions of store, store updates,dataﬂow in declarative languages, data-driven concurrency, and message passing concurrency. Thecontributions of this paper are twofold: it shows how the semantics of concurrent programming lan-guages can be fully speciﬁed in a Horn-based logic framework; and it demonstrates that CTR-basedlogical denotations provide a uniﬁed formal semantics for such languag es, which can also serve as aprototyping tool for the language developer.
Dynamic transmit-power control for WiFi access points based on wireless link occupancy

Dynamic transmit-power control (DTPC) is critical to improve spectral efficiency and reduce interference in wireless local area networks (WLANs). DTPC schemes typically use signal-to-noise-ratio (SNR) information and require exchange of information between transmitters and receivers. However, that is not always easy to implement in actual WLAN deployments. In this paper, we present a simple but novel DTPC scheme for 802.11n Access Points (AP). The method, which is run by each AP without exchanging signaling information with other APs and associated Stations (STA), seeks for transmitting with the minimum power provided that the link is not overloaded. In lieu of using the SNR at the receiver side, the power is adapted based on the wireless link occupancy (rate load). As a result, no signaling exchange between stations and the AP is required. Reducing the transmit-power reduces both co-channel and adjacent channel interference and, hence, entails benefits for all nearby WLANs. The DTPC scheme was tested in a simulator and implemented in an actual 802.11n deployment, which confirmed the theoretical benefits.
Ethanol extract of Angelica gigas inhibits croton oil-induced inflammation by suppressing the cyclooxygenase - prostaglandin pathway

The anti-inflammatory effects of an ethanol extract of Angelica gigas (EAG) were investigated in vitro and in vivo using croton oil-induced inflammation models. Croton oil (20 µg/mL) up-regulated mRNA expression of cyclooxygenase (COX)-I and COX-II in the macrophage cell line, RAW 264.7, resulting in the release of high concentrations of prostaglandin E2 (PGE2). EAG (1~10 µg/mL) markedly suppressed croton oil-induced COX-II mRNA expression and PGE2 production. Application of croton oil (5% in acetone) to mouse ears caused severe local erythema, edema and vascular leakage, which were significantly attenuated by oral pre-treatment with EAG (50~500 mg/kg). Croton oil dramatically increased blood levels of interleukin (IL)-6 and PGE2 without affecting tumor-necrosis factor (TNF)-α and nitric oxide (NO) levels. EAG pre-treatment remarkably lowered IL-6 and PGE2, but did not alter TNF-α or NO concentrations. These results indicate that EAG attenuates inflammatory responses in part by blocking the COX-PGE2 pathway. Therefore, EAG could be a promising candidate for the treatment of inflammatory diseases.
Stability adaptive routing algorithm in high-density networks

The development of wireless technology enabled mobile networking at any time, anyplace. In the not too remote future, many everyday objects such as portable devices and appliances will be equipped with small wireless network interfaces and tied to digital networks. Utilizing such nodes and vast number of networked sensors scattered in every place will provide unprecedented flexible services. We call this kind of network high-density networks. In high-density networks, an ad-hoc routing protocol is a key technology because it is essential to send and receive data packets among all nodes. We present SARAH (Stable Adaptive Routing in Ad-hoc Networks of Heterogeneous Nodes), which is a routing protocol for high-density networks. SARAH can cope with node diversity and can provide stable connection between nodes. The performance of SARAH in terms of stable route construction is shown by computer simulation.
Distinguishing roles of the membrane-cytoskeleton and cadherin mediated cell-cell adhesion in generating different Na+,K(+)-ATPase distributions in polarized epithelia

In simple epithelia, the distribution of ion transporting proteins between the apical or basal-lateral domains of the plasma membrane is important for determining directions of vectorial ion transport across the epithelium. In the choroid plexus, Na+,K(+)-ATPase is localized to the apical plasma membrane domain where it regulates sodium secretion and production of cerebrospinal fluid; in contrast, Na+,K(+)-ATPase is localized to the basal-lateral membrane of cells in the kidney nephron where it regulates ion and solute reabsorption. The mechanisms involved in restricting Na+,K(+)-ATPase distribution to different membrane domains in these simple epithelia are poorly understood. Previous studies have indicated a role for E-cadherin mediated cell-cell adhesion and membrane-cytoskeleton (ankyrin and fodrin) assembly in regulating Na+,K(+)-ATPase distribution in absorptive kidney epithelial cells. Confocal immunofluorescence microscopy reveals that in chicken and rat choroid plexus epithelium, fodrin, and ankyrin colocalize with Na+,K(+)-ATPase at the apical plasma membrane, but fodrin, ankyrin, and adducin also localize at the lateral plasma membrane where Na+,K(+)- ATPase is absent. Biochemical analysis shows that fodrin, ankyrin, and Na+,K(+)-ATPase are relatively resistant to extraction from cells in buffers containing Triton X-100. The fractions of Na+,K(+)-ATPase, fodrin, and ankyrin that are extracted from cells cosediment in sucrose gradients at approximately 10.5 S. Further separation of the 10.5 S peak of proteins by electrophoresis in nondenaturing polyacrylamide gels revealed that fodrin, ankyrin, and Na+,K(+)-ATPase comigrate, indicating that these proteins are in a high molecular weight complex similar to that found previously in kidney epithelial cells. In contrast, the anion exchanger (AE2), a marker protein of the basal- lateral plasma membrane in the choroid plexus, did not cosediment in sucrose gradients or comigrate in nondenaturing polyacrylamide gels with the complex of Na+,K(+)-ATPase, ankyrin, and fodrin. Ca(++)- dependent cell adhesion molecules (cadherins) were detected at lateral membranes of the choroid plexus epithelium and colocalized with a distinct fraction of ankyrin, fodrin, and adducin. Cadherins did not colocalize with Na+,K(+)-ATPase and were absent from the apical membrane. The fraction of cadherins that was extracted with buffers containing Triton X-100 cosedimented with ankyrin and fodrin in sucrose gradients and comigrated in nondenaturing gels with ankyrin and fodrin in a high molecular weight complex. Since a previous study showed that E-cadherin is an instructive inducer of Na+,K(+)-ATPase distribution, we examined protein distributions in fibroblasts transfected with B- cadherin, a prominent cadherin expressed in the choroid plexus epithelium. (ABSTRACT TRUNCATED AT 400 WORDS)
Enabling Automatic Certification of Online Auctions

We consider the problem of building up trust in a network of online auctions by software agents. This requires agents to have a deeper understanding of auction mechanisms and be able to verify desirable properties of a given mechanism. We have shown how these mechanisms can be formalised as semantic web services in OWL-S, a good enough expressive machine-readable formalism enabling software agents, to discover, invoke, and execute a web service. We have also used abstract interpretation to translate the auction's specifications from OWL-S, based on description logic, to COQ, based on typed lambda calculus, in order to enable automatic verification of desirable properties of the auction by the software agents. For this language translation, we have discussed the syntactic transformation as well as the semantics connections between both concrete and abstract domains. This work contributes to the implementation of the vision of agent-mediated e-commerce systems.
Designing a New Model for the Relationship between Individual features and Brain Gamma Waves from advertising Images

This study mainly attempted to design a new model for the relationship between Individual features and brain gamma waves from advertising images. The demographic characteristics of the subjects were identified through Edinburgh’s Lateral Preference Scale, Scott and Bruce’s General Decision-Making Style Inventory and Gray-Wilson Personality Questionnaire (GWPQ). The brain gamma waves were recorded by quantitative electroencephalography (QEEG). This research involved laboratory testing in terms of methodology, where a total of 72 subjects were selected through random sampling from among students at Payame-Noor- University of Qom. The average age of the selected samples was 24 years, including 48 females and 24 males. There were four sets of advertising images containing pasta and cracker in round and pointy shapes in warm colors (orange) as well as cold colors (gray and blue). The model was designed through the Partial Least Squares (PLS) technique. The results demonstrated that age and gamma waves from round images (warm and cold) were in a significantly positive relationship. Fight, a personality trait, was in a significantly negative relationship with both warm and cold gamma waves from round images, and also from pointy and cold images. Avoidance, a component of decision-making styles, had a significantly positive relationship with gamma waves from round images. Other components of personality traits, decision-making styles, lateral preference and gender had no significant relationship with gamma waves from image sets. Also the high gamma waves, only gender had a significantly positive relationship with pointy and round image sets.
Does Money Granger Cause Inflation in the Euro Area

In this paper we re-evaluate the empirical evidence on money-inflation Granger causality for the euro area and, in contrast to Trecroci and Vega (2000), conclude that money does in fact Granger cause inflation. We also show that it takes about a year and a half for changes in money growth to start passing on to inflation and five years for the whole adjustment to take place
Community detection in temporal multilayer networks, and its application to correlation networks

Networks are a convenient way to represent complex systems of interacting entities. Many networks contain"communities"of nodes that are more densely connected to each other than to nodes in the rest of the network. In this paper, we investigate the detection of communities in temporal networks represented as multilayer networks. As a focal example, we study time-dependent financial-asset correlation networks. We first argue that the use of the"modularity"quality function---which is defined by comparing edge weights in an observed network to expected edge weights in a"null network"---is application-dependent. We differentiate between"null networks"and"null models"in our discussion of modularity maximization, and we highlight that the same null network can correspond to different null models. We then investigate a multilayer modularity-maximization problem to identify communities in temporal networks. Our multilayer analysis only depends on the form of the maximization problem and not on the specific quality function that one chooses. We introduce a diagnostic to measure \emph{persistence} of community structure in a multilayer network partition. We prove several results that describe how the multilayer maximization problem measures a trade-off between static community structure within layers and higher values of persistence across layers. We also discuss some implementation issues that the popular"Louvain"heuristic faces with temporal multilayer networks and suggest ways to mitigate them.
Scalable RDF query processing on clusters and supercomputers

The proliferation of RDF data on the web has increased the need for systems that can query these data while scaling with their growing size and number. We present an application of parallel hash-joins for basic graph pattern matching over large amounts of RDF designed for shared nothing architectures including high-performance clusters and the Blue Gene/L. Our approach does not require any pre-processing of the RDF data or costly index building. Rather, we rely on a cluster’s high bandwidth and fast memory to load and query data in parallel and in near-real time. We present an initial evaluation of our algorithm showing competitive results on clusters of up to 1,024 processors.
Marginal maximum likelihood estimation of single parameter logistic based on EM algorithm

Cluster analysis is one of the most important functions of data mining. Expectation Maximization (EM) method is an important technology based on model clustering method. The expectation maximization algorithm is analyzed in this research and applied to Adaptive Testing System, in which logistic function in item response theory serves as a model, and the combination of methods of marginal maximum likelihood estimation (MMLE) and the EM algorithm are used to estimate the difficulty parameter estimation of single-parameter logistic function. This effort achieves good results.
Optimal resource allocation with node and link capacity constraints in complex networks

With the tremendous increase of the Internet traffic, achieving the best performance with limited resources is becoming an extremely urgent problem. In order to address this concern, in this paper, we build an optimization problem which aims to maximize the total utility of traffic flows with the capacity constraint of nodes and links in the network. Based on Duality Theory, we propose an iterative algorithm which adjusts the rates of traffic flows and capacity of nodes and links simultaneously to maximize the total utility. Simulation results show that our algorithm performs better than the NUP algorithm on BA and ER network models, which has shown to get the best performance so far. Since our research combines the topology information with capacity constraint, it may give some insights for resource allocation in real communication networks.
A new efficient EDA tool design methodology

New sophisticated EDA tools and methodologies will be needed to make products viable in the future marketplace by simplifying the various design stages. These tools will permit system design at a high abstraction level and enable automatic refinement through several abstraction levels to obtain a final prototype. They will have to be based on representations that are clean, complete, and easy to manipulate. In order to develop these new EDA tools, key features such as standardization, metadata programming, reflectivity, and introspection are needed. This work proposes a . Net Framework-based methodology, which possesses all these required key features. This methodology simplifies specification, synthesis, and validation of systems and enables the efficient creation/customization of EDA tools at low cost and development time. We show the effectiveness of this methodology by presenting its application for the design of a new EDA tool called ESys . Net (Embedded System design with .Net). We emphasize the specification and simulation aspects of this tool.