Miracle-dz/UniFAR-FTUs huggingface dataset:
Why is there no science in cyber science?: a panel discussion at NSPW 2010

As researchers with scientific training in fields that depend on experimental results to make progress, we have long been puzzled by the resistance of the experimental computer science community in general, and computer security research in particular, to the use of the methods of experimentation and reporting that are commonplace in most scientific undertakings. To bring our concerns to a broader audience, we proposed a discussion topic for NSPW 2010 that covers the history and practicality of experimental information security with an emphasis on exposing the pros and cons of the application of rigorous scientific experimental methodology in our work. We focused on discussion points that explore the challenges we face as scientists, and we tried to identify a set of concrete steps to resolve the apparent conflict between desire and practice. We hoped that the application of these steps to the papers accepted at NSPW could be an early opportunity to begin a journey toward putting more science into cyber science. The discussion, as expected, was wide ranging, interesting, and often frustrating. This paper is a slight modification of the discussion proposal that was accepted by NSPW with the addition of a brief summary of the discussion.
Evaluation of the Vector Space Representation in Text-Based Gene Clustering

Thanks to its increasing availability, electronic literature can now be a major source of information when developing complex statistical models where data is scarce or contains much noise. This raises the question of how to deeply integrate information from domain literature with experimental data. Evaluating what kind of statistical text representations can integrate literature knowledge in clustering still remains an unsufficiently explored topic. In this work we discuss how the bag-of-words representation can be used successfully to represent genetic annotation and free-text information coming from different databases. We demonstrate the effect of various weighting schemes and information sources in a functional clustering setup. As a quantitative evaluation, we contrast for different parameter settings the functional groupings obtained from text with those obtained from expert assessments and link each of the results to a biological discussion.
Word-of-Mouth Research: Principles and Applications

ABSTRACT Word of mouth (WOM) is an important component of a complex and dynamic marketplace environment, and as such, WOM research is best undertaken as part of a holistic research program. Five principles describing the operation of WOM are discussed, supported by data, and examples drawn from recent research studies. Complexity science modeling is introduced as an effective method for simulating the real-world operation of WOM in a given market category and identifying ways in which marketers can influence it to their advantage. Key business issues where WOM research can inform decision making are listed.
Binary fingerprinting codes - can we prove that someone is guilty?!

The Identifiable Parent Property guarantees, with probability 1, the identification of at least one of the traitors by the corresponding traitor tracing schemes, or, by IPP-codes. Unfortunately, for the case of binary codes the IPP property does not hold even in the case of only two traitors. A recent work has considered a natural generalization of IPP-codes for the binary case, where the identifiable parent property should hold with probability almost 1. It has been shown that almost t-IPP codes of nonvanishing rate exist for the case t = 2. Surprisingly enough, collusion secure digital fingerprinting codes do not automatically possess this almost IPP property. In practice, this means that for a given forged fingerprint, say z, a user identified as guilty by the tracing algorithm can deny this claim since he will be able to present a coalition of users that can create the same z, but he does not belong to that coalition. In this paper, we study the case of t-almost IPP codes for t > 2.
Simplifying Influenza Vaccination During Pandemics: Sublingual Priming and Intramuscular Boosting of Immune Responses with Heterologous Whole Inactivated Influenza Vaccine

The best approach to control the spread of influenza virus during a pandemic is vaccination. Yet, an appropriate vaccine is not available early in the pandemic since vaccine production is time consuming. For influenza strains with a high pandemic potential like H5N1, stockpiling of vaccines has been considered but is hampered by rapid antigenic drift of the virus. It has, however, been shown that immunization with a given H5N1 strain can prime the immune system for a later booster with a drifted variant. Here, we investigated whether whole inactivated virus (WIV) vaccine can be processed to tablets suitable for sublingual (s.l.) use and whether s.l. vaccine administration can prime the immune system for a later intramuscular (i.m.) boost with a heterologous vaccine. In vitro results demonstrate that freeze-drying and tableting of WIV did not affect the integrity of the viral proteins or the hemagglutinating properties of the viral particles. Immunization experiments revealed that s.l. priming with WIV (prepared from the H5N1 vaccine strain NIBRG-14) 4 weeks prior to i.m. booster immunization with the same virus strongly enhanced hemagglutination-inhibition (HI) titers against NIBRG-14 and the drifted variant NIBRG-23. Moreover, s.l. (and i.m.) immunization with NIBRG-14 also primed for a subsequent heterologous i.m. booster immunization with NIBRG-23 vaccine. In addition to HI serum antibodies, s.l. priming enhanced lung and nose IgA responses, while i.m. priming enhanced lung IgA but not nose IgA levels. Our results identify s.l. vaccination as a user-friendly method to prime for influenza-specific immune responses toward homologous and drifted variants.
Algorithm 813: SPG—Software for Convex-Constrained Optimization

Fortran 77 software implementing the SPG method is introduced. SPG is a nonmonotone projected gradient algorithm for solving large-scale convex-constrained optimization problems. It combines the classical projected gradient method with the spectral gradient choice of steplength and a nonmonotone line-search strategy. The user provides objective function and gradient values, and projections onto the feasible set. Some recent numerical tests are reported on very large location problems, indicating that SPG is substantially more efficient than existing general-purpose software on problems for which projections can be computed efficiently.
Model companion of ordered theories with an automorphism

Kikyo and Shelah showed that if $T$ is a theory with the Strict Order Property in some first-order language $\mathcal{L}$, then in the expanded language $\mathcal{L}_\sigma := \mathcal{L}\cup\{\sigma\}$ with a new unary function symbol $\sigma$, the bigger theory $T_\sigma := T\cup\{``\sigma \mbox{is an} \mathcal{L}\mbox{-automorphism''}\}$ does not have a model companion. We show in this paper that if, however, we restrict the automorphism and consider the theory $T_\sigma$ as the base theory $T$ together with a ``restricted'' class of automorphisms, then $T_\sigma$ can have a model companion in $\mathcal{L}_\sigma$. We show this in the context of linear orders and ordered abelian groups.
Personalized Searching for Web Service Using User Interests

Users usually have different prospective even they input a same keyword to search Web services. It is a challenge to personalize web service search engine as more and more keyword-like Web services becoming available on Internet. User interest plays an important role in personalizing search result. Therefore, through interest extraction, Web service search engine is personalized. At last, an experiment is presented to demonstrate the feasibility of the method.
The neural correlates of effort-related and effort-unrelated fatigue in patients with multiple sclerosis

Background: Among patients with multiple sclerosis (MS) fatigue is the most commonly reported symptom. It can be subdivided into an effort-dependent (fatigability) and an effort-independent component (trait-fatigue). Objective: The objective was to disentangle activity changes associated with effort-independent “trait-fatigue”, from those associated with effort-dependent fatigability in patients with MS. Methods: The current study employed behavioral measures and functional magnetic imaging to investigate neural changes in patients with MS associated with fatigue. Forty patients with MS and twenty-two age-matched healthy controls performed in a fatigue-inducing N-back task. Effort-independent fatigue was assessed using the fatigue scale of motor and cognition (FSMC) questionnaire. Results: Effort-independent fatigue was observed to be reflected by activity increases in fronto-striatal-subcortical networks primarily involved in the maintenance of homeostatic processes and in motor and cognitive control. Effort-dependent fatigue (fatigability) lead to activity decreases in attention-related cortical and subcortical networks. Conclusion: These results indicate that effort-independent (fatigue) and effort-dependent fatigue (fatigability) in patients with MS have functionally related but fundamentally different neural correlates. Fatigue in MS as a general phenomenon is reflected by complex interactions of activity increases in control networks (effortindependent component) and activity reductions in executive networks (effort-dependent component) of
Line feature detection from 3D point clouds via adaptive CS-RBFs shape reconstruction and multistep vertex normal manipulation

This paper presents a multistep based on vertex normal manipulation method for ridge line detection on 3D surfaces, which is reconstructed from 3D point clouds via adaptive CS-RBF. Based on point density, centers of RBF are randomly chosen from the points. The support size of each RBF is obtained adaptively depending on surface geometry, which surrounds the RBF center. After the reconstructed shape is polygonized, a classification-based method for vertex normal approximation is executed. Searching the entire neighborhood in geodesic distance, we calculate the standard deviation of angles between a vertex and its geodesic neighbors, decide which kind of neighbor can be employed for final normal estimation, with the help of a user-specified parameter. With continuing curvature tensor estimation and ridge vertex evaluation, ridge-valley lines of salient features on polygon meshes are detected. Comparing with common vertex normal approximation, experiment results show that this method works satisfactorily, especially for 3D human faces.
Semantic Memory Architecture for Knowledge Acquisition and Management

Understanding information contained in texts and symbols requires extensive background knowledge. This knowledge is stored in semantic memory. Recently manually created ontologies and dictionaries became very popular but still do not contain sufficient information for many applications, such as semantic search or automatic annotation of concepts. Architecture facilitating knowledge acquisition for common sense semantic memories is presented and an algorithm for playing 20 questions word game used for further verification and acquisition of new knowledge. This approach is then applied to the WordNet database for gathering new and correcting existing knowledge.
Global Deprivation of Brain-Derived Neurotrophic Factor in the CNS Reveals an Area-Specific Requirement for Dendritic Growth

Although brain-derived neurotrophic factor (BDNF) is linked with an increasing number of conditions causing brain dysfunction, its role in the postnatal CNS has remained difficult to assess. This is because the bdnf-null mutation causes the death of the animals before BDNF levels have reached adult levels. In addition, the anterograde axonal transport of BDNF complicates the interpretation of area-specific gene deletion. The present study describes the generation of a new conditional mouse mutant essentially lacking BDNF throughout the CNS. It shows that BDNF is not essential for prolonged postnatal survival, but that the behavior of such mutant animals is markedly altered. It also reveals that BDNF is not a major survival factor for most CNS neurons and for myelination of their axons. However, it is required for the postnatal growth of the striatum, and single-cell analyses revealed a marked decreased in dendritic complexity and spine density. In contrast, BDNF is dispensable for the growth of the hippocampus and only minimal changes were observed in the dendrites of CA1 pyramidal neurons in mutant animals. Spine density remained unchanged, whereas the proportion of the mushroom-type spine was moderately decreased. In line with these in vivo observations, we found that BDNF markedly promotes the growth of cultured striatal neurons and of their dendrites, but not of those of hippocampal neurons, suggesting that the differential responsiveness to BDNF is part of a neuron-intrinsic program.
Query Expansion for Khmer Information Retrieval

This paper presents the proposed Query Expansion (QE) techniques based on Khmer specific characteristics to improve the retrieval performance of Khmer Information Retrieval (IR) system. Four types of Khmer specific characteristics: spelling variants, synonyms, derivative words and reduplicative words have been investigated in this research. In order to evaluate the effectiveness and the efficiency of the proposed QE techniques, a prototype of Khmer IR system has been implemented. The system is built on top of the popular open source information retrieval software library Lucene 1 . The Khmer word segmentation tool (Chea et al., 2007) is also implemented into the system to improve the accuracy of indexing as well as searching. Furthermore, the Google web search engine is also used in the evaluation process. The results show the proposed QE techniques improve the retrieval performance both of the proposed system and the Google web search engine. With the reduplicative word QE technique, an improvement of 17.93% of recall can be achieved to the proposed system.
The complexity hypothesis revisited: connectivity rather than function constitutes a barrier to horizontal gene transfer.

Horizontal gene transfer (HGT) is a prevalent and a highly important phenomenon in microbial species evolution. One of the important challenges in HGT research is to better understand the factors that determine the tendency of genes to be successfully transferred and retained in evolution (i.e., transferability). It was previously observed that transferability of genes depends on the cellular process in which they are involved where genes involved in transcription or translation are less likely to be transferred than metabolic genes. It was further shown that gene connectivity in the protein-protein interaction network affects HGT. These two factors were shown to be correlated, and their influence on HGT is collectively termed the "Complexity Hypothesis". In this study, we used a stochastic mapping method utilizing advanced likelihood-based evolutionary models to quantify gene family acquisition events by HGT. We applied our methodology to an extensive across-species genome-wide dataset that enabled us to estimate the overall extent of transfer events in evolution and to study the trends and barriers to gene transferability. Focusing on the biological function and the connectivity of genes, we obtained novel insights regarding the "complexity hypothesis. " Specifically, we aimed to disentangle the relationships between protein connectivity, cellular function, and transferability and to quantify the relative contribution of each of these factors in determining transferability. We show that the biological function of a gene family is an insignificant factor in the determination of transferability when proteins with similar levels of connectivity are compared. In contrast, we found that connectivity is an important and a statistically significant factor in determining transferability when proteins with a similar function are compared.
Understanding Real World Practices : a Place-Centred Study of Mobile Workers

This paper discusses a case study reflecting on the importance of designing interfaces for specific interactions within specific situations and locations. The study focuses on sales representatives and their work practices during the transition form a paper based system to an electronic system based on a PDA / Phone. We argue that, in order to design effective mobile technologies, it's necessary to go beyond the basic considerations of functionality and even usability of a system. There is a need to focus on en-placed activities according to the features, possibilities and boundaries that each of their work-places offers them.
The use and representational faithfulness of graphs in Australian IPO prospectuses

This paper investigates the use of graphs, selection of variables to graph and construction of graphs in prospectuses issued by Australian companies making their initial public offering (IPO) of shares to the Australian capital market. The paper formulates and tests hypotheses concerning selectivity in the use of graphs and distortion in the construction of graphs presented in IPO prospectuses, as well as providing descriptive evidence about the use of graphs in such prospectuses. Results show that firms enjoying improving profit performance are significantly more likely to include graphs of key financial variables in their prospectuses than firms suffering deteriorating profit performance. Thus, similar to studies of graphs in annual reports, evidence of selectivity in the inclusion of graphs is found. No significant relationship is found between performance on the variable being graphed and distortion in the construction of the graph. When the graphs are split between those covering key financial variables and other variables, a significant relationship is found in both categories. For graphs of other variables, a significant positive association is found between performance and distortion. However, the relationship for key financial variables is in the opposite direction to that suggested by impression management. Further analysis identifies significant sub‐period differences in selectivity and distortion which are consistent with the view that the major regulatory and institutional changes outlined in the paper, reduced the extent of selectivity and graphical distortion in the post‐1991 period. As far as we are aware, this is the first study reported in the literature to investigate the use of graphs in prospectuses. The results also have policy implications for the regulatory authority in Australia.
Inulin/oligofructose and anticancer therapy

The results of our investigations indicate that dietary treatment with inulin or oligofructose incorporated in the basal diet for experimental animals: (i) reduced the incidence of mammary tumors induced in Sprague-Dawley rats by methylnitrosourea; (ii) inhibited the growth of transplantable malignant tumors in mice; and (iii) decreased the incidence of lung metastases of a malignant tumor implanted intramuscularily in mice. Moreover, besides such cancer risk reduction effects, the dietary treatment with inulin or oligofructose significantly potentiated the effects of subtherapeutic doses of six different cytotoxic drugs commonly utilized in human cancer treatment. If confirmed, such dietary treatment with inulin or oligofructose potentiating cancer therapy might become an interesting approach to complement classical protocols of human cancer treatment without any additional risk for the patients.
Charles A . Dice Center for Research in Financial Economics Why are Buyouts Levered ? The Financial Structure of Private Equity Funds

Private equity funds are important actors in the economy, yet there is little analysis explaining their financial structure. In our model the financial structure minimizes agency conflicts between fund managers and investors. Relative to financing each deal separately, raising a fund where the manager receives a fraction of aggregate excess returns reduces incentives to make bad investments. Efficiency is further improved by requiring funds to also use deal-by-deal debt financing, which becomes unavailable in states where internal discipline fails. Private equity investment becomes highly sensitive to economy-wide availability of credit and investments in bad states outperform investments in good states. Practitioner: “Things are really tough because the banks are only lending 4 times cash flow, when they used to lend 6 times cash flow. We can’t make our deals profitable anymore. ” Academic: “Why do you care if banks will not lend you as much as they used to? If you are unable to lever up as much as before, your limited partners will receive lower expected returns on any given deal, but the risk to them will have gone down proportionately. ” Practitioner: “Ah yes, the Modigliani-Miller theorem. I learned about that in business school. We don’t think that way at our firm. Our philosophy is to lever our deals as much as we can, to give the highest returns to our limited partners. ” Private equity funds are responsible for an enormous quantity of investment in the economy. From 2005 through June 2007, CapitalIQ recorded a total of 5,188 buyout transactions at a combined estimated enterprise value of over $1.6 trillion (Kaplan and Strömberg (forthcoming)). Private equity investments are now of major importance not just in the United States, but internationally ∗Ulf Axelson is with the Stockholm School of Economics and SIFR, Per Strömberg is with the Stockholm School of Economics, SIFR, CEPR, and NBER, and Michael S. Weisbach is with Ohio State University and NBER. We would like to thank an anonymous referee, Diego Garcia, Campbell Harvey (the editor), Bengt Holmström, Antoinette Schoar, and Jeremy Stein (the associate editor) for helpful comments, and seminar participants at Amsterdam, Berkeley, Boston College, CEPR Summer Institute 2005, Chicago, ECB-CFS, Emory, Harvard, Helsinkin School of Economics, HKUST, Illinois, INSEAD, MIT, NBER 2005, Norwegian School of Economics, NYU, Oxford, ParisDauphine University, Rutgers, SSE Riga, Stockholm School of Economics, Texas, Vanderbilt, Stockholm University, Virginia, Washington University, and WFA Meetings 2005.
Using the MegaBlock to Partition and Optimize Programs for Embedded Systems at Runtime

This paper presents our recent research efforts addressing the dynamic mapping of sections of execution to a coarse-grained reconfigurable array (CGRA) coupled to a General Purpose Processor (GPP). We are considering the common scenario of a GPP - a RISC processor - using the CGRA as a co-processor to speedup applications. We present a partitioning scheme based on large traces of instructions (named Megablock). We show estimations of the speedups achieved by considering the Megablock. Resumo. Este artigo apresenta os nossos esforcos mais recentes em relacao ao mapeamento dinâmico de seccoes de programas a correr em processadores de âmbito geral (GPPs) para agregados reconfiguraveis de grao grosso (CGRAs). Na abordagem actual consideramos um cenario em que temos um GPP - processador RISC - que utiliza um CGRA como co-processador para acelerar aplicacoes. Apresentamos um metodo de particionamento baseado em grandes blocos de instrucoes (denominados MegaBlocos) e mostramos valores estimados de aceleracoes do tempo de execucao quando se considera o MegaBloco como unidade de particao.