Miracle-dz/UniFAR-FTUs huggingface dataset:
Motion Retrieval Using Probability Graph Model

In this paper, we propose a content-based motion retrieval algorithm. In this work, firstly, each motion is represented by a set of sequence frames. Representative frames are first selected from the motions and the corresponding weights are provided. Secondly, the graph model is built with these selected frames. For searching the optimal measurement between query motion and relevant motions in database, an object function is built. The task to find the maximal a posterior (MAP) in the motion level is equivalent to find the minimal objective function value. At last, based on probability calculation, the KM (Kuhn-Munkres) algorithm is used to find the optimal matching between motions. The matching result is used to measure the similarity between two motions. Experimental results and comparison with existing methods show the effectiveness of the proposed algorithm.
Immunization with mutant HPV16 E7 protein inhibits the growth of TC-1 cells in tumor-bearing mice

Two human papillomavirus (HPV) 16 oncogenic proteins, E6 and E7, are co-expressed in the majority of HPV16-induced cervical cancer cells. Thus, the E6 and E7 proteins are good targets for developing therapeutic vaccines for cervical cancer. In the present study, immunization with the mutant non-transforming HPV16 E7 (mE7) protein was demonstrated to inhibit the growth of TC-1 cells in the TC-1 mouse model. The HPV16 mE7 gene was amplified by splicing overlap extension polymerase chain reaction using pET-28a(+)-E7 as a template, and the gene was cloned into pET-28a(+) to form pET-28a(+)-mE7. Compared with the E7 protein, mE7 lacks amino acid residues 94–98, and at residue 24, there is a Cys to Gly substitution. pET-28a(+)-mE7 was then introduced into Escherichia coli Rosetta. The expression of mE7 was induced by isopropyl β-D-1-thiogalactopyranoside. The mE7 protein was purified using Ni-NTA agarose and detected by SDS-PAGE and western blot analysis. In the tumor prevention model, no tumor was detected in the mice vaccinated with the mE7 protein. After 40 days, the tumor-free mice and control mice were challenged with 2×105 TC-1 cells. All control mice developed tumors six days later, but mE7 immunized mice were tumor free until 90 days. In the tumor therapy model, the TC-1 cells were initially injected subcutaneously, and the mice were subsequently vaccinated. Vaccination against the mE7 protein may significantly inhibit TC-1 cell growth compared to the control. These results demonstrated that immunization with the HPV16 mE7 protein elicited a long-term protective immunity against TC-1 tumor growth and generated a significant inhibition of TC-1 growth in a TC-1 mouse model.
Data re-archival in IT application retirement scenario a case study

The prolific expansion of business operations globally, multi-channel operations and many such newer paradigms are driving voluminous growth for many businesses. This is resulting in tremendous data volume growth within supporting IT systems. Increased need for fact driven decision making and regulatory compliance requirements needs is driving the need for retention and storage of historical data for longer duration. Historical data being referred occasionally does not warrant storage using expensive database systems unlike transactional data. Information Lifecycle Management (ILM) is an emerging discipline within Information Technology that addresses this problem. Data Archival is a concept within ILM used to retain necessary data for reference by live applications, while preserving historical data. The challenges faced during the execution of a Data Archival project by a Fortune 500 organization, the methodology formulated and implemented to work-around the challenges are described in this case.
Labelfaces: Parsing facial features by multiclass labeling with an epitome prior

We consider the problem of parsing facial features from an image labeling perspective. We learn a per-pixel unary classifier, and a prior over expected label configurations, allowing us to estimate a dense labeling of facial images by part (e.g. hair, mouth, moustache, hat). This approach deals naturally with large variations in shape and appearance characteristic of unconstrained facial images, and also the problem of detecting classes that may be present or absent. We use an Adaboost-based unary classifier, and develop a family of priors based on ‘epitomes’ which are shown to be particularly effective in capturing the non-stationary aspects of face label distributions.
Inverse problem for an inhomogeneous Schrödinger equation

Let (l−k2)u=−u″+q(x)u−k2u=δ(x), x∈R, ∂u/∂|x|−iku→0, |x|→∞. Assume that the potential q(x) is real valued and compactly supported: q(x)=q(x)¯, q(x)=0 for |x|⩾1, ∫−11|q|dx 0 be the data. It is shown that under the above assumptions these data determine q(x) uniquely.
LIQUIDITY EFFECTS WITH LONG LIVED PRODUCTION PROJECTS

This paper explores the effects of monetary shocks on the allocation of factors of production. We analyze these effects when money plays a role in improving the timing of the transactions undertaken by entrepreneurs. Such improvement is facilitated by money? important role in providing liquidity to entrepreneurs. Using a model in which production processes take time to mature and where credit contracts are not enforceable, we show the consequences of monetary shocks for the allocation of resources and the real business cycle. Our analysis reveals that such shocks disrupt the allocation of resources with important effects on total factor productivity.
Accuracy and Cut-Off Values of Pepsinogens I, II and Gastrin 17 for Diagnosis of Gastric Fundic Atrophy: Influence of Gastritis

Background To establish optimal cutoff values for serologic diagnosis of fundic atrophy in a high-risk area for oesophageal squamous cell carcinoma and gastric cancer with high prevalence of Helicobacter pylori (H. pylori) in Northern Iran, we performed an endoscopy-room-based validation study. Methods We measured serum pepsinogens I (PGI) and II (PGII), gastrin 17 (G-17), and antibodies against whole H. pylori, or cytotoxin-associated gene A (CagA) antigen among 309 consecutive patients in two major endoscopy clinics in northeastern Iran. Updated Sydney System was used as histology gold standard. Areas under curves (AUCs), optimal cutoff and predictive values were calculated for serum biomarkers against the histology. Results 309 persons were recruited (mean age: 63.5 years old, 59.5% female). 84.5% were H. pylori positive and 77.5% were CagA positive. 21 fundic atrophy and 101 nonatrophic pangastritis were diagnosed. The best cutoff values in fundic atrophy assessment were calculated at PGI<56 µg/l (sensitivity: 61.9%, specificity: 94.8%) and PGI/PGII ratio<5 (sensitivity: 75.0%, specificity: 91.0%). A serum G-17<2.6 pmol/l or G-17>40 pmol/l was 81% sensitive and 73.3% specific for diagnosing fundic atrophy. At cutoff concentration of 11.8 µg/l, PGII showed 84.2% sensitivity and 45.4% specificity to distinguish nonatrophic pangastritis. Exclusion of nonatrophic pangastritis enhanced diagnostic ability of PGI/PGII ratio (from AUC = 0.66 to 0.90) but did not affect AUC of PGI. After restricting study samples to those with PGII<11.8, the sensitivity of using PGI<56 to define fundic atrophy increased to 83.3% (95%CI 51.6–97.9) and its specificity decreased to 88.8% (95%CI 80.8–94.3). Conclusions Among endoscopy clinic patients, PGII is a sensitive marker for extension of nonatrophic gastritis toward the corpus. PGI is a stable biomarker in assessment of fundic atrophy and has similar accuracy to PGI/PGII ratio among populations with prevalent nonatrophic pangastritis.
Saturated simple topological graphs János Pach

A simple topological graph G is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. G is called saturated if no further edge can be added without violating this condition. We construct saturated simple topological graphs with n vertices and O(n) edges. These constructions are nearly optimal: it is shown that every saturated simple topological graph with n vertices has at least cn edges for some constant c ≥ 1.5. Several related problems are also considered.
System model of production inventory control

The primary consequence of just-in-time (JIT) production is reduction of inventory with associated financial benefits. However, existing methods cannot adequately explain the causality that leads to failed (or successful) JIT implementations. This paper describes a fresh theoretical approach to examining the larger organisational factors in which inventory control systems are embedded. A structured descriptive system model for production inventory control is described, including base stock, CONWIP, kanban and hybrid systems. The model was then interrogated to produce lists of tentative critical success factors for implementation of these strategies in JIT and lean production, and propose explanations as to why it succeeds or fails.
An ILP for the metro-line crossing problem

In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in G (e.g. the train lines), we want to draw the paths along the edges of G such that they cross each other as few times as possible. For aesthetic reasons we insist that the relative order of the paths that traverse a vertex does not change within the area occupied by the vertex. We prove that the problem, which is known to be NP-hard, can be rewritten as an integer linear program that finds the optimal solution for the problem. In the case when the order of the endpoints of the paths is fixed we prove that the problem can be solved in polynomial time. This improves a recent result by Bekos et al. (2007).
Swipe Right: An Exploration of Self-Presentation and Impression Management on Tinder

The emergence of Location-Based-Real-Time-Dating (LBRTD) apps such as Tinder, has introduced a new way for users to get to know potential partners nearby. The design of the app represents a departure from "oldschool" dating sites as it leaves plenty of space for pictures, but only minimal room for self-description. This might change the way individuals decide to portray themselves as their real, ideal or ought-to self. Based on empirical data collected in the Netherlands, we try to assess how Tinder users present themselves, exploring at the same time the impact of their personality and their motives of use.
Vibrio cholerae Strain Typing and Phylogeny Study Based on Simple Sequence Repeats

ABSTRACT Vibrio cholerae is the etiological agent of cholera. Its natural reservoir is the aquatic environment. To date, practical typing of V. cholerae is mainly serological and requires about 200 antisera. Simple sequence repeats (SSR), also termed VNTR (for variable number of tandem repeats), provide a source of high genomic polymorphism used in bacterial typing. Here we describe an SSR-based typing method that combines the variation in highly mutable SSR loci, with that of shorter, relatively more stable mononucleotide repeat (MNR) loci, for accurate and rapid typing of V. cholerae. In silico screening of the V. cholerae genome revealed thousands of perfect SSR tracts with an average frequency of one SSR every 152 bp. A panel of 32 V. cholerae strains, representing both clinical and environmental isolates, was tested for polymorphism in SSR loci. Two strategies were applied to identify SSR variation: polymorphism of SSR tracts longer than 12 bp (L-SSR) assessed by capillary fragment-size analysis and MNR polymorphism assessed by sequencing. The nine L-SSR loci tested were all polymorphic, displaying 2 to 13 alleles per locus. Sequence analysis of eight MNR-containing loci (MNR-multilocus sequence typing [MLST]) provided information on both variations in the MNR tract itself, and single nucleotide polymorphism (SNP) in their flanking sequences. Phylogenetic analysis of the combined SSR data showed a clear discrimination between the clinical strains belonging to O1 and O139 serogroups, and the environmental isolates. Furthermore, discrimination between 27 strains of the 32 strains was achieved. SSR-based typing methods combining L-SSR and MNR-MLST were found to be efficient for V. cholerae typing.
The liminal magic circle : boundaries, frames, and participants in pervasive mobile games

While the emphasis in traditional game theory has been on the rule formations and zone demarcations that distinguish games from play, mobile games tend to deliberately and thoughtfully blur the lines, not just between games and play but between a game and an experience, as well as between places of play (the “magic circle”) and places of everyday life. Mobile games often create moments of liminality as they are driven by the idea of playing with and within everyday spaces, technologies, and objects. In this brief paper, I will discuss these boundaries and the liminality of mobile games to date, and focus on one particularly difficult ethical area- that of player and non-player participation. The concepts of play and game are complexly intertwined. According to Johan Huizinga (1950), games can be found on a continuum between the two poles of ludus and paidia. Ludus (frequently understood as a pure game) is characterized by the corseting of exuberance with deliberate and arbitrary conventions that require the player to demonstrate effort, skill, patience, or intellect. Chess is often upheld as a pure ludus game. Paidia (or pure play), on the other hand, is characterized by a shared, ritualistic principle that is found in gaiety and improvisation, as is the case with children’s games, with less rigorous boundaries and rules guiding moments and places of play. Confusion often arises when discussing the play of games. For the purposes of this essay, I am discussing games in the sense of ludus and play as a verb to describe people who are taking part in games. When I refer to the magic circle, I am describing the place where a particular game takes place, with
Disproving the Neighborhood Conjecture

We study the following Maker/Breaker game. Maker and Breaker take turns in choosing vertices from a given n-uniform hypergraph F, with Maker going first. Maker's goal is to completely occupy a hyperedge and Breaker tries to avoid this. Beck conjectures that if the maximum neighborhood size of F is at most 2^(n-1) then Breaker has a winning strategy. We disprove this conjecture by establishing an n-uniform hypergraph with maximum neighborhood size 3*2^(n-3) where Maker has a winning strategy. Moreover, we show how to construct an n-uniform hypergraph with maximum degree 2^(n-1)/n where Maker has a winning strategy. Finally we show that each n-uniform hypergraph with maximum degree at most 2^(n-2)/(en) has a proper halving 2-coloring, which solves another open problem posed by Beck related to the Neighborhood Conjecture.
Feedback Control Which Preserves Optimality for Systems with Unknown Parameters

A method is described for constructing a feedback control law which remains optimal for a class of systems with unknown parameters whose values may lie in given regions. The control depends only on the input and output, and there is no explicit dependence on the unknown parameters. In contrast to the usual adaptive sirategy, there is no identification or adjustment period. The optimal controlisgeneratedinaTaylorseriesform, but truncation of the series results in a feedback control which is close to optimal for a range of parameter values. An nth-order truncation of the control results in a (2n + 1)th-order approximation of the optimally adaptive performance index.
MAl-l Visual Acuity Measurement With a Second-Generation Scanning Laser Ophthalmoscope

Individuals with longstanding macular scotomas use an idiosyncratic, non-foveal retinal area adjacent to the scotoma to fixate and to inspect detailed visual stimuli (1). It is not known whether this preferred retinal locus (PRL) "selected" by the patient is the retinal area of highest residual visual acuity or how acuity is modified in retinal areas surrounding the scotoma. Because this information could be useful in visual rehabilitation of patients with macular disease we have developed a technique for measuring acuity at specific retinal loci using the Scanning Laser Ophthalmoscope (SLO) (2).
Kernel based Learning Suitable for Text Categorization

This research proposes a new strategy where documents are encoded into string vectors for text categorization and modified versions of SVM to be adaptable to string vectors. Traditionally, when the supervised machine learning algorithms are used for pattern classification, raw data should be encoded into numerical vectors. This encoding may be difficult, depending on a given application area of pattern classification. For example, in text categorization, encoding full texts given as raw data into numerical vectors leads to two main problems: huge dimensionality and sparse distribution. In this research, we encode full texts into string vectors, and apply the SVM to string vectors for text categorization.
Reprints Available Directly from the Publisher Photocopying Permitted by License Only (c) 2000 Opa (overseas Publishers Association) N.v. Laparoscopic Surgical Techniques for Endometriosis and Adenomyosis

The details ofsurgical techniques for laparoscopic removal of endometriosis and adenomyosis are described briefly in textbooks and gynaecological journal articles. We have described a wide variety of techniques for the various procedures required in the treatment of endo-metriosis and adenomyosis, excluding hysterectomy. The principles are based upon those used in removal of primary cancer lesions. The limitations of thermal ablation are discussed, and evidence of improved results after excision of lesions have been submitted for publication.
Cascade Simulation On Optimized Networks

Cascade phenomena, which are sequences of adoption by agents, are the important driven forces for the society to make a successful diffusion of innovation. Cascade phenomena on complex networks occur under a range of conditions (or known as cascade windows) defined by both the average degree of the underlying network topology and the threshold of each agents(or nodes). In this paper, we obtain optimal networks for good cascade using generic algorithm (GA). In order to obtain the optimal network for good cascade, the network should have a sufficient number of vulnerable nodes and hub nodes of medium sizes, in other words, the degree distribution of the optimal network should follow a linear combination of Poisson and uniform distribution.
Scheduling Energy Efficient Data Centers Using Renewable Energy

This work presents a multi-objective approach for scheduling energy consumption in data centers considering traditional and green energy data sources. This problem is addressed as a whole by simultaneously scheduling the state of the servers and the cooling devices, and by scheduling the workload of the data center, which is comprised of a set of independent tasks with due dates. Its goal is to simultaneously minimize the energy consumption budget of the data center, the energy consumption deviation from a reference profile, and the amount of tasks whose due dates are violated. Two multi-objective evolutionary algorithms hybridized with a greedy heuristic are proposed and are enhanced by applying simulated annealing for post hoc optimization. Experimental results show that these methods are able to reduce energy consumption budget by about 60% while adequately following a power consumption profile and providing a high quality of service. These results confirm the effectiveness of the proposed algorithmic approach and the usefulness of green energy sources for data center infrastructures.
The Impact Exerted on Clinical Outcomes of Patients With Chronic Heart Failure by Aldosterone Receptor Antagonists: A Meta-Analysis of Randomized Controlled Trials

Background Aldosterone receptor antagonists (ARAs) have been associated with improved clinical outcomes in patients with heart failure with reduced left ventricular ejection fraction (HFREF), but not in those with heart failure with preserved left ventricular ejection fraction (HFpEF). With the aim to study this topic more deeply, we carried out a meta-analysis of selective and non-selective ARAs in HFREF and HFpEF. Methods We searched PubMed and Scopus databases. We decided to incorporate in the meta-analysis only randomized controlled trials (RCTs) of ARAs in patients with chronic heart failure (CHF) if they met the following criteria: experimental groups included patients with CHF treated with ARAs in addition to the conventional therapy; control groups included patients with CHF receiving conventional therapy without ARAs. Outcomes of interest were all-cause death, hospitalizations from cardiovascular cause, hyperkalemia, or gynecomastia. Results We detected 15 studies representing 15,671 patients. ARAs were associated with a reduced odds of all-cause death (odds ratio (OR): 0.79; 95% confidence interval (CI): 0.73 - 0.87) and hospitalizations from cardiovascular cause (OR: 0.73; 95% CI: 0.61 - 0.89). However, subgroup analysis showed that these advantages were limited to HFREF (all-cause death: OR: 0.77, 95% CI: 0.69 - 0.84; hospitalizations from cardiovascular cause: OR: 0.66, 95% CI: 0.51 - 0.85), but they did not affect the HFpEF group (all-cause death: OR: 0.91, 95% CI: 0.76 - 1.1; hospitalizations from cardiovascular cause: OR: 0.85, 95% CI: 0.7 - 1.09). ARAs increased the risk of hyperkalemia (OR: 2.17; 95% CI: 1.88 - 2.5). Non-selective ARAs, but not selective ARAs, increased the risk of gynecomastia (OR: 8.22, 95% CI: 4.9 - 13.81 vs. OR: 0.74, 95% CI: 0.43 - 1.27). Conclusions ARAs reduced the risk of adverse cardiac events in HFREF but not HFpEF. In particular, ARA use in HFpEF patients is questionable, since in this CHF type, no significant improvement in all-cause death and cardiovascular hospitalizations was demonstrated with ARA treatment, in the face of the well-known risks of hyperkalemia and/or gynecomastia that chronic ARA therapy entails. Selective ARAs were equally effective as non-selective ARAs, without the risk of gynecomastia.
Tracking a moving hypothesis for visual data with explicit switch detection

The use of support vector (SV) methods has been successful in many areas involving pattern recognition. Video surveillance requires pattern recognition algorithms that are efficient in their operation, and requires the use of online processing for the detection and identification of events, objects, and behaviours. To successfully use SV methods in video surveillance, on-line training methods must be employed; NORMA [1] is one such training method. A video surveillance system represents a dynamic system with non-stationary characteristics. It is the purpose of our work to enhance NORMA to better adapt to sudden changes (switches) in the surveillance environment. We show that the decision hypothesis that NORMA generates is more accurate when a switch in the data is explicitly detected and managed. Our preliminary testing involves simulated data, real world benchmark data, and real video data captured from a digital camera.
Dimensionality Reduction in Hyperbolic Data Spaces: Bounding Reconstructed-Information Loss

We have started to see non-Euclidean geometries used in many applications, including visualization, network measurement, and geometric routing. Therefore, we need new mechanisms for managing and exploring non-Euclidean data. In this paper, we specifically address the dimensionality reduction problem for Hyperbolic data that are represented by the Poincare Disk model. A desirable property of our solution is its reconstructed boundedness. In other words, we can reconstruct the data from its dimension-reduced version to obtain an approximation whose deviation from the original data is bounded and independent of the boundary measure of the original data space. We also propose a similarity search technique as an application of our reduction approach. We provide both theoretical and simulation analyses to substantiate the findings of our work.