ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (711,273)
  • Latest Papers from Table of Contents or Articles in Press  (711,273)
  • Computer Science  (711,273)
Collection
  • Articles  (711,273)
Source
Keywords
Publisher
Years
Journal
Topic
  • 1
    facet.materialart.
    Unknown
    Towards a holistic semantic support for context-aware network monitoring (2020)
    Springer
    Details
    Publication Date: 2020-08-25
    Print ISSN: 0010-485X
    Electronic ISSN: 1436-5057
    Topics: Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 2
    facet.materialart.
    Unknown
    Strongly Possible Keys for SQL (2020)
    Springer
    Details
    Publication Date: 2020-08-25
    Description: Missing data value is an extensive problem in both research and industrial developers. Two general approaches are there to deal with the problem of missing values in databases; they could be either ignored (removed) or imputed (filled in) with new values (Farhangfar et al. in IEEE Trans Syst Man Cybern-Part A: Syst Hum 37(5):692–709, 2007). For some SQL tables, it is possible that some candidate key of the table is not null-free and this needs to be handled. Possible keys and certain keys to deal with this situation were introduced in Köhler et al. (VLDB J 25(4):571–596, 2016). In the present paper, we introduce an intermediate concept called strongly possible keys that is based on a data mining approach using only information already contained in the SQL table. A strongly possible key is a key that holds for some possible world which is obtained by replacing any occurrences of nulls with some values already appearing in the corresponding attributes. Implication among strongly possible keys is characterized, and Armstrong tables are constructed. An algorithm to verify a strongly possible key is given applying bipartite matching. Connection between matroid intersection problem and system of strongly possible keys is established. For the cases when no strongly possible keys hold, an approximation notion is introduced to calculate the closeness of any given set of attributes to be considered as a strongly possible key using the $$g_3$$ g 3 measure, and we derive its component version $$g_4$$ g 4 . Analytical comparisons are given between the two measures.
    Print ISSN: 1861-2032
    Electronic ISSN: 1861-2040
    Topics: Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 3
    facet.materialart.
    Unknown
    Club Characteristic and the Proximity Effect of Travel Links between Cities in China (2020)
    Hindawi
    Details
    Publication Date: 2020-08-25
    Description: With the increasingly close relations between cities in China, it is of great significance to explore the regular characteristics of the intercity connection. Through Tencent’s population migration heat and Baidu map big data, this paper analyzes the regular characteristics of the relations between complex cities based on such index as the rich node propensity index, preference level index, and relative heat index and also investigates the influence of geographical proximity factors on the external relations of different cities. The research has the following results. Firstly, the relations between cities have obvious club characteristics. The rich nodes tend to connect with the rich nodes, while the nonrich nodes tend to connect with the nonrich nodes. Secondly, the connection between cities has the effect of hierarchical proximity, and cities mainly establish spatial connections with cities of the same level and adjacent level. Thirdly, the relations between cities also have the effect of geographical proximity, and the degree of influence of geographical proximity in low-level cities is greater than that in high-level cities. Fourthly, the external connection mode of high-level cities is to establish close contact with high-level cities adjacent to the level, with strong attraction to low-level cities adjacent to the location at the same time. The low-level cities are closely related to the high-level cities adjacent to the location and other cities of geographical proximity or adjacent level. This study helps to further understand the complex characteristics and laws of intercity connections and urban networks.
    Print ISSN: 1076-2787
    Electronic ISSN: 1099-0526
    Topics: Computer Science , Mathematics
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 4
    facet.materialart.
    Unknown
    Deep Learning Algorithm for Brain-Computer Interface (2020)
    Hindawi
    Details
    Publication Date: 2020-08-25
    Description: Electroencephalography-(EEG-) based control is a noninvasive technique which employs brain signals to control electrical devices/circuits. Currently, the brain-computer interface (BCI) systems provide two types of signals, raw signals and logic state signals. The latter signals are used to turn on/off the devices. In this paper, the capabilities of BCI systems are explored, and a survey is conducted how to extend and enhance the reliability and accuracy of the BCI systems. A structured overview was provided which consists of the data acquisition, feature extraction, and classification algorithm methods used by different researchers in the past few years. Some classification algorithms for EEG-based BCI systems are adaptive classifiers, tensor classifiers, transfer learning approach, and deep learning, as well as some miscellaneous techniques. Based on our assessment, we generally concluded that, through adaptive classifiers, accurate results are acquired as compared to the static classification techniques. Deep learning techniques were developed to achieve the desired objectives and their real-time implementation as compared to other algorithms.
    Print ISSN: 1058-9244
    Electronic ISSN: 1875-919X
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 5
    facet.materialart.
    Unknown
    A Game Mechanism of Individual Value Decision-Making Based on SVO Differences (2020)
    Hindawi
    Details
    Publication Date: 2020-08-25
    Description: As the externalized carrier of intrinsic value, value decision-making is an important factor affecting the social value system. As an old Chinese saying goes, “A friend in need is a friend indeed,” crisis environment provides the background for the conflicts of multiple values, while individual social value orientation (SVO) determines the ranking of the value states. This paper defined the SVO types by means of Slider Measure method on the basis of environment description, constructed a decision-making game model in accordance with SVO differences, and finally analysed the mechanism of people’s decision-making. Taking the epidemic situation as the background, this paper conducted an empirical analysis with the sample of college students. The results showed that the most SVO types of college students were prosocial orientation, followed by individualistic orientation, altruistic orientation, and competitive orientation. In the crisis environment, individual SVO type and decision-making constituted a mapping relationship. There was an equilibrium point in the decision of prosocial orientation, and the dominant decision of altruistic orientation or individualistic orientation is relatively stable.
    Print ISSN: 1076-2787
    Electronic ISSN: 1099-0526
    Topics: Computer Science , Mathematics
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 6
    facet.materialart.
    Unknown
    Short-Term Passenger Flow Forecast of Rail Transit Station Based on MIC Feature Selection and ST-LightGBM considering Transfer Passenger Flow (2020)
    Hindawi
    Details
    Publication Date: 2020-08-25
    Description: To solve the problems of current short-term forecasting methods for metro passenger flow, such as unclear influencing factors, low accuracy, and high time-space complexity, a method for metro passenger flow based on ST-LightGBM after considering transfer passenger flow is proposed. Firstly, using historical data as the training set to transform the problem into a data-driven multi-input single-output regression prediction problem, the problem of the short-term prediction of metro passenger flow is formalized and the difficulties of the problem are identified. Secondly, we extract the candidate temporal and spatial features that may affect passenger flow at a metro station from passenger travel data based on the spatial transfer and spatial similarity of passenger flow. Thirdly, we use a maximal information coefficient (MIC) feature selection algorithm to select the significant impact features as the input. Finally, a short-term forecasting model for metro passenger flow based on the light gradient boosting machine (LightGBM) model is established. Taking transfer passenger flow into account, this method has a low space-time cost and high accuracy. The experimental results on the dataset of Lianban metro station in Xiamen city show that the proposed method obtains higher prediction accuracy than SARIMA, SVR, and BP network.
    Print ISSN: 1058-9244
    Electronic ISSN: 1875-919X
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 7
    facet.materialart.
    Unknown
    Structure and Dynamic of Global Population Migration Network (2020)
    Hindawi
    Details
    Publication Date: 2020-08-25
    Description: People are the most important factors of economy and the primary carriers of social culture. Cross-border migration brings economic and cultural impacts to the origin and destination and is also a key to reflect the international relations of related countries. In fact, the migration relationships of countries are complex and multilateral, but most traditional migration models are bilateral. Network theories could provide a better description of global migration to show the structure and statistical characteristics more clearly. Based on the estimated migration data and disparity filter algorithm, the networks describing the global multilateral migration relationships have been extracted among 200 countries over fifty years. The results show that the global migration networks during 1960–2015 exhibit a clustering and disassortative feature, implying globalized and multipolarized changes of migration during these years. The networks were embed into a Poincaré disk, yielding a typical and hierarchical “core-periphery” structure, which is associated with angular density distribution, and has been used to describe the “multicentering” trend since 1990s. Analysis on correlation and evolution of communities indicates the stability of most communities, yet some structural changes still exist since 1990s, which reflect that the important historical events are contributable to regional and even global migration patterns.
    Print ISSN: 1076-2787
    Electronic ISSN: 1099-0526
    Topics: Computer Science , Mathematics
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 8
    facet.materialart.
    Unknown
    Representation Learning of Knowledge Graphs with Embedding Subspaces (2020)
    Hindawi
    Details
    Publication Date: 2020-08-25
    Description: Most of the existing knowledge graph embedding models are supervised methods and largely relying on the quality and quantity of obtainable labelled training data. The cost of obtaining high quality triples is high and the data sources are facing a serious problem of data sparsity, which may result in insufficient training of long-tail entities. However, unstructured text encoding entities and relational knowledge can be obtained anywhere in large quantities. Word vectors of entity names estimated from the unlabelled raw text using natural language model encode syntax and semantic properties of entities. Yet since these feature vectors are estimated through minimizing prediction error on unsupervised entity names, they may not be the best for knowledge graphs. We propose a two-phase approach to adapt unsupervised entity name embeddings to a knowledge graph subspace and jointly learn the adaptive matrix and knowledge representation. Experiments on Freebase show that our method can rely less on the labelled data and outperforms the baselines when the labelled data is relatively less. Especially, it is applicable to zero-shot scenario.
    Print ISSN: 1058-9244
    Electronic ISSN: 1875-919X
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 9
    facet.materialart.
    Unknown
    Model for Design of Portfolio Venture Investment Contract When Taking Moral Hazards into Account (2020)
    Hindawi
    Details
    Publication Date: 2020-08-25
    Description: Portfolio investment is adopted by the venture capital to diversify those risks involved in project selection, investing or operating so that the venture capitalist can expect a relatively stable income and lower financing risks. Based on the design of portfolio investment contract with unlimited funds developed by Kanniainen and Keuschnigg, and Inderst et al., this article makes a modification and presents a model given the limitation of funds available for the venture capitalist. It is demonstrated that the marginal benefit of efforts paid by the entrepreneurs exceeds the marginal cost, given the limitation of funds available, which will conduce to a high-level engagement of the entrepreneurs. Thus, by adopting the design of renegotiation contract, the venture capitalist can manage to stimulate the entrepreneurs to make efforts, which is to result in moral hazard reduction.
    Print ISSN: 1058-9244
    Electronic ISSN: 1875-919X
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 10
    facet.materialart.
    Unknown
    Sentence Embedding Based Semantic Clustering Approach for Discussion Thread Summarization (2020)
    Hindawi
    Details
    Publication Date: 2020-08-25
    Description: Huge data on the web come from discussion forums, which contain millions of threads. Discussion threads are a valuable source of knowledge for Internet users, as they have information about numerous topics. The discussion thread related to single topic comprises a huge number of reply posts, which makes it hard for the forum users to scan all the replies and determine the most relevant replies in the thread. At the same time, it is also hard for the forum users to manually summarize the bulk of reply posts in order to get the gist of discussion thread. Thus, automatically extracting the most relevant replies from discussion thread and combining them to form a summary are a challenging task. With this motivation behind, this study has proposed a sentence embedding based clustering approach for discussion thread summarization. The proposed approach works in the following fashion: At first, word2vec model is employed to represent reply sentences in the discussion thread through sentence embeddings/sentence vectors. Next, K-medoid clustering algorithm is applied to group semantically similar reply sentences in order to reduce the overlapping reply sentences. Finally, different quality text features are utilized to rank the reply sentences in different clusters, and then the high-ranked reply sentences are picked out from all clusters to form the thread summary. Two standard forum datasets are used to assess the effectiveness of the suggested approach. Empirical results confirm that the proposed sentence based clustering approach performed superior in comparison to other summarization methods in the context of mean precision, recall, and F-measure.
    Print ISSN: 1076-2787
    Electronic ISSN: 1099-0526
    Topics: Computer Science , Mathematics
    Published by Hindawi
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...