The Experts below are selected from a list of 27 Experts worldwide ranked by ideXlab platform
Florian Kerschbaum - One of the best experts on this subject based on the ideXlab platform.
-
EDOC - Building a Privacy-Preserving Benchmarking Enterprise System
11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007), 2007Co-Authors: Florian KerschbaumAbstract:Benchmarking is the process of comparing one's own performance to the statistics of a group of competitors, named peer group. It is a common and important process in the business world for many important business metrics, called key performance indicators (KPI). Privacy is of the utmost importance, since these KPIs allow the inference of sensitive information. Therefore several secure multiparty computation (SMC) protocols for securely and privately computing statistics of KPIs have recently been developed. These protocols are the basic building block for a privacy-preserving benchmarking system, but in order to complete an enterprise system that offers a benchmarking service to its customers more problems need to be solved. This paper addresses two remaining problems: peer group formation and protocol orchestration. We first analyze how peer group participation impacts privacy and vice-versa. Given current network performance limitations we conclude that in order for KPIs to remain private one subscriber can participate in at most one peer group. Peer group formation is the process of forming sensible peer groups out of the set of subscribers. A sensible peer group is one that is useful for benchmarking, i.e. a group of similar companies, under the constraint that one subscriber can participate in at most one peer group. We characterize subscribers by a set of discrete criteria and therefore view the automatic peer group formation as a data clustering problem. A data clustering algorithm customized for automatic peer group formation is required to build clusters whose size does not fall below a minimum threshold. We present a high-performance modification of k-means clustering that takes the minimum cluster size as an additional parameter which might be of independent interest. In a simulation we evaluate its practical applicability to automatic peer group formation. Our final approach is the first automatic peer group formation algorithm for an enterprise benchmarking system. Polling-based protocol orchestration allows the subscribers to remain passive clients, i.e. require no Inbound Connection, e.g. through a company firewall. We show through simulation that such a polling-based orchestration can be expected to complete within one polling interval.
-
Building a Privacy-Preserving Benchmarking Enterprise System
11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007), 2007Co-Authors: Florian KerschbaumAbstract:Benchmarking is the process of comparing one's own performance to the statistics of a group of competitors, named peer group. It is a common and important process in the business world for many important business metrics, called key performance indicators (KPI). Privacy is of the utmost importance, since these KPIs allow the inference of sensitive information. Therefore several secure multiparty computation (SMC) protocols for securely and privately computing statistics of KPIs have recently been developed. These protocols are the basic building block for a privacy-preserving benchmarking system, but in order to complete an enterprise system that offers a benchmarking service to its customers more problems need to be solved. This paper addresses two remaining problems: peer group formation and protocol orchestration. We first analyze how peer group participation impacts privacy and vice-versa. Given current network performance limitations we conclude that in order for KPIs to remain private one subscriber can participate in at most one peer group. Peer group formation is the process of forming sensible peer groups out of the set of subscribers. A sensible peer group is one that is useful for benchmarking, i.e. a group of similar companies, under the constraint that one subscriber can participate in at most one peer group. We characterize subscribers by a set of discrete criteria and therefore view the automatic peer group formation as a data clustering problem. A data clustering algorithm customized for automatic peer group formation is required to build clusters whose size does not fall below a minimum threshold. We present a high-performance modification of k-means clustering that takes the minimum cluster size as an additional parameter which might be of independent interest. In a simulation we evaluate its practical applicability to automatic peer group formation. Our final approach is the first automatic peer group formation algorithm for an enterprise benchmarking system. Polling-based protocol orchestration allows the subscribers to remain passive clients, i.e. require no Inbound Connection, e.g. through a company firewall. We show through simulation that such a polling-based orchestration can be expected to complete within one polling interval.
Zhang Zhenchao - One of the best experts on this subject based on the ideXlab platform.
-
Design of wireless LAMOST control system based on Java
Computer Engineering and Applications, 2020Co-Authors: Zhang ZhenchaoAbstract:This paper proposed a telescope mobile control system based on Java to get over limitation of the remote,mobile and wireless control of telescope.The system adopted the J2ME-J2EE frame so that client can control the telescope in time through mobile terminal.This paper exploited telescope control client system on mobile terminal based on J2ME and server system based on J2EE.It achieved communication between client and server by XML format codes and used PushRegistry to dynamically register Inbound Connection network.This system achieved the control of LAMOST at"Any Time,Any Where,Any Body".
E. Van Hensbergen - One of the best experts on this subject based on the ideXlab platform.
-
INFOCOM - KNITS: switch-based Connection hand-off
Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2002Co-Authors: Athanasios E. Papathanasiou, E. Van HensbergenAbstract:This paper describes a mechanism allowing nodes to hand-off active Connections by utilizing Connection splicing at an edge-switch serving as a gateway to a server cluster. The mechanism is primarily intended to be used as part of a content aware request distribution strategy. Our approach uses an extended form of network address translation which maps Inbound Connection information (ie., address, port, and sequence number) to a separate outbound Connection. A key difference in our approach is that while the switch performs network address translation and TCP splicing, the actual hand-off is triggered by the back-end nodes. This relieves the switch of performing any application layer responsibilities. Nodes may hand-off Connections by first initiating a new Connection to the destination and then sending a message to the gateway which splices the two Connections together. The gateway modifies subsequent packet headers in order to create a transparent hand-off. This mechanism requires no modification to the operating system on the servers or the clients and supports HTTP/1.1 persistent Connections and pipelined requests. To test our design, we implemented a soft-switch using Linux Netfilter which includes the extended network address translation. We provide some preliminary performance analysis and make recommendations for future work.
E R Kraft - One of the best experts on this subject based on the ideXlab platform.
-
A HUMP SEQUENCING ALGORITHM FOR REAL TIME MANAGEMENT OF TRAIN Connection RELIABILITY
Journal of the Transportation Research Forum, 2020Co-Authors: E R KraftAbstract:This paper describes the hump sequencing component of the Terminal Priority Movement Planner (TPMP), a proof-of-concept decision support system field tested in 1994 at Union Pacific Railroad's Hinkle, Oregon, classification yard. The aim was not to make all Connections, but to ensure that at least a subset of the most important ones--those which would cause late deliveries if missed--were protected. Rather than automatically dropping late Connections, TPMP minimizes delays associated with holding outbound trains as necessary to protect Connections. When called for, the decision to drop a late Inbound Connection and leave cars behind is made by a human being, not a computer. A mixed integer, nonlinear mathematical programming problem is solved using breadth-first branch and bound search. Realistic 1-day problems are solved in 15-20 sec. on a microcomputer. Practical adaptations required to implement the procedure in a real world setting are also described. Considerable emphasis is given to discussion of factors affecting rail service reliability, and steps railroad management can take to improve performance.
Lu Ke-zhong - One of the best experts on this subject based on the ideXlab platform.
-
Design and Implementation of PushRegistry-Based Notify in Mobile Library
Computer Technology and Development, 2020Co-Authors: Lu Ke-zhongAbstract:As convenience of mobile telecom,devise application of mobile library with J2ME to build smart client.Using PushRegistry to dynamically register Inbound Connection network and scheduled alarm to achieve offline and online service and communication at any time,any where,any body in mobile library.At same time,realizes synchronization of data between servers and clients by SyncML.The superiority of PushRegistry lies in getting information initiative,in time and flexibly,satisfy necessity of mobile user richly.
