The work presents a distributed environment for model-based design of power electronic devices. It is based on the use of an information model of the devices. The goal is to use a model-based design to create a flexib...
详细信息
ISBN:
(纸本)9781538634196
The work presents a distributed environment for model-based design of power electronic devices. It is based on the use of an information model of the devices. The goal is to use a model-based design to create a flexible distributed system with minimization of the hardware resources used. With using an information models, software systems are being integrated and used in different scientific fields with appropriate program interfaces. This approach allows the automation of the design process, which is consisted of connected multiple repetitive operations. In this way, the results are structured in a platform independent database.
With the rapid advancement of sports analytics and fan engagement technologies, the volume and diversity of physique data generated by smart devices across various distributed sports platforms have grown significantly...
详细信息
With the rapid advancement of sports analytics and fan engagement technologies, the volume and diversity of physique data generated by smart devices across various distributed sports platforms have grown significantly. Extracting insights and enhancing fan experiences from such data offer considerable benefits. Yet, this process unveils two primary challenges. Firstly, efficiently utilizing the vast datasets in sports analytics is daunting due to the complex nature of the sports industry. Secondly, the data collected from diverse sources and stored in distributed platforms contain sensitive information like fan preferences and athlete performance metrics, posing risks of privacy breaches. To address these challenges, we leverage an advanced Locality-Sensitive Hashing technique, known as PSDFP ALSH \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$_{\text {ALSH}}$$\end{document} , tailored for the sports domain. This paper presents a new privacy-preserving method for sports data fusion and prediction in distributed environments, utilizing enhanced Locality-Sensitive Hashing to protect sensitive information while maintaining high data utility. Through extensive experimentation, our approach demonstrates superior performance over existing methods in terms of Mean Absolute Error (MAE), Root Mean Squared Error (RMSE), and computational efficiency.
Because most ensemble learning algorithms use the centralized model, and the training instances must be centralized on a single station, it is difficult to centralize the training data on a station. A distributed ense...
详细信息
Because most ensemble learning algorithms use the centralized model, and the training instances must be centralized on a single station, it is difficult to centralize the training data on a station. A distributed ensemble learning algorithm is proposed which has two kinds of weight genes of instances that denote the global distribution and the local distribution. Instead of the repeated sampling method in the standard ensemble learning, non-balance sampling from each station is used to train the base classifier set of each station. The concept of the effective nearby region for local integration classifier is proposed, and is used for the dynamic integration method of multiple classifiers in distributed environment. The experiments show that the ensemble learning algorithm in distributed environment proposed could reduce the time of training the base classifiers effectively, and ensure the classify performance is as same as the centralized learning method.
作者:
Park, JGPark, MSKorea Univ
Dept Comp Sci & Engn Internet Comp Lab Sungbuk Gu Seoul 136701 South Korea
The platform neutrality of Java programs allows them to run on heterogeneous computers. In a distributed environment, however, Java programs often cause performance problems because they are not implemented for specif...
详细信息
The platform neutrality of Java programs allows them to run on heterogeneous computers. In a distributed environment, however, Java programs often cause performance problems because they are not implemented for specific clients, so their implementation conflicts with their usage patterns at the client side. In this paper, we present a mechanism to address this problem by optimizing Java programs using a program specialization technique. Unlike traditional program specialization, our specialization method does not encode the result of specialization only into run-time code. Instead, it encodes the values of multi-valued static expressions into indexed data structure that is referenced by run-time code, and single-valued static expressions into run-time code. With this approach, we can address the code explosion problem of traditional program specialization. In a preliminary implementation, we achieved improvement in performance up to a factor of 3 with very low space requirements.
This paper proposes a security violation detection method for RBAC based interoperation to meet the requirements of secure interoperation among distributed systems. We use role mappings between RBAC systems to impleme...
详细信息
This paper proposes a security violation detection method for RBAC based interoperation to meet the requirements of secure interoperation among distributed systems. We use role mappings between RBAC systems to implement trans-system access control, analyze security violation of interoperation with role mappings, and formalize definitions of secure interoperation. A minimum detection method according to the feature of RBAC system in distributed environment is introduced in detail. This method reduces complexity by decreasing the amount of roles involved in detection. Finally, we analyze security violation further based on the minimum detection method to help administrators eliminate security violation.
Foreign functions have been considered in the advanced database systems to support complex applications. In this paper, we consider optimizing queries with foreign functions in a distributed environment. In traditiona...
详细信息
Foreign functions have been considered in the advanced database systems to support complex applications. In this paper, we consider optimizing queries with foreign functions in a distributed environment. In traditional distributed query processing, selection operations are locally processed before joins as much as possible so that the size of relations being transmitted and joined can be reduced. However, it selection predicates involve foreign functions, the cost of evaluating selections cannot be ignored. As a result, the execution order of selections and joins becomes significant, and the trade-off for reducing the costs of data transmission, join processing, and selection predicate evaluation needs to be carefully considered in query optimization. In this paper, a response time model is developed for estimating the cost of distributed query processing involving foreign functions. We explore the property of the problem and find an optimal algorithm with polynomial complexity for a special case of it. However, finding the optimal execution plan for the general case is NP-hard. We propose an efficient heuristic algorithm for solving the problem and the simulation result shows its good quality. The research result can also be applied to the advanced database systems and the multidatabase systems where the conversion function defined for the need of schema integration can be considered a type of foreign functions.
An automatic predictor of L/H transition times has been implemented for the DIII-D tokamak. The system predicts the transition combining two techniques: A morphological pattern recognition algorithm, which estimates t...
详细信息
An automatic predictor of L/H transition times has been implemented for the DIII-D tokamak. The system predicts the transition combining two techniques: A morphological pattern recognition algorithm, which estimates the transition based on the waveform of a D alpha emission signal, and a support vector machines multi-layer model, which predicts the L/H transition using a non-parametric model. The predictor is employed within a collaborative distributed computing environment. The system is trained remotely in the Ciemat computer cluster and operated on the DIII-D site. (c) 2012 Elsevier B.V. All rights reserved.
Recently, we have witnessed a phenomenal growth in the Internet/Intranet coupled with rapid deployment of new services. Information dissemination over the network has become one of the most important activities in our...
详细信息
Recently, we have witnessed a phenomenal growth in the Internet/Intranet coupled with rapid deployment of new services. Information dissemination over the network has become one of the most important activities in our daily life. The existing systems, however, often suffer from notorious long delay experienced by clients, especially during peak hours. This is caused by the combination of a variety of factors including inadequate link bandwidth, server overload and network congestion. Sewer replication has been shown to be one of the most effective mechanisms to cope with this problem. The basic idea is to replicate the information across a network so that the clients' requests can be spread out. The major issue is in which locations inside the network this replication takes place at, i.e. where to place the replicated servers. In this paper we investigate the server replication in a controlled distributed environment. The salient feature of this environment is that the decision of where to replicate information can be determined by a single authority, the Intranet being the typical example. We consider the problem of placing multiple replicated servers within a network, given there exist multiple target web servers as information providers. Wie formulate this as an optimization problem by taking into consideration the characteristics of the network topology. We first show that this is an NP-complete problem, and then present a number of heuristics-based algorithms for server replications. Finally, in order to investigate various tradeoffs in terms of cost and algorithm complexity, we carry out comparison studies among different heuristic algorithms. (C) 2000 Elsevier Science B.V. All rights reserved.
Data can be replicated to improved availability and performance in a distributed environment. To ensure the consistency of the replicated data, many schemes have been proposed. Most of these schemes are designed based...
详细信息
Data can be replicated to improved availability and performance in a distributed environment. To ensure the consistency of the replicated data, many schemes have been proposed. Most of these schemes are designed based on the quorum set approach. However, some of them are dominated. Such schemes can be further improved. By using theoretical analysis, we devise a paradigm for refining quorum schemes for managing replicated data. We present two dominating alternatives to a recently proposed high performance scheme.
The growing volumes of information and multifaceted nature of information processing, workflow scheduling in distributed environment are a prominent component for computing operations to diminish the amount of informa...
详细信息
The growing volumes of information and multifaceted nature of information processing, workflow scheduling in distributed environment are a prominent component for computing operations to diminish the amount of information transferring, computation load allocation to resources, reducing the task's waiting time and execution time. The basic objective of this article is to find an optimal schedule (Sopt) which can reduce the makespan of workflow. Artificial intelligence and neural network (NN) systems are the main-stream, but they were not effectively employed nevertheless for workflow scheduling. Hence, we enhance the scheduling by realising artificial neural networks and reinforcement Q-learning standards. An optimised NN-based scheduling algorithm (WfSo_ANRL) that represents an agent which can effectively schedule the tasks among computational nodes was provided in this article. The agent interacts with the external environment, i.e., the computing environment and collects the current status of load encoded in the form of a state vector. The agent then predicts an action and efficiently allocates the tasks on to the attainable resources. The external computing environment then awards incentives to the agent. The agent then learns to produce optimal schedules for reducing the makespan. In this way, the WfSo_ANRL produces optimal solution for workload.
暂无评论