ppxscal/embedding_network huggingface dataset:
Analysis of the effects of magnetizing inrush current on power transformer differential protection
Authors: Fouad Rekina, Dris Ouahdi
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

In this paper, a differential protection using second harmonic restrain and fifth harmonic block schemes for power transformer protection is presented. First we review the concept of differential protection, and describe the magnetizing inrush current and over-excitation phenomena as they belong to the causes of the protection male-operation. Second, we investigate harmonic restrain scheme and microprocessor based-protection on power transformer differential protection. Finally the relay logic and the algorithm that uses Discreet Fourier transformer for extraction of fundamental and higher harmonics components of differential current are presented.
Trace-based derivation of a scalable lock-free stack algorithm
Authors: Lindsay Groves, Robert Colvin
Venue: Formal Aspects of Computing (2009)

We show how a sophisticated, lock-free concurrent stack implementation can be derived from an abstract specification in a series of verifiable steps. The algorithm is based on the scalable stack algorithm of Hendler et al. (Proceedings of the sixteenth annual ACM symposium on parallel algorithms, 27&#x2013;30 June 2004, Barcelona, Spain, pp 206&#x2013;215), which allows push and pop operations to be paired off and eliminated without affecting the central stack, thus reducing contention on the stack, and allowing multiple pairs of push and pop operations to be performed in parallel. Our algorithm uses a simpler data structure than Hendler, Shavit and Yerushalmi&#x2019;s, and avoids an ABA problem. We first derive a simple lock-free stack algorithm using a linked-list implementation, and discuss issues related to memory management and the ABA problem. We then add an abstract model of the elimination process, from which we derive our elimination algorithm. This allows the basic algorithmic ideas to be separated from implementation details, and provides a basis for explaining and comparing different variants of the algorithm. We show that the elimination stack algorithm is linearisable by showing that any execution of the implementation can be transformed into an equivalent execution of an abstract model of a linearisable stack. Each step in the derivation is either a data refinement which preserves the level of atomicity, an operational refinement which may alter the level of atomicity, or a refactoring step which alters the structure of the system resulting from the preceding derivation. We verify our refinements using an extension of Lipton&#x2019;s reduction method, allowing concurrent and non-concurrent aspects to be considered separately.
Advances in Artificial Intelligence - IBERAMIA 2008: 11th Ibero-American Conference on AI, Lisbon, Portugal, October 14-17, 2008. Proceedings (Lecture ... / Lecture Notes in Artificial Intelligence), 1 edition
Authors: Hecto Geffner, Rui Prada, Isabel Machado Alexandre, Nuno David
Venue:  (2008)

This book constitutes the refereed proceedings of the 11th Ibero-American Conference on Artificial Intelligence, IBERAMIA 2008, held in Lisbon, Portugal, in October 2008. The 46 papers presented were carefully reviewed and selected from 147 submissions. The papers are organized in topical sections on Knowledge Representation; Planning and Scheduling; Constraint Satisfaction and Optimization; Probabilistic Reasoning; Machine Learning; Multiagent Systems; Natural Language Processing; Intelligent Information Systems and NLP; Robotics; and Applications.
A multidimensional data model for environment protection
Authors: Constanta Zoie Radulescu, Marius Radulescu
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

On-Line Analytical Processing (OLAP) is a trend in database technology, based on the multidimensional view of data and it is an indispensable component of the so-called business intelligence technology. The paper presents an approach based on OLAP technology for solving some decision problems about environment protection. A multidimensional data model for water pollution in the textil e industry is described. An analysis of this model is performed using OLAP. Several risk measures for pollution assessment are defined. One of them, the upper partial moment, is applied for the risk management.
Surrogate Models for Shape Optimization of Underwater Glider
Authors: Haitao Gu, Lin Yang, Zhiqiang Hu, Jiancheng Yu
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Design of experiments and surrogate models method facilitating much of today’s engineering design and optimization. In this paper we systematically compare several experimental design types and surrogate modeling techniques in terms of their capability to generate accurate approximations for the shape optimization of underwater gliders. The parametric geometry construction, mesh generation and computation fluid dynamics were integrated as an automatic analysis process. Procedures of surrogate model construction were presented and the characteristics and applicability of response surface model and radial basis function model were discussed. A fast design exploration and multi-objective optimization was implemented. At last, the optimal plane shape of the Underwater Glider was found out based on the surrogate model.
Understanding the privacy-efficiency trade-off in location based queries
Authors: Gabriel Ghinita
Venue: Proceedings of the SIGSPATIAL ACM GIS 2008 International Workshop on Security and Privacy in GIS and LBS (2008)

Mobile devices with global positioning capabilities (e.g., GPS) allow users to ask queries relative to their present location. Since certain queries may be privacy-sensitive, it is important to protect the identity of the users who send requests for Location-based Services (LBS). Instead of reporting the exact user location to the LBS provider, existing privacy-preserving techniques either perturb or encrypt the location data. Current LBS privacy solutions fall into several categories, based on the type of location transformation they employ, and the system architecture they rely on. This position paper introduces a taxonomy of LBS privacy solutions, and discusses the privacy-efficiency trade-offs achieved by various techniques. It also identifies several open problems, and proposes some interesting directions for future research.
A current-mode DC-DC converter using a quadratic slope compensation scheme
Authors: Chihiro Kawabata, Yasuhiro Sugimoto
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

A quadratic slope compensation scheme for a current-mode DC-DC converter to obtain stable frequency characteristics without depending on the input and output voltages is proposed. A 5 MHz and 500 mA buck DC-DC converter with input voltages ranging from 3.3 V to 2.5 V and with output voltages ranging from 2.5 V to 0.5 V was fabricated by using a 0.35 &mu;m CMOS process to verify the effectiveness of the scheme. Little variation of frequency characteristics at frequencies above 200 KHz for the various input and output voltages was observed.
The prospects for commercial satellite services at Q- and V-band
Authors: J. V. Evans, A. Dissanayake
Venue: Space Communications (1998)

Some sixteen proposed new satellite systems operating in the Q- (36-46 GHz) and V- (46-56 GHz) bands have been proposed to the FCC by United States companies. Of these, fourteen are intended to provide a global, or nearly-global, service. One is for United States domestic service and one is a package to provide additional store-and-forward capability on an earlier proposed &lsquo;Little LEO&rsquo; system. This paper provides a brief description of the fourteen global systems which, for the most part, are designed to exploit the wide band of frequencies available for services such as multimedia distribution and Internet access. Systems are proposed that would use geostationary, medium-earth orbit, low-earth orbit, and Molniya orbit satellites, and in some cases, combinations of two of these orbits. Most of these new systems propose to exploit new technologies such as multiple narrow spot-beam antennas, on-board demodulation and routing of traffic between beams, intersatellite-links and in some cases, the scanning of the beams to continuously illuminate the service area as the satellite flies by. The paper discusses some of the difficulties of fielding systems at these high frequencies arising out of the propagation impairments that can be expected and the high cost of solid-state power devices for user terminals, which will drive up costs. It is concluded that while the large amount of bandwidth (3 GHz) that has been proposed by the FCC for these systems is attractive, few, if any, are likely to be built while spectrum remains available at Ka-band.
Private International Law and the Internet
Authors: Dan Svantesson
Venue:  (2007)

In this fresh and original approach to what is perhaps the most crucial current issue in private international law, Dan Svantesson examines how the Internet affects and is affected by the four fundamental questions: When should a lawsuit be entertained by the courts? Which state's law should be applied? When should a court that can entertain a lawsuit decline to do so? And will a judgement rendered in one country be recognised in another? He identifies eleven characteristics of Internet communication that are relevant to these questions, and then proceeds with a detailed investigation of whether and to what extent these characteristics (or their closest analogues) have already been dealt with in legal issues arising from other forms of communication. Dr Svantesson's approach focuses on several issues that have far-reaching consequences in the Internet context, including the following: cross-border defamation; cross-border business contracts; and cross-border consumer contracts. A wide survey of private international law solutions encompasses insightful analyses of relevant laws adopted in a variety of countries - including Australia, England, Hong Kong, the United States, Germany, Sweden, and China - as well as in international instruments. There is also a chapter on advances in geo-identification technology and its special value for legal practice. The book concludes with two model international conventions, one on cross-border defamation and one on cross-border contracts. Dr Svantesson's book brings together a wealth of research findings in the overlapping disciplines of law and technology that will be of particular utility to practitioners and academics working in this new and rapidly changing field. His thoughtful analysis of the interplay of the developing Internet and private international law will also be of great value, as will the tools he offers with which to anticipate the future. "Private International Law and the Internet" provides a remarkable stimulus to continue working towards globally acceptable rules on jurisdiction, applicable law, and recognition and enforcement of judgments for communication via the World Wide Web.
A Collaborative Task Modeling Approach Based on Extended GOMS
Authors: Lu Liang, Xiaoling Deng
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Usability Evaluation is traditionally used in the late stage of software development process. However, to some high-cost complex distributed collaborative software, such late-usability-evaluation or single-user-oriented usability inspection are unsuitable in modern situation. The early stage of evaluation always relies on a task model (interface model) to simulate the actions of real user. However, the existing task analysis models neither provide enough support to the high-level use-context, nor address the low-level description of the basic unit of collaborative behavior (such two level factors always have great effect on the usability of collaborative software). Thus, this paper analyzed the limitation of the traditional GOMS method, and then put forward a task modeling approach based on GOMS to fit usability evaluation in collaborative environment. This approach cost less, and is easy to be applied in the early development stage to discover and modify usability problems.
The complexity of ranking hypotheses in optimality theory
Authors: Jason Riggle
Venue: Computational Linguistics (2009)

Given a constraint set with k constraints in the framework of Optimality Theory (OT), what is its capacity as a classification scheme for linguistic data? One useful measure of this capacity is the size of the largest data set of which each subset is consistent with a different grammar hypothesis. This measure is known as the Vapnik-Chervonenkis dimension (VCD) and is a standard complexity measure for concept classes in computational learnability theory. In this work, I use the three-valued logic of Elementary Ranking Conditions to show that the VCD of Optimality Theory with k constraints is k-1. Analysis of OT in terms of the VCD establishes that the complexity of OT is a well-behaved function of k and that the 'hardness' of learning in OT is linear in k for a variety of frameworks that employ probabilistic definitions of learnability.
DWR Java AJAX Applications
Authors: Sami Salkosuo
Venue:  (2008)

This book covers all the theoretical and practical knowledge required for working with DWR. The book is packed with code and graphics with step-by-step explanations. This book is written for competent Java developers and assumes that you are a professional rather than hobbyist. You should be familiar with the concepts of programming, Web 2.0, and AJAX.
Performance Evaluations of Listed Companies Based on Projection Pursuit by Real-coded Accelerating Genetic Algorithm
Authors: Xin-li Wang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In order to evaluating performance of listed companies comprehensively, this paper analyzes multi-index based on projection pursuit，and optimize the weight of financial indicators by Using RAGA (Real coding based on Accelerating Genetic Algorithm). This method succeeded in dynamic weighing, makes full use of data, obtains more reasonable and scientific comprehensive performance evaluation.
A queueing network based system to model capacity and cycle time for semiconductor fabrication
Authors: Horst Zisgen, Ingo Meents, Benjamin R. Wheeler, Thomas Hanschke
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In today's competitive semiconductor business environment, wafer manufacturers are facing continuous pressure to accurately predict cycle time and tool utilization, gauge the impact of changes in capacity available, assess the impact of changes in product mix and quantity, and determine action plans to improve operational performance. Discrete Event Simulation (DES) is a widely used approach to perform such an analysis. However, DES has some inherent shortcomings for these planning tasks. Analytical models, like queueing networks, have much shorter response times and additional advantages compared to DES. But due to the complexity of semiconductor manufacturing systems (SMS) queueing models were not able to model all the peculiarities of those. This paper provides an overview of the main features of the IBM Enterprise Production planning and Optimization System (EPOS), a queueing network based system, which closes this gap. EPOS has been in use in the 300mm fabrication of IBM in Fishkill for more than 2 years and has turned out to be an invaluable tool to analyze the trade-offs of cycle time and capacity within this complex environment.
Modeling and Consistency Checking Based on Category for Web Navigation Behavior
Authors: Xin-lin Zhang, Huai-kou Miao, Hong-wei Zeng
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Using formal method is an effective methodology for modeling and verifying software system. Category theory provides a kind of common language, tool, thinking method and study means for other mathematics subjects, in which a sketch as a formal structure is a specification based on graphs. This paper gives a linear sketch for the Web navigation behavior, and constructs a formal model based on the category theory, which satisfies the given requirements and the specification described by the sketch, and proposes a method of the model consistency checking by constructing the free category, and discusses the security of the navigation model. Some rules of the link-security and return-security together with the corresponding approach to security checking are given as well as.
Online scheduling on two uniform machines to minimize the makespan
Authors: Ming Liu, Yinfeng Xu, Chengbin Chu, Feifeng Zheng
Venue: Theoretical Computer Science (2009)

We consider two problems of online scheduling on two uniform machines: online scheduling under a grade of service (GoS) and online scheduling with reassignment. These problems are online in the sense that when a job presents, we have to irrevocably assign it to one of the machines before the next job is seen. The objective is to minimize the makespan. In the first problem, GoS means that some jobs have to be processed by some machine so that they can be guaranteed a higher quality. Assume that the speed of the higher GoS machine is normalized to 1, while the speed of the other one is s. We show that a lower bound of competitive ratio is 1+2ss+2 in the case 01. Then we propose and analyze two online algorithms: HSF algorithm and EX-ONLINE algorithm. HSF is optimal in the case where s>1 and @S"1>=@S"2s, where @S"1 and @S"2 denote the total processing time of jobs which request higher GoS machine and the total processing time of jobs which request the normal one, respectively. EX-ONLINE is optimal in the case 2(2-1)@?s@?1. In the second problem, we study two subproblems P"L and P"A proposed in [Z. Tan, S. Yu, Online scheduling with reassignment, Operations Research Letters 36 (2008) 250-254]. Assume that the speeds of 2 uniform machines are 1 and s>=1, respectively. For P"L where we can reassign the last k jobs of the sequence, we show a lower bound of competitive ratio 1+11+s. For P"A where we can reassign arbitrary k jobs, we show a lower bound of competitive ratio (s+1)^2s^2+s+1. We propose a s+1s-competitive algorithm HSF-1 for both P"L and P"A. For P"A, we propose a (s+1)^2s+2-competitive algorithm EX-RA, which is superior to HSF-1 when 1@?s@?2.
Practical approach to experimentation in a simulation study
Authors: Benny Tjahjono, Raúl Fernández
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Simulation study of complex production facilities can be a challenging task for manufacturing engineers as it requires skills to build the models and to conduct experiments. Accurate modeling but inadequate experimentation may lead to poor decision and can be detrimental particularly when financial investment is involved. This paper proposes a practical approach to simulation experimentation in the context of simulation study of an engine assembly line. The overall aim of the study was to increase the productivity and efficiency of the line. The approach was deployed in the form of a methodology that was used to select the most feasible outcome from a series of simulation experiments, taking into account the minimum effort/investment needed to implement the improvement.
Linux Application Development, 2nd edition
Authors: Michael K. Johnson, Erik W. Troan
Venue:  (2008)

"The first edition of this book has always been kept within arm's reach of my desk due to the wonderful explanations of all areas of the Linux userspace API. This second edition greatly overshadows the first one, and will replace it."--Greg Kroah-Hartman, Linux kernel programmer Develop Software that Leverages the Full Power of Today's Linux Linux Application Development, Second Edition, is the definitive reference for Linux programmers at all levels of experience, including C programmers moving from other operating systems. Building on their widely praised first edition, leading Linux programmers Michael Johnson and Erik Troan systematically present the key APIs and techniques you need to create robust, secure, efficient software or to port existing code to Linux. This book has been fully updated for the Linux 2.6 kernel, GNU C library version 2.3, the latest POSIX standards, and the Single Unix Specification, Issue 6. Its deep coverage of Linux-specific extensions and features helps you take advantage of the full power of contemporary Linux. Along the way, the authors share insights, tips, and tricks for developers working with any recent Linux distribution, and virtually any version of Unix. Topics includeDeveloping in Linux: understanding the operating system, licensing, and documentation The development environment: compilers, linker and loader, and unique debugging tools System programming: process models, file handling, signal processing, directory operations, and job control Terminals, sockets, timers, virtual consoles, and the Linux console Development libraries: string matching, terminal handling, command-line parsing, authentication, and more Hundreds of downloadable code samples New to this editionThe GNU C library (glibc), underlying standards, and test macros Writing secure Linux programs, system daemons, and utilities Significantly expanded coverage of memory debugging, including Valgrind and mpr Greatly improved coverage of regular expressions IPv6 networking coverage, including new system library interfaces for using IPv6 and IPv4 interchangeably Coverage of strace, ltrace, real-time signals, poll and epoll system calls, popt library improvements, Pluggable Authentication Modules (PAM), qdbm, and much more Improved index and glossary, plus line-numbered code examples
Multi-level SLA Management for Service-Oriented Infrastructures
Authors: Wolfgang Theilmann, Ramin Yahyapour, Joe Butler
Venue: Proceedings of the 1st European Conference on Towards a Service-Based Internet (2008)

The ongoing transformation of a product-oriented economy towards a service-oriented economy has come to a critical point. In order to have services as tradable goods, the conditions of their provisioning need to be exactly specified and managed. Service Level Agreements (SLAs) have become a common means for specifying these conditions at a singular level. However, realistic service provisioning scenarios involve multiple stakeholders and layers of a business/IT stack.This paper presents an approach for multi-level SLA management, where SLAs are consistently specified and managed within a service-oriented infrastructure (SOI). We present the general approach of an SLA management framework, a conceptual architecture and some insights into industrial practice in various domains.
Four new sums of graphs and their Wiener indices
Authors: Mehdi Eliasi, Bijan Taeri
Venue: Discrete Applied Mathematics (2009)

The Wiener index is the sum of distances between all vertex pairs in a connected graph. This notion was motivated by various mathematical properties and chemical applications. In this paper we introduce four new operations on graphs and study the Wiener indices of the resulting graphs.