Miracle-dz/UniFAR-FTUs huggingface dataset:
Knowledge Management For Enterprise Systems: A Review Of The Literature

Enterprise Resource Planning (ERP) systems, also called Enterprise Systems (ES), have received much attention from researchers and practitioners. Along with that many researches have underlined the pivotal role of knowledge management for enterprise system success. This research in progress paper explores articles published in 8 journals during recent 11 years for knowledge management instances across ES lifecycle and categorizes these processes according to each phase of ES and knowledge management lifecycle. Subsequently presents the further analysis about gaps in the research area and under-studied fields which warrant future research.
A Graph-Based Program Representation for Analyzing Hardware Specialization Approaches

Hardware specialization has emerged as a promising paradigm for future microprocessors. Unfortunately, it is natural to develop and evaluate such architectures within end-to-end vertical silos spanning application, language/ compiler, hardware design and evaluation tools, leaving little opportunity for cross-architecture analysis and innovation. This paper develops a novel program representation suitable for modeling heterogeneous architectures with specialized hardware, called the transformable dependence graph (TDG), which combines semantic information about program properties and low-level hardware events in a single representation. We demonstrate, using four example architectures from the literature, that the TDG is a feasible, simple, and accurate modeling technique for transparent specialization architectures, enabling cross-domain comparison and design-space exploration.
Semantic Concept-Based Query Expansion and Re-ranking for Multimedia Retrieval

We study the problem of semantic concept-based query expansion and re-ranking for multimedia retrieval. In particular, we explore the utility of a fixed lexicon of visual semantic concepts for automatic multimedia retrieval and re-ranking purposes. In this paper, we propose several new approaches for query expansion, in which textual keywords, visual examples, or initial retrieval results are analyzed to identify the most relevant visual concepts for the given query. These concepts are then used to generate additional query results and/or to re-rank an existing set of results. We develop both lexical and statistical approaches for text query expansion, as well as content-based approaches for visual query expansion. In addition, we study several other recently proposed methods for concept-based query expansion. In total, we compare 7 different approaches for expanding queries with visual semantic concepts. They are evaluated using a large video corpus and 39 concept detectors from the TRECVID2006 video retrieval benchmark. We observe consistent improvement over the baselines for all 7 approaches, leading to an overall performance gain of 78% relative to a text retrieval baseline, and a 31% improvement relative to a stateof-the-art multimodal retrieval baseline. To the best of our knowledge, this is the most comprehensive review and evaluation of concept-based retrieval and re-ranking methods so far, and it clearly establishes the value of semantic concept detectors for answering and expanding ad-hoc user queries.
Design, analysis, and interpretation of higher tier risk assessment of chemicals in aquatic microcosms

The objective of this state of the art review was to quantify the replicability of pesticide studies using micro/ mesocosms. Low interpretability of micro/mesocosm studies, and inconclusive and highly variable data, resulted in a discontinuation of the use of these studies for the registration of pesticides. Coefficients of variation, CV%, were calculated on the basis of data tables as a measure of statistical 'effectiveness' taken from the literature. The average CV in the investigated studies was 45%; larger out-door mesocosms averaged 51%, and smaller indoor micro/mesocosms averaged 32%. CVs on variables involving animals were higher than CVs on plant end-points, which in turn were higher than abiotic variables for all experiments. However, to enhance the interpretability and implementation of micro/mesocosm studies for pesticide registration, a number of context-dependent steps could be incorporated; 1) determine the appropriate experimental design and number of replicates by using power analysis, 2) Utilise advanced statistical analysis, such as probabilistic effect distribution and principal response curves, 4) report, preferably in quantitative terms using power analysis, the risk of Type II error. The author's primary conclusion is that the level of CVs is context dependent and, therefore, it is not possible to suggest a generally acceptable level of CVs for all experiments. This has been suggested both directly and indirectly in the literature. Moreover, the number of insignificant (p >0.05) results is high, 88% of all test biotic variables had no statistical significance. The average number of replicates were 3–4, which theoretically should yield significant effects at least at the highest test-concentration, then resulting in 75–66% insignificant results.
A perceptually tuned subband image coder based on the measure of just-noticeable-distortion profile

To represent an image of high perceptual quality with the lowest possible bit rate, an effective image compression algorithm should not only remove the redundancy due to statistical correlation but also the perceptually insignificant components from image signals. In this paper, a perceptually tuned subband image coding scheme is presented, where a just-noticeable distortion (JND) or minimally noticeable distortion (MND) profile is employed to quantify the perceptual redundancy. The JND profile provides each signal being coded with a visibility threshold of distortion, below which reconstruction errors are rendered imperceptible. Based on a perceptual model that incorporates the threshold sensitivities due to background luminance and texture masking effect, the JND profile is estimated from analyzing local properties of image signals. According to the sensitivity of human visual perception to spatial frequencies, the full-band JND/MND profile is decomposed into component JND/MND profiles of different frequency subbands. With these component profiles, perceptually insignificant signals in each subband can be screened out, and significant signals can be properly encoded to meet the visibility threshold. A new quantitative fidelity measure, termed as peak signal-to-perceptible-noise ratio (PSPNR), is proposed to assess the quality of the compressed image by taking the perceptible part of the distortion into account. Simulation results show that near-transparent image coding can be achieved at less than 0.4 b/pixel. As compared to the ISO-JPEG standard, the proposed algorithm can remove more perceptual redundancy from the original image, and the visual quality of the reconstructed image is much more acceptable at low bit rates.
Multiple Routing Configurations for Datacenter Disaster Recovery Applicability and Challenges

Cloud services based on data center networks are becoming very important. Data centers host computing and storage resources, and these resources are served to customers through a network of data centers. Protecting such a network from disasters like earthquakes, hurricanes and terrorist attacks is crucial. In this paper, we propose the use of multiple routing configurations (MRC) IP fast reroute recovery process for data center disaster recovery. A demonstration of how this recovery scheme can be applied is shown. Also, we discuss the impact of the MRC recovery process on the post failure load distribution over network links and how this impact can be minimized. We propose a manual technique to minimize the impact of MRC and compare it to an automatic technique called modified MRC. Both the advantages and disadvantages of the two techniques are outlined. We conclude that a newer technique is needed that overcome the above mentioned disadvantages. The new technique should not manipulate link weights to achieve good load distribution. Our proposed new technique will implement unequal weight load balance inside open shortest path first (OSPF) and it is used with MRC. The new technique achieves good load distribution while overcoming all disadvantages.
Einige Europapolitische Überlegungen Zur Weiterentwicklung Der Dateninfrastruktur Für Die Sozial - Und Wirtschaftswissenschaften

Ziel der Expertise ist es, Wege aufzeigen, wie den Anliegen der wissenschaftlichen Nutzern von Wirtschafts- und Sozialdaten auf europaischer Ebene besser Rechnung getragen werden kann, ohne dass dadurch die legitimen und prioritaren Anspruche der europaischen Politik vernachlassigt werden mussen.
A semantic characterisation of the correctness of a proof net

The purpose of this note is to show that the correctness of a multiplicative proof net with mix is equivalent to its semantic correctness: a proof structure is a proof net if and only if its semantic interpretation is a clique, where one given nite coherence space interprets all propositional variables. This is just an example of what can be done with these kinds of semantic techniques; for more information and further results, the reader is referred to (Retor e, 1994). 1. Presentation and warning This note demonstrates the use of coherence semantics | more precisely, of the so-called experiment method of (Girard, 1987) | for the analysis of proof structures and proof nets. We limit our study to the cut-free, constant-free multiplicative fragment of linear logic enriched with the mix rule. This allows our note to be self contained, but we must warn the reader that the dee-nition we give are adapted to the particular case under consideration, and consequently, would be incomplete in the general setting. Regarding the formal deenition of a proof structure or net, it is just a question of precision, but regarding the semantics of a proof structure, one must be aware that in the non-cut-free case, the set of all the results of the experiments has to be restricted to the set of the results of the succeeding experiments. For simplicity we will speak about "proof structures (or nets)" instead of "constant-free and cut-free multiplicative proof structure (or net) with mix" and of "experiments" instead of "succeedings experiments" | as the two notions agree in this restricted case. We give here a semantic, but nevertheless algorithmic criterion for a proof structure to be a proof net. Notice that this result nevertheless apply to non-cut-free proofs, since, as far as correctness is concerned, a cut between A and A ? may be viewed as a tensor rule or link with premises A and A ? and conclusion AA ? In (Retor e, 1994) we extended these methods in two directions. Firstly, dealing directly with non-cut-free proof structures allows a semantic characterisation of another interesting property of proof structures or proof expressions which is called deadlock freeness in (Lafont, 1990) and acyclicity in (Abramsky, 1993). Secondly, we extended the character-isations of correctness and deadlock freeness to the pomset calculus of (Retor e, 1993b;
Universität Des Saarlandes Fachrichtung 6.1 – Mathematik Frobenius Actions on the De Rham Cohomology of Drinfeld Modules Frobenius Actions on the De Rham Cohomology of Drinfeld Modules

We study the action of endomorphisms of a Drinfeld A-module φ on its de Rham cohomology H DR (φ, L) and related modules, in the case where φ is defined over a field L of finite A-characteristic p. Among others, we find that the nilspace H 0 of the total Frobenius F r DR on H DR (φ, L) has dimension h = height of φ. We define and study a pairing between the p-torsion p φ of φ and H DR (φ, L), which becomes perfect after dividing out H 0 .
Design of novel hexagonal s-band patches antenna array for RFID applications

The design and study of the behavior of antennas adapted to radio-frequency identification RFID tags take on all their importance because they must respond to integration problems and therefore the need to design a structure with minimal dimensions, without however deteriorating their performance. The rise in frequency makes it possible to have short wavelengths so that it becomes possible to have a great integrationas as well as very fast bit rate. But, this induces a smaller range due to the propagation losses according to the model of Friis. In this article, a new patch antenna array for microwave frequency band in radio-frequency identification RFID applications will be presented. The antenna covers the band for the central frequency of 2.45 GHz with better loss characteristics. In addition, the antenna offers a high gain at this frequency. After the digital design of the antenna element, which was carried out using the commercial software CST MWS®, the antenna is printed on an FR4 substrate with a dielectric constant of 4.3 and a thickness of 1.6 mm. The comparison between the simulation results and the measurement results proves that the antenna achieves satisfactory impedance matching and radiation efficiency.
Finding “It”: Weakly-Supervised Reference-Aware Visual Grounding in Instructional Video

Graph and Video Visualization. Please refer to our oral presentation video for examples, including a walkthrough of a full visually-grounded action graph on a video describing how to prepare a spaghetti and meatballs dish. Error Analysis. In the main paper, we included negative examples where incorrectly inferred reference edges negatively impacted the grounding performance relative to when no reference is incorporated. In Figure A1, we include additional visualizations of other classes of errors, such as those inherent to the weak supervision method from our work (based on multiple instance learning). We observe that scene clutter, number of co-occuring entities, and size of the entities can affect model performance. This is a common limitation arising from the multiple instance learning objective, since the only supervision that is provided during training is based on the transcription-video alignment (i.e. grounding in the same segment is encouraged). Notably, such errors are not specific to entities that add mustard, butter to potatoes Serve [∅] with fried chips (a) (b)
The Computer Revolution: An Economic Perspective

From the Publisher: This book provides a straightforward guide to the economic issues behind the debates about the role of computers in the nation's economy. To set the stage, Daniel Sichel reviews the essential facts about computers in the economy, with a particular emphasis on software. Using quantitative and historical analysis, supplemented by interviews with business leaders and other professionals, Sichel assesses the aggregate economic impact of computers in recent decades and looks ahead to their future impact. When compared with the size of the slowdown in productivity growth in the 1970s, he finds that recent contributions of computers to growth seem relatively modest. And, looking ahead, Sichel suggests it is doubtful that these contributions will surge in coming years. Thus, despite the importance of information technology, some caution is in order; computers may not be a magic bullet for productivity growth.
Smoothing parameter as shape parameter of function approximating the average course of terrain surface subsidence

In this article have been presented the approximation results of average course of mining area subsidence measured at observational line and caused by hard coal exploitation, which was conducted by some hard coal mine in Poland. An approximation has been done with the use of smoothed spline function with value change of smoothing parameter of approximating function. The right value of smoothing parameter has been chosen by the use of least squares method, what means the minimization of differences sum between the measured terrain subsidence and their average values.
Establishing the Genuinity of Remote Computer Systems

A fundamental problem in distributed computing environments involves determining whether a remote computer system can be trusted to autonomously access secure resources via a network. In this paper, we describe a means by which a remote computer system can be challenged to demonstrate that it is genuine and trustworthy. Upon passing a test, it can be granted access to distributed resources and can serve as a general-purpose host for distributed computation so long as it remains in contact with some certifying authority. The test we describe is applicable to consumer-grade computer systems with a conventional network interface and requires no additional hardware. The results of the test can be conveyed over an unsecured network; no trusted human intermediary is needed to relay the results. We examine potential attacks and weaknesses of the system and show how they can be avoided. Finally, we describe an implementation of a genuinity test for a representative set of computer systems.
dbCRAF: a curated knowledgebase for regulation of radiation response in human cancer

Abstract Radiation therapy (RT) is one of the primary treatment modalities of cancer, with 40–60% of cancer patients benefiting from RT during their treatment course. The intrinsic radiosensitivity or acquired radioresistance of tumor cells would affect the response to RT and clinical outcomes in patients. Thus, mining the regulatory mechanisms in tumor radiosensitivity or radioresistance that have been verified by biological experiments and computational analysis methods will enhance the overall understanding of RT. Here, we describe a comprehensive database dbCRAF (http://dbCRAF.xialab.info/) to document and annotate the factors (1,677 genes, 49 proteins and 612 radiosensitizers) linked with radiation response, including radiosensitivity, radioresistance in cancer cells and prognosis in cancer patients receiving RT. On the one hand, dbCRAF enables researchers to directly access knowledge for regulation of radiation response in human cancer buried in the vast literature. On the other hand, dbCRAF provides four flexible modules to analyze and visualize the functional relationship between these factors and clinical outcome, KEGG pathway and target genes. In conclusion, dbCRAF serves as a valuable resource for elucidating the regulatory mechanisms of radiation response in human cancers as well as for the improvement of RT options.
Treatment of Post-stroke Dysphagia With Interferential Current: Three Case Reports and a Review of the Literature

Stroke is damage to the central nervous system due to vascular pathology. Stroke causes many complications. One of the most important of these complications is dysphagia. Dysphagia is a major cause of morbidity and mortality. In recent years, the benefits of using interferential current (IFC) stimulation in the treatment of dysphagia due to various etiologies have been demonstrated. However, there are significant gaps in the literature regarding patient populations, treatment procedures, and evaluation of treatment response. Here, we report the treatment of three cases of dysphagia after ischemic stroke with IFC stimulation and review the current literature. The patients had no previous treatment for dysphagia and were using only compensatory methods. This case report highlights the benefit of IFC stimulation in the treatment of post-stroke dysphagia both clinically and videofluoroscopically. It should be kept in mind that IFC stimulation may be an important alternative in the treatment of post-stroke dysphagia.
Exotic and native plants play equally important roles in supporting and structuring plant-hummingbird networks within urban green spaces

Background Urban gardens, despite their transformed nature, serve as invaluable microcosms for a quantitative examination of floral resource provision to urban pollinators, considering the plant’s origin. Thus, knowledge has increased, emphasizing the importance of these green areas for hosting and conserving pollinator communities. However, there is a significant knowledge gap concerning the changing availability of these native and exotic floral resources over time and their impact on structuring interaction networks with specific pollinators. Methods Over a year-long period, monthly surveys were conducted to record both native and exotic plant species visited by hummingbirds in an urban garden at Tlaxcala, Mexico. Flower visits were recorded, and the total flowers on each plant visited were tallied. Additionally, all observed hummingbirds were recorded during the transect walks, regardless of plant visits, to determine hummingbird abundance. The interactions were summarized using matrices, and network descriptors like connectance, specializacion, nestedness, and modularity were computed. Plant and hummingbird species in the core and periphery of the network were also identified. Lastly, simulations were performed to assess the network’s resilience to the extinction of highly connected native and exotic plant species, including those previously situated in the network’s core. Results We recorded 4,674 interactions between 28 plant species, and eight hummingbird species. The majority of plants showed an ornithophilic syndrome, with 20 species considered exotic. Despite asynchronous flowering, there was overlap observed across different plant species throughout the year. Exotic plants like Jacaranda mimosifolia and Nicotiana glauca produced more flowers annually than native species. The abundance of hummingbirds varied throughout the study, with Saucerottia berillyna being the most abundant species. The plant-hummingbird network displayed high connectance, indicating generalization in their interaction. Significant nestedness was observed, mainly influenced by exotic plant species. The core of the network was enriched with exotic plants, while Basilinna leucotis and Cynanthus latirostris played central roles among hummingbirds. Network resilience to species extinction remained generally high. Conclusions Our findings provide valuable insights into the dynamics and structure of plant-hummingbird interactions in urban gardens, emphasizing the influence of exotic plant species and the network’s resilience to perturbations. Understanding and managing the impact of exotic plants on such networks is crucial for the conservation and sustainable functioning of urban ecosystems.
Science of Computer Programming

Redundancy concepts are major design drivers in fault-tolerant space systems. It can be a diﬃcult task to decide when to activate which redundancy, and which component should be replaced. In this paper, we reﬁne a methodology where recovery strategies are synthesized from a model of non-deterministic dynamic fault trees. The synthesis is performed by transforming non-deterministic dynamic fault trees into Markov automata that represent all possible choices between recovery actions. From the corresponding scheduler, optimized for maximum expected long-term reachability of failure states, a recovery strategy, optimal with respect to mean time to failure, can then be derived and represented by a model we call recovery automaton. We discuss techniques for reducing the state space of this recovery automaton, and analyze their soundness and completeness. We show that they do not generally guarantee recovery automata with the minimal number of states and derive a class where this guarantee holds. Implementation details for our approach are given and its effectiveness is veriﬁed on the basis of three case studies. © 2020 Published by Elsevier B.V.