SoroushVahidi/scidocs huggingface dataset:
On multiple foreground cosegmentation
(2012)

In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo sets where a finite number of K foregrounds of interest repeatedly occur cross the entire photo set, but only an unknown subset of them is presented in each image. This contrasts the classical cosegmentation problem dealt with by most existing algorithms, which assume a much simpler but less realistic setting where the same set of foregrounds recurs in every image. We propose a novel optimization method for MFC, which makes no assumption on foreground configurations and does not suffer from the aforementioned limitation, while still leverages all the benefits of having co-occurring or (partially) recurring contents across images. Our method builds on an iterative scheme that alternates between a foreground modeling module and a region assignment module, both highly efficient and scalable. In particular, our approach is flexible enough to integrate any advanced region classifiers for foreground modeling, and our region assignment employs a combinatorial auction framework that enjoys several intuitively good properties such as optimality guarantee and linear complexity. We show the superior performance of our method in both segmentation quality and scalability in comparison with other state-of-the-art techniques on a newly introduced FlickrMFC dataset and the standard ImageNet dataset.
Fourier Analysis for Demand Forecasting in a Fashion Company
(2018)

In the fashion industry, demand forecasting is particularly complex: companies operate with a large variety of short lifecycle products, deeply influenced by seasonal sales, promotional events, weather conditions, advertising and marketing campaigns, on top of festivities and socio-economic factors. At the same time, shelf-out-of-stock phenomena must be avoided at all costs. Given the strong seasonal nature of the products that characterize the fashion sector, this paper aims to highlight how the Fourier method can represent an easy and more effective forecasting method compared to other widespread heuristics normally used. For this purpose, a comparison between the fast Fourier transform algorithm and another two techniques based on moving average and exponential smoothing was carried out on a set of 4year historical sales data of a €60+ million turnover mediumto large-sized Italian fashion company, which operates in the women’s textiles apparel and clothing sectors. The entire analysis was performed on a common spreadsheet, in order to demonstrate that accurate results exploiting advanced numerical computation techniques can be carried out without necessarily using expensive software.
Multiview Hessian Regularization for Image Annotation
(2013)

The rapid development of computer hardware and Internet technology makes large scale data dependent models computationally tractable, and opens a bright avenue for annotating images through innovative machine learning algorithms. Semisupervised learning (SSL) therefore received intensive attention in recent years and was successfully deployed in image annotation. One representative work in SSL is Laplacian regularization (LR), which smoothes the conditional distribution for classification along the manifold encoded in the graph Laplacian, however, it is observed that LR biases the classification function toward a constant function that possibly results in poor generalization. In addition, LR is developed to handle uniformly distributed data (or single-view data), although instances or objects, such as images and videos, are usually represented by multiview features, such as color, shape, and texture. In this paper, we present multiview Hessian regularization (mHR) to address the above two problems in LR-based image annotation. In particular, mHR optimally combines multiple HR, each of which is obtained from a particular view of instances, and steers the classification function that varies linearly along the data manifold. We apply mHR to kernel least squares and support vector machines as two examples for image annotation. Extensive experiments on the PASCAL VOC'07 dataset validate the effectiveness of mHR by comparing it with baseline algorithms, including LR and HR.
PKLot - A robust dataset for parking lot classification
(2015)

http://dx.doi.org/10.1016/j.eswa.2015.02.009 0957-4174/ 2015 Elsevier Ltd. All rights reserved. ⇑ Corresponding author. E-mail addresses: prlalmeida@inf.ufpr.br (P.R.L. de Almeida), lesoliveira@inf. ufpr.br (L.S. Oliveira), alceu@ppgia.pucpr.br (A.S. Britto Jr.), eunelson@ppgia.pucpr. br (E.J. Silva Jr.), alessandro.koerich@etsmtl.ca (A.L. Koerich). Paulo R.L. de Almeida , Luiz S. Oliveira , Alceu S. Britto Jr. b,⇑, Eunelson J. Silva Jr. b Alessandro L. Koerich b,c
Irregularities in the Distribution of Primes and Twin Primes By
(2003)

The maxima and minima of sL(x)) — n(x), iR(x)) — n(x), and sL2(x)) — n2(x) in various intervals up to x = 8 x 10 are tabulated. Here n(x) and n2(x) are respectively the number of primes and twin primes not exceeding x, L(x) is the logarithmic integral, R(x) is Riemann's approximation to ir(x), and L2(x) is the Hardy-Littlewood approximation to ti"2(;c). The computation of the sum of inverses of twin primes less than 8 x 10 gives a probable value 1.9021604 ± 5 x 10~7 for Brun's constant. 1. Approximations to nix). Let P= {2, 3, 5, • • • } be the set of primes, and let 7r(x) be the number of primes not exceeding x. Two well-known approximations to 7t(x) for x > 1 are the logarithmic integral: rx dt (1.1) L{x) = \v ; J o log t O-2) =T + log(logx)+Í: ^> k=\ k-k and Riemann's approximation: (1.3) R{x)=Z^L{xi'k) k=i k (1.4) =1 + ¿Jtó_ fz. k\kl{k + 1) Note that (1.1) differs by 1(2) = 1.04516378... from the frequently used approximation f2 dt/log t. We are interested in the errors O-5) r.{x) = (L(x)> n{x) and (1 6) r2(x) = (Rix)) n{x), where <y> denotes the integer closest to y {i.e., the integer part of (y + W)). k Received July 5, 1974. AMS (MOS) subject classifications (1970). Primary 10-04, 10H25, 10H15; Secondary 10A25, 10A40, 10H05, 65A05, 65B05.
Low-Cost Dual-Band Circularly Polarized Switched-Beam Array for Global Navigation Satellite System
(2014)

This paper presents the design and development of a dual-band switched-beam microstrip array for global navigation satellite system (GNSS) applications such as ocean reflectometry and remote sensing. In contrast to the traditional Butler matrix, a simple, low cost, broadband and low insertion loss beam switching feed network is proposed, designed and integrated with a dual band antenna array to achieve continuous beam coverage of ±25° around the boresight at the L1 (1.575 GHz) and L2 (1.227 GHz) bands. To reduce the cost, microstrip lines and PIN diode based switches are employed. The proposed switched-beam network is then integrated with dual-band step-shorted annular ring (S-SAR) antenna elements in order to produce a fully integrated compact-sized switched-beam array. Antenna simulation results show that the switched-beam array achieves a maximum gain of 12 dBic at the L1 band and 10 dBic at the L2 band. In order to validate the concept, a scaled down prototype of the simulated design is fabricated and measured. The prototype operates at twice of the original design frequency, i.e., 3.15 GHz and 2.454 GHz and the measured results confirm that the integrated array achieves beam switching and good performance at both bands.
A faceted approach to conceptualizing tasks in information seeking
(2008)

0306-4573/$ see front matter Published by Elsevi doi:10.1016/j.ipm.2008.07.005 * Corresponding author. Tel.: +1 601 266 4035; fa E-mail addresses: Yuelin.Li@usm.edu (Y. Li), nick 1 Tel.: +1 732 932 7500x8271; fax: +1 732 932 69 The nature of the task that leads a person to engage in information interaction, as well as of information seeking and searching tasks, have been shown to influence individuals’ information behavior. Classifying tasks in a domain has been viewed as a departure point of studies on the relationship between tasks and human information behavior. However, previous task classification schemes either classify tasks with respect to the requirements of specific studies or merely classify a certain category of task. Such approaches do not lead to a holistic picture of task since a task involves different aspects. Therefore, the present study aims to develop a faceted classification of task, which can incorporate work tasks and information search tasks into the same classification scheme and characterize tasks in such a way as to help people make predictions of information behavior. For this purpose, previous task classification schemes and their underlying facets are reviewed and discussed. Analysis identifies essential facets and categorizes them into Generic facets of task and Common attributes of task. Generic facets of task include Source of task, Task doer, Time, Action, Product, and Goal. Common attributes of task includes Task characteristics and User’s perception of task. Corresponding sub-facets and values are identified as well. In this fashion, a faceted classification of task is established which could be used to describe users’ work tasks and information search tasks. This faceted classification provides a framework to further explore the relationships among work tasks, search tasks, and interactive information retrieval and advance adaptive IR systems design. Published by Elsevier Ltd.
RCD: Rapid Close to Deadline Scheduling for datacenter networks
(2016)

Datacenter-based Cloud Computing services provide a flexible, scalable and yet economical infrastructure to host online services such as multimedia streaming, email and bulk storage. Many such services perform geo-replication to provide necessary quality of service and reliability to users resulting in frequent large inter-datacenter transfers. In order to meet tenant service level agreements (SLAs), these transfers have to be completed prior to a deadline. In addition, WAN resources are quite scarce and costly, meaning they should be fully utilized. Several recently proposed schemes, such as B4 [1], TEMPUS [2], and SWAN [3] have focused on improving the utilization of inter-datacenter transfers through centralized scheduling, however, they fail to provide a mechanism to guarantee that admitted requests meet their deadlines. Also, in a recent study, authors propose Amoeba [4], a system that allows tenants to define deadlines and guarantees that the specified deadlines are met, however, to admit new traffic, the proposed system has to modify the allocation of already admitted transfers. In this paper, we propose Rapid Close to Deadline Scheduling (RCD), a close to deadline traffic allocation technique that is fast and efficient. Through simulations, we show that RCD is up to 15 times faster than Amoeba, provides high link utilization along with deadline guarantees, and is able to make quick decisions on whether a new request can be fully satisfied before its deadline.
A Lyapunov approach to the stability of fractional differential equations
(2011)

Lyapunov stability of fractional differential equations is addressed in this paper. The key concept is the frequency distributed fractional integrator model, which is the basis for a global state space model of FDEs. Two approaches are presented: the direct one is intuitive but it leads to a large dimension parametric problem while the indirect one, which is based on the continuous frequency distribution, leads to a parsimonious solution. Two examples, with linear and nonlinear FDEs, exhibit the main features of this new methodology. & 2010 Elsevier B.V. All rights reserved.
Semi-Supervised Recognition of Sarcasm in Twitter and Amazon
(2010)

Sarcasm is a form of speech act in which the speakers convey their message in an implicit way. The inherently ambiguous nature of sarcasm sometimes makes it hard even for humans to decide whether an utterance is sarcastic or not. Recognition of sarcasm can benefit many sentiment analysis NLP applications, such as review summarization, dialogue systems and review ranking systems. In this paper we experiment with semisupervised sarcasm identification on two very different data sets: a collection of 5.9 million tweets collected from Twitter, and a collection of 66000 product reviews from Amazon. Using the Mechanical Turk we created a gold standard sample in which each sentence was tagged by 3 annotators, obtaining F-scores of 0.78 on the product reviews dataset and 0.83 on the Twitter dataset. We discuss the differences between the datasets and how the algorithm uses them (e.g., for the Amazon dataset the algorithm makes use of structured information). We also discuss the utility of Twitter #sarcasm hashtags for the task.
Scheduling and locking in multiprocessor real-time operating systems
(2011)

BJÖRN B. BRANDENBURG: Scheduling and Locking in Multiprocessor Real-Time Operating Systems (Under the direction of James H. Anderson) With the widespread adoption of multicore architectures, multiprocessors are now a standard deployment platform for (soft) real-time applications. This dissertation addresses two questions fundamental to the design of multicore-ready real-time operating systems: (1) Which scheduling policies offer the greatest flexibility in satisfying temporal constraints; and (2) which locking algorithms should be used to avoid unpredictable delays? With regard to Question 1, LITMUSRT, a real-time extension of the Linux kernel, is presented and its design is discussed in detail. Notably, LITMUSRT implements link-based scheduling, a novel approach to controlling blocking due to non-preemptive sections. Each implemented scheduler (22 configurations in total) is evaluated under consideration of overheads on a 24-core Intel Xeon platform. The experiments show that partitioned earliest-deadline first (EDF) scheduling is generally preferable in a hard real-time setting, whereas global and clustered EDF scheduling are effective in a soft real-time setting. With regard to Question 2, real-time locking protocols are required to ensure that the maximum delay due priority inversion can be bounded a priori. Several spinlockand semaphore-based multiprocessor real-time locking protocols for mutual exclusion (mutex), reader-writer (RW) exclusion, and k-exclusion are proposed and analyzed. A new category of RW locks suited to worst-case analysis, termed phase-fair locks, is proposed and three efficient phase-fair spinlock implementations are provided (one with few atomic operations, one with low space requirements, and one with constant RMR complexity). Maximum priority-inversion blocking is proposed as a natural complexity measure for semaphore protocols. It is shown that there are two classes of schedulability analysis, namely suspensionoblivious and suspension-aware analysis, that yield two different lower bounds on blocking. Five
Miniaturized rat-race coupler with bandpass response and good stopband rejection
(2009)

Coupled-resonator network is applied to the design of a rat-race coupler with bandpass response in this paper. Net-type resonators are used to reduce the circuit size and control the harmonics. As a result, the proposed coupler exhibits not only a compact size but also good stopband rejection. The proposed coupler occupies only one sixth area of the conventional design, while the rejection level in the stopband is better than 30 dB up to 4.3ƒ0. The measured results are in good agreement with the simulated predictions.
BinMatch: A Semantics-Based Hybrid Approach on Binary Code Clone Analysis
(2018)

Binary code clone analysis is an important technique which has a wide range of applications in software engineering (e.g., plagiarism detection, bug detection). The main challenge of the topic lies in the semantics-equivalent code transformation (e.g., optimization, obfuscation) which would alter representations of binary code tremendously. Another challenge is the trade-off between detection accuracy and coverage. Unfortunately, existing techniques still rely on semantics-less code features which are susceptible to the code transformation. Besides, they adopt merely either a static or a dynamic approach to detect binary code clones, which cannot achieve high accuracy and coverage simultaneously.  In this paper, we propose a semantics-based hybrid approach to detect binary clone functions. We execute a template binary function with its test cases, and emulate the execution of every target function for clone comparison with the runtime information migrated from that template function. The semantic signatures are extracted during the execution of the template function and emulation of the target function. Lastly, a similarity score is calculated from their signatures to measure their likeness. We implement the approach in a prototype system designated as BinMatch which analyzes IA-32 binary code on the Linux platform. We evaluate BinMatch with eight real-world projects compiled with different compilation configurations and commonly-used obfuscation methods, totally performing over 100 million pairs of function comparison. The experimental results show that BinMatch is robust to the semantics-equivalent code transformation. Besides, it not only covers all target functions for clone analysis, but also improves the detection accuracy comparing to the state-of-the-art solutions.
Broadband antenna array aperture made of tightly couple printed dipoles
(2016)

This study reports a novel tight-coupled dipole array antenna to operate with up to six octave bandwidth and 60 degrees scanning. The array was designed through full-wave EM simulations by employing the current sheet array radiator concept that was advanced by a novel integrated feed network. Several prototypes of planar and conformal arrays across 0.3–20 GHz have been fabricated and tested with good agreement observed between all predicted and measured terminal and radiation features. The exemplified arrays have been designed for 1.2–6 GHz with relative radiator height 0.12 of maximum operational wavelength.
Swing-up and stabilization of a cart-pendulum system under restricted cart track length
(2002)

This paper describes the swing-up and stabilization of a cart–pendulum system with a restricted cart track length and restricted control force using generalized energy control methods. Starting from a pendant position, the pendulum is swung up to the upright unstable equilibrium con5guration using energy control principles. An “energy well” is built within the cart track to prevent the cart from going outside the limited length. When su9cient energy is acquired by the pendulum, it goes into a “cruise” mode when the acquired energy is maintained. Finally, when the pendulum is close to the upright con5guration, a stabilizing controller is activated around a linear zone about the upright con5guration. The proposed scheme has worked well both in simulation and a practical setup and the conditions for stability have been derived using the multiple Lyapunov functions approach. c © 2002 Elsevier Science B.V. All rights reserved.
Depression as a risk factor for coronary artery disease: evidence, mechanisms, and treatment.
(2004)

OBJECTIVE
The present paper reviews the evidence that depression is a risk factor for the development and progression of coronary artery disease (CAD).


METHODS
MEDLINE searches and reviews of bibliographies were used to identify relevant articles. Articles were clustered by theme: depression as a risk factor, biobehavioral mechanisms, and treatment outcome studies.


RESULTS
Depression confers a relative risk between 1.5 and 2.0 for the onset of CAD in healthy individuals, whereas depression in patients with existing CAD confers a relative risk between 1.5 and 2.5 for cardiac morbidity and mortality. A number of plausible biobehavioral mechanisms linking depression and CAD have been identified, including treatment adherence, lifestyle factors, traditional risk factors, alterations in autonomic nervous system (ANS) and hypothalamic pituitary adrenal (HPA) axis functioning, platelet activation, and inflammation.


CONCLUSION
There is substantial evidence for a relationship between depression and adverse clinical outcomes. However, despite the availability of effective therapies for depression, there is a paucity of data to support the efficacy of these interventions to improve clinical outcomes for depressed CAD patients. Randomized clinical trials are needed to further evaluate the value of treating depression in CAD patients to improve survival and reduce morbidity.
Risk Assessment Uncertainties in Cybersecurity Investments
(2018)

When undertaking cybersecurity risk assessments, it is important to be able to assign numeric values to metrics to compute the final expected loss that represents the risk that an organization is exposed to due to cyber threats. Even if risk assessment is motivated by real-world observations and data, there is always a high chance of assigning inaccurate values due to different uncertainties involved (e.g., evolving threat landscape, human errors) and the natural difficulty of quantifying risk. Existing models empower organizations to compute optimal cybersecurity strategies given their financial constraints, i.e., available cybersecurity budget. Further, a general game-theoretic model with uncertain payoffs (probability-distribution-valued payoffs) shows that such uncertainty can be incorporated in the game-theoretic model by allowing payoffs to be random. This paper extends previous work in the field to tackle uncertainties in risk assessment that affect cybersecurity investments. The findings from simulated examples indicate that although uncertainties in cybersecurity risk assessment lead, on average, to different cybersecurity strategies, they do not play a significant role in the final expected loss of the organization when utilising a game-theoretic model and methodology to derive these strategies. The model determines robust defending strategies even when knowledge regarding risk assessment values is not accurate. As a result, it is possible to show that the cybersecurity investments’ tool is capable of providing effective decision support.
Wideband and Low Sidelobe Slot Antenna Fed by Series-Fed Printed Array
(2010)

A combination of slots and series-fed patch antenna array is introduced leading to an array antenna with wide bandwidth, low sidelobe level (SLL), and high front-to-back ratio (F/B). Three structures are analyzed. The first, the reference structure, is the conventional series-fed microstrip antenna array that operates at 16.26 GHz with a bandwidth of 3%, SLL of -24 dB, and F/B of 23 dB. The second is similar to the reference structure, but a large slot that covers the patch array is removed from the ground plane. This results in a wide operating bandwidth of over 72% for , with a 3 dB gain bandwidth of over 15.9%. The SLL of this structure is improved to more than at 16.26 GHz, and stable SLL of over 15.5-16.4 GHz band is also exhibited. This structure has a bi-directional radiation pattern. To make the pattern uni-directional and increase the F/B, a third structure is analyzed. In this structure, rather than one single large slot, an array of slots is used and a reflector is placed above the series-fed patch array. This increases the F/B to 40 dB. The simulated and measured results are presented and discussed.
Active Learning for Real Time Detection of Polyps in Videocolonoscopy
(2016)

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Active Learning For Real Time Detection Of Polyps In Videocolonoscopy Quentin Angermann, Aymeric Histace, Olivier Romain