ppxscal/embedding_network huggingface dataset:
Beginning SQL Queries: From Novice to Professional (Beginning from Novice to Professional)
Authors: Clare Churcher
Venue:  (2008)

Clare Churchers Beginning SQL Queries is your guide to mastering the lingua franca of the database industry: the SQL language. Good knowledge of SQL is crucial to anyone working with databases, because it is with SQL that you retrieve data, manipulate data, and generate business results. Knowing how to write good queries is the foundation for all work done in SQL, and it is a foundation that Clare lays well in her book. Does not bore with syntax! Helps you learn the underlying concepts involved in querying a database, and from there the syntax is easy Provides exceptionally clear examples and explanations Is academically sound while being practical and approachable What youll learn Write simple queries to extract data from a single table. Understand relational algebra and calculus and why they are important. Combine data from many tables into one business result. Avoid pitfalls and traps such as Cartesian products and difficulties with null values. Summarize large amounts of data for reporting purposes. Apply set theory to the problems of manipulating data and generating reports. Who is this book for? Beginning SQL Queries is aimed at intelligent laypeople who need to extract information from a database, and at developers and other IT people who are new to SQL. The book is especially useful for business intelligence analysts who must ask more complex questions of their database than their GUIbased reporting software supports. Such people might be business owners wanting to target specific customers, scientists and students needing to extract subsets of their research data, or end users wanting to make the best use of databases for their clubs and societies. About the Apress Beginning Series The Beginning series from Apress is the right choice to get the information you need to land that crucial entrylevel job. These books will teach you a standard and important technology from the ground up because they are explicitly designed to take you from novice to professional. Youll start your journey by seeing what you need to knowbut without needless theory and filler. Youll build your skill set by learning how to put together realworld projects step by step. So whether your goal is your next career challenge or a new learning opportunity, the Beginning series from Apress will take you thereit is your trusted guide through unfamiliar territory! Related Titles Beginning Database Design: From Novice to Professional Date on Database: Writings 2000-2006 Applied Mathematics for Database Professionals
Domination in a graph with a 2-factor
Authors: Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito
Venue: Journal of Graph Theory (2006)

Let &gamma;(G) be the domination number of a graph G. Reed [6] proved that every graph G of minimum degree at least three satisfies &gamma;(G)&thinsp;&le;&thinsp;(3-8)|G|, and conjectured that a better upper bound can be obtained for cubic graphs. In this paper, we prove that a 2-edge-connected cubic graph G of girth at least 3k satisfies $\gamma (G)\le (({3k+2}))/({9k+3})|G|$. For $k\ge 3$, this gives $\gamma (G)\le ({11}/{30})|G|$, which is better than Reed's bound. In order to obtain this bound, we actually prove a more general theorem for graphs with a 2-factor. &copy; 2006 Wiley Periodicals, Inc. J Graph Theory 52: 1&ndash;6, 2006 The study is dedicated to Professor Hikoe Enomoto on his sixtieth birthday.
Optimization of sensor locations and sensitivity analysis for engine health monitoring using minimum interference algorithms
Authors: Paul Cotae, Sireesha Yalamnchili, C. L. Philip Chen, Arturo Ayon
Venue: EURASIP Journal on Advances in Signal Processing (2008)

The global optimization of sensor locations and a sensitivity analysis based on the minimization of interferences due to wireless communications between sensors are studied in the presence of additive white Gaussian noise (AWGN). We used a Gram matrix approach for robust determination of sensor locations by minimizing the interferences (maximizing the signal strength) among sensors for engine health monitoring systems. In order to solve the problem of optimum placement, an iterative algorithm for maximizing the determinant of the Gram matrix is proposed and implemented. The sensitivity criterion proposed in this paper is the spectral number of the Frobenius norm of the Gram matrix associated with sensor readings. We derived the necessary conditions under which the number of sensors and the optimal sensor locations will remain unchanged when the data measured for sensitivity analysis is affected by AWGN. Our theoretical results are verified by simulations providing details concerning numerical implementations.
A dimensional splitting method for the linearly elastic shell
Authors: Kaitai Li, Xiaoqin Shen
Venue: International Journal of Computer Mathematics (2007)

In this paper, we split the 3-D linearly elastic shell problem into a 2-D problem by using the approach of formal asymptotic expansion. The approximate solution UKT(x, ξ) for the 3-D linearly elastic shell consists of [image omitted] , where u0, u1, u2 are independent of ξ. The leading term u0 satisfies a 2-D elliptic boundary value problem, and other terms u1, u2 will be derived using the algebraic expression for u0 without solving PDEs. We prove that the solution u0(x) exists and is unique, and give the error estimation for an elliptic membrane, which is smaller than the error with other models.
Complementary use of Fuzzy Decision Trees and Augmented Fuzzy Cognitive Maps for Decision Making in Medical Informatics
Authors: E. I. Papageorgiou, N. I. Papandrianos, D. Apostolopoulos, P. Vassilakos
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

This work focuses on the formalization of a Fuzzy Cognitive Map based decision support system using complementary the fuzzy decision tree method for producing fuzzy If-Then rules (extracted from data) accompanied with the available experts’ knowledge. The proposed approach is applied to build a Fuzzy Cognitive Map based decision support system (FCM-DSS) used in medical informatics. In this approach, an augmented FCM-DSS is developed combining knowledge from experts and fuzzy rules generated from data using fuzzy decision tree based extraction method. In this research work, our scope is to introduce a new methodology for medical decision making tasks using the soft computing technique of FCMs, producing an augmented FCM decision support system. The proposed approach is implemented in a well-known benchmark medical problem with real clinical data for thyroid disease diagnosis. The first results are very promising and better than other fuzzy-based computational intelligent techniques.
Relay assisted soft handover in multihop cellular networks
Authors: Sunghyun Cho, Jisu Kim, Jae-Hyun Kim
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

This paper proposes a relay assisted soft handover in multihop cellular networks. In the relay assisted soft handover, a handover ranging is not required and an association process can be significantly simplified because it is unnecessary to change a serving node during handover process. In the proposed scheme, the handover latency and the service-interruption time caused by handover are reduced by 24% and 86%, respectively, while the capacity loss is only 5.33% compared to a hard handover in multihop cellular networks.
Technological opportunities for supporting people with dementia who are living at home
Authors: Joseph P. Wherton, Andrew F. Monk
Venue: International Journal of Human-Computer Studies (2008)

Recent advances in pervasive computing raise new possibilities for supporting people with dementia who wish to live in their own homes. Interviews were conducted in order to identify the daily activities of people living at home that might most usefully be supported. In Study 1, nine interviews and one focus group were conducted with occupational therapists and other professional caregivers. In Study 2, interviews were conducted with eight people with mild to moderate dementia in their own homes and 10 informal caregivers. A grounded theory analysis of the transcripts revealed specific areas where support was needed and suggestions concerning the kinds of prompting and sensing required to support: dressing, taking medication, personal hygiene, preparing food, and socialising. The findings demonstrate the value of consulting directly with people with dementia and their caregivers. The design challenge is to provide flexible prompting systems that are sensitive to the intentions, capabilities, and values of their users.
A Sharper Estimate on the Betti Numbers of Sets Defined by Quadratic Inequalities
Authors: Saugata Basu, Michael Kettner
Venue: Discrete Computational Geometry (2008)

In this paper we consider the problem of bounding the Betti numbers, b i (S), of a semi-algebraic set S&#x2282;&#x211d; k defined by polynomial inequalities P 1&#x2265;0,&#x2026;,P s &#x2265;0, where P i &#x2208;&#x211d;[X 1,&#x2026;,X k ], s<k, and deg&#x2009;(P i )&#x2264;2, for 1&#x2264;i&#x2264;s. We prove that for 0&#x2264;i&#x2264;k&#x2212;1, $$\begin{array}{lll}\displaystyle b_{i}(S)&\displaystyle \le&\displaystyle \frac{1}{2}+(k-s)+\frac{1}{2}\cdot \sum_{j=0}^{\mathit{min}\{s+1,k-i\}}2^{j}{{s+1}\choose j}{{k}\choose j-1}\\[18pt]&\displaystyle \le &\displaystyle \frac{3}{2}\cdot\biggl(\frac{6ek}{s}\biggr)^{s}+k.\end{array}$$ This improves the bound of k O(s) proved by Barvinok (in Math.&#x00a0;Z. 225:231&#x2013;244, 1997). This improvement is made possible by a new approach, whereby we first bound the Betti numbers of non-singular complete intersections of complex projective varieties defined by generic quadratic forms, and use this bound to obtain bounds in the real semi-algebraic case.
Remote sensing as a tool for monitoring plasticulture in agricultural landscapes
Authors: N. Levin, R. Lugassi, U. Ramon, O. Braun, E. Ben-Dor
Venue: International Journal of Remote Sensing (2007)

Agricultural landscapes are changing their appearance with the increasing use of man-made plastic materials in covered agriculture (plasticulture) all around the world. As these affect the landscape visually, increase pollution and decrease local biodiversity, better monitoring and planning of their uses and areas are needed. Using a field spectrometer we studied the spectral properties of a sample of polyethylene sheets and various nets used in Israel. We detected three major absorption features around 1218 nm, 1732 nm and 2313 nm. These were not affected by settling dust, whitewashing or by the underlying surface, but were not apparent in black coloured polyethylene sheets or nets. A hyperspectral AISA-ES image with a spatial resolution of 1 m achieved a detection accuracy of above 90% for bright sheets and nets but of only 70% for the black nets. The best spectral feature for plastic mapping was found to be that around 1732 nm as it does not coincide with spectral features of other minerals, soils, vegetation or atmospheric attenuation. As most of the greenhouses patches in Israel are smaller than 3200 m2, the optimal spatial resolution of a sensor for mapping them should be equal or better than 8-16 m. As a result of their low spectral and spatial resolution, Landsat images proved inadequate for mapping greenhouses, and strengthen the need of hyperspectral technology for that end.
Packet-based context aware system to determine information system user's context
Authors: Hyeon Kang, Euiho Suh, Keedong Yoo
Venue: Expert Systems with Applications: An International Journal (2008)

Context awareness has been a vital field of ubiquitous computing research. Numerous methods for capturing, interring external context and providing necessary service have been developed and relevant projects have been performed. However, user's internal context is more valuable than the external one. Thus, more searches on internal context are needed. This paper confines its research domain to the internet based information system (IS) in order to infer the internal context of user. For inferring internal context in this IS domain, one of the computer network techniques, packet sniffing technique, is utilized. This is effective and efficient in acquiring the information of the user's demand. Also, inference algorithm which is integrated with the acquired user's information is proposed. Furthermore, this paper demonstrates that the prototype system adopts the suggested technique and algorithm in order to prove its validity. The proposed prototype system is the basis of providing IS user with ubiquitous services and enhances the convenience and efficiency during business hour of IS user. In this fashion, this paper presents a new pattern of context acquisition and inference in implementing the ubiquitous computing based-IS along with the direction of internal context awareness research.
An insight into space-time block codes using Hurwitz-Radon families of matrices
Authors: Yu Chang, Yingbo Hua, Xiang-Gen Xia, Brian M. Sadler
Venue: Signal Processing (2008)

It is shown that for four-transmitter systems, a family of four-by-four unit-rate complex quasi-orthogonal space-time block codes, where each entry equals a symbol variable up to a change of sign and/or complex conjugation, can be generated from any two independent codes via elementary operations. The two independent groups of codes in the family generally have different properties of diversity, but the codes in each group have the same diversity provided that the differential symbol constellation is symmetric. It is also shown that for four-transmitter systems, an eight-by-four unit-rate complex linear dispersion space-time block code can be constructed by using Hurwitz-Radon families of matrices of size eight such that diversity three is guaranteed even when all symbols are independently selected from any given constellation. This code is so far the only known unit-rate linear dispersion code that has diversity no less than three for four transmitters under any given constellation.
A grid-alignment finite element technique for incompressible multicomponent flows
Authors: B. Bejanov, J. L. Guermond, P. D. Minev
Venue: Journal of Computational Physics (2008)

We present a numerical method for solving the multicomponent incompressible Navier-Stokes equations. The methods employs a moving grid technique and a projection scheme based on low-order Crouzeix-Raviart and P"1 finite elements. The computational grid is aligned with the fluid interface at each time step to keep the interpolation order optimal. The connectivity of the grid is fixed during the entire time simulation to ensure efficient assembling and parallelization. The method is tested on several examples.
The size of minimum 3-trees: Cases 3 and 4 mod 6
Authors: Jorge L. Arocha, Joaquín Tey
Venue: Journal of Graph Theory (1999)

A 3-uniform hypergraph is called a minimum 3-tree, if for any 3-coloring of its vertex set there is a heterochromatic edge and the hypergraph has the minimum possible number of edges. Here we show that the number of edges in such 3-tree is [n(n-2) / 3] for any number of vertices n a 3, 4 (mod 6). &copy; 1999 John Wiley Sons, Inc. J Graph Theory 30: 157-166, 1999
A Methodology for Evaluating Vertical Handoff Decision Mechanisms
Authors: Imed Lassoued, Jean-Marie Bonnin, Zied Ben Hamouda, Abdelfettah Belghith
Venue: Proceedings of the Seventh International Conference on Networking (2008)

The proliferation of wireless technologies and their ever increasing popularity and pervasiveness made it possible to have mobile terminals (MTs) equipped with a myriad of network interfaces. It is then becoming essential to offer vertical handoff solutions where users can move among various network types efficiently and seamlessly. A variety of mechanisms supporting vertical handoffs by selecting the best possible network interfaces have recently been proposed. The evaluation of these mechanisms, however, remains a complicated task and no known proposal is completely adequate to evaluate these mechanisms. In this paper, we propose a novel methodology for evaluating vertical handoff decision mechanisms. This methodology takes into account the current context, different realistic user mobility models, users preferences, applications requirements as well as wireless access technologies specificities and QoS parameters. The proposed methodology provides an adequate framework to investigate Vertical Handoff Mechanisms (VHMs) and evaluate their performances. Then, we demonstrate our methodology on a VHM called Ubique.
Using Tactic-Based Learning (formerly Mentoring) to Accelerate Recovery of an Adaptive Learning System in a Changing Environment
Authors: Alice Armstrong, Peter Bock
Venue: Proceedings of the 36th Applied Imagery Pattern Recognition Workshop (2007)

Tactic-Based Learning (TBL), formerly referred to as mentoring, is a selection policy for statistical learning systems that has been initially tested with a Collective Learning Automaton that solves a simple, but representative, problem. To respond to an immature stimulus that does not yet have a high-confidence response associated with it, TBL hypothesizes that selecting a response that has been designated as useful by a different, but nonetheless well-trained stimulus, is a better strategy than selecting a random response. TBL does not use any feature analysis in search of an appropriate response. Previous results [1] show that TBL significantly accelerates learning of a static problem, especially when several stimuli share the same response, i.e., when broad domain generalization is possible. This paper shows that TBL also increases the speed of recovery when the problem changes abruptly after the learning agent has mastered the initial state of the problem.
BAD: bandwidth adaptive dissemination or (the case for BAD trees)
Authors: Manos Kapritsos, Peter Triantafillou
Venue: Proceedings of the 2007 ACM/IFIP/USENIX international conference on Middleware companion (2007)

In this paper, we present BAD, an application-level multicast infrastructure. BAD is designed to improve the performance of multicast dissemination trees, under both a static and a dynamic environment, where the effective bandwidth of the network links changes with time. Its main goal is to improve the data rate that end users perceive during a multicast operation. BAD can be used for the creation and management of multicast groups. It can be deployed over any DHT retaining its fundamental advantages of bandwidth improvement. BAD consists of a suit of algorithms for node joins/leaves, bandwidth distribution to heterogeneous nodes, tree rearrangement and reduction of overhead. We have implemented BAD within the FreePastry system. We report on the results of a detailed performance evaluation which testifies for BAD's efficiency and low overhead. Specifically, our experiments show that the improvement on the minimum bandwidth ranges from 40% to 1400% and the improvement on the average bandwidth ranges from 60% to 250%.
Local approximation of PageRank and reverse PageRank
Authors: Ziv Bar-Yossef, Li-Tal Mashiach
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We consider the problem of approximating the PageRank of a target node using only local information provided by a link server. We prove that local approximation of PageRank is feasible if and only if the graph has low in-degree and admits fast PageRank convergence. While natural graphs, such as the web graph, are abundant with high in-degree nodes, making local PageRank approximation too costly, we show that reverse natural graphs tend to have low indegree while maintaining fast PageRank convergence. It follows that calculating Reverse PageRank locally is frequently more feasible than computing PageRank locally. Finally, we demonstrate the usefulness of Reverse PageRank in five different applications.
Measuring integrity on mobile phone systems
Authors: Divya Muthukumaran, Anuj Sawani, Joshua Schiffman, Brian M. Jung, Trent Jaeger
Venue: Proceedings of the 13th ACM symposium on Access control models and technologies (2008)

Mobile phone security is a relatively new field that is gathering momentum in the wake of rapid advancements in phone system technology. Mobile phones are now becoming sophisticated smart phones that provide services beyond basic telephony, such as supporting third-party applications. Such third-party applications may be security-critical, such as mobile banking, or may be untrusted applications, such as downloaded games. Our goal is to protect the integrity of such critical applications from potentially untrusted functionality, but we find that existing mandatory access control approaches are too complex and do not provide formal integrity guarantees. In this work, we leverage the simplicity inherent to phone system environments to develop a compact SELinux policy that can be used to justify the integrity of a phone system using the Policy Reduced Integrity Measurement Architecture (PRIMA) approach. We show that the resultant policy enables systems to be proven secure to remote parties, enables the desired functionality for installing and running trusted programs, and the resultant SELinux policy is over 90% smaller in size. We envision that this approach can provide an outline for how to build high integrity phone systems.
Lifelink: a 4G experience game
Authors: Ingrid Mulder, Elwin Levels
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

"Connected anytime, anywhere, anyhow" is what the Dutch research programme Freeband envisions. However, how does always being connected, anywhere and anytime affect your life? Lifelink, an interactive simulation, enables users to experience the impact of 4G technology. This playable simulation is a representation of an imaginary city in which you as being either a student or a general practitioner experience how 4G communication enriches your daily activities. In this way, Lifelink shows the compelling value of 4G at personal and professional level, and enables Lifelink users to discover the uniqueness of the Freeband projects. The interactive simulation has been designed for deployment and usage on demonstration floors. The gameplay is operated with a PDA and can be experienced on a large screen as well.
Towards identity anonymization on graphs
Authors: Kun Liu, Evimaria Terzi
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities of the nodes before publishing the graph/social network data does not guarantee privacy. The structure of the graph itself, and in its basic form the degree of the nodes, can be revealing the identities of individuals. To address this issue, we study a specific graph-anonymization problem. We call a graph k-degree anonymous if for every node v, there exist at least k-1 other nodes in the graph with the same degree as v. This definition of anonymity prevents the re-identification of individuals by adversaries with a priori knowledge of the degree of certain nodes. We formally define the graph-anonymization problem that, given a graph G, asks for the k-degree anonymous graph that stems from G with the minimum number of graph-modification operations. We devise simple and efficient algorithms for solving this problem. Our algorithms are based on principles related to the realizability of degree sequences. We apply our methods to a large spectrum of synthetic and real datasets and demonstrate their efficiency and practical utility.