ppxscal/embedding_network huggingface dataset:
The Ramsey number for a cycle of length five vs. a complete graph of order six
Authors: Chula J. Jayawardene, Cecil C. Rousseau
Venue: Journal of Graph Theory (2000)

It has been conjectured that r(Cm, Kn)&thinsp;=&thinsp;(m&thinsp;-&thinsp;1)(n&thinsp;-&thinsp;1)&thinsp;+&thinsp;1 for all m&thinsp;&ge;&thinsp;n&thinsp;&ge;&thinsp;4. This has been proved recently for n&thinsp;=&thinsp;4 and n&thinsp;=&thinsp;5. In this paper, we prove that r(C5, K6)&thinsp;=&thinsp;21. This raises the possibility that r(Cm, K6)&thinsp;=&thinsp;5m&thinsp;-&thinsp;4 for all m&thinsp;&ge;&thinsp;5. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 35: 99&ndash;108, 2000
States on R 0 algebras
Authors: Liu Lianzhen, Zhang Xiangyang
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

The aim of this paper is to introduce the notion of states on R 0 algebras and investigate some of their properties. We prove that every R 0 algebra possesses at least one state. Moreover, we investigate states on weak R 0 algebras and give some examples to show that, in contrast to R 0 algebras, there exist weak R 0 algebras which have no states. We also derive the condition under which finite linearly ordered weak R 0 algebras have a state.
In the News
Authors: Mark Ingrebretsen, Keri Schreiner
Venue: IEEE Intelligent Systems (2008)

The first story, "AI Essay Graders Get High Marks for Speed and Accuracy," looks at several current approaches to analyzing and scoring student-written essays. The second story, "Machine Learning Takes On the Brain," reports on an attempt to combine brain imaging and machine learning technologies to study human information processing.
Towards persistence-based reconstruction in euclidean spaces
Authors: Frédéric Chazal, Steve Yann Oudot
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new methods to reconstruct large classes of compact subsets of Rd. However, the complexities of these methods scale up exponentially with d, making them impractical in medium or high dimensions, even on data sets of low intrinsic dimensionality. In this paper, we introduce a novel approach that stands in-between classical reconstruction and topological estimation, and whose complexity scales up with the intrinsic dimension of the data. Our algorithm combines two paradigms: greedy refinement, and topological persistence. Given a point cloud in Rd, we build a set of landmarks iteratively, while maintaining a nested pair of abstract complexes, whose images in Rd lie close to the data, and whose persistent homology eventually coincides with the homology of the underlying shape. When the data points are densely sampled from a smooth m-submanifold X of Rd, our method retrieves the homology of X in time at most c(m)n5, where n is the size of the input and c(m) is a constant depending solely on m. To prove the correctness of our algorithm, we investigate on Čech, Rips, and witness complex filtrations in Euclidean spaces. More precisely, we show how previous results on unions of balls can be transposed to Čech filtrations, and from there to Rips and witness complex filtrations. Finally, investigating further on witness complexes, we quantify a conjecture of Carlsson and de Silva, which states that witness complex filtrations should have cleaner persistence barcodes than Čech or Rips filtrations, at least on smooth submanifolds of Euclidean spaces.
Grid enabled, hierarchical distributed metamodel-assisted evolutionary algorithms for aerodynamic shape optimization
Authors: P. I. K. Liakopoulos, I. C. Kampolis, K. C. Giannakoglou
Venue: Future Generation Computer Systems (2008)

A Grid-enabled optimization environment is presented. It is based on Metamodel-Assisted Evolutionary Algorithms (MAEAs), where radial basis function networks, trained on the fly on selected subsets of the previously evaluated individuals, are used to pre-evaluate the population members. The search follows a Hierarchical and Distributed scheme (HDMAEA), with more than one search level, each of which is associated with a different problem-specific evaluation tool and a different number of semi-isolated demes. Irrespective of the use of cluster or Grid computing, the HDMAEA drastically reduces the number of evaluations required to reach the optimal solution(s). The Grid-enabled HDMAEA, based on the master-slave model with simultaneously evaluated population members, aims at solving large scale optimization problems in affordable wall clock time. In the proposed Grid-computing setup, Condor is used as the local resource manager on each contributing cluster, authentication and interfacing is carried out via the Globus Toolkit and the unification of Grid resources under a common queue is undertaken by the Gridway metascheduler. If more than one search level are used (hierarchical search), the optimization of Grid resources' allocation relies on the distinction between computationally demanding, high-accuracy and less demanding, low-accuracy evaluation tools. The proposed Grid-enabled problem solving environment is demonstrated on three aerodynamic shape optimization problems, namely the design of a compressor cascade and two 3D elbow ducts, on three remote clusters.
Data Quality and Query Cost in Pervasive Sensing Systems
Authors: David Yates, Erich Nahum, James F. Kurose, Prashant Shenoy
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

This research is motivated by large-scale pervasive sensing applications. We examine the benefits and costs of caching data for such applications. We propose and evaluate several approaches to querying for, and then caching data in a sensor field data server. We show that for some application requirements (i.e., when delay drives data quality), policies that emulate cache hits by computing and returning approximate values for sensor data yield a simultaneous quality improvement and cost savings. This win-win is because when system delay is sufficiently important, the benefit to both query cost and data quality achieved by using approximate values outweighs the negative impact on quality due to the approximation. In contrast, when data accuracy drives quality, a linear trade-off between query cost and data quality emerges. We also identify caching and lookup policies for which the sensor field query rate is bounded when servicing an arbitrary workload of user queries. This upper bound is achieved by having multiple user queries share the cost of a single sensor field query. Finally, we demonstrate that our results are robust to the manner in which the environment being monitored changes using models for two different sensing systems.
Crosslingual location search
Authors: Tanuja Joshi, Joseph Joy, Tobias Kellner, Udayan Khurana, A Kumaran, Vibhuti Sengar
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Address geocoding, the process of finding the map location for a structured postal address, is a relatively well-studied problem. In this paper we consider the more general problem of crosslingual location search, where the queries are not limited to postal addresses, and the language and script used in the search query is different from the one in which the underlying data is stored. To the best of our knowledge, our system is the first crosslingual location search system that is able to geocode complex addresses. We use a statistical machine transliteration system to convert location names from the script of the query to that of the stored data. However, we show that it is not sufficient to simply feed the resulting transliterations into a monolingual geocoding system, as the ambiguity inherent in the conversion drastically expands the location search space and significantly lowers the quality of results. The strength of our approach lies in its integrated, end-to-end nature: we use abstraction and fuzzy search (in the text domain) to achieve maximum coverage despite transliteration ambiguities, while applying spatial constraints (in the geographic domain) to focus only on viable interpretations of the query. Our experiments with structured and unstructured queries in a set of diverse languages and scripts (Arabic, English, Hindi and Japanese) searching for locations in different regions of the world, show full crosslingual location search accuracy at levels comparable to that of commercial monolingual systems. We achieve these levels of performance using techniques that may be applied to crosslingual searches in any language/script, and over arbitrary spatial data.
Hexahedral mesh generation constraints
Authors: Jason F. Shepherd, Chris R. Johnson
Venue: Engineering with Computers (2008)

For finite element analyses within highly elastic and plastic structural domains, hexahedral meshes have historically offered some benefits over tetrahedral finite element meshes in terms of reduced error, smaller element counts, and improved reliability. However, hexahedral finite element mesh generation continues to be difficult to perform and automate, with hexahedral mesh generation taking several orders of magnitude longer than current tetrahedral mesh generators to complete. Thus, developing a better understanding of the underlying constraints that make hexahedral meshing difficult could result in dramatic reductions in the amount of time necessary to prepare a hexahedral finite element model for analysis. In this paper, we present a survey of constraints associated with hexahedral meshes (i.e., the conditions that must be satisfied to produce a hexahedral mesh). In presenting our formulation of these constraints, we will utilize the dual of a hexahedral mesh. We also discuss how incorporation of these constraints into existing hexahedral mesh generation algorithms could be utilized to extend the class of geometries to which these algorithms apply. We also describe a list of open problems in hexahedral mesh generation and give some context for future efforts in addressing these problems.
Error bounds for systems of lower semicontinuous functions in Asplund spaces
Authors: Huynh Ngai, Michel van Th&#x00e9;ra
Venue: Mathematical Programming: Series A and B (2008)

In this paper, using the Fr&#x00e9;chet subdifferential, we derive several sufficient conditions ensuring an error bound for inequality systems in Asplund spaces. As an application we obtain in the context of Banach spaces a global error bound for quadratic nonconvex inequalities and we derive necessary optimality conditions for optimization problems.
Lotus Notes 7 Calendar Quick Reference Guide
Authors: Beezix Inc
Venue:  (2007)

Laminated quick reference guide showing step-by-step instructions and shortcuts for the calendar features of Lotus Notes 7. Topics include: Viewing the Calendar, Creating Calendar Entries, Types of Calendar Entries, Setting Alarms, Responding to Alarms, Rescheduling Entries, Repeating Calendar Entries, Deleting Entries, Adjusting Defaults, Allowing Others to View Your Calendar, Creating and Viewing Group Calendars, Editing Members of a Group Calendar, Changing Start Time and Duration of Group Calendar Days, Opening Another Person s Calendar, Creating a Shortcut to Someone's Calendar, Cleaning up the Calendar, Filtering the Calendar, Inviting People to Meetings, Finding Other People s Free Time, Editing the Invitee List, Reviewing Invitee Responses, Confirming a Meeting, Responding to Meeting Invitations, Printing Your Calendar, Displaying the To Do List, Creating To Do Items, Converting Messages to To Do Items, Assigning To Do Items to Others, and Completing To Do Items. Also includes a list of Movement Shortcuts. This guide is suitable as a training handout, or simply an easy to use reference guide for any type of user.
Hotspot Preventing Routing algorithm for delay-sensitive applications of in vivo biomedical sensor networks
Authors: Anirban Bag, Mostafa A. Bassiouni
Venue: Information Fusion (2008)

Networks of implanted biomedical sensor nodes promise to give a new direction to medical research. The in vivo sensor nodes collect desired biometric data and communicate the data wirelessly to a base-station through a multi-hop network. The wireless communication produces heat, leading to a rise in the temperature of the nodes. A high temperature of the in vivo nodes for a prolonged period is not desired as it might damage the surrounding tissues. Medical applications are also often delay-sensitive. In this paper, we propose Hotspot Preventing Routing (HPR) algorithm that performs much better than the shortest hop routing algorithm and the previously proposed Thermal Aware Routing Algorithm (TARA) in terms of preventing the formation of hotspots and reducing the average packet delivery delay by dynamically adapting to the network load. The simulation results presented also show that the HPR algorithm is highly scalable, increases the operational life of the network and helps reduce the number of packets dropped.
Science Code .NET: Object-oriented programming for science
Authors: Myung-Hoon Chung
Venue: Science of Computer Programming (2008)

We propose an object-oriented programming library system for Science in a similar structure of .NET framework. We call the system Science Code .Net. Presenting rules of thumb, we show how to enhance readability of Science Code .Net. As an initial progress, several namespaces have been constructed. We explain the structure of classes in each namespace. As a challenge to the programming community, a perspective view of Science Code .Net is discussed.
A design framework exploratory geovisualization in epidemiology
Authors: Anthony C. Robinson
Venue: Information Visualization (2007)

This paper presents a design framework for geographic visualization based on iterative evaluations of a toolkit designed to support cancer epidemiology. The Exploratory Spatio-Temporal Analysis Toolkit (ESTAT), is intended to support visual exploration through multivariate health data. Its purpose is to provide epidemiologists with the ability to generate new hypotheses or further refine those they may already have. Through an iterative user-centered design process, ESTAT has been evaluated by epidemiologists at the National Cancer Institute (NCI). Results of these evaluations are discussed, and a design framework based on evaluation evidence is presented. The framework provides specific recommendations and considerations for the design and development of a geovisualization toolkit for epidemiology. Its basic structure provides a model for future design and evaluation efforts in information visualization.
Spectral reflectance of the seagrasses: Thalassia testudinum, Halodule wrightii, Syringodium filiforme and five marine algae
Authors: A. Thorhaug, A. D. Richardson, G. P. Berlyn
Venue: International Journal of Remote Sensing (2007)

Spectral reflectance of three Western Atlantic subtropical/tropical dominant benthic seagrasses (Thalassia testudinum, Halodule wrightii and Syringodium filiforme) measured in the laboratory by UNIspec Spectral Analysis system over 400-1000 nm are compared to five Western Atlantic dominant benthic and intertidal algae (Fucus vesiculosus, Ulva lactuca, Halimeda incrassata, Udotea flabellum and Penicillus capitatus). Thalassia spectra are also compared to previously studied forest species, showing that the spectral reflectance signature of Thalassia was of the same general shape as forest species, but of lesser peak height (18% vs 28-50%) in the 750-759 nm range. For marine plants, near-infrared reflectance of Thalassia, Syringodium and Halodule was intermediate (18%) between the ubiquitous green alga Ulva (15%) and the temperate brown alga, Fucus (27%). The brown alga had a unique spectral signature in the first difference spectrum (three secondary peaks at differing spectral values than the other species' secondary peaks). Comparisons between Halodule, Syringodium and Thalassia near-infrared peaks and Halimeda (58%), Penicillus (29%) and Udotea (42%), subtropical/tropical algae, were also carried out. Halimeda differed most from the other green algae in terms of numerous oscillations from 450 to 700 nm seen in the first difference spectrum. The three seagrasses were similar in spectral reflectance curve shape to one another but differed somewhat in peak height. The first difference spectrum was helpful in pointing out subtle differences among the species and between algae and seagrass. Spectral reflectance data such as those presented here appear potentially useful for remote sensing of shallow habitats, and may additionally be used to monitor their health.
Micro FET pressure sensor manufactured using CMOS-MEMS technique
Authors: Ching-Liang Dai, Pin-Hsu Kao, Yao-Wei Tai, Chyan-Chyi Wu
Venue: Microelectronics Journal (2008)

The fabrication of a micro field effect transistor (FET) pressure sensor using the commercial 0.35@mm complementary metal oxide semiconductor (CMOS) process and a post-process has been investigated. The pressure sensor is composed of 16 sensing cells in parallel, and each sensing cell includes a suspended membrane and an NMOS. The suspended membrane is the movable gate of the NMOS. The pressure sensor needs a post-process to obtain the suspended membrane after the CMOS process. The post-process employs etchants to etch the sacrificial layers to release the suspended membrane, and then a low-pressure chemical vapor deposition (LPCVD) parylene is used to seal the etching holes in the pressure sensor. The pressure sensor produces a change in current when applying a pressure to the sensing cells. Experimental results show that the pressure sensor has a sensitivity of 0.022@mA/kPa in the pressure range of 0-500kPa.
Public key based authentication for secure integration of sensor data and RFID
Authors: Mingyan Li, Casey Fung, Krishna Sampigethaya, Richard Robinson, Radha Poovendran, Rainer Falk, Florian Kohlmayer, Andreas Koepf
Venue: Proceeding of the 1st ACM international workshop on Heterogeneous sensor and actor networks (2008)

The incorporation of sensor readings into RFID tags creates a significant potential for applications which require environment monitoring as well as asset management and tracking, such as blood storage and management, and on-board aircraft part maintenance. On one hand, the environment history is essential in evaluating health and integrity of objects to be protected, such as blood and aircraft part. On the other hand, the periodic sensing information stored in RFID enables identifying the events of displacing and removal of the objects. However, the benefits of integrating RFID with sensor data are achieved only when the authenticity and integrity of data written to and stored at RFID are ensured. In this paper, we present challenges on secure integration of sensor readings and RFID, and compare security solutions of data integrity and authenticity for resource-constrained RFID tags. For mutual authentication between RFID tags and sensors (or readers), the public key based approaches proves efficient and feasible. We further evaluate different public key based approaches in terms of storage and communication efficiency.
Wrong Assumptions and Neglected Areas in Embedded Systems Research
Authors: Hermann Kopetz
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

We need a systematic methodology about how to build robust embedded systems. A starting point for the development of such a methodology could be the analysis of fielded systems that exhibit a high degree of robustness.
Dynamic recognition of synchronization operations for improved data race detection
Authors: Chen Tian, Vijay Nagarajan, Rajiv Gupta, Sriraman Tallam
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

Debugging multithreaded programs, which involves detection and identification of the cause of data races, has proved to be a hard problem. Although there has been significant amount of research on this topic, prior works rely on one important assumption - the debuggers must be aware of all the synchronization operations that take place during a program run. This assumption is a significant limitation as multithreaded programs, including the popular SPLASH-2 benchmark, have barriers and flag synchronizations implemented in the user code. We show that the lack of knowledge of these synchronization operations leads to unnecessary reporting of numerous races. Our experiments with SPLASH-2 benchmark suite show that 12-131 distinct segments in source code, on an average, give rise to well over 4 million dynamic instances of falsely reported races for these programs. We propose a dynamic software technique that identifies the user defined synchronizations exercised during a program run. This information not only helps avoids reporting of unnecessary races, but also helps a record/replay system to speedup the replay. Our evaluation confirms that our synchronization detector is highly accurate with no false negatives and very few false positives. Thus, reporting of nearly all unnecessary races is avoided. Finally, we show that the knowledge of synchronization operations resulted in about 23% reduction in replay time.
The observation of ultra-low frequency emissions at Nakatsugawa, Japan, in possible association with the Sumatra, Indonesia, earthquake
Authors: K. Ohta, N. Watanabe, M. Hayakawa
Venue: International Journal of Remote Sensing (2007)

The observation of direct current (DC)/ultra-low frequency (ULF) electromagnetic emissions at Nakatsugawa, Gifu, Japan, has indicated that ULF emissions in the frequency below 0.1 Hz took place about 3-10 days before the disastrous Sumatra, Indonesia, earthquake. The most important support to this is based on the goniometric direction finding for those ULF emissions during the period of 17-23 December, which indicates their azimuth angle being very close to the epicentre of the earthquake. So, these ULF emissions between 17-23 December are likely to be associated with the earthquake.
Rational swarms for distributed on-line Bayesian search
Authors: Alfredo Garcia, Chenyang Li, Fernan Pedraza
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

We present a novel scheme for distributed search in mobile sensors networks that is inspired by collective forms of intelligence present in many biological systems. Unlike the established paradigms of swarm intelligence, we posit a form of individual rationality governing each agent's decision. In the scheme proposed, a network of mobile sensors is tasked to find several targets over a search area. The sensing technology is imperfect so there are non-negligible probabilities for false positives and false negatives. Mobile sensors leave two data 'trails' across potential target locations that have been explored. One trail is associated with the frequency with which a given location has been probed while the other relates to the Bayes updated likelihood that a target is present. These trails are stored in a geographically distributed array of stationary motes. Each sensor processes the implicit information encapsulated in the two trails and chooses a decision that is aimed at maximizing the chance of detecting a target without unnecessary duplication in probing. By endowing mobile sensors with this simple optimization rule, we show that a form of 'rational swarm' intelligence emerges as sensors successfully coordinate indirectly (i.e. they achieve a one-to-one allocation of agents and targets) through active manipulation of the trails. This feature guarantees the proposed scheme is both reconfigurable and scalable.