ppxscal/embedding_network huggingface dataset:
The circular chromatic number of series-parallel graphs with large girth
Authors: Chihyun Chien, Xuding Zhu
Venue: Journal of Graph Theory (2000)

It was proved by Hell and Zhu that, if G is a series-parallel graph of girth at least 2 (3k - 1)-2, then &chi;c(G) d 4k-(2k - 1). In this article, we prove that the girth requirement is sharp, i.e., for any k &ge; 2, there is a series-parallel graph G of girth 2 (3k - 1)-2 - 1 such that &chi;c(G) > 4k-(2k - 1). &copy; 2000 John Wiley Sons, Inc. J Graph Theory 33: 185198, 2000
Framework for realistic surface representation of real objects
Authors: Haedong Kim, Sungye Kim, Jinseo Kim, Byeongtae Choi
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

We present a simple framework to represent images of real objects and show developed results. In the framework, we acquire characteristics of the objects' surface from their original images and reproduce new photo-realistic images of the objects by using their characteristics. To do these, the characteristics of a camera are extracted, and the, the characteristics of the objects' surface from their image acquired by camera are extracted, and finally new photorealistic images are depicted in new environments. BRDF (Bi-directional Reflectance Distribution Function) and texture of the objects' surface are used as the characteristics of the objects. When the images of a real object acquired by a specific camera in various lighting environments of virtual museum, cinema and advertisement and so on are needed, the similar corresponding images can be created through our framework.
Data/Information Lifecycle Management: A Solution for Taming Data Beast
Authors: Jivika Govil, Navkeerat Kaur, Harkeerat Kaur, Jivesh Govil
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Large amount of unstructured data are growing in the present world organizations, as organizations are growing at a rapid pace and accumulating information at an accelerating rate. Moreover data add real value in terms of increase efficiency productivity and profitability. It is extremely difficult for the users to sort through files to find data. This has resulted in the growing cost and inefficiencies that threaten their ability to function. This need has developed the Information Life Cycle Management (ILM). ILM is a process to eliminate low value information data, as early as possible and managing the long term storage of rest of the data, so that it can be quickly and cheaply accessed. ILM moves data from place to place, according to its usefulness. This poster paper has attempted to explain the data explosion, and thus need for the ILM, which is a software and hardware movement.
Multi-scale information extraction from high resolution remote sensing imagery and region partition methods based on GMRF-SVM
Authors: J. Luo, D. Ming, Z. Shen, M. Wang, H. Sheng
Venue: International Journal of Remote Sensing (2007)

This paper proposes the work flow of multi-scale information extraction from high resolution remote sensing images based on features: rough classification-parcel unit extraction (subtle segmentation)-expression of features-intelligent illation-information extraction or target recognition. This paper then analyses its theoretical and practical significance for information extraction from enormous amounts of data on a large scale. Based on the spectrum and texture of images, this paper presents a region partition method for high resolution remote sensing images based on Gaussian Markov Random Field (GMRF)-Support Vector Machine (SVM), that is the image classification based on GMRF-SVM. This method integrates the advantages of GMRF-based texture classification and SVM-based pattern recognition with small samples and makes it convenient to utilize a priori knowledge. Finally, the paper reports tests on Ikonos images. The experimental results show that the method used here is superior to GMRF-based segmentation in terms of both the time expenditure and processing effect. In addition, it is actually meaningful for the stage of information extraction and target recognition.
GeometryEditor: a web-based interactive geometry manipulative authoring system (abstract only)
Authors: Xun Lai, Paul S. Wang
Venue: ACM Communications in Computer Algebra (2008)

GeometryEditor (previous code name: GeoSVG) is a Web-based environment for authoring interactive geometry manipulatives. Users may create on-line manipulatives to illustrate mathematical concepts for a hands-on learning environment. GeometryEditor provides standard authoring features, such as sketching, measurements, calculation, macros, iteration, loci, animation and coordinate systems. GeometryEditor also offers several its own authoring features, such as synchronized copy, parametric color and visibility, and mouse click events. The GeoSite provides the GeometryEditor authoring environment and a corresponding page authoring environment to assist in creating lessons around the manipulatives. Other people via the Internet can immediately view completed manipulatives and pages.
Evaluation of the Evolutionary Ability of Business Incubation Network Based on Genetic Algorithm
Authors: Zhang Min, Jiang Renguo, Hu Haiqing
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The paper begins from the basic content of business incubation network (BIN) and expatiates the meanings of BIN evolution and its model. And the paper uses Genetic Algorithm to evaluate the evolutionary ability of the incubatee and BIN based on the model of stimulus consciousness reaction of BIN, and supposes the path to improve the evolutionary ability of incubatee species and BIN.
Short communication: Bootstrap quantile estimation via importance resampling
Authors: Jiaqiao Hu, Zheng Su
Venue: Computational Statistics Data Analysis (2008)

We propose an adaptive importance resampling algorithm for estimating bootstrap quantiles of general statistics. The algorithm is especially useful in estimating extreme quantiles and can be easily used to construct bootstrap confidence intervals. Empirical results on real and simulated data sets show that the proposed algorithm is not only superior to the uniform resampling approach, but may also provide more than an order of magnitude of computational efficiency gains.
Boosting: a classification method for remote sensing
Authors: J. S. Bailly, M. Arnaud, C. Puech
Venue: International Journal of Remote Sensing (2007)

This article sets out to demonstrate how boosting can serve as a supervised classification method, and to compare its results with those of conventional methods. The comparison begins with a theoretical example in which several criteria are varied: number of pixels per class, overlapping (or not) of radiometric values between classes, and presence and absence of spatial structuring of classes within the geographical space. The results are then compared with a real case study of land cover based on a multispectral SPOT image of the Sousson catchment area (South of France). It is seen that (1) maximum likelihood gives better results than boosting when the radiometric values for each class are clearly separated. This advantage is lost as the number of pixels per class increases; (2) boosting is systematically better than maximum likelihood in the event of overlapping radiometric variable classes, whether or not there is a spatial structure.
A note on group colorings
Authors: Daniel Král', Ondřej Pangrác, Heinz-Jürgen Voss
Venue: Journal of Graph Theory (2005)

We study a concept of group coloring introduced by Jaeger et al. We show that the group chromatic number of a graph with minimum degree &delta; is greater than &delta;-(2, ln &delta;) and we answer several open questions on the group chromatic number of planar graphs: a construction of a bipartite planar graph with group chromatic number four and a 3-colorable planar graph with group chromatic number five are presented. We also observe that several upper bounds on the choice number for various subclasses of planar graphs also translate to the concept of group colorings. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
New expansions of numerical eigenvalues by finite elements
Authors: Hung-Tsai Huang, Zi-Cai Li, Qun Lin
Venue: Journal of Computational and Applied Mathematics (2008)

The paper provides new expansions of leading eigenvalues for -@Du=@l@ru in S with the Dirichlet boundary condition u=0 on @?S by finite elements, with the support of numerical experiments. The theoretical proof of new expansions of leading eigenvalues is given only for the bilinear element Q"1. However, such a new proof technique can be applied to other elements, conforming and nonconforming. The new error expansions are reported for the Q"1 elements and other three nonconforming elements, the rotated bilinear element (denoted by Q"1^r^o^t), the extension of Q"1^r^o^t (denoted by EQ"1^r^o^t) and Wilson's element. The expansions imply that Q"1 and Q"1^r^o^t yield upper bounds of the eigenvalues, and that EQ"1^r^o^t and Wilson's elements yield lower bounds of the eigenvalues. By the extrapolation, the O(h^4) convergence rate can be obtained, where h is the boundary length of uniform rectangles.
Effects of Supraphysiological Thermal Injury in Human Embryonic Kidney Cells
Authors: Ching-Te Huang, Cheng-Han Tsai, Chun-Ping Jen
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Depending on the duration of exposure at supraphysiological temperatures, cellular proteins and organelles would suffer structural alternation and irreversible denaturation which may induce cell death. In the present study, a commercial hotplate was used to provide a constant temperature to heat the human embryonic kidney cells (293T). Heat transfer model were performed to evaluate thermal equilibrium time required for the cell samples. The survival of the human embryonic kidney cell line was investigated herein and the frequency factor and activation energy of 293T cells in the Arrhenius model for the thermal induced cell injury were obtained as A=5.95×1030s-1 and ΔE=211.79kJ/mol, respectively. It can also be observed patently that the cell membrane was ruptured when the cell was exposing such a supraphysiological temperature.
Parallel Communication With Limited Buffers
Authors: N. Pippenger
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

Currently known parallel communication schemes allow n nodes interconnected by arcs (in such a way that each node meets only a fixed number of arcs) to transmit n packets according to an arbitrary permutation in such a way that (1) only one packet is sent over a given arc at any step, (2) at most 0(log n) packets reside at a given node at any time and (3) with high probability, each packet arrives at its destination within 0(log n) steps. We present and analyze a new parallel communication scheme that ensures that at most a fixed number of packets reside at a given node at any time. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Multi-level Fidelity-Preserving Bandwidth-Limited Worm Simulation Model and Its Application
Authors: Yuewu Wang, Peng Liu, Jiwu Jin, Xiaoqi Jia
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

Worm validation experiments are very important for worm research. A major method to conduct these experiments is through simulation. However, almostall of the existing worm simulation models inherently face a rigid fidelity-scalability tradeoff problem. In this paper, we propose a multi-level fidelity-preserving worm simulation model aiming to solve this problem. Our model is composed of a set of different components, and the fidelity of every component can be adjusted to meet different fidelity-scalability tradeoff requirements by changing the abstraction level of the component model. Thus, the overall fidelity of the worm simulation model can be adjusted at a finer granularity, enabling the new model to flexibly trade fidelity with scalability, or vice versa, depending on specific requirements. In addition, we also presentthe methodology on how to construct the multi-level fidelity-preserving bandwidth-limited worm simulation model and how to use the model to validate the effectiveness of defense strategies.
Discrete graphic Markov model selection by a genetic algorithm: empirical comparison of two fitting convex functions
Authors: Elva Diaz Diaz, Eunice E. Ponce de León senti
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

The problem treated is the comparison of the performance of two different fitting index, defined based in Information Theory criteria (Kullback-Leibler and Akaike) for the genetic algorithm. Samples of known models are generated with the IPF modified algorithm. As the true model is known, the performance is assessed through the percent of true edges of the true model in the best model selected by the algorithm. An experiment is designed to select the best combination of parameters of the considered genetic algorithm, and nine known models of different complexities are used to assess the performance of the genetic algorithm with each of the two fitting criteria. As results the genetic algorithm with the convex fitting index (CFI) find more or equal (equal only in one case) number of correct edges than the mixed fitting index (MFI), the better performance of the genetic algorithm occurs always selecting 60 percent of the best population individuals for reproducing the next population, the edges of the sparse models are more difficult to find for any of the fitting indexes than the edges of the medium and dense models. The more complex the models are, the better the performance of the algorithm is. The significant factors were: the fitting indexes, the percent of the best individuals selected to reproduce, and the complexity of the models.
Region-Based Sensor Selection for Wireless Sensor Networks
Authors: Yoshiyuki Nakamura, Kenji Tei, Yoshiaki Fukazawa, Shinichi Honiden
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

In a sensor network, the technique that limits the number of sensors used for observation is effective to reduce the energy consumption of each sensor. To limit the number of sensors without sacrificing observation accuracy, an appropriate sensor combination must be selected by evaluating the observation effectiveness of various combinations. However, the computational workload for evaluating all the sensor combinations is quite large. We can define a parameter related to the optimal size of a region around an observation target by making a trade-off between accuracy and the computational workload. In region-based sensor selection, a combination of sensors is selected from that is near the observation target. Accuracy is better in a larger region with a lot of sensors, but the computational workload is heavier. In contrast, a smaller region with fewer sensors has poorer accuracy, but a lighter workload. The size of the region controls the trade-off between accuracy and the computational workload. We define a parameter related to the optimal size of a region, and use it to dynamically adjust the region's size. Our simulations confirmed that region-based sensor selection reduces the computational workload and improves accuracy in comparison to existing techniques.
Communication in the presence of replication
Authors: Omer Barkol, Yuval Ishai, Enav Weinreb
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We consider the following problem. Suppose that a big amount of data is distributed among several parties, so that each party misses only few pieces of data. The parties wish to perform some global computation on the data while minimizing the communication between them. This situation is common in many real-life scenarios. A naive solution to this problem is to first perform a synchronization step, letting one party learn all pieces of data, and then let this party perform the required computation locally. We study the question of obtaining better solutions to the problem, focusing mainly on the case of computing low-degree polynomials via non-interactive protocols. We present interesting connections between this problem and the well studied cryptographic problem of secret sharing. We use this connection to obtain nontrivial upper bounds and lower bounds using results and techniques from the domain of secret sharing. The relation with open problems from the area of secret sharing also provides evidence for the difficulty of resolving some of the questions we leave open.
k-TSN(k-Top Scoring N): Microarray Data Classification Based on Rank-Comparison Decision Rules
Authors: Youngmi Yoon, Sangjay Bien, Sanghyun Park
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Microarrays produce expression measurements for thousands of genes simultaneously, which is useful for the phenotype classification. We performed a direct integration of individual microarrays with same biological objectives by converting an expression value into a rank value within a sample and built a classifier based on rank comparison. Our classifier is an ensemble method, which has k top-scoring decision rules. Each rule contains a number of genes, a relationship between those genes, and a class label. Current classifiers fix the number of genes in each rule as a pair or a triple. In this paper, we generalized the number of genes involved in each rule. Generalizing the number of genes increases the robustness and the reliability of the classifier. Our algorithm saves resources by combining shorter rules to build a longer-rule, shows a rapid convergence toward its high-scoring rule list, and outperforms the current methods in run-time and classification accuracy.
Modeling and Calculation for Network System Survivability
Authors: Zhou Meng, Zhou Xueguang, Zhang Huanguo
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Survivability is the ability of a system to continue operating despite the presence of abnormal events such as failures and intrusions. This paper presents a quantitative model of spare resource limited survivability (SRLSQM), based on the definition and four characteristic attributes of network survivability. The executing process of SRLSQM is also illustrated and then the calculating formulas are proposed which include the calculation of restoration rate and system state transition matrixes. The formulas reflect the survivability requirements in network spare resources. At last, a simulation testing is carried through, which demonstrates the feasibility and reliability of our model.
Assessment of Three-class Diagnostic Tests when Disease Verification is Subject to Selection
Authors: Yueh-Yun Chi
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In the assessment of a three-class diagnostic test, the Receiver Operating Characteristic surface has been one of the established tools when subsequent definitive disease verification can be obtained. However, omitting cases that have no definitive verification can seriously bias the assessment. In this paper, the assumption about the selection mechanism for verification is made in order to adjust for the bias. Through sets of numerical simulations with differential selection mechanisms, the properties of adjusted estimates are demonstrated. The proposed method is used to evaluate the accuracy of using Mini-Mental State Examination in diagnosing the three disease states of Alzheimer's disease.
Llama-b: automatic hyperlink authoring in the blogosphere
Authors: Dong Zhou, Mark Truran, Tim Brailsford, Helen Ashman, Amir Pourabdollah
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

Viewed collectively, the sum of all blog entries recorded to date (usually referred to as the blogosphere) represents a prodigiously rich collection of commentary and opinion, a dizzying mixture of fact and speculation, subjective opinion and objective data. This paper introduces a hypermedia authoring tool intended to simplify the process of navigating this chaotic environment. The tool works by adding additional hyperlinks to blogs, links which connect blog entries addressing similar topics. These hyperlinks are generated by an algorithm that uses statistical language modeling and graph based analysis to exploit the implicit associative structure of the blogosphere. An evaluative exercise, centred upon the unsupervised labeling of blog articles, confirms the effectiveness of this approach.
An Efficient Hardware Implementation of the Tate Pairing in Characteristic Three
Authors: Giray Kömürcü, Erkay Savas
Venue: Proceedings of the Third International Conference on Systems (2008)

DL systems with bilinear structure recently became an important base for cryptographic protocols such as identity-based encryption (IBE). Since the main computational task is the evaluation of the bilinear pairings over elliptic curves, known to be prohibitively expensive, efficient implementations are required to render them applicable in real life scenarios. We present an efficient accelerator for computing the Tate Pairing in characteristic 3, using the Modified-Duursma-Lee algorithm. Our accelerator shows that it is possible to improve the area-time product by 12 times on FPGA, compared to estimated values from one of the best known hardware architecture [6] implemented on the same type of FPGA. Also the computation time is improved upto 16 times compared to software applications reported in [17]. In addition, we present the result of an ASIC implementation of the algorithm, which is the first hitherto.
Improve Model Checking Efficiency Using Specific Knowledge about the System
Authors: Jianhua Zhao, Bin Lei, Xuandong Li, Guoliang Zheng
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

In this paper, we present a timed automaton reachability analysis algorithm which can use some other properties to improve the model checking efficiency. If the model checker aborts because of memory or CPU time limitation when checking a property P, the users can still use a set of auxiliary properties P_1, P_2, \dots, P_n about the system to reduce the space and time requirement. People can verify these auxiliary properties by either model checking or other methods like theorem proving. This algorithm gives the users a way to reduce the space and time requirement of model checking using their knowledge about the system under check.