ppxscal/embedding_network huggingface dataset:
Individually-optimal equilibria of noncooperative games in preference relations
Authors: S. O. Mashchenko
Venue: Cybernetics and Systems Analysis (2009)

For a game specified on a set of situations by preference relations of players, the individual optimum principle is considered that is a generalization of Nash, Berge, and Pareto optimum principles. On this basis, different types of equilibria and stability of game problems are characterized and investigated.
Organizational culture and stakeholder power: a case study of postgraduate initiatives in e-government
Authors: Frances Slack, John Walton
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

We propose the deployment of strategic models such as the Cultural Web and stakeholder analysis to gain insights into the delivery of e-Government in a local authority in the United Kingdom. Despite using mature technological approaches, the implementation issues can only be addressed using organizational frameworks with an information systems focus. A joint venture between a telecommunications company and local authorities in the UK has provided a case study for exploration of the role of post-graduate education as an intervention in organizational transformation. This approach identifies and suggests initiatives that involve meeting and addressing the different demands of stakeholders. Data collection has been carried out through qualitative methods of interviews and participant observation. In addition, action research has been used to explore the perceptions and learning of the students in this case study. The outcome has indicated the paradigms of the two groups involved in the case study. It has revealed further research questions to be addressed in the implementation of e-Government at both local and national levels in the UK and, we expect, the wider world.
Multi-dimensional dynamic facility location and fast computation at query points
Authors: S. Abravaya, D. Berend
Venue: Information Processing Letters (2009)

We present O(nlogn) time algorithms for the minimax rectilinear facility location problem in R^1 and R^2. The algorithms enable, once they terminate, computing the cost of any given query point in O(logn) time. Based on these algorithms, we develop a preprocessing procedure which enables solving the following two problems: Fast computation of the cost of any query point in R^d, and fast solution for the dynamic location problem in R^2 (namely, in the presence of an additional facility). Finally, we show that the preprocessing always gives a bound on the optimal value, which allows us in many cases to find the optimum fast (for both the traditional and the dynamic location problems in R^d for any d).
Chlorophyll-a bloom along the southern coasts of Java and Sumatra during 2006
Authors: I. Iskandar, S. A. Rao, T. Tozuka
Venue: International Journal of Remote Sensing (2009)

Nine years of chlorophyll-a concentration data provided by the Sea-viewing Wide-Field of view Sensor (SeaWiFS) revealed an unusual bloom along the southern coastal area of Java and Sumatra during 2006. The bloom was generated by anomalous strong southeasterly winds along the coasts of Java and Sumatra associated with the Indian Ocean Dipole (IOD) event. The bloom evolution started in July 2006 and intensified during August 2006. Peak positive anomalies exceeding 4.0 mg m-3 were evident in September-November coinciding with the peak phase of the IOD. The blooms, thereafter, diminished rapidly in December 2006. In addition, there was an offshore intensification of chlorophyll-a distribution off eastern Java during November initiated by upwelling-favourable winds along the coast. Concurrent altimeter data show that the offshore intensification was co-located with the cyclonic eddies that further enhanced the intensification by increasing the concentration of nutrients in the euphotic zone.
Foreground detection based on motion vector from compressed video
Authors: Zhu Leiqi, Xue Ping, Zhang Qishan
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

A new algorithm to distinguish the foreground from compressed videos is proposed in this paper. Local motion, which is estimated from the residual between the original motion and the global motion, is one of the strongest influences on visual attention. Global motion is modeled by four parameters related to camera pan, tilt, zoom and rotation. The initial parameters are obtained from the least-squares method and updated iteratively using the Levenberg-Marquardt algorithm. Temporal and spatial filters are also introduced to revise the final global motion. In addition, DC coefficients are employed to refine the result based on the local motion. Experiments show that the proposed algorithm can segment foreground effectively with a largely reduced computational complexity, as DC coefficients and motion vectors can easily be extracted from compressed videos.
Ninja on a Plane: Automatic Discovery of Physical Planes for Augmented Reality Using Visual SLAM
Authors: Denis Chekhlov, Andrew P. Gee, Andrew Calway, Walterio Mayol-Cuevas
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

Most work in visual augmented reality (AR) employs predefined markers or models that simplify the algorithms needed for sensor positioning and augmentation but at the cost of imposing restrictions on the areas of operation and on interactivity. This paper presents a simple game in which an AR agent has to navigate using real planar surfaces on objects that are dynamically added to an unprepared environment. An extended Kalman filter (EKF) simultaneous localisation and mapping (SLAM) framework with automatic plane discovery is used to enable the player to interactively build a structured map of the game environment using a single, agile camera. By using SLAM, we are able to achieve real-time interactivity and maintain rigorous estimates of the system's uncertainty, which enables the effects of high quality estimates to be propagated to other features (points and planes) even if they are outside the camera's current field of view.
Power-Efficient Reconfiguration Control in Coarse-Grained Dynamically Reconfigurable Architectures
Authors: Dmitrij Kissler, Andreas Strawetz, Frank Hannig, Jürgen Teich
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

Coarse-grained reconfigurable architectures deliver high performance and energy efficiency for computationally intensive applications like mobile multimedia and wireless communication. This paper deals with the aspect of power-efficient dynamic reconfiguration control techniques in such architectures. Proper clock domain partitioning with custom clock gating combined with automatic clock gating resulted in a 35% total power reduction. This is more than a threefold as compared to the single clock gating techniques applied separately. The corresponding case study application with 0.064 mW/MHz and 124 MOPS/mW power efficiency outperforms the major coarse-grained and general purpose embedded processor architectures by a factor of 1.7 to 28.
On Locally Linear Classification by Pairwise Coupling
Authors: Feng Chen, Chang-Tien Lu, Arnold P. Boedihardjo
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Locally linear classification by pairwise coupling addresses a nonlinear classification problem by three basic phases: decompose the classes of complex concepts into linearly separable subclasses, learn a linear classifier for each pair, and combine pairwise classifiers into a single classifier. A number of methods have been proposed in this framework. However, these methods have two major deficiencies: 1) lack of systematic evaluation of this framework; 2) naive application of clustering algorithms to generate subclasses. This paper proves the equivalence between three popular combination schemas under general settings, defines several global criterion functions for measuring the goodness of subclasses, and presents a supervised greedy clustering algorithm to optimize the proposed criterion functions. Extensive experiments were conducted to validate the effectiveness of the proposed techniques.
The Complexity of Early Deciding Set Agreement: How can Topology help?
Authors: Rachid Guerraoui, Bastian Pochon
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

The aim of this paper is to pose a challenge to the experts of (algebraic) topology techniques. We present an early deciding algorithm that solves the set agreement problem, i.e., the problem which triggered research on applying topology techniques to distributed computing. We conjecture the algorithm to be optimal, and we discuss the need and challenges of applying topology techniques to prove the lower bound.
Efficient allocation and composition of distributed storage
Authors: Jimmy Secretan, Malachi Lawson, Ladislau Bölöni
Venue: The Journal of Supercomputing (2009)

In this paper, we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of finding the optimal composition for availability and price requirements can be reduced to the knapsack problem, and propose three techniques for efficiently finding approximate solutions. The first algorithm uses a dynamic programming approach to find mirrored storage resources for high availability requirements, and runs in the pseudo-polynomial O(n 2 c) time where n is the number of sellers&rsquo; resources to choose from and c is a capacity function of the requested and minimum availability. The second technique is a heuristic which finds resources to be agglomerated into a larger coherent resource, with complexity of O(nlog&thinsp;n). The third technique finds a compromise between capacity and availability (which in our phrasing is a complex integer programming problem) using a genetic algorithm. The algorithms can be implemented on a broker that intermediates between buyers and sellers of storage resources. Finally, we show that a broker in an open storage market, using the combination of the three algorithms can more frequently meet user requests and lower the cost of requests that are met compared to a broker that simply matches single resources to requests.
The double paging anomaly
Authors: Robert P. Goldberg, Robert Hassinger
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Belady's paging anomaly has illustrated that certain page replacement algorithms can cause more page faults as the size of memory increases. Mattson has shown that there exists a class of algorithms called stack algorithms (such as LRU least recently used) which cannot cause more page faults as memory size increases. In this paper, we investigate the dynamics of double-paging, i.e., running a paged operating system, e.g., IBM's OS/VS2, under a paged virtual machine monitor, e.g., VM/370. In particular, we show that an increase in the size of the memory of the virtual machine without a corresponding increase in its real memory size can lead to a significant increase in the amount of paging, even for the LRU algorithm.
A fast resurrected core-spreading vortex method with no-slip boundary conditions
Authors: Mei-Jiau Huang, Huan-Xun Su, Li-Chieh Chen
Venue: Journal of Computational Physics (2009)

To simulate two-dimensional viscous incompressible flows based on a scheme of blob splitting and merging, we developed a vortex method and employed a fast multipole method to speed the computation of velocities. The diffusion of the vortex sheet induced at a solid wall by the no-slip boundary conditions is first modeled according to the analytical solution of Koumoutsakos and then converted into discrete blobs in the vicinity of the wall. To prevent the vorticity from entering the solid body, we introduce a concept residual circulation in a sense that only a partial circulation of the vortex sheet is diffused into the flow field; the rest remains at the wall. Blobs near the wall are thus avoided. Blobs near the wall that might cause large fluctuations in the strength of the vortex sheet are handled similarly. The solver thus developed requires no grid-based remeshing. We applied this solver to simulate the flow induced with an impulsively initiated circular cylinder; the results agree satisfactorily with those of previous experimental and numerical investigations.
Netezza Underground: The unauthorized tales of derring-do and adventures in resilient data warehousing solutions.
Authors: David Birmingham
Venue:  (2008)

Welcome to the Underground! Ever wanted to know more about the most powerful data processing technology on the planet? Look no further than this foray into the simplest, most effective and easiest-to-implement data appliance that the marketplace has to offer. Get some insight into the data warehousing principles that spawned the genius inside the big black box, how to leverage it to meet critical deadlines, and how to put some serious processing juice to work on a large-scale problem domain. Need some gravity-bending power to shape and mold whole terabytes-at-a-time like they were so much warm cookie dough? Inside are some tricks, tips and opinions on how to make a smooth and clean transition from an underpowered - er - overwhelmed data processing system and into the future of a quietly running appliance - that can inhale and exhale data at scales that will blow your mind. Okay, enough of the hype. Just crack the pages and get moving. This book is for those who already have a machine (and those who might want to just kick the tires). But keep in mind, once you kick the tires, youll want one. Maybe two.
A Mobile Blended Learning Approach Based on Podcasts with Respect to the Students' Media Literacy
Authors: Karsten Morisse, Michaela Ramm, Thomas Schüler, Svenja Wichelhaus
Venue: Proceedings of the 2009 International Conference on Mobile, Hybrid, and On-line Learning (2009)

Since several years lecture recordings have intensively been used as a teaching tool. Several courses are provided with lecture recordings as complementary learning material. Several distribution variants of lecture recordings have been investigated. Podcasts have established as a comfortable distribution technology for lecture recordings and are now established as a regular service for lecturing. This article describes how lecture recordings and podcasts have changed the way of teaching. A blended learning scenario has been set up based on mobile podcast technology. The classical lecture is substituted by coaching sessions, the transfer of knowledge is sourced out of the lecture hall. As a side effect of this didactical concept, the students' competence of self-organization can be enhanced.
Unconditionally secure disjointness tests for private datasets
Authors: Qingsong Ye, Huaxiong Wang, Josef Pieprzyk, Xian-Mo Zhang
Venue: International Journal of Applied Cryptography (2009)

We present two unconditional secure protocols for private set disjointness tests. In order to provide intuition of our protocols, we give a naive example that applies Sylvester matrices. Unfortunately, this simple construction is insecure as it reveals information about the intersection cardinality. More specifically, it discloses its lower bound. By using the Lagrange interpolation, we provide a protocol for the honest-but-curious case without revealing any additional information. Finally, we describe a protocol that is secure against malicious adversaries. In this protocol, a verification test is applied to detect misbehaving participants. Both protocols require O(1) rounds of communication. Our protocols are more efficient than the previous protocols in terms of communication and computation overhead. Unlike previous protocols whose security relies on computational assumptions, our protocols provide information theoretic security. To our knowledge, our protocols are the first ones that have been designed without a generic secure function evaluation. More important, they are the most efficient protocols for private disjointness tests in the malicious adversary case.
Imitation guided learning in learning classifier systems
Authors: Marc Métivier, Claude Lattaud
Venue: Natural Computing: an international journal (2009)

In this paper, we study the means of developing an imitation process allowing to improve learning in the framework of learning classifier systems. We present three different approaches in the way a behavior observed may be taken into account through a guidance interaction: two approaches using a model of this behavior, and one without modelling. Those approaches are evaluated and compared in different environments when they are applied to three major classifier systems: ZCS, XCS and ACS. Results are analyzed and discussed. They highlight the importance of using a model of the observed behavior to enable an efficient imitation. Moreover, they show the advantages of taking this model into account by a specialized internal action. Finally, they bring new results of comparison between ZCS, XCS and ACS.
Performance analysis of a Poisson-Pareto queue over the full range of system parameters
Authors: Ronald G. Addie, Timothy D. Neame, Moshe Zukerman
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

There have been many queuing analyses for a single server queue fed by an M/G/~ traffic process, in which G is a Pareto distribution, that focus on certain limiting conditions. In this paper we enhance the so-called Quasi-Stationary (QS) approximation - a queuing analysis introduced previously that provides an algorithm for computation of an accurate approximation for the stationary queue distribution, applicable to the entire range of system parameters. By numerical evaluation of the QS approximation and the asymptotic approximations (large buffer, many sources, and heavy traffic) over an extremely wide range of parameter values we are able to graphically display consistency of the QS approximation with all the asymptotic results. We demonstrate that the accuracy of the asymptotic approximations is satisfactory only in limited regions of the system parameter space.
Integration of product quality and tool degradation for reliability modelling and analysis of multi-station manufacturing systems
Authors: J. Sun, L. Xi, E. Pan, S. Du, B. Ju
Venue: International Journal of Computer Integrated Manufacturing (2009)

The degradation of a tool component at an upstream station may cause the deterioration of the dimensional quality of a downstream workpiece. Meanwhile, the tool failure and its induced system reliability are affected by the incoming product quality from an upstream station. Quality and reliability interaction is thus introduced to address this interdependence in the reliability modeling and analysis of a multi-station manufacturing system. Moreover, an innovative quality and reliability integrated model is developed to describe the complicated propagation and transmission process of the interaction, as well as the information integration between the tool reliability and the product quality across the stations. Three factors are incorporated into the model, namely the tool degradation, the product quality, and the tool failure. An industrial case of a four-station machining process is used to demonstrate the importance and effectiveness of the proposed analytical procedures. Results indicate that the system reliability will be evidently overestimated without consideration of the quality and reliability interaction. Moreover, the presented integrated model suggests early maintenance schedule for the tool failure and its associated machine downtime.
Graph Simultaneous Embedding Tool, GraphSET
Authors: Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

Problems in simultaneous graph drawing involve the layout of several graphs on a shared vertex set. This paper describes a Graph Simultaneous Embedding Tool, GraphSET, designed to allow the investigation of a wide range of embedding problems. GraphSET can be used in the study of several variants of simultaneous embedding including simultaneous geometric embedding, simultaneous embedding with fixed edges and colored simultaneous embedding with the vertex set partitioned into color classes. The tool has two primary uses: (i) studying theoretical problems in simultaneous graph drawing through the production of examples and counterexamples and (ii) producing layouts of given classes of graphs using built-in implementations of known algorithms. GraphSET along with movies illustrating its utility are available at http://graphset.cs.arizona.edu.
Emergence of simulations for manufacturing line designs in Japanese automobile manufacturing plants
Authors: Minh Dang Nguyen, Soemon Takakuwa
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The aim of this research is to introduce the reader to a new perspective on the framework for designing a manufacturing line project in Japanese automobile manufacturing plants. All manufacturing aspects, manual, automated and hybrid manufacturing lines are considered; however, which line should be used for the factory is always under investigation within the factory. Simulation studies that include resource utilization, line productivity and manufacturing costs help to identify the most suitable manufacturing line type within a factory. By utilizing simulation studies, designers can make reliable decisions upon suitable manufacturing lines faster than conventional methods based upon engineering experience. In order to understand the framework of manufacturing line design, a project to design a new automobile component manufacturing line was investigated in this study, and the chosen manufacturing line was also checked by the manufacturing activities in the factory.
First principles study of Nb-W bilayer metal gate electrode
Authors: H. R. Gong, Kyeongjae Cho
Venue: Microelectronic Engineering (2009)

First principles calculations are performed to study the electronic structure and related properties of the Nb-W interface within NbW multilayer metal gate electrode. It is found that the surface work functions of NbW multilayers are located between those of pure Nb and W surfaces due to the strain effect from the lattice dismatch. The interface energy of Nb(110)/W(110) is calculated to be -0.17J/m^2, implying that the Nb-W interface is energetically favorable. Additionally, it is found that the interface dipoles are formed in the interface region to balance the work function difference of W and Nb, and the dipole layers are mainly due to the contributions of interface atoms with a very small contribution from the second atomic layers from the interface. It is of interest to note that the interface W atoms give out a little bit more electrons than the interface Nb atoms during the formation of the interface dipole and that these changes are closely related to the DOS changes.