Miracle-dz/UniFAR-FTUs huggingface dataset:
Kobe University at TRECVID 2011 Semantic Indexing and Multimedia Event Detection

This paper describes our methods and experimental results for TRECVID 2011 SIN and MED tasks. For SIN task, we submitted the run L A cs24 kobe sin 1 that addresses the following two problems: The first one is an expensive computation cost for constructing an SVM with a large number of examples. To ensure the detection accuracy and speed for each concept, we developed a method that selects a small number of negative examples similar to positive examples. Such negative examples are useful for characterizing the decision boundary between shots where the concept is present and shots where it is absent. The second problem is a large variety of shots where the concept is present, due to varied camera techniques and setting. Only using a single classifier is insufficient for covering such a large variety of shots. Hence, we used rough set theory to extract multiple classification rules, that characterize different subsets of positive examples. Although the evaluation result of L A cs24 kobe sin 1 was not very good, we found that one main reason is overfitting of classification rules extracted by RST. For MED task, we aim to examine the applicability of virtual reality techniques to event detection. It is laborious and timeconsuming to collect a sufficient number of positive examples for an event. To overcome this, we create virtual examples using virtual reality techniques. We developed a method that creates virtual examples by synthesizing user’s gesture, 3D object and background images. In order to evaluate the effectiveness of this approach, we submitted two runs, c real (cs24kobe MED11 MED11TEST MEDPart SemiAutoEAG c-real) and p virtual (cs24-kobe MED11 MED11TEST MEDPart SemiAutoEAG p-virtual). c real only uses positive examples that are selected from training videos. On the other hand, p virtual uses virtual examples in addition to positive examples used in c real. Detection error tradeoff curves of c real and p virtual indicate the effectiveness of virtual examples.
FOR A FEEDBACK-CONTROLLED MULTIMEDIA TRANSMISSION SYSTEM

Multimedia transmissions over IP networks have increased significantly in recent years. Both user expectations and traffic levels have increased as well. One way to take these into account is for senders to receive and respond to feedback about the quality of their transmissions. We have built a feedback controlled multimedia transmission system, and we have tested and analysed the influence of various factors on transmission performance. This paper presents the results of some of these tests, and suggests some solutions for improving the quality of multimedia transmissions under network congestion.
Computing Cycle Covers without Short Cycles Computing Cycle Covers without Short Cycles

A cycle cover of a graph is a spanning subgraph where each node resides in exactly one cycle. A k-cycle cover is a cycle cover where each cycle has at least length k. k-DCC resp. k-UCC are the decision problems whether a directed resp. undirected graph has a k-cycle cover. Given a graph with edge weights one and two, Mink -DCC and Mink -UCC are the minimization problems of nding a k-cycle cover with minimum weight. We present a factor 4=3 approximation algorithm for Mink -DCC that runs in time O(n 5=2) (independent of k). Speciically, we obtain a factor 4=3 approximation algorithm for the asymmetric travelling salesperson problem with distances one and two and a factor 2=3 approximation algorithm for the directed maximum path packing problem with the same running time. On the other hand, we show that k-DCC is NP-complete for k 3 and Mink -DCC has no PTAS for k 4, unless P = NP. Furthermore, we design a polynomial time factor 7=6 approximation algorithm for Mink -UCC. As a lower bound, we prove that Mink -UCC has no PTAS for k 12, unless P = NP.
Automatic facades segmentation using detected lines and vanishing points

Segmenting facades from buildings is important to a variety of vision applications operating in outdoor urban environments which include image-based modeling, landmark recognition, autonomous navigation and urban scene understanding. Existing method based on Structure-from-Motion relies on multiple images, and the cost of computation is high, while another method based on prior knowledge about arbitrarily shaped repetitive regions cannot handle non-repetitive facades segmentation. In order to segment facades simply, fast and accurately, we propose an automatic algorithm for facade segmentation, which segments building to a set of separate facades. By first detecting line segments and corresponding vanishing points from a single image, then rectifying the image to make the vertical direction be parallel to y-direction of the image, we convert the facade-segmentation problem to a simple 1D segmentation. The experiment results show that our method is accurate, robust and efficient to facades segmentation problem.
Alternate Query Construction Agent for Improving Web Search Result Using WordNet

Traditional information retrieval systems lack consistent semantic description of information i.e. they fail to meet users' need due to lack of applying semantic identification to extract the information from the available information. Use of semantic equivalent of the user query will improve the efficiency of the search. In this paper, we propose a framework for semantic based information retrieval. Here we find the concepts that user specify in their query by analyzing the semantic equivalencies. The result which is a set of alternate queries to the main search query is then compared with the existing keyword based system's result. Then, according to the alternate queries' search results, the main queries result gets rearranged by assigning new weights. We further personalize the search and then re-rank the results on user preference. The proposed semantic retrieval model is combined with keyword based model to achieve completeness of the knowledge base. The model which we propose is helping to project the most relevant result URLs to the higher ranks.
Automatically identifying the sources of large Internet events

The Internet occasionally experiences large disruptions, arising from both natural and manmade disturbances, and it is of significant interest to develop methods for locating within the network the source of a given disruption (i.e., the network element(s) whose perturbation initiated the event). This paper presents a near real-time approach to realizing this logical localization objective. The proposed methodology consists of three steps: 1. ) data acquisition/preprocessing, in which publicly available measurements of Internet activity are acquired, “cleaned”, and assembled into a format suitable for computational analysis, 2. ) event characterization via tensor factorization-based time series analysis, and 3. ) localization of the source of the disruption through graph theoretic analysis. This procedure provides a principled, automated approach to identifying the root causes of network disruptions at “whole-Internet” scale. The considerable potential of the proposed analytic method is illustrated through a computer simulation study and empirical analysis of a recent, large-scale Internet disruption.
Efficient implementation of fingerprint verification for mobile embedded systems using fixed-point arithmetic

Fingerprint sensors are getting small enough to be included in mobile devices to enable fingerprint verification be employed as an authentication tool when using the mobile devices for secure transactions. Fingerprint verification, however, is a computing intensive technology that requires a lot of floating-point computation. Unfortunately, the embedded processors in most mobile devices do not support floating-point hardware. In this paper, we present the implementation of a fingerprint verification process in an embedded system environment based the StrongArm processor and the embedded Linux operating system. The success of the implementation relies on the use of a fixed-point arithmetic only. The fingerprint verification component, the fixed-point component as well as the technique employed to pair up the two components are described in details. In particular, we estimated the required precisions in the fixed-point representations before conducting experiments. Through our results, we further show that not only the fixed-point implementation achieves the goal of significant speed improvement but is almost as reliable as the floating-point counterparts.
Implication of the env gene of the human endogenous retrovirus W family in the expression of BDNF and DRD3 and development of recent-onset schizophrenia.

OBJECTIVE Retrovirus has been suggested as one of agents involved in the development of schizophrenia. In the present study, we examined the role of the human endogenous retrovirus W family (HERV-W) env gene in the etiopathogenesis of recent-onset schizophrenia, using molecular and epidemiological approaches. METHODS Nested RT-PCR was used to detect the messenger RNA (mRNA) of the HERV-w env gene in plasmas. Quantitative real-time polymerase chain reaction (PCR) was employed to detect the viral reverse transcriptase activity in human sera. Human U251 glioma cells were used to study the potential role of the HERV-W env gene in the etiopathogenesis of recent-onset schizophrenia. RESULTS We identified genes with mRNA sequences homologous to HERV-W env gene from plasmas of 42 out of 118 individuals with recent-onset schizophrenia but not from any of 106 normal persons (P < .01, t test). Quantitative real-time PCR showed a significantly increase in the reverse transcriptase activity in the sera of patients (by 35.59%) compared with controls (by 2.83%) (P < .05, t test). Overexpression of HERV-w env in human U251 glioma cells upregulated brain-derived neurotrophic factor (BDNF), an important schizophrenia-associated gene, neurotrophic tyrosine kinase receptor type 2 (NTRK2, also called TrkB), and dopamine receptor D3 and increased the phosphorylation of cyclic adenosine monophosphate response element-binding (CREB) protein. BDNF promoter reporter gene assays showed that the HERV-W env triggers BDNF production in human U251 glioma cells. Using gene knockdown, we found that CREB is required for the expression of BDNF that is regulated by env. CONCLUSION Our data revealed that the transcriptional activation of HERV is associated with the development of schizophrenia in some patients and indicated that HERV-W env regulates the expression of schizophrenia-associated genes. This report is the first to elucidate the signaling pathway responsible for the upregulation of HERV-W env-triggered BDNF. Our study provides new evidence for the involvement of HERV-W in the central nervous system, which will benefit the diagnosis and treatment of the devastating schizophrenia and related disorders.
ROTATIONAL VARIABILITY OF EARTH'S POLAR REGIONS: IMPLICATIONS FOR DETECTING SNOWBALL PLANETS

We have obtained the first time-resolved, disk-integrated observations of Earth's poles with the Deep Impact spacecraft as part of the EPOXI mission of opportunity. These data mimic what we will see when we point next-generation space telescopes at nearby exoplanets. We use principal component analysis (PCA) and rotational light curve inversion to characterize color inhomogeneities and map their spatial distribution from these unusual vantage points, as a complement to the equatorial views presented by Cowan et al. in 2009. We also perform the same PCA on a suite of simulated rotational multi-band light curves from NASA's Virtual Planetary Laboratory three-dimensional spectral Earth model. This numerical experiment allows us to understand what sorts of surface features PCA can robustly identify. We find that the EPOXI polar observations have similar broadband colors as the equatorial Earth, but with 20%–30% greater apparent albedo. This is because the polar observations are most sensitive to mid-latitudes, which tend to be more cloudy than the equatorial latitudes emphasized by the original EPOXI Earth observations. The cloudiness of the mid-latitudes also manifests itself in the form of increased variability at short wavelengths in the polar observations and as a dominant gray eigencolor in the south polar observation. We construct a simple reflectance model for a snowball Earth. By construction, our model has a higher Bond albedo than the modern Earth; its surface albedo is so high that Rayleigh scattering does not noticeably affect its spectrum. The rotational color variations occur at short wavelengths due to the large contrast between glacier ice and bare land in those wavebands. Thus, we find that both the broadband colors and diurnal color variations of such a planet would be easily distinguishable from the modern-day Earth, regardless of viewing angle.
Incremental stock time series data delivery and visualization

SB-Tree is a binary tree data structure proposed to represent time series according to the importance of data points. Its use in stock data management is distinguished by preserving the critical data points' attribute values, retrieving time series data according to the importance of data points and facilitating multi-resolution time series retrieval. As new stock data are available continuously, an effective updating mechanism for SB-Tree is needed. In this paper, a study of different updating approaches is reported. Three families of updating methods are proposed. They are periodic rebuild, batch update and point-by-point update. Their efficiency, effectiveness and characteristics are compared and reported.
Performance comparison of binaural beamforming and MWF-based noise reduction algorithms for hearing aids

Noise reduction algorithms in hearing aids are crucial to improve speech understanding in background noise for hearing-impaired persons. For binaural hearing aids multi-microphone algorithms, exploiting signals from both the left and the right hearing aid, are considered to be promising techniques for noise reduction, because in addition to spectral information spatial sound information can be exploited. The performance of these algorithms however highly depends on prior assumptions about the acoustic environment and/or estimates of the signal statistics. In this paper the performance of 3 algorithms for a simulated everyday situation has been investigated using objective and subjective performance measures.
Modified Matching Pursuit based channel estimation for ISDB-T

This paper demonstrates a new approach in reliable channel estimation for Integrated Services Digital Broadcasting Terrestrial (ISDB-T) using Modified Matching Pursuit Algorithm (MMP). The assumption is that the channel characteristic of the succeeding symbols does have correlation with the adjacent symbols. The Matching Pursuit (MP) is used first for solving the channel estimation of the first symbol, and then a proposed MMP is used for succeeding symbol based on the last estimate of the MP. The result of the simulation shows that the MMP was able to validate decent channel estimation with reduced computational cost.
Music therapy in the psychosocial rehabilitation of people with epilepsy

The article presents a pilot study analysing the application of music therapy in the today’s psychosocial rehabilitation of people with epilepsy. The study is based on the analysis of the up-to-date application of music therapy in psychosocial rehabilitation, outcomes of epilepsy and special needs of people with this disorder. The analysis serves as a basis for making the assumption that music therapy is an effective measure addressing psychosocial issues of patients suffering from epilepsy. To achieve the objective set, an on-line survey method was used. A questionnaire was sent to the European Confederation of Music Therapy, the International Fellowship in Music Therapy for Neuro-disability, and several members of the World Federation of Music Therapy. It is difficult to formulate final conclusions about the today’s role of music therapy in the psychosocial rehabilitation of people suffering from epilepsy on the basis of this study as the sample is not representative. The analysis of literature and the results of the survey prove the issue of the role of music therapy in the psychosocial rehabilitation of epileptic people to be complex. The service of music therapy should be integrated into health promotion programmes focused on meeting special needs of people with epilepsy and implemented by an interdisciplinary team. Music therapy is applied specifically and diversely subject to symptoms of the disorder and the therapeutic objectives set. Crystallising the specificity of the application of music therapy in this context requires further research.
Precision Medicine and Advancing Genetic Technologies—Disability and Human Rights Perspectives

Scientific and technological developments are propelling genetics and genetic technologies into the public sphere. Scientific and technological innovation is becoming more refined, resulting in an increase in the availability and use of genetic testing, and other cutting edge genetic technologies, including gene editing. These genetic advances not only signal a growing trend towards precision medicine, but also provoke consideration of the protection of genetic information as an emerging human rights concern. Particular ethical and legal issues arise from a disability perspective, including the potential for discrimination and privacy violations. In consideration of the intersection of genetics and disability, this article highlights the significant concerns raised as genetic science and technology advances, and the consequences for disability rights, particularly the core concepts of non-discrimination, and respect for diversity and difference. On examining international human rights perspectives, it looks particularly at the UN Convention on the Rights of Persons with Disabilities and how it may be used to guide best practice in this area. With an acknowledgement of historical abuses of genetic science, this article highlights the need to maintain caution as to the potential consequences of advancing genetic technologies on persons with disabilities and indeed on society as a whole.
A high-performance, transactional filestore for application servers

There is a class of data, including messages and business workflow state, for which conventional monolithic databases are less than ideal. Performance and scalability of Application Server systems can be dramatically increased by distributing such data across transactional filestores, each of which is bound to a server instance in a cluster. This paper describes a high-performance, transactional filestore that has been developed for the BEA WebLogic Application ServerTM and benchmarks it against a database. The filestore uses a novel, platform-independent disk scheduling algorithm to minimize the latency of small, synchronous writes to disk.
Relation-Wise Automatic Domain-Range Information Management for Knowledge Entries

Relations play a vital role on knowledge construction and maintenance thereof. They for example connect domain type entities to range type entities, like the relation born in connects some Persons to some Places. Over any dataset, the domain-range information is used to maintain data consistency. Therefore, we see that knowledge construction frameworks sometime engage costly Knowledge Engineers to define the domain-range information in form of a schema or an ontology. We also see that frameworks that hold such defined domain-range information, often do not follow them strictly. In the worst case some frameworks do not even allow to define a domain-range, rather they just gather the knowledge entries. One reason of not defining the domain-range information is that it is costly. On the other hand, the reason for not following the domain-range constraint is that the most of them are either manual or semi-automatic, therefore they face adaptation difficulty. In this research, we propose a relation-wise machine learning model that can define and validate domain-range information automatically. The initial experiment shows that the proposed framework performs promisingly.
Trends in Web Mining for Personalization

Web mining has matured as a field of basic and applied research in computer science in general and e-commerce in particular. In the last decade, WWW has emerged as an all encompassing technology that has revolutionized the way people live. Web browsing has become an integral part of their lifestyle. This need has led to rise of range of technologies that overcome the information overload problem on the web, which is termed as personalization of the web. In this paper, we present a survey that gives a precise and comprehensive understanding of work done in the last five years in the field of personalization. The paper reviews how each of the approaches cater to user needs and give examples of projects associated with some of these techniques. The paper also mentions few issues for further research in this domain, based on the survey. In the end, paper concludes citing a promising future of this area of research. I. Introduction With the growth of World Wide Web and the range of services available which are cheap, fast and efficient, people are hooked on the internet like never before. The use of internet has been increasing with a remarkable speed. As such, the need to provide coherent, comprehendible and easy to use information has become a necessity for every vendor on the internet who is providing such services. This need has led to the rise in a range of technologies that cater to such requirements, prominent of which is web mining. Web Mining is essentially the enhancement of data mining techniques (such as association, clustering and classification) and other newly devised techniques to cope with the complex data that is available on the web. It then discovers and analyzes patterns that could be useful for the vendor as well as the user. This is the essence of many research efforts going in this direction. There are a range of application provided by web mining techniques like system improvement, site modification, business intelligence and personalization. Personalization among them is one of the widely researched and commercially functional applications. This is because personalization is an all encompassing process that embeds in itself the usefulness of providing easily comprehended, efficient and required information to the user as well as provides insight to the vendor about how to adapt its site according to the requirement of the user that is in turn beneficial for its business …