ppxscal/embedding_network huggingface dataset:
A Global Reputation Model for Grid Computing
Authors: Yiduo Mei, Shangyuan Guan, Zhixing Gao, Siyuan Ma, Xiaoshe Dong
Venue: International Journal of Distributed Sensor Networks (2009)

Trust and reputation are important decision-making factors in large-scale distributed systems. The Constellation Model is one of our previous works about grid resource management. Since local feedback plays an important role in aggregating global reputation, a new local feedback metric is introduced to reflect the dynamic feature of trust. This paper introduces our recent effort of combining reputation into the Constelltaion Model. We propose a novel global reputation model for grid systems such as Constellation Model. We model the relationship between global reputation and the nodes' feedback credibility. A node's feedback credibility which is calculated by similarity measurement will impact on its reputation in a direct way. In our model, to promote a node's reputation, there exist two possible ways: the first one is to provide high-quality services to others. The second way is to provide authentic feedbacks towards others. In addition, to evaluate a node's local feedback trustiness, approach based on similarity measurement is employed. If local feedback trustiness is too low, compensation calculated by exponential smoothing is applied. This design is employed to combat malicious collectives and slandering in large-scale communities. The computational framework of EigenTrust which is proposed by S. D. Kamvar at Stanford University is used to compute global reputations of all the nodes in the Constellation Model. In the Constellation Model, nodes (stars) in a solar system can be organized using a Peer-to-Peer way. Distributed Hash Table protocol such as Chord which is proposed by I. Stoica, et al. at University of California, Berkeley can be used to implement the distributed ranking mechanism. We have implemented a prototype of Constellation Model. Experimental results show that, our model can reflect dynamic characteristics of trust better. Our model can also improve the evaluation accuracy of global reputation by leveraging feedback credibility. In Comparison with EigenTrust, our model shows an improved robustness with the presence of malicious behaviors in the Constellation Model.
A Fish Disease Diagnosis Expert System Using Short Message Service
Authors: Guirong Wang, Daoliang Li
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

This paper presents a fish disease diagnosis system using the short message service (SMS) which can compensate the lacking of computer and the inconvenient using of Web-debased fish disease diagnosis system for poor basic-establishment of computer in countryside in China. This study is based on the broad using of mobile phone, the convenience of using short message service and the technology of short message platform, an equipment which can send and receive short message. The input format for user and the process of fish disease diagnose system based on SMS platform was designed and the system was implemented by the Java language. The platform has been pilot used and proved to be a very useful design tool with the high accurate diagnosis rate of 93.57% for fresh-water-fish diseases by fish disease diagnosis experts in Tianjin in China, and it provides a convenient and timely way to do fish disease diagnose by sending short message in given input format.
Building and Evaluating a Pattern Collection for the Domain of Workflow Modeling Tools
Authors: Kirstin Kohler, Daniel Kerkow
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

In this paper, we present the results of a case study conducted together with a small company that develops a workflow modeling tool. During the case study, we created a pattern collection for the domain of workflow modeling tools and evaluated a subset of these patterns. Beside the pattern description itself, the contribution of our work is a systematic process for identifying patterns. The results of the case study showed, that the identified pattern are a valuable instrument for software developers to improve the usability of their software in the given domain. Additionally this finding shows that the process of pattern identification is valuable as well.ACM Classification Keywords: H5.2. Information interfaces and presentations, Miscellaneous theory and methods, D.2.2 Software Engineering, Design Tools and Techniques.
Evolutionary Multi-Objective Optimization for Biped Walking
Authors: Toshihiko Yanase, Hitoshi Iba
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

We introduce an application of Evolutionary Multi- Objective Optimization on multi-layered robot control system. Recent robot control systems consist of many simple function modules. The parameter settings for most of these modules were manually adjusted in previous research. Our goal is to develop an automatic parameter adjustment method for the robot control system. In this paper, we focused on three modules as the experiment environment: whole-body motion generator, footstep planner and path planner. At first the features of these three modules are examined. Then we discuss the trade-off relationship between the requirements of each module. Finally, we examined an application of Evolutionary Multi-Objective Optimization on this problem.
Brief paper: An H∞ approach to the controller design of AQM routers supporting TCP flows
Authors: Feng Zheng, John Nelson
Venue: Automatica (Journal of IFAC) (2009)

In this paper, we aim at developing an H"~ approach to the design of an active queue management (AQM) based congestion controller for the Internet Protocol. In the approach, the available link bandwidth is modelled as a nominal constant value, which is known to the link, plus a time-variant disturbance, which is unknown. The design objective is to minimize the ratio, denoted as @c, between the norm of the perturbed queue length and that of the disturbance. An important feature of the approach is that the system performances, including the disturbance rejection ratio @c and hence the stability of closed-loop systems, are guaranteed for all round-trip times that are less than a known value. The design is described by matrix inequalities, which can be efficiently solved by the linear matrix inequality toolbox in Matlab.
Clustering Based on Data Attribute Partition and Its Visualization
Authors: Yonggong Ren, Alma Leora Culén
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

Clustering algorithms are the core technique of data mining, machine learning, pattern matching, bioinformatics and a number of other fields. This paper proposes a new clustering method based on attribute partitioning and a novel data visualization method. In a nutshell, the idea for our method is based on two steps: 1) cluster data set using primary and secondary attributes of data; 2) map color stimulus spectrum to RGB color space and visualize clustering using the chromaticity diagram of J.C. Maxwell (Maxwell's triangle). The experiments show that the algorithm is very efficient. In addition it is simple and easy to implement. Our visualization algorithm aims at helping the user to get an overview of data as well as in prediction and decision making processes.
The more plot: displaying measures of risk & error from simulation output
Authors: Barry L. Nelson
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The focus on mean (long-run average) performance as the primary output measure produced by simulation experiments diminishes the usefulness of simulation for characterizing risk. Confidence intervals on means are often misinterpreted as measures of future risk, when in fact they are measures of error. We introduce the Measure of Risk & Error (MORE) plot as a way to display and make intuitive the concepts of risk and error and thus support sound experiment design and correct decision making.
Interactive services in digital television infrastructure: flow of information and applications on mobile devices
Authors: Bojan Bakmaz, Zoran Bojkovic
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

The challenge of multimedia communications is to provide applications that integrate text, image, and video information and to do it in a way that presents ease of use and interactivity. This work describes interactive services in digital television infrastructure from the point of view of flow of information and applications on mobile devices. We start with a short overview concerning previous work on this hot topic. Then, we deal with the interactive services in digital television infrastructure. After that flow of information in the interactive TV services for mobile devices is described including applications on mobile devices.
How liquid is biological signalling?
Authors: Vincent Danos, Linus J. Schumacher
Venue: Theoretical Computer Science (2009)

This paper proposes an investigation of the global statistics of synthetic protein networks-a step towards a systemic understanding of their design space. We derive a liquidity index which describes the onset of the phase transition where an ensemble of agents aggregates into a giant cluster. This index captures the influence of both the domain distribution of agents and the binding strengths of their various domains in the limit of infinite populations. In simple cases it is possible to derive an explicit analytical expression of this index, which allows one to compare with simulations, and get a sense of how it transfers to the concrete finite case.
Optimal learning rules for familiarity detection
Authors: Andrea Greve, David C. Sterratt, David I. Donaldson, David J. Willshaw, Mark C. W. van Rossum
Venue: Biological Cybernetics (2009)

It has been suggested that the mammalian memory system has both familiarity and recollection components. Recently, a high-capacity network to store familiarity has been proposed. Here we derive analytically the optimal learning rule for such a familiarity memory using a signal- to-noise ratio analysis. We find that in the limit of large networks the covariance rule, known to be the optimal local, linear learning rule for pattern association, is also the optimal learning rule for familiarity discrimination. In the limit of large networks, the capacity is independent of the sparseness of the patterns and the corresponding information capacity is 0.057 bits per synapse, which is somewhat less than typically found for associative networks.
Two-phase mobile transaction validation in wireless broadcast environments
Authors: Miseon Choi, Wonik Park, Young-kuk Kim
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

In this paper, we propose a two-phase mobile transaction validation protocol making the best use of the strong point of (l, m) indexing broadcast data organization in wireless broadcast environments. It is based on OCC(Optimistic Concurrency Control) protocol which minimizes the excessive bi-directional communication by making transactions execute unhindered to their validation point. In the proposed protocol, the validation of a mobile transaction is performed in two-phase: partial validation phase and final validation phase. The partial validation is performed at the mobile client based on the control information contained in the broadcast disk and the final validation is performed on the committed and active transactions at the server. The proposed protocol tries to minimize the restart rate of mobile transactions as well as average transaction response time through adjusting serialization order of mobile transactions by exploiting the potential read/write set of mobile transactions.
Calculation of transformer tank losses
Authors: Milan Krasl, Rostislav Vlk
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

This paper presents the application of two finite-element approaches to calculate losses in the tank of the transformer. The first one is related to a two-dimensional time harmonic finite-element model, while the second one is based on a three-dimensional finite-element technique. The equations, boundary conditions and excitations of models are explained with some detail in this work. 25MVA transformer was calculated.
Effects of different rotor and stator constructions on the performance of switched reluctance motors
Authors: Caner Akuner, Durmus Uygun
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

This paper is carried out to develop a theoretical model for the simulation of 8/6-pole and 6/4-pole switched reluctance motors and describes the difference of these kinds of motors in dynamic characteristics such as magnetic field energy, magnetic field coenergy, magnitude of By, magnetization losses, steady-state weighted stress tensor torque, mutual inductance and so in performance. As known; finite element method (FEM) has been a powerful tool to solve many complex problems in electromagnetics. Thus; it has been possible to determine the effects of different rotor and stator constructions on the performance of motors. The comparison of the dynamic output performance for each motor provides the basis for the discussion on the relationship of output performance of switched reluctance motor to its physical size [2]. In this study; we are going to develop a model using Femm 4.0 software with respect to some main geometric and electromagnetic characteristics and we will try to explain the differences between the motors mentioned above.
Randomized Truthful Mechanisms for Scheduling Unrelated Machines
Authors: Pinyan Lu, Changyuan Yu
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

In this paper, we consider randomized truthful mechanisms for scheduling tasks to unrelated machines, where each machine is controlled by a selfish agent. Some previous work on this topic focused on a special case, scheduling two machines, for which the best approximation ratio is 1.6737 [5] and the best lower bound is 1.5 [6]. For this case, we give a unified framework for designing universally truthful mechanisms, which includes all the known mechanisms, and also a tight analysis method of their approximation ratios. Based on this, we give an improved randomized truthful mechanism, whose approximation ratio is 1.5963. For the general case, when there are m machines, the only known technique is to obtain a $\frac {\gamma m}{2}$-approximation truthful mechanism by generalizing a &gamma;-approximation truthful mechanism for two machines[6]. There is a barrier of 0.75m for this technique due to the lower bound of 1.5 for two machines. We break this 0.75m barrier by a new designing technique, rounding a fractional solution. We propose a randomized truthful-in-expectation mechanism that achieves approximation of $\frac{m+5}{2}$, for m machines. For the lower bound side, we focus on an interesting family of mechanisms, namely task-independent truthful mechanisms. We prove a lower bound of 11/7 for two machines and a lower bound of $\frac{m+1}{2}$ for m machines with respect to this family. They almost match our upper bounds in both cases.
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
Authors: Florian Sahling, Lisbeth Buschkühl, Horst Tempelmeier, Stefan Helber
Venue: Computers and Operations Research (2009)

This paper presents a new algorithm for the dynamic multi-level capacitated lot sizing problem with setup carry-overs (MLCLSP-L). The MLCLSP-L is a big-bucket model that allows the production of any number of products within a period, but it incorporates partial sequencing of the production orders in the sense that the first and the last products produced in a period are determined by the model. We solve a model which is applicable to general bill-of-material structures and which includes minimum lead times of one period and multi-period setup carry-overs. Our algorithm solves a series of mixed-integer linear programs in an iterative so-called fix-and-optimize approach. In each instance of these mixed-integer linear programs a large number of binary setup variables is fixed whereas only a small subset of these variables is optimized, together with the complete set of the inventory and lot size variables. A numerical study shows that the algorithm provides high-quality results and that the computational effort is moderate.
Privacy and securityAnswering the wrong questions is no answer
Authors: Eugene H. Spafford
Venue: Communications of the ACM (2009)

Asking the wrong questions when building and deploying systems results in systems that cannot be sufficiently protected against the threats they face.
Immune-based algorithms for dynamic optimization
Authors: Krzysztof Trojanowski, Sławomir T. Wierzchoń
Venue: Information Sciences: an International Journal (2009)

The main problem with biologically inspired algorithms (like evolutionary algorithms or particle swarm optimization) when applied to dynamic optimization is to force their readiness for continuous search for new optima occurring in changing locations. Immune-based algorithm, being an instance of an algorithm that adapt by innovation seem to be a perfect candidate for continuous exploration of a search space. In this paper we describe various implementations of the immune principles and we compare these instantiations on complex environments.
labAlive - A Java Toolbox for the Simulation of Systems
Authors: Erwin Riederer, Rolf Matzner
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The labAlive toolbox allows the development of interactive, animated simulations and demonstrations of communication systems. Students can explore complex learning contents, and since the toolbox is implemented in Java, the training material can seamlessly be integrated into the World Wide Web. To make the development of customized wirings as easy as possible, a framework is provided for the simulation task, user interaction and display. An inheritance hierarchy with base classes implements these tasks, and a set of ready to use objects is provided, e.g. wires, standard systems like sine-wave generator and oscillographs. Developing a new wiring mainly consists of creating the required systems and wires, connecting up and defining the graphical layout. Special focus has been put on the extendability of the toolbox. New systems and also their graphical representation can easily be implemented.
Xoom: a tool for zooming in and out of XML documents
Authors: Maya Ramanath, Kondreddi Sarath Kumar
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Suppose there is a large corpus of XML documents, each of which describes a movie released in the last 30 years (for example, extracted from IMDB). A movie enthusiast wants to make a list of interesting movies based on various criteria, such as, the genre, lead actors, directors, etc. She first decides to narrow the focus to just thrillers. However, she then has to look into each document individually, since only then is it possible for her to tell whether the combination of actors, directors, etc. interests her. This would be time-consuming if the documents in question contain hundreds of tags each. Instead, she could use our tool Xoom (XML-Zoom) which can extract and present the key information in every document. This would drastically cut down the time to go through the documents. She could then use Xoom to zoom into specific portions of each of the remaining documents, instead of opening and scanning them from top to bottom. In this proposal, we describe the construction of Xoom and outline a demonstration.
High Performance Hardware Architecture of Linear Filters for Intelligent Video Processing
Authors: Tse-Wei Chen, Shao-Yi Chien
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Image filtering is an essential process in the field of image processing, and linear image filters with large kernels are especially significant for computer vision or intelligent video processing. In this paper, a high performance hardware architecture of linear image filters, which is designed for embedded system in mobile devices, is proposed and analyzed. This linear filter hardware is capable of dealing with a 15 by 15 kernel by using massively parallel processing elements, and it offers a set of configurable parameters, which generalizes the functionality to handle different kinds of linear filters in most applications.
Synthesis and characterization of blue emitting ZnSe quantum dots
Authors: J. J. Andrade, A. G. Brasil,  Jr., P. M. A. Farias, A. Fontes, B. S. Santos
Venue: Microelectronics Journal (2009)

In this work we show a new experimental methodology to obtain ZnSe nanocrystals in aqueous solution aiming their application as biophotonic probes. The nanocrystals were obtained using a simple procedure based on the arrested precipitation of ZnSe in aqueous solution in the presence of a thiol-alkyl stabilizing agent, in air and at room temperature. Using post-preparative experimental procedures on the colloidal particles, blue and green emissions were observed. The structural characterization (powder X-ray diffraction and electronic transmission microscopy) shows that the particles were obtained in the quantum confinement regime (d=2-4nm) and possess a zinc-blend crystalline structure. The optical properties of the suspensions were determined by electronic absorption, excitation and emission spectroscopies and are discussed in terms of their size and chemical compositions.
Semantic Support for Quantitative Research Processes
Authors: Hajo Rijgersberg, Jan Top, Marcel Meinders
Venue: IEEE Intelligent Systems (2009)

Abstract: Collaboration in science requires a shared model of underlying workflows and concepts. In addition to leveraging information exchange between scientists, the shared model should enable automated invocation of computational (numerical) methods from a conceptual level. In this way, the model fills the gap between humans interpreting textual information and computers processing the underlying data and mathematical models. To this end, the authors propose an ontology of quantitative research (OQR). The OQR is based on established tenets of the philosophy of science. Scientific quantities expressed in OQR can be used directly as input to computational methods. The authors demonstrate the OQR's quality by applying it to a case of quantitative food research. Finally, they describe an application in Quest, a prototype quantitative e-science tool.
Browser battles: opera, crossover chromium and flock
Authors: James Gray
Venue: Linux Journal (2009)

Stuck on Firefox? You may find fulfillment in an alternative browser.