Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "computing cloud" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-12 z 12
    Tytuł:
    Mobile devices and computing cloud resources allocation for interactive applications
    Autorzy:
    Krawczyk, H.
    Nykiel, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/229566.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    mobile devices
    computing cloud
    task allocation
    optimization
    Opis:
    Using mobile devices such as smartphones or iPads for various interactive applications is currently very common. In the case of complex applications, e.g. chess games, the capabilities of these devices are insufficient to run the application in real time. One of the solutions is to use cloud computing. However, there is an optimization problem of mobile device and cloud resources allocation. An iterative heuristic algorithm for application distribution is proposed. The algorithm minimizes the energy cost of application execution with constrained execution time.
    Źródło:
    Archives of Control Sciences; 2017, 27, 2; 293-307
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Technicized University – Are the Technological Changes an Opportunity or a Threat?
    Autorzy:
    Chmielecki, Przemysław
    Powiązania:
    https://bibliotekanauki.pl/articles/1199064.pdf
    Data publikacji:
    2019
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    university
    cloud computing
    technicization
    sts
    Opis:
    The university’s classic formula refers to the importance of an in-depth relationship between the professor and his students. However, one can get the impression that currently students’ expectations towards the university have changed significantly, which is why higher education institutions are currently facing a paradigmatic change. In this article, the author analyses selected phenomena of technicalization of the university, indicating the possibilities and potential threats to the identity of academic institutions.
    Źródło:
    Zagadnienia Naukoznawstwa; 2019, 55, 1(219); 103-111
    0044-1619
    Pojawia się w:
    Zagadnienia Naukoznawstwa
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A note on the complexity of scheduling of communication-aware directed acyclic graph
    Autorzy:
    Musial, J.
    Guzek, M.
    Bouvry, P.
    Blazewicz, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/202127.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    computational complexity
    cloud computing
    communication-aware cloud computing
    directed acyclic graph
    NP-hardness in cloud computing
    złożoność obliczeniowa
    chmura obliczeniowa
    skierowany graf acykliczny
    Opis:
    The most recent incarnation of distributed paradigm is cloud computing. It can be seen as the first widely accepted business model of mass consumption of the distributed computing resources. Despite the differences in business models and technical details regarding cloud platforms, the distributed computing underlies cloud. Communications in cloud systems include transmissions of the results of cloud applications, users interactions, and exchange of data between different services that compose applications. The latter becomes more critical as applications become richer as well as more complex, and may consist of services operated by various providers. The effective communication between components of cloud systems is thus critical to the end user satisfaction and to the success of cloud services. We will discuss different cloud computing models (communication aware and unaware). Main focus will be placed on communication-aware directed acyclic graph (CA-DAG), which extends the classical DAG model by explicitly modeling communication tasks. Moreover, we will analyze and consult computational complexity of this innovative distributed computation model inspired by the characteristics of cloud computing. Providing a proof of strong NP-hardness of the problem allows for a future implementation and evolution of the communication-aware DAG models.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 2; 187-191
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A Software Architecture Assisting Workflow Executions on Cloud Resources
    Autorzy:
    Borowik, G.
    Woźniak, M.
    Fornaia, A.
    Giunta, R.
    Napoli, C.
    Pappalardo, G.
    Tramontana, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/226324.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    software architecture
    dependability
    workflows
    cloud computing
    monitoring
    Opis:
    An enterprise providing services handled by means of workflows needs to monitor and control their execution, gather usage data, determine priorities, and properly use computing cloud-related resources. This paper proposes a software architecture that connects unaware services to components handling workflow monitoring and management concerns. Moreover, the provided components enhance dependability of services while letting developers focus only on the business logic.
    Źródło:
    International Journal of Electronics and Telecommunications; 2015, 61, 1; 17-22
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Integration of Remote Sensing Data in a Cloud Computing Environment
    Autorzy:
    Sabri, Yassine
    Bahja, Fadoua
    Pet, Henk
    Powiązania:
    https://bibliotekanauki.pl/articles/2055265.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    remote sensing
    data integration
    cloud computing
    big data
    Opis:
    With the rapid development of remote sensing technology, our ability to obtain remote sensing data has been improved to an unprecedented level. We have entered an era of big data. Remote sensing data clear showing the characteristics of Big Data such as hyper spectral, high spatial resolution, and high time resolution, thus, resulting in a significant increase in the volume, variety, velocity and veracity of data. This paper proposes a feature supporting, salable, and efficient data cube for time-series analysis application, and used the spatial feature data and remote sensing data for comparative study of the water cover and vegetation change. In this system, the feature data cube building and distributed executor engine are critical in supporting large spatiotemporal RS data analysis with spatial features. The feature translation ensures that the geographic object can be combined with satellite data to build a feature data cube for analysis. Constructing a distributed executed engine based on dask ensures the efficient analysis of large-scale RS data. This work could provide a convenient and efficient multidimensional data services for many remote sensing applications.
    Źródło:
    International Journal of Electronics and Telecommunications; 2022, 68, 1; 167--172
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Confidential Greedy Graph Algorithm
    Autorzy:
    Waszkiewicz, D.
    Horubala, A.
    Sapiecha, P.
    Andrzejczak, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/226681.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    cryptography
    fully homomorphic encryption
    confidential graph algorithm
    cloud computing
    Opis:
    Confidential algorithm for the approximate graph vertex covering problem is presented in this article. It can preserve privacy of data at every stage of the computation, which is very important in context of cloud computing. Security of our solution is based on fully homomorphic encryption scheme. The time complexity and the security aspects of considered algorithm are described.
    Źródło:
    International Journal of Electronics and Telecommunications; 2018, 64, 2; 179-183
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The Implementation of 3TZ Model of Software Development
    Autorzy:
    Chaczko, Z.
    Aslanzadeh, S.
    Jiang, F.
    Klempous, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/226332.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    software development
    cloud computing
    distributed software services
    3TZ environment
    Opis:
    This paper presents the concepts and explores issues related to the 3 Time Zones (3TZ) model of software development in global workspace environment. The 3TZ model itself seeks to take advantages of differences in time zones between places around the world. By engaging software development teams in different regions separated by 8 hours each, it is possible for their combined working hours to cover the whole 24 hours period. Thus, while they each work their normal 8 hour days, together they are able to achieve in 1 day what a single team would achieve in 3 days. They are able to achieve this by passing on their work from one team to the next as one finishes their workday and the next team starts their workday. The 3TZ model of software development revolves around the employment of a software development team distributed in at least 3 different locations around the world in 3 different time zones. If work was passed on from one team to the next and adjacent teams were separated by 8 hours, then 24 hours continuous collaborative software development could be achieved. Though this poses many challenges, when dealt with there is great potential for software to be developed much faster than is possible for a single, collocated development team. In the global economy, we have seen a decrease in the barriers towards communication across the globe along with an increase of service availability to support this communication. Software development is one of the disciplines that is capable of effectively utilizing and benefiting from global collaboration prospect lent by ever increasing capability of information and communication technology. 24 hours continuous development is ideal for application towards tasks that have hard deadlines or require work completed as soon as possible. This article will mainly focus on introducing 24/7 global models that can be applied in cloud environment used in three different time zones.
    Źródło:
    International Journal of Electronics and Telecommunications; 2012, 58, 4; 433-439
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Online scheduling for a Testing-as-a-Service system
    Autorzy:
    Rudy, J.
    Smutnicki, C.
    Powiązania:
    https://bibliotekanauki.pl/articles/200221.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    discrete optimization
    online scheduling
    cloud computing
    Testing-as-a-Service
    Opis:
    The problem of performing software tests using Testing-as-a-Service cloud environment is considered and formulated as an~online cluster scheduling on parallel machines with total flowtime criterion. A mathematical model is proposed. Several properties of the problem, including solution feasibility and connection to the classic scheduling on parallel machines are discussed. A family of algorithms based on a new priority rule called the Smallest Remaining Load (SRL) is proposed. We prove that algorithms from that family are not competitive relative to each other. Computer experiment using real-life data indicated that the SRL algorithm using the longest job sub-strategy is the best in performance. This algorithm is then compared with the Simulated Annealing metaheuristic. Results indicate that the metaheuristic rarely outperforms the SRL algorithm, obtaining worse results most of the time, which is counter-intuitive for a metaheuristic. Finally, we test the accuracy of prediction of processing times of jobs. The results indicate high (91.4%) accuracy for predicting processing times of test cases and even higher (98.7%) for prediction of remaining load of test suites. Results also show that schedules obtained through prediction are stable (coefficient of variation is 0.2–3.7%) and do not affect most of the algorithms (around 1% difference in flowtime), proving the considered problem is semi-clairvoyant. For the Largest Remaining Load rule, the predicted values tend to perform better than the actual values. The use of predicted values affects the SRL algorithm the most (up to 15% flowtime increase), but it still outperforms other algorithms.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 4; 869-882
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Block Cipher Based Public Key Encryption via Indistinguishability Obfuscation
    Autorzy:
    Horubała, A.
    Waszkiewicz, D.
    Andrzejczak, M.
    Sapiecha, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/226598.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    indistinguishability obfuscation
    public key cryptosystems
    homomorphic encryption
    cloud computing
    information protection
    Opis:
    The article is devoted to generation techniques of the new public key crypto-systems, which are based on application of indistinguishability obfuscation methods to selected private key crypto-systems. The techniques are applied to symmetric key crypto-system and the target system is asymmetric one. As an input for our approach an implementation of symmetric block cipher with a given private-key is considered. Different obfuscation methods are subjected to processing. The target system would be treated as a public-key for newly created public crypto-system. The approach seems to be interesting from theoretical point of view. Moreover, it can be useful for information protection in a cloud-computing model.
    Źródło:
    International Journal of Electronics and Telecommunications; 2018, 64, 2; 173-178
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    N-Body Potential Interaction as a Cost Function in the Elastic Model for SANET Cloud Computing
    Autorzy:
    Chaczko, Z.
    Resconi, G.
    Chiu, C.
    Aslanzadeh, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/227216.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    elastic network model
    cloud computing
    Sensor-Actor networks
    matrix calculus
    N-Body interactions
    cost functions
    Opis:
    Given a connection graph of entities that send and receive a flow of data controlled by effort and given the parameters, the metric tensor is computed that is in the elastic relational flow to effort. The metric tensor can be represented by the Hessian of the interaction potential. Now the interaction potential or cost function can be among two entities: 3 entities or 'N' entities and can be separated into two main parts. The first part is the repulsion potential the entities move further from the others to obtain minimum cost, the second part is the attraction potential for which the entities move near to others to obtain the minimum cost. For Pauli's model [1], the attraction potential is a functional set of parameters given from the environment (all the elements that have an influence in the module can be the attraction of one entity to another). Now the cost function can be created in a space of macro-variables or macro-states that is less of all possible variables. Any macro-variable collect a set of micro-variables or microstates. Now from the hessian of the macro-variables, the Hessian is computed of the micro-variables in the singular points as stable or unstable only by matrix calculus without any analytical computation - possible when the macro-states are distant among entities. Trivially, the same method can be obtained by a general definition of the macro-variable or macro-states and micro-states or variables. As cloud computing for Sensor-Actor Networks (SANETS) is based on the bonding concept for complex interrelated systems; the bond valence or couple corresponds to the minimum of the interaction potential V and in the SANET cloud as the minimum cost.
    Źródło:
    International Journal of Electronics and Telecommunications; 2012, 58, 1; 63-70
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Information technology adaptation in Indian small and medium sized enterprises: opportunities and challenges ahead
    Autorzy:
    Khan, I.
    Trzcieliński, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/407235.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    small sized enterprises
    medium sized enterprises
    information technology
    information communication technology
    cloud computing
    National Association of Software and Services Companies
    National Institute of Standards and Technology
    Opis:
    The purpose of the study is to analyze the opportunities and the challenges associated with the adoption of Information technology in the Indian SMEs. The significant usage of Information Technology in the SME sector and the factors that influence the business are discussed. SME industry in India has shown substantial growth over the past few years. The implementation of new technologies tends to offer better opportunities to the companies particularly for SME sector in India. However, there are a few challenges associated with technology adaptation that needs attention. This research is focused on improved business quality and responsiveness towards market opportunities while using the latest technologies available. This study is based on a review of research journals and articles including news magazines concerning current SME market situation in India. The current market scenario of Indian SMEs, as well as several policy interventions and new trends in the market were discussed.
    Źródło:
    Management and Production Engineering Review; 2018, 9, 3; 41-48
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Performance of Noise Map Service Working in Cloud Computing Environment
    Autorzy:
    Marciniuk, K.
    Szczodrak, M.
    Kostek, B.
    Powiązania:
    https://bibliotekanauki.pl/articles/177042.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    noise maps
    dynamic noise maps
    sound propagation
    environmental noise
    web applications
    cloud computing
    mapy hałasu
    mapy dynamiczne hałasu
    rozprzestrzenianie się dźwięku
    hałas środowiskowy
    aplikacje sieci Web
    przetwarzanie w chmurze
    Opis:
    In the paper, a noise map service designated for the user interested in environmental noise is presented. Noise prediction algorithm and source model, developed for creating acoustic maps, are working in the cloud computing environment. In the study, issues related to the noise modelling of sound propagation in urban spaces are discussed with a particular focus on traffic noise. Examples of results obtained through a web application created for that purpose are shown. In addition, these are compared to results obtained from the commercial software simulations based on two road noise prediction models. Moreover, the computing performance of the developed application is investigated and analyzed. In the paper, a flowchart simulating the operation of the noise web-based service is presented showing that the created application is easy to use even for people with little experience in computer technology.
    Źródło:
    Archives of Acoustics; 2016, 41, 2; 297-302
    0137-5075
    Pojawia się w:
    Archives of Acoustics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-12 z 12

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies