ppxscal/embedding_network huggingface dataset:
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
Authors: David Eppstein, Emma S. Spiro
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

We describe a data structure that maintains the number of triangles in a dynamic undirected graph, subject to insertions and deletions of edges and of degree-zero vertices. More generally it can be used to maintain the number of copies of each possible three-vertex subgraph in time O(h) per update, where h is the h-index of the graph, the maximum number such that the graph contains h vertices of degree at least h. We also show how to maintain the h-index itself, and a collection of h high-degree vertices in the graph, in constant time per update. Our data structure has applications in social network analysis using the exponential random graph model (ERGM); its bound of O(h) time per edge is never worse than the $\Theta(\sqrt m)$ time per edge necessary to list all triangles in a static graph, and is strictly better for graphs obeying a power law degree distribution. In order to better understand the behavior of the h-index statistic and its implications for the performance of our algorithms, we also study the behavior of the h-index on a set of 136 real-world networks.
Optimal Inversion of Tidal Amplitude Open Boundary Conditions Using BPNN Data-driven Model Combined with Tidal Model
Authors: Li Ming-chang, Zhang Guang-yu, Zhou Bin, Liang Shu-xiu, Sun Zhao-chen
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

One of major difficulties with numerical tidal models is accurate inversion of open boundary conditions. A data-driven model based on artificial neural network is developed to retrieve open boundary values. All training data are calculated by numerical tidal model, so the tidal physics is not disturbed. The basic idea is to find out the relationship between open boundary values and the values of interior tidal stations. Case testes are carried out with a real ocean bay named Bohai Bay, part of the Bohai Sea, China. Three major tidal constituents, M2, S2 and K1, are considered in coupled inversion method. Case study shows that the coupled inversion for open boundary conditions can make a more satisfactory inversion for a practical problem.
Quantification of crustal geotherms along with their error bounds for seismically active regions of India: A Matlab toolbox
Authors: Kirti Srivastava, Likhita Narain, Swaroopa Rani, V. P. Dimri
Venue: Computers Geosciences (2009)

Determination of the thermo-mechanical structure of the crust for seismically active regions using available geophysical and geological data is of great importance. The most important feature of the intraplate earthquakes in the Indian region are that the seismicity occurs within the entire crust. In Latur region of India an earthquake occurred in the upper crust. In such situations, quantifying the uncertainties in seismogenic depths becomes very important. The stochastic heat conduction equation has been solved for different sets of boundary conditions, an exponentially decreasing radiogenic heat generation and randomness in thermal conductivity. Closed form analytical expressions for mean and variance in the temperature depth distribution have been used and an automatic formulation has been developed in Matlab for computing and plotting the thermal structure. The Matlab toolbox presented allows us to display the controlling thermal parameters on the screen directly, and plot the subsurface thermal structure along with its error bounds. The software can be used to quantify the thermal structure for any given region and is applied here to the Latur earthquake region of India.
A Novel Method for Face Detection across Illumination Changes
Authors: Wang Ying-hui, Ning Xiao-juan, Yang Chun-xia, Wang Qiong-fang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

In this paper, a novel method is proposed for human face detection. It contains three parts: illumination compensation, skin color model and template matching. First, we remove the color offset, high light and shadows that exist in human face images, and Gaussian model in YCrCb skin color space is chosen.Then, the facial skin region is marked and segmented using an improved segmentation algorithm. The features such as holes, deflection angle, center of mass,area and aspect ratio are used to make further verification. Finally a template matching approach is introduced to face candidate region and then the human faces are fixed by rectangles. The proposed method has been evaluated from variation of illumination, pose and expression. Experimental results demonstrate that the detection rate improved to84% and also indicate that our face detection approach under different illumination conditions is effective and robust.
Efficient Construction of Near-Optimal Binary and Multiway Search Trees
Authors: Prosenjit Bose, Karim Douïeb
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

We present a new linear-time algorithm for constructing multiway search trees with near-optimal search cost whose running time is independent of the size of the node in the tree. With the analysis of our construction method, we provide a new upper bound on the average search cost for multiway search trees that nearly matches the lower bound. In fact, it is tight for infinitely many probability distributions. This problem is well-studied in the literature for the case of binary search trees. Using our new construction method, we are able to provide the tightest upper bound on the average search cost for an optimal binary search tree.
Recommending XMLTable Views for XQuery Workloads
Authors: Iman Elghandour, Ashraf Aboulnaga, Daniel C. Zilio, Calisto Zuzarte
Venue: Proceedings of the 6th International XML Database Symposium on Database and XML Technologies (2009)

Physical structures, for example indexes and materialized views, can improve query execution performance by orders of magnitude. Hence, it is important to choose the right configuration of these physical structures for a given database. In this paper, we discuss the types of materialized views that are suitable for an XML database. We then focus on XMLTable materialized views and present a procedure to recommend them given an XML database and a workload of XQuery queries. We have implemented our XMLTable View Advisor in a prototype version based on IBM® DB2® V9.7, which supports both relational and XML data, and we experimentally demonstrate the effectiveness of our advisor's recommendations.
Research on the Access Control Protocol of WiMAX
Authors: Luo Cuilan
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

WiMAX security has two goals, one is to provide privacy across the wireless network and the other is to provide access control to the network. Privacy is accomplished by encrypting connections between the subscriber station and the base station. The base station protects against unauthorized access by enforcing encryption of service flows across the network. This paper analyzes the physical layer threat and MAC layer threat of WiMAX, then proposes the security architecture of WiMAX. In conclusion, we introduce WiMAX access control protocols in detail, including EAP, RADIUS and DIAMETER protocol.
Arithmetic Circuits, Monomial Algebras and Finite Automata
Authors: Vikraman Arvind, Pushkar S. Joglekar
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

We study lower bounds for circuit and branching program size over monomial algebras both in the noncommutative and commutative setting. Our main tool is automata theory and the main results are: An extension of Nisan's noncommutative algebraic branching program size lower bounds [N91] over the free noncommutative ring${\mathbb F}\langle{x_1,x_2,\cdots,x_n}\rangle$ to similar lower bounds over the noncommutative monomial algebras ${\ensuremath{\mathbb{F}}}\langle{x_1,x_2,\cdots,x_n}\rangle/I$ for a monomial ideal I generated by subexponential number of monomials. An extension of the exponential size lower bounds for monotone commutative circuits [JS82] computing the Permanent in ¿[x 11,x 12, ¿ ,x nn ] to an exponential lower bound for monotone commutative circuits computing the Permanent in any monomial algebra ¿[x 11,x 12, ¿ ,x nn ]/I such that the monomial ideal I is generated by o(n/logn) monomials.
Teaching and Learning HCI
Authors: Harold Thimbleby
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

We consider how to teach effectively with particular reference to HCI. HCI can be taught to explicitly empower students to engage with their own learning. Further, HCI motivates because HCI empowers students to make a valuable and lasting contribution to the world.
Feature-Based Data Stream Clustering
Authors: Mohsen Jafari Asbagh, Hassan Abolhassani
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Data stream clustering has attracted a huge attention in recent years. Many one-pass and evolving algorithms have been developed in this field but feature selection and its influence on clustering solution has not been addressed by these algorithms. In this paper we explain a feature-based clustering method for streaming data. Our method establishes a ranking between features based on their appropriateness in terms of clustering compactness and separateness. Then, it uses an automatic algorithm to identify unimportant features and remove them from feature set. These two steps take place continuously during lifetime of clustering task.
Professional MEL Solutions for Production, 1st edition
Authors: Kevin Mannens, Ed Caspersen
Venue:  (2009)

Maya s Embedded Language is the heart and soul of Maya, the most powerful 3D application on the market today. MEL provides Maya with a versatility and adaptability unmatched in the CG industry. It is MEL that allows technical directors to customize Maya to fit each pipeline, to work around each limitation, and to write tools that expand Maya s already impressive set of capabilities. Mastery of MEL is as essential to a TD as a scalpel is to a surgeon. This book shows you how MEL is being (ab)used in high-end visual effects production by picking apart scripts written in the production of recent feature films. The exhaustive and in-depth nature of this book makes it useful for a broad audience: from the MEL novice who wants to learn MEL to the advanced scripter interested in developing strategies for production problems.
Knowledge Construction Based on Visualization E-learning in Digital Library
Authors: Chen Yongyue, Xia Huosong
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Since the point that knowledge organizational system must be introduced into digital library was proposed, it has triggered a great concern to knowledge organization in digital library at home and abroad. This paper is based on the point, and puts forward the knowledge construction mode based on visualization e-learning. The main idea is that the learners utilize knowledge visualization tool to continually construct knowledge by learning the information resources of digital library so as to eventually form a complete knowledge organizational system, which can help user rapid retrieval and knowledge learning.
Fair Partnerships --- Working with NGOs
Authors: Shikoh Gitau, Gary Marsden
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

This paper highlights how Non-Governmental Organizations (NGOs) can be utilized during the design of Information Communication Technologies for Development (ICT4D). We use the design process of a voter education system as a case study, which incorporated three NGOs from two African countries. Of key interest to us are the ways in which we can avoid exploiting these NGOs and make sure the ICT intervention meets their goals, as well as those of the researchers.
Landmarks in Algorithmic Graph Theory: A Personal Retrospective
Authors: Martin Charles Golumbic
Venue: Graph Theory, Computational Intelligence and Thought: Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday (2009)

This is an edited version of the conference lecture delivered by the author in celebration of his 60th birthday. It is intended to be an autobiographical tour through stories, pictures and theorems, suitable for both mathematicians and non-scientists.
Fuzzy Information Fusion Based Quantitative HAZOP Analysis for Gas Compressor Units
Authors: Liang Wei, Zhang Laibin, Hu Jinqiu
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

An improved HAZOP modeling and reasoning approach for machine safety assessment based on fuzzy information fusion is proposed in this paper to solve the problems of the quantitative information loss and the safety decision-making difficulty in mechanical system existing multi-hazard sources. HAZOP graph analysis model is established to extract the interaction information among components and elements in mechanical system and identify possible hazard reasons and consequences; HAZOP fuzzy quantitative model is further researched for determination of deviation degree of system nodes with different attributes and occurrence probability of possible hazard reasons and consequences, and then HAZOP reasoning model based on D-S evidence theory is developed for final hazard reason and consequence searching and safety measure making, by calculating fusion reliability of each node on the hazard propagation pathway with the existence of multi-hazard source or deviation nodes.The results of improved quantitative HAZOP approach applied on safety assessment of gas compressor units in “Se-Ning-Lan” pipeline system, finally giving accurate and reliable hazard reasons.
Maximizing power efficiency with asymmetric multicore systems
Authors: Alexandra Fedorova, Juan Carlos Saez, Daniel Shelepov, Manuel Prieto
Venue: Communications of the ACM (2009)

How do we develop software to make the most of the promise that asymmetric multicore systems use a lot less energy?
An Elliptic Curve Digital Signature Scheme Based on Proactive Secret Sharing
Authors: Ping Guo, Hong Zhang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

Most digital signature algorithms are based on RSA algorithm, and traditional secret sharing schemes involve the use of a mutually trusted authority to assist in the generation and distribution of shares that will allow a secret to be protected among a set of participants. In contrast, this paper describes a signature scheme based on elliptic curves and proactive secret sharing. A general protocol is discussed and several related steps of this protocol are presented. Special attention is given to mutually trusted authority-free threshold scheme. The scheme ensures that a system can provide reliable signature services even if some servers fail caused by attacks or failures.
Acquire the Affine Transformation Coefficients in the Chinese Character Intelligent Formation
Authors: Mingyou Liu, Chengsen Duan, Youguo Pi
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

In the Chinese character intelligent formation, the same basic element has different position, size and shape in different Chinese characters. The transformation from the basic element to the Chinese character can be realized by affine transformation, and a novel approach was proposed to acquire the transformation coefficients of basic elements. The interested region was determined based on the structure of Chinese character, scale invariant and location invariant was extracted with SIFT features; meanwhile, rotation invariant was removed. The matched points was determined by Euclidean distance of eigenvectors, the best of three pairs non-collinear points were selected by using particle swarm optimization (PSO) algorithm which take normalized correlation coefficient as fitness function. 27533 Chinese characters in National Standards GB18030-2000 character set were taken as the experimental subject. Finally, the experimental processes and results were given in this paper.
Best-case WiBro performance for a single flow
Authors: Shinae Woo, Keon Jang, Sangman Kim, Soohyun Cho, Jaehwa Lee, Youngseok Lee, Sue Moon
Venue: Proceedings of the 1st ACM workshop on Mobile internet through cellular networks (2009)

WiBro (Wireless Broadband Internet), the Korean version of mobileWiMAX compatible standard, provides high-speed mobile data service. Although mobile WiMAX services are being deployed, there exist few reports about WiBro performance. In this work, we measure and analyze best-case performance of WiBro. In order to measure one-way delay, we develop a GPS synchronization device to measure one-way delay. Our measurement shows that the maximum hroughput over the WiBro network is 10 Mbps in downlink and 2.5 Mbps in uplink. We estimate that both the base station and WiBro modems have large buffers up to 2 s and 500 ms and minimum one-way delay of 76 ms and 11 ms for uplink and downlink, respectively. We measure TCP throughput over WiBro by varying the send buffer and receive buffer sizes. To fully exploit the high bandwidth of Wibro, we conclude the TCP needs along with the minimum of 128 KB buffer size.
Convergence of LR algorithm for a one-point spectrum tridiagonal matrix
Authors: Carla Ferreira, Beresford Parlett
Venue: Numerische Mathematik (2009)

We prove convergence for the basic LR algorithm on a real unreduced tridiagonal matrix with a one-point spectrum&#x2014;the Jordan form is one big Jordan block. First we develop properties of eigenvector matrices. We also show how to deal with the singular case.
Using modified Lasso regression to learn large undirected graphs in a probabilistic framework
Authors: Fan Li, Yiming Yang
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

Learning the structures of large undirected graphs with thousands of nodes from data has been an open challenge. In this paper, we use graphical Gaussian model (GGM) as the underlying model and propose a novel ARD style Wishart prior for the precision matrix of the GGM. which encodes the graph structure we want to learn. With this prior, we can get the MAP estimation of the precision matrix by solving (a modified version of) Lasso regressions and achieve a sparse solution. We use our approach to learn genetic regulatory networks from genome-wide expression microarray data and protein-binding location analysis data. Evaluated on the basis of consistency with the GO annotations, the experiments show that our approach has a much better performance than the clustering-based approaches and BN learning approaches in discovering gene regulatory modules.
CWNA: Certified Wireless Network Administrator Official Study Guide, 2nd edition
Authors: David D. Coleman, David A. Westcott
Venue: Cwnp Official Study Guides (2009)

Sybex is now the official publisher for CWNP, the certifying vendor for the CWNA program. This valuable guide covers all objectives for the newest version of the PW0-104 exam, including radio technologies; antenna concepts; wireless LAN hardware and software; network design, installation and management; wireless standards and organizations; 802.11 network architecture; wireless LAN security; performing site surveys; and troubleshooting. Also included are hands-on exercises, chapter review questions, a detailed glossary, and a pre-assessment test. The CD-ROM features two bonus exams, over 150 flashcards, and numerous White Papers and demo software.
Privacy-Preserving Computation and Verification of Aggregate Queries on Outsourced Databases
Authors: Brian Thompson, Stuart Haber, William G. Horne, Tomas Sander, Danfeng Yao
Venue: Proceedings of the 9th International Symposium on Privacy Enhancing Technologies (2009)

Outsourced databases provide a solution for data owners who want to delegate the task of answering database queries to third-party service providers. However, distrustful users may desire a means of verifying the integrity of responses to their database queries. Simultaneously, for privacy or security reasons, the data owner may want to keep the database hidden from service providers. This security property is particularly relevant for aggregate databases, where data is sensitive, and results should only be revealed for queries that are aggregate in nature. In such a scenario, using simple signature schemes for verification does not suffice. We present a solution in which service providers can collaboratively compute aggregate queries without gaining knowledge of intermediate results, and users can verify the results of their queries, relying only on their trust of the data owner. Our protocols are secure under reasonable cryptographic assumptions, and are robust to collusion among k dishonest service providers.
Using a Real-Time Conferencing Tool in Distributed Collaboration: An Experience Report from Siemens IT Solutions and Services
Authors: Daniela Damian, Sabrina Marczak, Madalina Dascalu, Michael Heiss, Adrian Liche
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

Successful distributed collaboration requires support for informal communication, opportunistic interactions, and smooth and frequent shifts between synchronous and asynchronous collaboration modes. Introducing new collaboration tools for distributed interaction is often regarded as a difficult organizational endeavor, compounded by a lack of concrete, empirical evidence of expected improvements in tool-supported distributed collaboration. In this paper, we describe the introduction of the Microsoft Office Communication Server collaboration tool to improve collaboration in a distributed project at Siemens IT Solutions and Services. Improvements included (1) faster response and resolution time on issues that involve cross-site communication; (2) enhanced productivity of global teams, enhanced sense of teamwork, and motivation in the global team; and (3) flatter communication structures across sites. We discuss lessons learned from the adoption of the collaboration tool and factors that made it possible.
Reduced representations of Emerging Cubes for OLAP database mining
Authors: Sebastien Nedjar, Alain Casali, Rosine Cicchetti, Lotfi Lakhal
Venue: International Journal of Business Intelligence and Data Mining (2009)

In this paper, we investigate reduced representations for the Emerging Cube. We use the borders, classical in data mining, for the Emerging Cube. These borders can support classification tasks to know whether a trend is emerging or not. However, the borders do not make possible to retrieve the measure values. This is why we introduce two new and reduced representations without measure loss: the L-Emerging Closed Cube and Emerging Quotient Cube. We state the relationship between the introduced representations. Experiments performed on various data sets are intended to measure the size of the three reduced representations.