ppxscal/embedding_network huggingface dataset:
Constructive results from graph minors: linkless embeddings
Authors: R. Motwani, A. Raghunathan, H. Saran
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

A formal study of three-dimensional topological graph theory is initiated. The problem of deciding whether a graph can be embedded in 3-space so that no collection of vertex-disjoint cycles is topologically linked is considered first. The Robertson-Seymour Theory of Graph Minors is applicable to this problem and guarantees the existence of an O(n/sup 3/) algorithm for the decision problem. However, not even a finite-time decision procedure was known for this problem. A small set of forbidden minors for linkless embeddable graphs is exhibited, and it is shown that any graph with these minors cannot be embedded without linked cycles. It is further established that any graph that does not contain these minors is embeddable without linked cycles. Thus, an O(n/sup 3/) algorithm for the decision problem is demonstrated. It is believed that the proof technique will lead to an algorithm for actually embedding a graph, provided it does not contain the forbidden minors.
Query-drift prevention for robust query expansion
Authors: Liron Zighelnic, Oren Kurland
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Pseudo-feedback-based automatic query expansion yields effective retrieval performance on average, but results in performance inferior to that of using the original query for many information needs. We address an important cause of this robustness issue, namely, the query drift problem, by fusing the results retrieved in response to the original query and to its expanded form. Our approach posts performance that is significantly better than that of retrieval based only on the original query and more robust than that of retrieval using the expanded query.
Some properties of a random set approximation to upper and lower distribution functions
Authors: Fulvio Tonon
Venue: International Journal of Approximate Reasoning (2008)

Information on an uncertain real variable is oftentimes conveyed using upper and lower distribution functions, which define a credal set, M. The paper explores the properties of a random set (random interval) approximation, R, to the upper and lower distribution functions carried out using the outer discretization method (ODM) introduced by the author as a generalization to an algorithm proposed in Williamson and Downs [R.C. Williamson, T. Downs, Probabilistic arithmetic. i. Numerical methods for calculating convolutions and dependency bounds, Int. J. Approx. Reason. 4 (1990) 89-158]. It is shown that probability bounds calculated using the ODM random sets, R, always contain the probability bounds calculated using M. This result holds even in the multivariate case (when each marginal is ODM discretized into a random set, R) regardless of the concept of dependence or independence adopted. The bound inclusion is also true for the image of a function defined on those variables. Finer discretizations of the original credal sets yield tighter or equal probability bounds. Since the ODM yields a random set, R, the information can be modeled either using probability measures of the measurable selections or the credal set of the belief and plausibility of R. It is proven that both models yield the same probability bounds and that the Choquet integrals of the belief and plausibility of R are the inferior and superior, respectively, of the expectations calculated using the measurable selections. However, the probabilistic information conveyed by the measurable selections may be more restrictive than the information contained in the credal set of the belief and plausibility of R.
Comparative energy and delay of energy recovery and square wave clock flip-flops for high-performance and low-power applications
Authors: Aliakbar Ghadiri, Hamid Mahmoodi-Meimand
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

Flip-flops are essential elements of a design from both delay and energy aspects. A significant fraction of the total power in highly synchronous systems is dissipated over clock networks. Hence, low-power clocking schemes are promising approaches for future designs. Recently, there has been published several energy recovery flip-flops that enable energy recovery from the clock network, resulting in significant energy savings. However, there has not been shown any extensive power and delay comparison between energy-recovery and square clock flip-flops. We compare the energy recovery flip-flops with square wave clock flip-flops in terms of power, delay, and area. Based on the simulation results using BPTM 0.18µm CMOS technology, at a frequency of 200MHz, the differential energy recovery flip-flops exhibit more than 14% delay reduction and power reduction of more than 43% compared to the differential square-wave clock flip-flops. The single-ended energy recovery flip-flops show more than 22% delay reduction and power reduction of more than 16% compared to the single-ended square wave clock flip-flops.
Screening in multiple criteria decision analysis
Authors: Ye Chen, D. Marc Kilgour, Keith W. Hipel
Venue: Decision Support Systems (2008)

Screening is a process for multiple criteria decision analysis (MCDA) that reduces a large set of alternatives to a smaller set that most likely contains the best choice. To study screening in detail, MCDA is first interpreted as consequence-based preference aggregation. Consequence data and preference expressions (values and weights) are defined and the aggregation steps are elaborated. Based on these concepts, screening and sequential screening are defined and their properties are discussed. Then, it is shown how several popular MCDA methods can be integrated into a decision support system for sequential screening based upon available decision information. Finally, an illustrative application to water supply planning is presented.
Developing of an Ontological Focused-Crawler for Ubiquitous Services
Authors: Sheng-Yuan Yang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

This paper proposes the use of several ontological techniques to provide a semantic level solution for a search agent so that it can provide fast, precise, and stable search results in ubiquitous information environments. An ontological focused-crawler had been developed according to these techniques, which can benefit both user requests and domain semantics. Equipped with these techniques, the crawler can manifest the following interesting features: ontology-supported construction of website models, website models-supported website model expansion, and website models-supported webpage retrieval.
Design, Modeling, and Capacity Planning for Micro-solar Power Sensor Networks
Authors: Jay Taneja, Jaein Jeong, David Culler
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

This paper describes a systematic approach to building micro-solar power subsystems for wireless sensor network nodes. Our approach composes models of the basic pieces - solar panels, regulators, energy storage elements, and application loads - to appropriately select and size the components. We demonstrate our approach in the context of a microclimate monitoring project through the design of the node, micro-solar subsystem, and network, which is deployed in a challenging, deep forest setting. We evaluate our deployment by analyzing the effects of the range of solar profiles experienced across the network.
Application of inverse FEM to earth pressure estimation
Authors: Carsten Hauser, Bernhard Walz, Philippe Mainçon, Celeste Barnardo
Venue: Finite Elements in Analysis and Design (2008)

In order to process measurement data in structural mechanics, an inverse FEM is formulated with displacement and loads as unknowns. A cost related to both loads and discrepancies between measured and estimated values is minimised, under constraint that equilibrium be verified. The constrained minimisation problem is discretised using Galerkin's method, and solved using Lagrange multipliers. For quadratic costs and linear structures, this yields a linear system of equations with three times more unknowns than the corresponding forward FEM model. The technique is applied to estimate soil pressures acting on a small-scale model of a retaining wall, using bending strain measurements. Repeatable and realistic results were obtained, providing valuable information for the formulation of a design guideline for coffer dams and similar structures.
Piecewise algebraic surface computation and smoothing from a discrete model
Authors: Jordi Esteve, Pere Brunet, Alvar Vinacua
Venue: Computer Aided Geometric Design (2008)

This paper describes a constrained smoothing method for implicit surfaces defined on a voxelization. This method is suitable for computing a closed smooth surface that approximates an initial set of face connected voxels. The implicit surface is defined as the zero-set of a tensor-product uniform cubic Bspline. The smoothing process is based on increasing the Bspline continuity from C^2 to C^3 on the boundary faces of the voxels. The final surface is guaranteed to pierce a predefined subset of voxels.
Variable-Number Sample-Path Optimization
Authors: Geng Deng, Michael C. Ferris
Venue: Mathematical Programming: Series A and B (2008)

The sample-path method is one of the most important tools in simulation-based optimization. The basic idea of the method is to approximate the expected simulation output by the average of sample observations with a common random number sequence. In this paper, we describe a new variant of Powell&#x2019;s unconstrained optimization by quadratic approximation (UOBYQA) method, which integrates a Bayesian variable-number sample-path (VNSP) scheme to choose appropriate number of samples at each iteration. The statistically accurate scheme determines the number of simulation runs, and guarantees the global convergence of the algorithm. The VNSP scheme saves a significant amount of simulation operations compared to general purpose &#x2018;fixed-number&#x2019; sample-path methods. We present numerical results based on the new algorithm.
New Self Certified Proxy Digital Signature Scheme based on Elliptic Curve Cryptosystem
Authors: Youan Xiao
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In this paper, a new proxy digital signature scheme based on the elliptic curve cryptosystem is proposed to solve the problems such as the low work efficiency and the weak in delegation authority control, which are existing in the known proxy digital signature schemes. By introducing the thought of public key self certified, the new scheme can finish all the verify operations such as comfirming the warrant, verifying the proxy digitial signature signed by the proxy signer, verifying the certificate of original signer and the proxy signer in one step. It also has the ability to control the scope of delegation reliably, and can prevent the abuse of proxy digital signature power. In the new scheme, none of the public key certificates and additional operations such as identify, provable and authentication are needed, and none trusted CA server is needed too. Compared with the existing proxy signature schemes, the new scheme has higher work efficiency, lower bandwidth, stronger security. The proposed scheme provides a successful solution to the existing problems in the known proxy digitial signature schemes, and has great practical value and application prospect.
Generating quadrangulations of surfaces with minimum degree at least 3
Authors: Atsuhiro Nakamoto
Venue: Journal of Graph Theory (1999)

In this article, we show that all quadrangulations of the sphere with minimum degree at least 3 can be constructed from the pseudo-double wheels, preserving the minimum degree at least 3, by a sequence of two kinds of transformations called &ldquo;vertex-splitting&rdquo; and &ldquo;4-cycle addition.&rdquo; We also consider such generating theorems for other closed surfaces. These theorems can be translated into those of 4-regular graphs on surfaces by taking duals. &copy; 1999 John Wiley & Sons, In. J Graph Theory 30: 223&ndash;234, 1999
Intelligent digital signal-type identification
Authors: A. Ebrahimzadeh, A. Ranjbar
Venue: Engineering Applications of Artificial Intelligence (2008)

Digital signal-type identification is an important issue in communication intelligence system. Most of the proposed identifiers (techniques) can only identify a few kinds of digital signal and/or low order of digital signals. They usually require high levels of signal-to-noise ratio (SNR). This paper presents an intelligent technique that includes a variety of digital signals. In this technique, a combination of the higher-order moments and the higher-order cumulants up to eighth are proposed as the effective features for representation of the considered digital signals. A multilayer perceptron neural network with resilient back propagation learning algorithm is utilized to determine class of the received signal. The numbers of nodes in the hidden layer, along with the selection of input features are optimized using a genetic algorithm. Simulation results show that the proposed technique has high performance for identification the different digital signal types even at very low SNRs. This high performance is achieved with only seven selected features and the least possible number of nodes in the hidden layer, which have been optimized using the genetic algorithm.
Sampling time-based sliding windows in bounded space
Authors: Rainer Gemulla, Wolfgang Lehner
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often interested in analyzing only the most recent fraction of the data stream in order to avoid outdated results. In this paper, we focus on sampling schemes that sample from a sliding window over a recent time interval; such windows are a popular and highly comprehensible method to model recency. In this setting, the main challenge is to guarantee an upper bound on the space consumption of the sample while using the allotted space efficiently at the same time. The difficulty arises from the fact that the number of items in the window is unknown in advance and may vary significantly over time, so that the sampling fraction has to be adjusted dynamically. We consider uniform sampling schemes, which produce each sample of the same size with equal probability, and stratified sampling schemes, in which the window is divided into smaller strata and a uniform sample is maintained per stratum. For uniform sampling, we prove that it is impossible to guarantee a minimum sample size in bounded space. We then introduce a novel sampling scheme called bounded priority sampling (BPS), which requires only bounded space. We derive a lower bound on the expected sample size and show that BPS quickly adapts to changing data rates. For stratified sampling, we propose a merge-based stratification scheme (MBS), which maintains strata of approximately equal size. Compared to naive stratification, MBS has the advantage that the sample is evenly distributed across the window, so that no part of the window is over- or underrepresented. We conclude the paper with a feasibility study of our algorithms on large real-world datasets.
Building Clinical Data Warehouse for Traditional Chinese Medicine Knowledge Discovery
Authors: Xuezhong Zhou, Baoyan Liu, Yinghui Wang, Runsun Zhang, Ping Li, Shibo Chen, Yufeng Guo, Zhuye Gao, Hua Zhang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The clinical data from the daily clinical process, which keeps to traditional Chinese medicine (TCM) theories and principles, is the core empirical knowledge source for TCM researches. This paper introduces a data warehouse system, which is based on the structured electronic medical record system and daily clinical data, for TCM clinical researches and medical knowledge discovery. The system consists of several key components: clinical data schema, extraction-transformation-loading tool, online analytical analysis (OLAP) based on Business Objects (a commercial business intelligence software), and integrated data mining functionalities. Currently, the data warehouse contains 20,000 inpatient data of diabetes, coronary heart disease and stroke, and more than 20,000 outpatient data. Moreover, we have developed several important research oriented subject analyses using OLAP, and conducted several TCM clinical data mining applications. The analysis applications show that the developed clinical data warehouse platform is promising to build the bridge for TCM clinical practice and theoretical research, hence, will promote the related TCM researches.
Security in the New Era of Telecommunication: Threats, Risks and Controls of VoIP
Authors: Moses Garuba, Jiang Li, Zhenqiang Yi
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The advent and advance of the Voice over Internet Protocol technology (VoIP) have the potential to greatly change the outlook of telecommunication. However, as a relatively new technology, VoIP is still facing various security dilemmas, both technical and social. In this research, major threats and vulnerabilities that exist in VoIP technology will be presented. Also, some of the security controls, policies and sound practices that should be implemented in the enterprise VOIP system will be discussed.
Selecting News and Elders in Unstructured Peer-to-Peer Network under Churn
Authors: Yanxiang He, Haowen Liu, Naixue Xiong, Laurence T. Yang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The concept of Churn is the continuous process of node arrival and departure in distributed peer-to-peer network. There exists two extreme cases. The first one is that enormous nodes joining the system concurrently, which results in a flash crowd scenario for special nodes in the system. The other is that enormous nodes crashed or the connections between nodes are failed in a moment, which comes out a shrink search later. In this paper, we present a novel protocol Selecting News and Elders (SNE) with positive communication policy among peers and conservative neighbor maintenance scheme under churn, to keep desirable properties such as a low network diameter and clustering. The protocol is resilient against different churn and fit for P2P information dissemination and file sharing systems especially.
A study on the emotion expression using lights in apparel types
Authors: Yongsoon Choi, Younghwan Pan, Jihong Jeung
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

When types of communication between people are observed, one can see that communication not only consist of words but also, contextual communication consist of facial expressions and body gestures. In this study, elements that need to be considered when using light in clothes in order to express the thoughts and various emotions of the wearer and surrounding people and to design contextual interaction rather than simply for visual effects, are examined. Clothes and light are central visual elements therefore, the relationship between perception of objects through sight and emotions are examined, elements of visual language of cloths and light are examined through documentary record, elements of visual language such as shape, color, and texture of light and clothes that influence each other are classified as well as unique elements of visual elements of light such as blink speed and blink pattern, and terms that are related to the psychological effects of these elements are extracted. Based on this, using the 8 most representative human emotions which includes happiness, excitement, anger, hatred, sadness, shock, fear, and shame as standards of design, interaction design elements using clothes and light for expression of each emotion are organized in a matrix. Then, scenarios and ideas are generated, and based on the Matrix, interaction concept design in which expression of emotions and information possible using light in apparel are produced.
A MIPS R2000 implementation
Authors: Nathaniel Pinckney, Thomas Barr, Michael Dayringer, Matthew McKnett, Nan Jiang, Carl Nygaard, David Money Harris, Joel Stanley, Braden Phillips
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Thirty-four undergraduates implemented a MIPS R2000 processor for an introductory CMOS VLSI design course. This included designing a microarchitecture in Verilog, developing custom PLA generation and ad-hoc random testing tools, creating a standard cell library, schematics, layout, and PCB test board. The processor was fabricated by MOSIS on an AMI 0.5-micron process, included 160,000 transistors, and ran at 7.25 MHz.
Trust and risk in e-government adoption
Authors: France Bélanger, Lemuria Carter
Venue: The Journal of Strategic Information Systems (2008)

Citizen confidence in government and technology is imperative to the wide-spread adoption of e-government. This study analyzes the impact of trust and risk perceptions on one's willingness to use e-government services. We propose a model of e-government trust composed of disposition to trust, trust of the Internet (TOI), trust of the government (TOG) and perceived risk. Results from a citizen survey indicate that disposition to trust positively affects TOI and TOG, which in turn affect intentions to use an e-government service. TOG also affects negatively perceived risk, which affects use intentions as well. Implications for practice and research are discussed.
Largest crater shape in the Great Sahara revealed by multi-spectral images and radar data
Authors: F. El-Baz, E. Ghoneim
Venue: International Journal of Remote Sensing (2007)

This Letter communicates the discovery of an exceptionally large, double-ringed crater in the eastern part of the Great Sahara, North Africa. The crater is centred at 24.40° N 24.58° E, straddling the boarder between Egypt and Libya. It is the 15th and largest impact crater identified in the Sahara. Landsat Enhanced Thematic Mapper Plus (ETM+) images as well as Radarsat-1 data reveal a discontinuous outer rim, 31 km in diameter, and a group of prominences forming an inner ring. The Nubian sandstone surface in which the crater was formed has undergone severe erosion. Thus, the crater morphology was affected by both aeolian and fluvial processes. Courses of a major river and smaller streams, now dry, have eroded much of the crater's outer rim as revealed by Shuttle Radar Topography Mission (SRTM) data. The probable impact that created the crater, named Kebira, meaning large in Arabic, is possibly the source of the silica glass fragments that abound on the desert surface between giant linear dunes of the Great Sand Sea in southwestern Egypt.