Miracle-dz/UniFAR-FTUs huggingface dataset:
Likeable Social Media: How to Delight Your Customers, Create an Irresistible Brand, and Be Generally Amazing on Facebook (& Other Social Networks)

Likeable Social Media: How to Delight Your Customers, Create an Irresistible Brand, and Be Generally Amazing on Facebook (& Other Social Networks), by Dave Kerpen. 2011. New York: The McGraw Hill Companies. 270 Pages. Paper. $22.00Likeable Social Media can benefit anybody seeking a truly rewarding career-even though the author aimed his work at companies. But there are parallels: Neither companies nor those who work for them will enjoy success until their value is seen, appreciated, and rewarded. Dave Kerpen's book is its content made visible. His goal is to give you clear and compelling proof that social media can help you build the relationships that drive mutually beneficial efforts. All the examples are drawn from businesses, and usually larger organizations rather than sole proprietorships. But the concepts apply right down to the individual job seeker. Job seekers will have very few "ah-ha" moments as they read. They probably know about the principles this book covers before they read the first page. What's different is how the author pulls them all together into a coherent whole by fitting each element into a comprehensive approach. "Comprehensive" translates into eighteen strategies he lays out to help put social media to work for anybody seeking a new career.Since there isn't room to cover each one, I'll only touch on the main themes. The first is to never stop listening. What's different about his book is what he suggests you listen for. Job seekers want to listen for all the employers' needs. Needs may go well beyond what's in ajob announcement. And, for some companies, customers may know what the companies needs are before management does. If job seekers stop listening too soon, they may not understand an employer's real needs, and thus miss opportunities. The key is to listen completely before you respond. According to Dave social media isn't a channel to sell yourself; it's the best way to engage people who need you. Job seekers should also know what they are looking for and who needs what they offer. This book describes companies offering any thing that makes them stand out. That also works when looking forajob. Whenjob seekers clearly identify how they are better than the competition, they're more successful. Once focused, job seekers can use social media to make every engagement worthwhile.Using social media well takes time. But the opportunities are richer because it engages people (job seekers and companies) in conversations that build relationships. Job seekers will be frustrated if their want ajob quickly. …
Real-time traversal in grammar-based compressed files

Summary form only given. In text compression applications, it is important to be able to process compressed data without requiring (complete) decompression. In this context it is crucial to study compression methods that allow time/space efficient access to any fragment of a compressed file without being forced to perform complete decompression. We study here the real-time recovery of consecutive symbols from compressed files, in the context of grammar-based compression. In this setting, a compressed text is represented as a small (a few Kb) dictionary D (containing a set of code words), and a very long (a few Mb) string based on symbols drawn from the dictionary D. The space efficiency of this kind of compression is comparable with standard compression methods based on the Lempel-Ziv approach. We show, that one can visit consecutive symbols of the original text, moving from one symbol to another in constant time and extra O(|D|) space. This algorithm is an improvement of the on-line linear (amortised) time algorithm presented in (L. Gasieniec et al, Proc. 13th Int. Symp. on Fund. of Comp. Theo., LNCS, vol.2138, p.138-152, 2001).
On the flexibility of data fulfillment locations in data-intensive distributed systems

The studies in our past and ongoing work tries to make improvements to data-intensive systems by extensively exploiting or considering their characteristics. Existing systems or techniques either ignored the potential of performance improvement through an optimized design or overlooked the specific requirements of data-intensive applications, which inevitably result in a sub-optimal result. Noticing that the data fulfillment location is regulated but still allowed to change by nature in distributed memory cache clusters, we proposed dynamic provisioning of memory cache clusters. The proposed scheme improves the energy efficiency of the system by the introduced elastic system provisioning. Specifically, the server activeness and the request dispatching in the system are dynamically controlled, so that the average energy cost of the system is lowered compared with other schemes. Besides, the proposed scheme can make the tradeoff between the request latency, cache hit rate performance and system energy cost to meet the specific demands of memory cache clusters.
Dynamic runtime re-scheduling allowing multiple implementations of a task for platform-based designs

This paper introduces an extension to the RMS scheduling technique that we call "hot swapping". Hot swapping enables a system to choose between various selected implementations of one task on-the-fly and thus to optimize the system's cost (e.g. power savings). The on-the-fly swapping between those implementations requires extra time to save and/or transform states of a certain task implementation. Even if the two steady-state schedules before and after the swapping are feasible, the transient schedule with the additional swapping computation time may exceed the system's capacity. Our technique is an extension to rate monotonic scheduling (RMS). While maintaining and meeting performance requirements, our technique shows an average reduction of 31% in power consumption compared to systems using a pure static scheduling approach (RMS) that cannot make use of task swapping. We have evaluated our algorithm through simulation of five real-world task sets and in addition by use of a large number of generated task sets.
Association of obstructive sleep apnea plus hypertension and prevalent cardiovascular diseases

AbstractCurrent study sought to evaluate the associations of obstructive sleep apnea (OSA) plus hypertension (HTN) and prevalent cardiovascular diseases (CVD). This was a cross-sectional study and a total of 1889 subjects were enrolled. The apnea-hypopnea index (AHI) was measured by polysomnography and OSA degree was classified as mild (AHI 5–14.9) and moderate-severe (AHI ≥ 15), and AHI < 5 was considered no-OSA. Mean and lowest oxyhemoglobin saturation (SaO2) was detected by pulse oximetry. Between-group differences were assessed and logistic regression analysis was used to analyze the association of OSA plus HTN and prevalent CVD.Compared to normotensive subjects, hypertensive subjects were older and had higher body mass index (BMI), neck girth, waist–hip ratio, AHI, and low-density lipoprotein cholesterol (LDL-C) level. Conversely, mean and lowest SaO2 levels were significantly lower. Logistic regression analysis showed that in an unadjusted model, compared to subjects with no-OSA and no-HTN (reference group), the association of HTN plus moderate-severe-OSA and prevalent CVD was the most prominent (odds ratio [OR]: 2.638 and 95% confidence interval [CI]: 1.942–3.583). In normotensive subjects, after adjusted for potential covariates, the associations of OSA (regardless of severity) and prevalent CVD were attenuated to nonsignificant. In hypertensive subjects, however, the associations remained significant but were reduced. Further adjusted for mean and lowest SaO2, the associations remained significant in HTN plus no-OSA (OR: 1.808, 95% CI: 1.207–2.707), HTN plus mild-OSA (OR: 2.003, 95% CI: 1.346–2.980), and HTN plus moderate-severe OSA (OR: 1.834, 95% CI: 1.214–2.770) groups.OSA plus HTN is associated with prevalent CVD, and OSA may potentiate the adverse cardiovascular effects on hypertensives patients but not normotensives.
Assessing activation of true and false memory traces: A study using the DRM Paradigm

This paper compares the activation of false memory traces with true memory traces and control items. An incidental learning version of the Deese-Roediger-McDermott paradigm (DRM) is used in conjunction with a Lexical Decision Task (LDT). One hundred participants read 5 DRM lists intermixed with 4 non-word lists. After a delay manipulated into 3 experimental conditions (immediate, 3-minute and 10-minute), they were asked to classify actually studied items, CIs, new words and non words in an LDT. Results showed that, independent of the delay, the classification latency of the CIs was the same as that for actually studied words and that both were more active than matched control items. Moreover, results showed that the delay affects the activation of true and false memories at the same rate. Overall the results seem to support the hypothesis that false memories trace becomes additive traces that are integrated into the episodic memory, with the same features of the true memories.
The Cognitive Assessment Interview (CAI): reliability and validity of a brief interview-based measure of cognition.

OBJECTIVE To obtain Food and Drug Administration approval for the treatment of cognitive impairments associated with schizophrenia, a drug will need to demonstrate benefits beyond those that may be documented on objective cognitive tests. Interview-based measures of cognition such as the Cognitive Assessment Interview (CAI) are candidate coprimary outcome measures. METHODS Psychiatrically stable schizophrenia outpatients (n=150) were studied using the CAI to obtain information about cognitive functioning from both the patient and an informant. Patients also received objective assessments of neurocognition, functional capacity, functional outcome, and symptoms, at baseline and 1 month later. RESULTS The CAI had good internal consistency (Cronbach's alpha=.92) and good test-retest reliability (r=.83). The CAI was moderately correlated with objective neurocognitive test scores (r's=-.39 to -.41) and moderately correlated with social functioning (r=-.38), work functioning (r=-.48), and overall functional outcome (r=-.49). The correlations of CAI scores with external validity indicators did not differ significantly by source of information (patient alone ratings were valid). Overall functional outcome correlated more strongly with patient CAI scores (r=-.50) than with objective neurocognitive test scores (r=.29) or functional capacity (r=.29). CONCLUSIONS Field testing of the CAI produced reliable ratings of cognitive functioning that were correlated with functional outcome. Patient ratings alone yielded scores with reliability and validity values appropriate for use in clinical trials. The CAI appears to provide useful complementary information and possesses practical advantages for rating cognitive functioning including an interview-based method of administration, brief assessment time (15 min for the patient assessment), little or no practice effects, and ease of scoring.
Three Essays on Child Development

Economics literature is interested in how child cognitive and socio-emotional skills develop during childhood. Evolution of skills is crucial to determine productivity, criminality among other social and economic outcomes. The government has a role in shaping abilities improving conditions at home or school. Thus, initial deficiencies of children in disadvantageous households can be compensated by increasing resources or material investments. These essays investigate how computers and income affect traditional measures of academic success. Also, how parental conflict is involved in a dynamic framework is investigated. The first chapter analyzes whether access to computers in schools improves performance in math and language standardized tests. Computers and in general technology are part of current living conditions, therefore, there has been a lot of debate whether they contribute to learning. Computers can affect tests because they can substitute or complement teachers and material inputs at school. The analysis is carried out using “Computadores para Educar” a nationwide program in Colombia that allocates computers in public schools. The program started in 2000 as a presidential initiative to improve access and use of information technologies. Results indicate that there is no gain on language and mathematics achievement tests.
Eye Detection for Electronic Map Control Application

Human-Computer Interaction (HCI) technology has been widely used in recent years. However, how to achieve a good performance is still a real challenge due to several practical factors. In this paper, we propose a new method to browse electronic map through human eyes detection. This method can operate movement and zooming of a map by accurately detecting and locating eyes and analyzing their behaviors. The core technique of the method is detecting and locating eyes accurately. The highlights lie in the diversity of controlling ways, stability of operation and good adaptation to different environments. Experimental results show that the proposed method has good effects on the accurate location of eyes and stable control of the map.
Which prior knowledge? Quantification of in vivo brain 13C MR spectra following 13C glucose infusion using AMARES

The recent developments in high magnetic field 13C magnetic resonance spectroscopy with improved localization and shimming techniques have led to important gains in sensitivity and spectral resolution of 13C in vivo spectra in the rodent brain, enabling the separation of several 13C isotopomers of glutamate and glutamine. In this context, the assumptions used in spectral quantification might have a significant impact on the determination of the 13C concentrations and the related metabolic fluxes. In this study, the time domain spectral quantification algorithm AMARES (advanced method for accurate, robust and efficient spectral fitting) was applied to 13C magnetic resonance spectroscopy spectra acquired in the rat brain at 9.4 T, following infusion of [1,6‐13C2] glucose. Using both Monte Carlo simulations and in vivo data, the goal of this work was: (1) to validate the quantification of in vivo 13C isotopomers using AMARES; (2) to assess the impact of the prior knowledge on the quantification of in vivo 13C isotopomers using AMARES; (3) to compare AMARES and LCModel (linear combination of model spectra) for the quantification of in vivo 13C spectra. AMARES led to accurate and reliable 13C spectral quantification similar to those obtained using LCModel, when the frequency shifts, J‐coupling constants and phase patterns of the different 13C isotopomers were included as prior knowledge in the analysis. Magn Reson Med, 2013. © 2012 Wiley Periodicals, Inc.
Model Counting

Propositional model counting or #SAT is the problem of computing the number of models for a given propositional formula, i.e., the number of distinct truth assignments to variables for which the formula evaluates to true. For a proposi-tional formula F , we will use #F to denote the model count of F. This problem is also referred to as the solution counting problem for SAT. It generalizes SAT and is the canonical #P-complete problem. There has been significant theoretical work trying to characterize the worst-case complexity of counting problems, with some surprising results such as model counting being hard even for some polynomial-time solvable problems like 2-SAT. The model counting problem presents fascinating challenges for practitioners and poses several new research questions. Efficient algorithms for this problem will have a significant impact on many application areas that are inherently beyond SAT ('beyond' under standard complexity theoretic assumptions), such as bounded-length adversarial and contingency planning, and probabilistic reasoning. For example, various probabilistic inference problems, such as Bayesian net reasoning, can be effectively translated into model counting problems [cf. Another application is in the study of hard combinatorial problems, such as combinatorial designs, where the number of solutions provides further insights into the problem. Even finding a single solution can be a challenge for such problems; counting the number of solutions is much harder. Not surprisingly, the largest formulas we can solve for the model counting problem with state-of-the-art model counters are orders of magnitude smaller than the formulas we can solve with the best SAT solvers. Generally speaking, current exact counting methods can tackle problems with a couple of hundred variables, while approximate counting methods push this to around 1,000 variables. #SAT can be solved, in principle and to an extent in practice, by extending the two most successful frameworks for SAT algorithms, namely, DPLL and local search. However, there are some interesting issues and choices that arise when extending SAT-based techniques to this harder problem. In general, solving #SAT requires the solver to, in a sense, be cognizant of all solutions in the search space, thereby reducing the effectiveness and relevance of commonly used SAT heuristics designed to quickly narrow down the search to a single solution. The resulting
A Novel Cooperative Opportunistic Routing Scheme for Underwater Sensor Networks

Increasing attention has recently been devoted to underwater sensor networks (UWSNs) because of their capabilities in the ocean monitoring and resource discovery. UWSNs are faced with different challenges, the most notable of which is perhaps how to efficiently deliver packets taking into account all of the constraints of the available acoustic communication channel. The opportunistic routing provides a reliable solution with the aid of intermediate nodes’ collaboration to relay a packet toward the destination. In this paper, we propose a new routing protocol, called opportunistic void avoidance routing (OVAR), to address the void problem and also the energy-reliability trade-off in the forwarding set selection. OVAR takes advantage of distributed beaconing, constructs the adjacency graph at each hop and selects a forwarding set that holds the best trade-off between reliability and energy efficiency. The unique features of OVAR in selecting the candidate nodes in the vicinity of each other leads to the resolution of the hidden node problem. OVAR is also able to select the forwarding set in any direction from the sender, which increases its flexibility to bypass any kind of void area with the minimum deviation from the optimal path. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of the packet delivery ratio, energy consumption, end-to-end delay, hop count and traversed distance.
Who's Afraid of the Patent Trolls? Assessing the Market Impact of Landmark Patent Troll Litigation Outcomes

Patent trolls have changed the innovation and patent policy landscape. This thesis is an empirical event study that focuses on two landmark cases of patent troll litigation, RIM v. NTP and eBay v. Mercexchange, to determine whether pro-troll litigation outcomes significantly impact the market values of the firms in the high-tech industries they target. I find that the Supreme Court ruling in eBay v. Mercexchange did seem to significantly impact a proportion of firms in the market. The decisive factors in distinguishing affected vs. unaffected firms include a firm‟s R&D to Sales ratio, market value, and NAICS code specification.
An implementation of a semantic associative search space for medical document databases

We present an implementation of a semantic associative search space for medical document databases. We have implemented a semantic associative search space for the medical field by using encyclopedias which describe not only word definitions but also word explanations. This implementation realizes a medical semantic associative search space by using a medical encyclopedia which includes explicit word explanations. We have created an actual medical semantic associative search space which consists of 149 dimensions computed from the 217 /spl times/ 219 matrix consisting of medical data. By using this actual medical space, we show several experimental results of semantic associative search creation and medical document retrieval for clarifying feasibility of our implementation method.
The miR-17∼92a Cluster of MicroRNAs Is Required for the Fitness of Foxp3+ Regulatory T Cells

By genetic inactivation of key microRNA biogenesis enzymes, we and others have previously demonstrated the critical requirement of the microRNA pathway for the differentiation and function of Foxp3+ regulatory T cells. In this study, we identified members of the miR-17∼92a cluster of microRNAs to be enriched in regulatory T cells. To investigate the function of this microRNA cluster, we deleted the gene specifically in Foxp3+ cells in mice. We found that miR-17∼92a is required for the fitness of regulatory T cells, and deficiency impacted at the level of apoptosis and proliferation of these cells. This led to a loss of Foxp3+ cells over time, particularly in competitive settings, and culminated in a range of immunologic perturbations. Thus, miR-17∼92a-target interactions are part of the essential microRNA networks that safeguard the regulatory T cell lineage.
LigASite—a database of biologically relevant binding sites in proteins with known apo-structures

Better characterization of binding sites in proteins and the ability to accurately predict their location and energetic properties are major challenges which, if addressed, would have many valuable practical applications. Unfortunately, reliable benchmark datasets of binding sites in proteins are still sorely lacking. Here, we present LigASite (‘LIGand Attachment SITE’), a gold-standard dataset of binding sites in 550 proteins of known structures. LigASite consists exclusively of biologically relevant binding sites in proteins for which at least one apo- and one holo-structure are available. In defining the binding sites for each protein, information from all holo-structures is combined, considering in each case the quaternary structure defined by the PQS server. LigASite is built using simple criteria and is automatically updated as new structures become available in the PDB, thereby guaranteeing optimal data coverage over time. Both a redundant and a culled non-redundant version of the dataset is available at http://www.scmbb. ulb.ac. be/Users/benoit/LigASite. The website interface allows users to search the dataset by PDB identifiers, ligand identifiers, protein names or sequence, and to look for structural matches as defined by the CATH homologous superfamilies. The datasets can be downloaded from the website as Schema-validated XML files or comma-separated flat files.
Novel Reduced-State BCJR Algorithms

BCJR algorithm is an exact and efficient algorithm to compute the marginal posterior distributions of state variables and pairs of consecutive state variables of a trellis structure. Due to its overwhelming complexity, reduced complexity variations, such as the M-BCJR algorithm, have been developed. In this paper, we propose improvements upon the conventional M-BCJR algorithm based on modified active state selection criteria. We propose selecting the active states based on estimates of the fixed-lag smoothed distributions of the state variables. We also present Gaussian approximation techniques for the low-complexity estimation of these fixed-lag smoothed distributions. The improved performance over the M-BCJR algorithm is shown via computer simulations.