Zaloguj się

Gotowe bibliografie tematyczne / Skyline / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Skyline.

Artykuły w czasopismach na temat „Skyline”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 27 stycznia 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Skyline”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Vijaya Saradhi, T., K. Subrahmanyam i Ch V. Phani Krishna. "Computing Subspace Skylines without Dominance Tests Using Set Interaction Approaches". International Journal of Electrical and Computer Engineering (IJECE) 5, nr 5 (1.10.2015): 1188. http://dx.doi.org/10.11591/ijece.v5i5.pp1188-1193.

Pełny tekst źródła

Streszczenie:

Now a day’s preference answering plays major role in all crucial applications. If user wants to find top k–objects from a set of high dimensional data based on any monotonic function requires huge computation. One of the promising methods to compute preference set is <em>Skyline Technology.</em> Sky line computation returns the set objects that are not overruled by any other objects in n a multi dimensional space. If data is high dimensional, different users requests sky line set based on different dimensions. It requires subspace skyline computation. If objects are d-dimensional we need to compute skyline sets in 2d<sup> </sup>different subspaces, called as SKYLINE CUBE computation, which incurs lot of computation cost. In this paper we address the problem of finding subspace skyline computation with minimum effort by using simple set interaction methods. By that we can decrease the number of subspace skylines need to be searched to find full sky cube. In this paper we developed one algorithm which uses Boolean algebra rules, skyline lattice to reduce dominance test for preparing sub space skylines.

Style APA, Harvard, Vancouver, ISO itp.

2

Sessions, John, Kevin Lyons i Jeff Wimer. "Maximizing the Standing Skyline Log Load Using a Variable Length Tagline". Forests 12, nr 7 (15.07.2021): 927. http://dx.doi.org/10.3390/f12070927.

Pełny tekst źródła

Streszczenie:

The standing skyline continues to be a common cable logging configuration. In payload analysis it is usually assumed that the tagline (line connecting the logs to the carriage) length is held constant while yarding a turn up the skyline corridor. We show this assumption severely limits the skyline load-carrying capacity for skylines operating with partial suspension. We suggest that smart carriage technology could markedly increase the log load capacity through the use of a variable length tagline, and thus logging productivity. A methodology for estimating the log load capacity for a standing skyline with variable tagline length is presented. We illustrate that increases of 30–40 percent in log load are possible with a variable length tagline.

Style APA, Harvard, Vancouver, ISO itp.

3

Maslovskaya, Oksana, i Grigoriy Ignatov. "Conceptions of Height and Verticality in the History of Skyscrapers and Skylines". E3S Web of Conferences 33 (2018): 01005. http://dx.doi.org/10.1051/e3sconf/20183301005.

Pełny tekst źródła

Streszczenie:

The main goal of this article is to reveal the significance of height and verticality history of skyscrapers and skylines. The objectives are as follows: 1. trace the origin of design concepts related to skyscraper; 2. discuss the perceived experience of the cultural aspects of skyscrapers and skylines; 3. describe the differences and similarities of the profiles of with comparable skylines. The methodology of study is designed to explore the perceived theory and principals of skyscraper and skyline development phenomenon and its key features. The skyscraper reveals an assertive creative form of vertical design. Skyscraper construction also relates to the origin of ancient cultural symbolism as the dominant vertical element as the main features of an ordered space. The historical idea of height reaches back to the earliest civilization such as the Tower of Babel. Philosophical approaches of elements of such post-structuralism have been included in studying of skyscraper phenomenon. The analysis of skyscraper and their resulting skyline are examined to show the connection to their origins with their concepts of height and verticality. From the historical perspective, cities with skyscrapers and a skyline turn out to be an assertive manifestation of common ideas of height and verticality.

Style APA, Harvard, Vancouver, ISO itp.

4

Cooper, Jon. "Fractal assessment of street-level skylines: a possible means of assessing and comparing character". Urban Morphology 7, nr 2 (9.08.2003): 73–82. http://dx.doi.org/10.51347/jum.v7i2.3905.

Pełny tekst źródła

Streszczenie:

Fractal analysis and the calculation of fractal dimension offers the potential for the numerical characterization of places by providing a synthetic measurement of place complexity. This paper provides a fractal analysis of street-scale urban skylines, linking the calculation of fractal dimension to the presence of the physical features making up a skyline. A technique for calculating skyline fractal dimensions is presented and suggestions are made about the use of fractal analysis in comparing the character of places.

Style APA, Harvard, Vancouver, ISO itp.

5

Mologni, Omar, Luca Marchi, Kevin C. Lyons, Stefano Grigolato, Raffaele Cavalli i Dominik Röser. "Skyline Tensile Forces in Cable Logging". Croatian journal of forest engineering 42, nr 2 (14.01.2021): 227–43. http://dx.doi.org/10.5552/crojfe.2021.722.

Pełny tekst źródła

Streszczenie:

Skyline tensile forces have been shown to frequently exceed the recommended safety limits during ordinary cable logging operations. Several models for skyline engineering analyses have been proposed. Although skyline tensile forces assume a dynamic behaviour, practical solutions are based on a static approach without consideration of the dynamic nature of the cable systems.The aim of this study was to compare field data of skyline tensile forces with the static calculations derived by dedicated available software such as SkylineXL. To overcome the limitation of static calculation, this work also aimed to simulate the actual response of the tensile fluctuations measured in the real environment by mean of a finite element model (FEM).Field observations of skyline tensile forces included 103 work cycles, recorded over four different cable lines in standing skyline configuration. Payload estimations, carriages positions, and time study of the logging operations were also collected in the field. The ground profiles and the cable line geometries were analysed using digital elevation models. The field data were then used to simulate the work cycles in SkylineXL. The dynamic response of six fully-suspended loads in a single-span cable line was also simulated by a dedicated FEM built through ANSYS®. The observed data and the software calculations were then compared.SkylineXL resulted particularly reliable in the prediction of the actual tensile forces, with RMSE ranging between 7.5 and 13.5 KN, linked to an average CV(RMSE) of 7.24%. The reliability in predicting the peak tensile forces was lower, reporting CV(RMSE) of 10.12%, but still not likely resulting in a safety or performance problem. If properly set-up and used, thus, SkylineXL could be considered appropriate for operational and practical purposes. This work, however, showed that finite element models could be successfully used for detailed analysis and simulation of the skyline tensile forces, including the dynamic oscillations due to the motion of the carriage and payload along the cable line. Further developments of this technique could also lead to the physical simulation and analysis of the log-to-ground interaction and the investigation of the breakout force during lateral skidding.

Style APA, Harvard, Vancouver, ISO itp.

6

Dong, Lei Gang, i Xiao Wei Cui. "Finding k-Dominant Skyline for Combined Dataset". Applied Mechanics and Materials 568-570 (czerwiec 2014): 1534–38. http://dx.doi.org/10.4028/www.scientific.net/amm.568-570.1534.

Pełny tekst źródła

Streszczenie:

The k-dominant skyline query which can return small result set in high dimensional space is very convenient for user to make decision. But all the existent algorithms are for single dataset, not suitable for two or more datasets being combined. To solve this problem, this paper proposed a new idea to get the newk-dominant skyline by computing the partial points of each dataset based on their existentk-dominant skylines. Furthermore, detailed theoretical analyses and extensive experiments demonstrate that the algorithms can effectively reduce redundant work, and keep the result correctly.

Style APA, Harvard, Vancouver, ISO itp.

7

Alvarez, Ignacio, i Laura Rumbel. "Skyline". International Journal of Mobile Human Computer Interaction 9, nr 3 (lipiec 2017): 34–53. http://dx.doi.org/10.4018/ijmhci.2017070103.

Pełny tekst źródła

Streszczenie:

This paper describes the research and development process of an in-vehicle user experience using Skyline, an automotive prototyping platform created in Intel Labs to empower interaction designers and user experience researches to rapidly and iteratively develop and test in-vehicle user experience concepts. The paper describes the hardware and software components of Skyline in depth and how to configure them to suit individual researcher needs. The paper also presents a case study to exemplify the design making process that Skyline enables. From ideation to use-case creation, prototyping and validation through user assessment, the paper showcases the benefits of capturing early qualitative user feedback as support for rapid prototyping walking through a study titled Agency vs. Control and the associated interactions inside the cockpit. Ten defined use-cases are developed and integrated into a hero scenario in Skyline. High fidelity HMI concepts are tested and validated over the course of six months with feedback from a total of fifty users.

Style APA, Harvard, Vancouver, ISO itp.

8

Battulga, Lkhagvadorj, i Aziz Nasridinov. "Hierarchical Clustering Approach for Selecting Representative Skylines". Information 10, nr 3 (5.03.2019): 96. http://dx.doi.org/10.3390/info10030096.

Pełny tekst źródła

Streszczenie:

Recently, the skyline query has attracted interest in a wide range of applications from recommendation systems to computer networks. The skyline query is useful to obtain the dominant data points from the given dataset. In the low-dimensional dataset, the skyline query may return a small number of skyline points. However, as the dimensionality of the dataset increases, the number of skyline points also increases. In other words, depending on the data distribution and dimensionality, most of the data points may become skyline points. With the emergence of big data applications, where the data distribution and dimensionality are a significant problem, obtaining representative skyline points among resulting skyline points is necessary. There have been several methods that focused on extracting representative skyline points with various success. However, existing methods have a problem of re-computation when the global threshold changes. Moreover, in certain cases, the resulting representative skyline points may not satisfy a user with multiple preferences. Thus, in this paper, we propose a new representative skyline query processing method, called representative skyline cluster (RSC), which solves the problems of the existing methods. Our method utilizes the hierarchical agglomerative clustering method to find the exact representative skyline points, which enable us to reduce the re-computation time significantly. We show the superiority of our proposed method over the existing state-of-the-art methods with various types of experiments.

Style APA, Harvard, Vancouver, ISO itp.

9

Hose, Katja. "Skyline Queries". Datenbank-Spektrum 16, nr 3 (6.07.2016): 247–51. http://dx.doi.org/10.1007/s13222-016-0229-2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Chen, Yi-Chung, i Chiang Lee. "Neural skyline filter for accelerating skyline search algorithms". Expert Systems 32, nr 1 (17.01.2014): 108–31. http://dx.doi.org/10.1111/exsy.12065.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Liu, Jinfei, Juncheng Yang, Li Xiong, Jian Pei, Jun Luo, Yuzhang Guo, Shuaicheng Ma i Chenglin Fan. "Skyline Diagram: Efficient Space Partitioning for Skyline Queries". IEEE Transactions on Knowledge and Data Engineering 33, nr 1 (1.01.2021): 271–86. http://dx.doi.org/10.1109/tkde.2019.2923914.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Lee, Jongwuk, Jinhan Kim i Seung-won Hwang. "Supporting efficient distributed skyline computation using skyline views". Information Sciences 194 (lipiec 2012): 24–37. http://dx.doi.org/10.1016/j.ins.2011.10.009.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

Kalyvas, Christos, i Manolis Maragoudakis. "Skyline and reverse skyline query processing in SpatialHadoop". Data & Knowledge Engineering 122 (lipiec 2019): 55–80. http://dx.doi.org/10.1016/j.datak.2019.04.004.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

Dong, Leigang, Guohua Liu, Xiaowei Cui i Quan Yu. "Efficiently computing Pareto optimal G-skyline query in wireless sensor network". International Journal of Distributed Sensor Networks 17, nr 12 (grudzień 2021): 155014772110606. http://dx.doi.org/10.1177/15501477211060673.

Pełny tekst źródła

Streszczenie:

There are much data transmitted from sensors in wireless sensor network. How to mine vital information from these large amount of data is very important for decision-making. Aiming at mining more interesting information for users, the skyline technology has attracted more attention due to its widespread use for multi-criteria decision-making. The point which is not dominated by any other points can be called skyline point. The skyline consists of all these points which are candidates for users. However, traditional skyline which consists of individual points is not suitable for combinations. To address this gap, we focus on the group skyline query and propose efficient algorithm to computing the Pareto optimal group-based skyline (G-skyline). We propose multiple query windows to compute key skyline layers, then optimize the method to compute directed skyline graph, finally introduce primary points definition and propose a fast algorithm based on it to compute G-skyline groups directly and efficiently. The experiments on the real-world sensor data set and the synthetic data set show that our algorithm performs more efficiently than the existing algorithms.

Style APA, Harvard, Vancouver, ISO itp.

15

Zhao, Xun, Yanhong Wu, Weiwei Cui, Xinnan Du, Yuan Chen, Yong Wang, Dik Lun Lee i Huamin Qu. "SkyLens: Visual Analysis of Skyline on Multi-Dimensional Data". IEEE Transactions on Visualization and Computer Graphics 24, nr 1 (styczeń 2018): 246–55. http://dx.doi.org/10.1109/tvcg.2017.2744738.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Xin, Junchang, Zhiqiong Wang, Mei Bai i Guoren Wang. "Reverse Skyline Computation over Sliding Windows". Mathematical Problems in Engineering 2015 (2015): 1–19. http://dx.doi.org/10.1155/2015/649271.

Pełny tekst źródła

Streszczenie:

Reverse skyline queries have been used in many real-world applications such as business planning, market analysis, and environmental monitoring. In this paper, we investigated how to efficiently evaluate continuous reverse skyline queries over sliding windows. We first theoretically analyzed the inherent properties of reverse skyline on data streams and proposed a novel pruning technique to reduce the number of data points preserved for processing continuous reverse skyline queries. Then, an efficient approach, called Semidominance Based Reverse Skyline (SDRS), was proposed to process continuous reverse skyline queries. Moreover, an extension was also proposed to handlen-of-Nand(n1,n2)-of-Nreverse skyline queries. Our extensive experimental studies have demonstrated the efficiency as well as effectiveness of the proposed approach with various experimental settings.

Style APA, Harvard, Vancouver, ISO itp.

17

Liu, Xingjie, De-Nian Yang, Mao Ye i Wang-Chien Lee. "U-Skyline: A New Skyline Query for Uncertain Databases". IEEE Transactions on Knowledge and Data Engineering 25, nr 4 (kwiecień 2013): 945–60. http://dx.doi.org/10.1109/tkde.2012.33.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Goncalves, Marlene, i Maria-Esther Vidal. "Efficiently Producing the K Nearest Neighbors in the Skyline on Vertically Partitioned Tables". International Journal of Information Retrieval Research 3, nr 2 (kwiecień 2013): 58–77. http://dx.doi.org/10.4018/ijirr.2013040104.

Pełny tekst źródła

Streszczenie:

Criteria that induce a Skyline naturally represent user's preference conditions useful to discard irrelevant data in large datasets. However, in the presence of high-dimensional Skyline spaces, the size of the Skyline can still be very large, making unfeasible for users to process this set of points. To identify the best points among the Skyline, the Top-k Skyline approach has been proposed. Top-k Skyline uses discriminatory criteria to induce a total order of the points that comprise the Skyline, and recognizes the best or top-k points based on these criteria. In this article the authors model queries as multi-dimensional points that represent bounds of VPT (Vertically Partitioned Table) property values, and datasets as sets of multi-dimensional points; the problem is to locate the k best tuples in the dataset whose distance to the query is minimized. A tuple is among the k best tuples whenever there is not another tuple that is better in all dimensions, and that is closer to the query point, i.e., the k best tuples correspond to the k nearest points to the query that are incomparable or belong to the skyline. The authors name these tuples the k nearest neighbors in the skyline. The authors propose a hybrid approach that combines Skyline and Top-k solutions and develop two algorithms: TKSI and k-NNSkyline. The proposed algorithms identify among the skyline tuples, the k ones with the lowest values of the distance metric, i.e., the k nearest neighbors to the multi-dimensional query that are incomparable. Empirically, we study the performance and quality of TKSI and k-NNSkyline. The authors’ experimental results show the TKSI is able to speed up the computation of the Top-k Skyline in at least 50% percent with respect to the state-of-the-art solutions, whenever k is smaller than the size of the Skyline. Additionally, the authors’ results suggest that k-NNSkyline outperforms existing solutions by up to three orders of magnitude.

Style APA, Harvard, Vancouver, ISO itp.

19

Liu, Yongshan, Tianbao Hao, Xiang Gong, Dehan Kong i Jianjun Wang. "Skyline-Like Query in Three-Dimensional Obstacle Space". Scientific Programming 2022 (11.05.2022): 1–13. http://dx.doi.org/10.1155/2022/3978601.

Pełny tekst źródła

Streszczenie:

Skyline query, as a query method to solve typical multiobjective optimization problems, has a wide range of applications in market analysis and data mining. Many scholars’ attention has been attracted since it was proposed. However, the correct result set cannot be obtained easily by traditional skyline query when nonspatial and spatial attributes of the data set need to be considered at the same time, and there are differences in the importance of each attribute. To solve this problem, a skyline-like query was proposed in three-dimensional obstacle space based on the traditional skyline query. In the skyline-like query algorithm, nonspatial skyline-like points were obtained according to the traditional algorithm. The spatial attribute dominated region of the obtained points was used to filter the data set, and then the shielding of obstacles was considered in the three-dimensional obstacle space. By constructing a three-dimensional visible graph, the Dijkstra algorithm was used to obtain the skyline-like points of spatial attribute. After sorting, the skyline-like point set was obtained based on the value of user’s preference. Compared with B2S2 algorithm, the experimental results show that the skyline-like algorithm had a better performance. Then, the comparative experiments within three-dimensional obstacle skyline query were carried out by setting different sizes of data sets and different numbers of obstacles. According to the results, it is shown that the algorithm had a great performance.

Style APA, Harvard, Vancouver, ISO itp.

20

Lougmiri, Zekri. "A New Progressive Method for Computing Skyline Queries". Journal of Information Technology Research 10, nr 3 (lipiec 2017): 1–21. http://dx.doi.org/10.4018/jitr.2017070101.

Pełny tekst źródła

Streszczenie:

Skyline queries are important in many fields, especially for decision making. In this context, objects or tuples of databases are defined according to some numerical and non numerical attributes. The skyline operator acts on the numerical ones. The algorithms that implements this skyline operator are genrally of progressive or non progressive. The progressive ones return the skyline operator during its execution while non preogressive alogrithms return the result at the end of its execution. This paper presents a new progressive algorithm for computing the skyline points. This algorithm is based on sorting as a preprocessing of the input. The authors present new theorems for deducing promptly the first skyline points and reducing the candidate space. A new version of Divide-and-Conquer algorithm is used for computing the final skyline. Intensive experimentations on both real and synthetic datasets show that our algorithm presents best performance comparatively to other methods.

Style APA, Harvard, Vancouver, ISO itp.

21

Xin, Junchang, Zhiqiong Wang, Mei Bai, Linlin Ding i Guoren Wang. "Energy-Efficientβ-Approximate Skylines Processing in Wireless Sensor Networks". Mathematical Problems in Engineering 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/149513.

Pełny tekst źródła

Streszczenie:

As the first priority of query processing in wireless sensor networks is to save the limited energy of sensor nodes and in many sensing applications a part of skyline result is enough for the user’s requirement, calculating the exact skyline is not energy-efficient relatively. Therefore, a new approximate skyline query,β-approximate skyline query which is limited by a guaranteed error bound, is proposed in this paper. With an objective to reduce the communication cost in evaluatingβ-approximate skyline queries, we also propose an energy-efficient processing algorithm using mapping and filtering strategies, named Actual Approximate Skyline (AAS). And more than that, an extended algorithm named Hypothetical Approximate Skyline (HAS) which replaces the real tuples with the hypothetical ones is proposed to further reduce the communication cost. Extensive experiments on synthetic data have demonstrated the efficiency and effectiveness of our proposed approaches with various experimental settings.

Style APA, Harvard, Vancouver, ISO itp.

22

Endres, Markus, i Werner Kießling. "Parallel Skyline Computation Exploiting the Lattice Structure". Journal of Database Management 26, nr 4 (październik 2015): 18–43. http://dx.doi.org/10.4018/jdm.2015100102.

Pełny tekst źródła

Streszczenie:

The problem of Skyline computation has attracted considerable research attention in the last decade. A Skyline query selects those tuples from a dataset that are optimal with respect to a set of designated preference attributes. Since multicore processors are going mainstream, it has become imperative to develop parallel algorithms, which fully exploit the advantages of such modern hardware architectures. In this paper, the authors present high-performance parallel Skyline algorithms based on the lattice structure generated by a Skyline query. For this, they propose different evaluation strategies and compare several data structures for the parallel evaluation of Skyline queries. The authors present novel optimization techniques for lattice based Skyline algorithms based on pruning and removing one unrestricted attribute domain. They demonstrate through comprehensive experiments on synthetic and real datasets that their new algorithms outperform state-of-the-art multicore Skyline techniques for low-cardinality domains. The authors' algorithms have linear runtime complexity and fully play on modern hardware architectures.

Style APA, Harvard, Vancouver, ISO itp.

23

Ahmed, Saleh, Mahboob Qaosar, Asif Zaman, Md Anisuzzaman Siddique, Chen Li, Kazi Md Rokibul Alam i Yasuhiko Morimoto. "Privacy-Aware MapReduce Based Multi-Party Secure Skyline Computation". Information 10, nr 6 (8.06.2019): 207. http://dx.doi.org/10.3390/info10060207.

Pełny tekst źródła

Streszczenie:

Selecting representative objects from a large-scale dataset is an important task for understanding the dataset. Skyline is a popular technique for selecting representative objects from a large dataset. It is obvious that the skyline computation from the collective databases of multiple organizations is more effective than the skyline computed from a database of a single organization. However, due to privacy-awareness, every organization is also concerned about the security and privacy of their data. In this regards, we propose an efficient multi-party secure skyline computation method that computes the skyline on encrypted data and preserves the confidentiality of each party’s database objects. Although several distributed skyline computing methods have been proposed, very few of them consider the data privacy and security issues. However, privacy-preserving multi-party skyline computing techniques are not efficient enough. In our proposed method, we present a secure computation model that is more efficient in comparison with existing privacy-preserving multi-party skyline computation models in terms of computation and communication complexity. In our computation model, we also introduce MapReduce as a distributive, scalable, open-source, cost-effective, and reliable framework to handle multi-party data efficiently.

Style APA, Harvard, Vancouver, ISO itp.

24

Sharma, Vagisha, Josh Eckels, Birgit Schilling, Christina Ludwig, Jacob D. Jaffe, Michael J. MacCoss i Brendan MacLean. "Panorama Public: A Public Repository for Quantitative Data Sets Processed in Skyline". Molecular & Cellular Proteomics 17, nr 6 (27.02.2018): 1239–44. http://dx.doi.org/10.1074/mcp.ra117.000543.

Pełny tekst źródła

Streszczenie:

To address the growing need for a centralized, community resource of published results processed with Skyline, and to provide reviewers and readers immediate visual access to the data behind published conclusions, we present Panorama Public (https://panoramaweb.org/public.url), a repository of Skyline documents supporting published results. Panorama Public is built on Panorama, an open source data management system for mass spectrometry data processed with the Skyline targeted mass spectrometry environment. The Panorama web application facilitates viewing, sharing, and disseminating results contained in Skyline documents via a web-browser. Skyline users can easily upload their documents to a Panorama server and allow other researchers to explore uploaded results in the Panorama web-interface through a variety of familiar summary graphs as well as annotated views of the chromatographic peaks processed with Skyline. This makes Panorama ideal for sharing targeted, quantitative results contained in Skyline documents with collaborators, reviewers, and the larger proteomics community. The Panorama Public repository employs the full data visualization capabilities of Panorama which facilitates sharing results with reviewers during manuscript review.

Style APA, Harvard, Vancouver, ISO itp.

25

Guo, Fan, Yuxiang Mai, Jin Tang, Yu Huang i Lijun Zhu. "Robust and Automatic Skyline Detection Algorithm Based on MSSDN". Journal of Advanced Computational Intelligence and Intelligent Informatics 24, nr 6 (20.11.2020): 750–62. http://dx.doi.org/10.20965/jaciii.2020.p0750.

Pełny tekst źródła

Streszczenie:

Automatic detection of the skyline plays an important role in several applications, such as visual geo-localization, flight control, port security, and mountain peak recognition. Existing skyline detection methods are mostly used under common weather conditions; however, they do not consider bad weather situations, such as rain, which limits their application in real scenes. In this paper, we propose a multi-stream-stage DenseNet to detect skyline automatically under different weather conditions. This model fully considers the adverse factors influencing the skyline and outputs a probability graph of the skyline. Finally, a dynamic programming algorithm is implemented to detect the skyline in images accurately. A comparison with the existing state-of-the-art methods proves that the proposed model shows a good performance under rainy or common weather conditions and exhibits the best detection precision for the public database.

Style APA, Harvard, Vancouver, ISO itp.

26

WEI, Xiao-Juan. "Skyline Query Processing". Journal of Software 19, nr 6 (21.10.2008): 1386–400. http://dx.doi.org/10.3724/sp.j.1001.2008.01386.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Gassner, Günter. "Wrecking London’s skyline?" City 21, nr 6 (2.11.2017): 754–68. http://dx.doi.org/10.1080/13604813.2017.1408994.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Shields, Jim. "Review: SKYLINE TECHNOLOGY". Simulation & Gaming 36, nr 4 (grudzień 2005): 531–35. http://dx.doi.org/10.1177/1046878105282108.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Lloyd, Richard. "East Nashville skyline". Ethnography 12, nr 1 (marzec 2011): 114–45. http://dx.doi.org/10.1177/1466138110387219.

Pełny tekst źródła

Streszczenie:

This article examines a familiar urban dynamic — gentrification — in the less familiar setting of Nashville, Tennessee. In recent years, gentrification processes are accompanied by legitimating appeals to civic design trends and new cultural dynamics, particularly those associated with the New Urbanism and the promotion of ‘‘creative’’ city environments nurturing educated and culturally savvy residents. These discourses have increasingly come to define contemporary ‘‘progressive’’ urban policy, promoting values of diversity and cosmopolitanism while eliding standard concerns over displacement and the retrenchment of state services. Beginning with a dramatic street-level encounter between old and new styles of urban development, this account addresses the juxtaposition of a low density district targeted for redevelopment on Nashville’s East Side with the obdurate presence of neighboring public housing projects, inscribing competing political and cultural imaginaries in the built environment. It contributes a detailed examination of the encounter between ‘‘one-size-fits-all’’ policy agendas with the spatial and historical specificity of a mid-South city, using thick description to unpack the sedimentary processes of transformation, and the contributions of state and non-state actors to new identity formation. This on-the-ground exploration further allows for a critical assessment of the progressive virtues of diversity and cosmopolitanism as they are manifest in the context of neoliberal state action and spatial restructuring.

Style APA, Harvard, Vancouver, ISO itp.

30

Hebbert, Michael. "The Manchester Skyline". disP - The Planning Review 55, nr 4 (2.10.2019): 6–13. http://dx.doi.org/10.1080/02513625.2019.1708058.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Zhang, Nan, Chengkai Li, Naeemul Hassan, Sundaresan Rajasekaran i Gautam Das. "On Skyline Groups". IEEE Transactions on Knowledge and Data Engineering 26, nr 4 (kwiecień 2014): 942–56. http://dx.doi.org/10.1109/tkde.2013.119.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Im, Hyeonseung, i Sungwoo Park. "Group skyline computation". Information Sciences 188 (kwiecień 2012): 151–69. http://dx.doi.org/10.1016/j.ins.2011.11.014.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Lee, Jongwuk, Gae-won You, Seung-won Hwang, Joachim Selke i Wolf-Tilo Balke. "Interactive skyline queries". Information Sciences 211 (listopad 2012): 18–35. http://dx.doi.org/10.1016/j.ins.2012.04.007.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

34

Holdsworth, Deryck W. "THE INVISIBLE SKYLINE". Antipode 26, nr 2 (kwiecień 1994): 141–46. http://dx.doi.org/10.1111/j.1467-8330.1994.tb00242.x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

Afrati, Foto N., Paraschos Koutris, Dan Suciu i Jeffrey D. Ullman. "Parallel Skyline Queries". Theory of Computing Systems 57, nr 4 (16.04.2015): 1008–37. http://dx.doi.org/10.1007/s00224-015-9627-3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

36

Kluck, Anita. "Bauboom verändert Skyline". Bankmagazin 68, nr 2-3 (luty 2019): 22–25. http://dx.doi.org/10.1007/s35127-019-0008-0.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

Sukhwani, Nitesh, Venkateswara Rao Kagita, Vikas Kumar i Sanjaya Kumar Panda. "Efficient Computation of Top-K Skyline Objects in Data Set With Uncertain Preferences". International Journal of Data Warehousing and Mining 17, nr 3 (lipiec 2021): 68–80. http://dx.doi.org/10.4018/ijdwm.2021070104.

Pełny tekst źródła

Streszczenie:

Skyline recommendation with uncertain preferences has drawn AI researchers' attention in recent years due to its wide range of applications. The naive approach of skyline recommendation computes the skyline probability of all objects and ranks them accordingly. However, in many applications, the interest is in determining top-k objects rather than their ranking. The most efficient algorithm to determine an object's skyline probability employs the concepts of zero-contributing set and prefix-based k-level absorption. The authors show that the performance of these methods highly depends on the arrangement of objects in the database. In this paper, the authors propose a method for determining top-k skyline objects without computing the skyline probability of all the objects. They also propose and analyze different methods of ordering the objects in the database. Finally, they empirically show the efficacy of the proposed approaches on several synthetic and real-world data sets.

Style APA, Harvard, Vancouver, ISO itp.

38

Park, Yoonjae, Jun-Ki Min i Kyuseok Shim. "Parallel computation of skyline and reverse skyline queries using mapreduce". Proceedings of the VLDB Endowment 6, nr 14 (wrzesień 2013): 2002–13. http://dx.doi.org/10.14778/2556549.2556580.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Zhang, Ming, i Reda Alhajj. "Skyline queries with constraints: Integrating skyline and traditional query operators". Data & Knowledge Engineering 69, nr 1 (styczeń 2010): 153–68. http://dx.doi.org/10.1016/j.datak.2009.10.001.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Pan, Zhibin, Jin Tang, Tardi Tjahjadi, Xiaoming Xiao i Zhihu Wu. "Camera Geolocation Using Digital Elevation Models in Hilly Area". Applied Sciences 10, nr 19 (23.09.2020): 6661. http://dx.doi.org/10.3390/app10196661.

Pełny tekst źródła

Streszczenie:

The geolocation of skyline provides an important application in unmanned vehicles, unmanned aerial vehicles, and other fields. However, the existing methods are not effective in hilly areas. In this paper, we analyze the difficulties to locate in hilly areas and propose a new geolocation method. According to the vegetation in hilly area, two new skyline features, enhanced angle chain code and lapel point, are proposed. In order to deal with the skyline being close to the camera, we also propose a matching method which incorporates skyline distance heatmap and skyline pyramid. The experimental results show that the proposed method is highly effective in hilly area and has a robust performance against noise and rotation effects.

Style APA, Harvard, Vancouver, ISO itp.

41

NAZAROVA, A. Yu. "THEORETICAL ASPECTS OF RESEARCH AND PRESERVATION OF HISTORIC CITY SKYLINE". Vestnik Tomskogo gosudarstvennogo arkhitekturno-stroitel'nogo universiteta. JOURNAL of Construction and Architecture, nr 3 (27.06.2019): 77–85. http://dx.doi.org/10.31675/1607-1859-2019-21-3-77-85.

Pełny tekst źródła

Streszczenie:

The paper considers general issues of the study and preservation of the historic city skyline in the context of the research experience analysis. The term city skyline is defined by factual information, its structural components, both tangible and intangible, and specific characteristics of the skyline visual perception are described. The analysis of the current legislation in relation to the protection of the historical environment shows the perspectives of the historical settlements in terms of the skyline preservation, the environmental characteristics of the historic city. In order to develop a methodology for determining the valuable skyline compositions of a historic city, the research methodology is reviewed and conclusions are drawn regarding the current algorithm of studying this environmental characteristic.

Style APA, Harvard, Vancouver, ISO itp.

42

Choi, Jong-Hyeok, Fei Hao i Aziz Nasridinov. "HI-Sky: Hash Index-Based Skyline Query Processing". Applied Sciences 10, nr 5 (2.03.2020): 1708. http://dx.doi.org/10.3390/app10051708.

Pełny tekst źródła

Streszczenie:

The skyline query has recently attracted a considerable amount of research interest in several fields. The query conducts computations using the domination test, where “domination” means that a data point does not have a worse value than others in any dimension, and has a better value in at least one dimension. Therefore, the skyline query can be used to construct efficient queries based on data from a variety of fields. However, when the number of dimensions or the amount of data increases, naïve skyline queries lead to a degradation in overall performance owing to the higher cost of comparisons among data. Several methods using index structures have been proposed to solve this problem but have not improved the performance of skyline queries because their indices are heavily influenced by the dimensionality and data amount. Therefore, in this study, we propose HI-Sky, a method that can perform quick skyline computations by using the hash index to overcome the above shortcomings. HI-Sky effectively manages data through the hash index and significantly improves performance by effectively eliminating unnecessary data comparisons when computing the skyline. We provide the theoretical background for HI-Sky and verify its improvement in skyline query performance through comparisons with prevalent methods.

Style APA, Harvard, Vancouver, ISO itp.

43

Liu, Jia, Wei Chen, Ziyang Chen, Lin Liu, Yuhong Wu, Kaiyu Liu, Amar Jain i Yasser H. Elawady. "Optimized Query Algorithms for Top- K Group Skyline". Wireless Communications and Mobile Computing 2022 (4.01.2022): 1–11. http://dx.doi.org/10.1155/2022/3404906.

Pełny tekst źródła

Streszczenie:

Skyline query is a typical multiobjective query and optimization problem, which aims to find out the information that all users may be interested in a multidimensional data set. Multiobjective optimization has been applied in many scientific fields, including engineering, economy, and logistics. It is necessary to make the optimal decision when two or more conflicting objectives are weighed. For example, maximize the service area without changing the number of express points, and in the existing business district distribution, find out the area or target point set whose target attribute is most in line with the user’s interest. Group Skyline is a further extension of the traditional definition of Skyline. It considers not only a single point but a group of points composed of multiple points. These point groups should not be dominated by other point groups. For example, in the previous example of business district selection, a single target point in line with the user’s interest is not the focus of the research, but the overall optimality of all points in the whole target area is the final result that the user wants. This paper focuses on how to efficiently solve top- k group Skyline query problem. Firstly, based on the characteristics that the low levels of Skyline dominate the high level points, a group Skyline ranking strategy and the corresponding SLGS algorithm on Skyline layer are proposed according to the number of Skyline layer and vertices in the layer. Secondly, a group Skyline ranking strategy based on vertex coverage is proposed, and corresponding VCGS algorithm and optimized algorithm VCGS+ are proposed. Finally, experiments verify the effectiveness of this method from two aspects: query response time and the quality of returned results.

Style APA, Harvard, Vancouver, ISO itp.

44

Liu, Zezheng, Yifu Zeng, Siyuan He i Yantao Zhou. "An Adaptive Parallel PI-Skyline Query for Probabilistic and Incomplete Database". International Journal of Computational Methods 17, nr 07 (31.05.2019): 1950036. http://dx.doi.org/10.1142/s0219876219500361.

Pełny tekst źródła

Streszczenie:

In the context of large quantities of information, the skyline query is a particularly useful tool for data mining and decision-making. However, the massive amounts of information on the Internet are frequently incomplete and uncertain due to data randomness, transmission errors, and many other reasons. Therefore, an efficient skyline query algorithm over an incomplete uncertain database is imperative. To address this issue, this paper proposes an efficient algorithm to apply skyline query on probabilistic incomplete data. The algorithm is based on U-Skyline model to avoid disadvantages of traditional P-Skyline model. The proposed methods introduce some novel concepts including transferred tuples, leading tuples and the new dominance relationship between probabilistic incomplete data. Besides, it is a parallel processing algorithm. Extensive experiments demonstrate the effectiveness and efficiency of the proposed algorithms.

Style APA, Harvard, Vancouver, ISO itp.

45

Dehaki, Ghoncheh Babanejad, Hamidah Ibrahim, Ali A. Alwan, Fatimah Sidi, Nur Izura Udzir i Ma’aruf Mohammed Lawal. "A Continuous Region-Based Skyline Computation for a Group of Mobile Users". Symmetry 14, nr 10 (24.09.2022): 2003. http://dx.doi.org/10.3390/sym14102003.

Pełny tekst źródła

Streszczenie:

Skyline queries, which are based on the concept of Pareto dominance, filter the objects from a potentially large multi-dimensional collection of objects by keeping the best, most favoured objects in satisfying the user’s preferences. With today’s advancement of technology, ad hoc meetings or impromptu gatherings involving a group of people are becoming more and more common. Intuitively, deciding on an optimal meeting point is not a straightforward task especially when conflicting criteria are involved and the number of criteria to be considered is vast. Moreover, a point that is near to a user might not meet all the various users’ preferences, while a point that meets most of the users’ preferences might be located far away from these users. The task becomes more complicated when these users are on the move. In this paper, we present the Region-based Skyline for a Group of Mobile Users (RSGMU) method, which aims to resolve the problem of continuously finding the optimal meeting points, herein called skyline objects, for a group of users while they are on the move. RSGMU assumes a centroid-based movement where users are assumed to be moving towards a centroid that is identified based on the current locations of each user in the group. Meanwhile, to limit the searching space in identifying the objects of interest, a search region is constructed. However, the changes in the users’ locations caused the search region of the group to be reconstructed. Unlike the existing methods that require users to frequently report their latest locations, RSGMU utilises a dynamic motion formula, which abides to the laws of classical physics that are fundamentally symmetrical with respect to time, in order to predict the locations of the users at a specified time interval. As a result, the skyline objects are continuously updated, and the ideal meeting points can be decided upon ahead of time. Hence, the users’ locations as well as the spatial and non-spatial attributes of the objects are used as the skyline evaluation criteria. Meanwhile, to avoid re-computation of skylines at each time interval, the objects of interest within a Single Minimum Bounding Rectangle that is formed based on the current search region are organized in a Kd-tree data structure. Several experiments have been conducted and the results show that our proposed method outperforms the previous work with respect to CPU time.

Style APA, Harvard, Vancouver, ISO itp.

46

Pan, Zhibin, Jin Tang, Tardi Tjahjadi i Fan Guo. "Fast Geo-Location Method Based on Panoramic Skyline in Hilly Area". ISPRS International Journal of Geo-Information 10, nr 8 (9.08.2021): 537. http://dx.doi.org/10.3390/ijgi10080537.

Pełny tekst źródła

Streszczenie:

Localization method based on skyline for visual geo-location is an important auxiliary localization method that does not use a satellite positioning system. Due to the computational complexity, existing panoramic skyline localization methods determine a small area using prior knowledge or auxiliary sensors. After correcting the camera orientation using inertial navigation sensors, a fine position is achieved via the skyline. In this paper, a new panoramic skyline localization method is proposed that involves the following. By clustering the sampling points in the location area and improving the existing retrieval method, the computing efficiency of the panoramic skyline localization is increased by fourfold. Furthermore, the camera orientation is estimated accurately from the terrain features in the image. Experimental results show that the proposed method achieves higher localization accuracy and requires less computation for a large area without the aid of external sensors.

Style APA, Harvard, Vancouver, ISO itp.

47

Marsh, Alexandra N., Vagisha Sharma, Surya K. Mani, Olga Vitek, Michael J. MacCoss i Brendan X. MacLean. "Skyline Batch: An Intuitive User Interface for Batch Processing with Skyline". Journal of Proteome Research 21, nr 1 (17.12.2021): 289–94. http://dx.doi.org/10.1021/acs.jproteome.1c00749.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

Bavirthi, Swathi Sowmya, i Supreethi K. P. "Systematic Review of Indexing Spatial Skyline Queries for Decision Support". International Journal of Decision Support System Technology 14, nr 1 (styczeń 2022): 1–15. http://dx.doi.org/10.4018/ijdsst.286685.

Pełny tekst źródła

Streszczenie:

Residing in the data age, researchers inferred that huge amount of geo-tagged data is available and identified the importance of Spatial Skyline queries. Spatial or geographic location in conjunction with textual relevance plays a key role in searching Point of Interest (POI) of the user. Efficient indexing techniques like R-Tree, Quad Tree, Z-order curve and variants of these trees are widely available in terms of spatial context. Inverted file is the popular indexing technique for textual data. As Spatial skyline query aims at analyzing both spatial and skyline dominance, there is a necessity for a hybrid indexing technique. This article presents the review of spatial skyline queries evaluation that include a range of indexing techniques which concentrates on disk access, I/O time, CPU time. The investigation and analysis of studies related to skyline queries based upon the indexing model and research gaps are presented in this review.

Style APA, Harvard, Vancouver, ISO itp.

49

Ruan, Pei Qi, Chuan Wei Xu, Ji Ting Huang, Lun Ke Qing i Chang Qing Ji. "A Distributed Algorithm for Skyline Query Based on Pre-Clustering". Advanced Materials Research 756-759 (wrzesień 2013): 3982–86. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.3982.

Pełny tekst źródła

Streszczenie:

With the increasing availability and mobile application of LBS (Location-Based Services), large scale spatial objects remind challenge in cloud environments. In order to retrieve a few data items within a very large structured data set, skyline queries are utilized to optimize a single respectively multiple criteria. In this paper, we develop a new pre-clustering-based skyline queries technique to address the skewed distribution problem. We also present distributed approaches that construct grid index and process skyline queries. We evaluate the effectiveness of our algorithms with extensive experiments using real data sets. The results demonstrate the efficiency and scalability of our skyline queries algorithms based on pre-clustering.

Style APA, Harvard, Vancouver, ISO itp.

50

Huang, Lan, Yuanwei Zhao, Pedro Mestre, Laipeng Han, Kangping Wang, Wenjuan Gao i Rui Zhang. "Research on Reverse Skyline Query Algorithm Based on Decision Set". Journal of Database Management 33, nr 1 (1.01.2022): 1–28. http://dx.doi.org/10.4018/jdm.313971.

Pełny tekst źródła

Streszczenie:

Reverse skyline query is an extension of the classical skyline query, widely used in the decision support in e-business. The vast burst of big data in e-business challenges the classical algorithms for such queries. This paper provides a novel definition of decision set and a decision set based reverse skyline query method called DRS on the double-layer R tree indexing in a map-reduce manner. Theoretical proofs are provided for the correctness and complexity of the DRS algorithm. Experiments made using several large data sets are presented and analyzed to illustrate the applicability and the outperformance of DRS over the state-of-the-art reverse skyline query methods.

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!