ppxscal/embedding_network huggingface dataset:
Improved Warping of Diffusion Tensor Fields Free of Artifacts
Authors: Dongrong Xu, Bradley S. Peterson
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Warping diffusion tensor (DT) fields accurately is much more complicated than that of conventional scalar images. It requires tensors be reoriented in the space to which the tensors are warped based on both the local deformation field and the orientation of the underlying fibers in the original image. Because DT images contain high dimensional information of both spatial orientation and magnitude, standard warping using backward mapping for regular intensity-based images cannot be applied to warp DT images. Therefore, all existing algorithms for warping tensors typically use forward mapping deformations; forward mapping, however, can also create artifacts by failing to define accurately the voxels in the template space where the local deformation is expanding. To overcome this disadvantage, we propose a novel method for the spatial normalization of DT fields that uses a bijection) to warp DT datasets from one imaging space to another, without generating artifacts.
Polychromatic colorings of plane graphs
Authors: Noga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi Shannigrahi, Bettina Speckmann, Philipp Zumstein
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

We show that the vertices of any plane graph in which every face is of size at least g can be colored by (3g Àý 5)=4 colors so that every color appears in every face. This is nearly tight, as there are plane graphs that admit no vertex coloring of this type with more than (3g+1)=4 colors. We further show that the problem of determining whether a plane graph admits a vertex coloring by 3 colors in which all colors appear in every face is NP-complete even for graphs in which all faces are of size 3 or 4 only. If all faces are of size 3 this can be decided in polynomial time.
Entropy numbers in sequence spaces with an application to weighted function spaces
Authors: Thomas Kühn
Venue: Journal of Approximation Theory (2008)

We determine the exact asymptotic behaviour of entropy numbers of diagonal operators from @?"p to @?"q, 0
A B+-tree based indexing technique for fuzzy numerical data
Authors: C. D. Barranco, J. R. Campaòa, J. M. Medina
Venue: Fuzzy Sets and Systems (2008)

This paper proposes an indexing technique for fuzzy numerical data which increases the performance of query processing when the query involves an atomic possibility measured flexible condition. The proposal is based on a classical indexing mechanism for numerical crisp data, B^+-tree, which is implemented in most commercial database management systems (DBMS). This makes the proposed technique a good candidate for integration in a fuzzy DBMS when it is developed as an extension of a crisp DBMS. The efficiency of the proposal is contrasted with another indexing method for similar data and queries, G-tree, which is specifically designed to index multidimensional data. Results show that the proposal performance is similar to and more stable than the measured for G-tree when used for indexing fuzzy numbers.
Mobile information systems for the private everyday life
Authors: Oliver Bohl, Shakib Manouchehri, Udo Winand
Venue: Mobile Information Systems (2007)

Despite the high penetration of the private sector in mobile devices, only few applications and services based on mobile technologies are used, and those are rather trivial. This article suggests an approach for the identification of alternatives for the support of processes of everyday life by establishing services based on mobile applications, mobile devices and infrastructures for mobile dispositions. Therefore, a framework for the identification, as well as criteria for the analysis of potential fields of application is discussed. Exemplary benchmarks for selected basic processes in private everyday life visualise the suggested framework, which can be adapted for individual methodical analyses.
Senceive: A Middleware for a Wireless Sensor Network
Authors: Christian Hermann, Waltenegus Dargie
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

A significant amount of research effort is being carried out by the research community to increase the scope and usefulness of wireless sensor networks; to optimise life time by developing energy efficient power management, self-organising, medium access and routing protocols; and to reduce the cost of sensing nodes so that dense and robust deployment is possible. Though much has already been achieved, currently the cost of commercially available wireless sensor nodes is considerable and the wide applicability of proposed or existing protocols is still under investigation. One essential problem associated with cost or wide applicability of protocols is that sensor networks are application-specific. Protocols and in-network algorithms are optimised for particular sensing tasks. On the other hand, in research environments researchers would like to experiment not with a single application but with many applications. Considering the not-so-cheap sensing nodes available on the market and the management overhead of deploying wireless sensor networks, it is not economical or efficient to dedicate wireless sensor networks just to a single application, not at present at any rate. We therefore propose a middleware that enables researchers to experiment with multiple applications while providing them with essential in-network functionalities to satisfy individual application’s requirements. The middleware cleanly separates sensing from network management so that application developers can obtain data from the wireless sensor networks without having to deal with management concerns.
On graph-theoretic lemmata and complexity classes
Authors: C. H. Papadimitriou
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

Several new complexity classes of search problems that lie between the classes FP and FNP are defined. These classes are contained in the class TFNP of search problems that always have a solution. A problem in each of these new classes is defined in terms of an implicitly given, exponentially large graph, very much like PLS (polynomial local search). The existence of the solution sought is established by means of a simple graph-theoretic lemma with an inefficiently constructive proof. Several class containments and collapses, resulting in the two new classes PDLF contained in PLF are shown; the relation of either class of PLS is open. PLF contains several important problems for which no polynomial-time algorithm is presently known.
An El-Zah&aacute;r type condition ensuring path-factors
Authors: Robert Johansson
Venue: Journal of Graph Theory (1998)

Let G be a connected graph of order n and suppose that n = n1 + &middot;&middot;&middot; + nk where ni &ge; 2 are integers. The following will be proved: If G has minimum degree at least &lfloor; &frac12;n1&rfloor; + &middot;&middot;&middot; + &lfloor; &frac12;nk&rfloor; then G has a spanning subgraph which consists of paths of orders n1, &hellip;, nk. &copy; 1998 John Wiley & Sons, Inc. J Graph Theory 28: 39&ndash;42, 1998 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
Annotating Regulations Using Cerno: An Application to Italian Documents - Extended Abstract
Authors: Nicola Zeni, Nadzeya Kiyavitskaya, James R. Cordy, Luisa Mich, John Mylopoulos
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The increasing complexity of software systems and growing demand for regulations compliance require effective methods and tools to support requirements analysts activities. Internationalization of information systems due to both economics and Web based architectures call for the application of regulations written in different languages. Thus far existing approaches for extracting rights and obligations have concentrated on English documents. In this paper, we describe the results of the application of Cerno, a lightweight framework for semantic annotation, to legal documents written in Italian. In addition, we investigate critical issues for semantic annotation tools in a different cultural and environmental context. Results obtained, while preliminary, allow us to quantify the effort needed to port tools based on Cerno and give some insight on directions of future development ofa multilingual system to support semantic annotation of regulations not only in different domains, but also written in different languages
An alternative analysis of the open hashing algorithm
Authors: Ningping Sun, Ryozo Nakamura
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

Hashing is one of the most important techniques for sorting and searching. Two problems that how to design a good hash function and how to deal with the collision must be resolved when hashing is applied. First, we provide an evaluation system of hashing algorithm unsing some popular hash functions and show some evaluation results. Continuously, we present an analysis of the probability that collision occurs. Introducing the probability distribution of frequency of access on each individual key in the separate chain into the analysis of search cost, we propose a mathematical analysis to exactly analyze and evaluate the performance of open hashing algorithm. Some interesting test results obtained from the proposed formulae are also presented.
Dynamic modeling of a vibratory bowl feeder
Authors: Diana Ioana Popescu
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

Vibratory bowl feeders are the most popular type of part feeders. They handle component parts with a wide range of shapes and sizes, made of any kind of material, from all areas of industry. They are useful for automatic feeding, providing a consistent and accurate flow of components and orienting them in proper feeding positions. The vibratory bowl executes a complex helical motion, depending on the driving force and the elastic suspension. The elastic suspension is mainly of the leaf spring type. It has a great influence on the dynamic behavior of the vibratory bowl feeder and generally on its performance. This paper presents a model for the dynamic calculus of a vibratory bowl feeder, having electromagnetic drive and leaf spring elastic suspension. The differential equations, which describe the motion of the bowl, are deduced and solved by analytical methods.
Average Fuzzy Direction Based Handwritten Chinese Characters Recognition Approach
Authors: Weiping Zhu, Wei Liu, Zhuqing Huang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Since handwritten Chinese characters' style is uncertain and differs as people differ, this article brings forward a new Average Fuzzy Direction Code based on weight, so as to conquer traditional fuzzy arithmetic's shortcoming that is without enough generalization capability; At the same time it improves association rules in data mining and applies it to the process of handwritten Chinese characters' generalization and picking up of their abstract attributes. Thus exact denotation of handwritten Chinese characters is resolved, and simultaneously it picks up the handwritten Chinese characters' characteristic and mines improved association rules, and further achieves the purpose of handwritten Chinese characters' quick recognition. Therefore it resolves traditional pattern identification's problem of poor adaptability.
A multi-dimensional framework for facilitating wide participation and common understanding
Authors: Weigang Wang, Simon French
Venue: Proceedings of the hypertext 2008 workshop on Collaboration and collective intelligence (2008)

The success of e-democracy, large-scale knowledge creation, and social networking activities depends on wide participation and effective collaboration. Successful participation and collaboration needs effective facilitation support that can engage people, coordinate their joint actions and advance their common understanding. This work addresses the emerging facilitation support issues by developing a multi-dimensional framework for wide participation and common understanding. The dimensions of the framework include methodology, technology, community, social cognitive interaction, participation space, and culture type. Such a framework can help us characterise the issues, describe the settings, understand, infer and explain the kind of facilitation support we may need, so as to guide the design and use of Web based collaborative systems.
TerraServer and the Russia adventure...
Authors: Tom Barclay
Venue: ACM SIGMOD Record (2008)

Jim Gray made many friends and few enemies in his career. Many of the projects he worked on were inspired by one or more of his friends and collaborators in industry and academia. The original idea for an "image server" happened in the early 1990s when Jim was at Digital. Jim had met Jeff Dozier while working on the National Research Council's "Computing the Future" committee [NRC 1994]. Jeff became Dean of the Bren School of Environmental Sciences and chair of UC Santa Barbara's Alexandria Digital Library advisory board. Jeff asked Jim to serve on the board. During an Alexandria board meeting, Jeff and Jim discussed the idea for a "geospatial image server". All they needed was a lot of accessible imagery, someone that wanted it done, and someone foolish enough to load a few tera-bytes of data. The cold war ended enabling the high resolution imagery marketplace. Microsoft SQL Server wanted a scalability internet demonstration. And I walked into Jim Gray's lab looking for a reason to move back to San Francisco. And that's where my 10 year project with Jim Gray and TerraServer begins...
Per-field urban land use classification based on tax parcel boundaries
Authors: S. Wu, J. Silvánhyphen, L. Wang
Venue: International Journal of Remote Sensing (2007)

The objective of this study is to test a per-field approach for classifying detailed urban land use, such as single-family, multi-family, industrial and commercial. Tax parcel boundaries are used as the field boundaries for classification. Twelve attributes of parcels, such as parcel sizes, parcel shape, building counts and building heights, are used as the discriminant factors between different land use types. For our study area that consists of 33 025 parcels, we first derived parcel attributes from geographic information system (GIS) and remote sensing data. We then converted the parcel vector data to an image of 12 bands with pixel values from parcel attributes. After that, we performed a standard supervised classification to classify the image into nine land use types. The best classification result with a decision tree classifier had an overall accuracy of 93.53% and a Kappa Coefficient of 0.7023. This study shows the feasibility of applying a per-field approach based on tax parcel boundaries to classify detailed urban land use.
Guest Editors' Introduction: Hot Chips 19
Authors: Raj Amirtharajah, John Mashey
Venue: IEEE Micro (2008)

This special issue showcases articles written from five of the best presentations at the Hot Chips 19 conference, held in August 2007. The guest editors give highlights of the conference and introduce the articles, which cover the mobile-optimized northbridge of AMD's Griffin microprocessor family; the IBM z10 next-generation mainframe microprocessor; fault tolerance in IBM's Power6 microprocessor; NVIDIA's Tesla unified graphics and computing architecture; and SiBEAM's 4-Gbps 1080p-capable uncompressed HD A/V wireless 60-GHz transceiver chipset.
Interactivist-constructivist foundations for embodying attention
Authors: Joshua C. Skewes
Venue: Journal of Experimental Theoretical Artificial Intelligence (2007)

This article discusses the increasing use of ideas from, and consistency with, the embodiment program in artificial intelligence (AI) and cognitive science. A model is embodied if it is (1) functionally grounded in behavioral regulation and (2) strongly constrained by both the physical and computational parameters of its implementation. The main goal of this is to put forward some dynamical foundations for embodying attention. A recent embodied model of attention is discussed in this context. It is shown that although the model's framework qualifies as embodied, its specific implementation does not. From here, its framework is used to develop a reconstruction of the model's dynamics, from which a new implementation which fits more closely into the embodiment program can be developed in the future. A general strategy of using dynamic considerations to constrain the development of embodied models is in this way advanced.
Towards a Mobile and Context-Aware Technology Based Healthcare System
Authors: Jae-gu Song, Seoksoo Kim, Gil-cheol Park
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

We are studying the process of accounting for context awareness for mobile information technology solutions in the healthcare sector. We consider the needs of contextaware information technology, its requirements and its delivery from intelligent and ubiquitous sensors through middleware. We discuss the state of the art and the processes that we deem important to advance the realization of powerful context-aware technology that offers new possibilities, services, and economies to the healthcare sector.
Large scale manifold transduction
Authors: Michael Karlen, Jason Weston, Ayse Erkan, Ronan Collobert
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We show how the regularizer of Transductive Support Vector Machines (TSVM) can be trained by stochastic gradient descent for linear models and multi-layer architectures. The resulting methods can be trained online, have vastly superior training and testing speed to existing TSVM algorithms, can encode prior knowledge in the network architecture, and obtain competitive error rates. We then go on to propose a natural generalization of the TSVM loss function that takes into account neighborhood and manifold information directly, unifying the two-stage Low Density Separation method into a single criterion, and leading to state-of-the-art results.
ArCoMo-An Artefact-based Collaborative Mobile Learning Environment
Authors: Christian Hoff, Ulf Wehling, Steffen Rothkugel
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

In this paper we propose Arcomo, a mobile learning environment designed for hybrid wireless networks. We introduce three key concepts used in the environment: spaces,anchor points, and artefacts. Spaces are used to uniquely identify, store, share, and disseminate learning materials, annotations, and examples among mobile users. Anchor points are defined by users on documents in spaces. Every anchor point specifies a location in a document, whichcan be a word, a sentence, a paragraph, an image, or even the whole document. Artefacts are utilized to describe relationships between anchor points together with comments on them. This way, they can map the current working context of a student that typically contains several open documents and a relationship between them. The main contribution is a general annotation concept which supports different file formats and is applicable for collaborative mobile users.
Signal restoration in linear systems with trends
Authors: A. A. Lomov
Venue: Automation and Remote Control (2008)

For the unique solution of the problem of calculation of the inputs and outputs of a linear system from observations comprising additive quasipolynomial additives (trends) with unknown parameters, the existence conditions were established. Formulas to calculate the system signals and trends from the observations of the total signal were presented.
Stones from other Hills: Finality Rules within the Law of International Large Value Electronic Credit Transfers in China
Authors: Wen Li
Venue: International Review of Law, Computers and Technology (2007)

By studying finality rules in English law and UNCITRAL Model Law on International Credit Transfers, and considering China's banking practice, this paper distinguishes four aspects of finality rules, which are time of completion of payment, discharge of underlying obligation owed by the originator to the beneficiary, access to funds, and revocation. To deal with these four aspects, private agreements, Model Law, civil law theory and electronic funds transfers (EFT) statutes should be applied flexibly and comprehensively, and successful banking law approaches from developed countries need to be borrowed by Chinese lawmakers with a broad heart.
$${\fancyscript{B}}$$-Valued fuzzy variable
Authors: Lixing Yang, Keping Li
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

In this paper, the concept of $${\fancyscript{B}}$$-valued fuzzy variable is first presented. Then, some mathematical properties of $${\fancyscript{B}}$$-valued fuzzy variable are also investigated, including independence, identical distribution, expected value, variance, inequalities, convergence concepts, and so on.
Confident estimation for multistage measurement sampling and aggregation
Authors: Edith Cohen, Nick Duffield, Carsten Lund, Mikkel Thorup
Venue: Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2008)

Measurement, collection, and interpretation of network usage data commonly involves multiple stage of sampling and aggregation. Examples include sampling packets, aggregating them into flow statistics at a router, sampling and aggregation of usage records in a network data repository for reporting, query and archiving. Although unbiased estimates of packet, bytes and flows usage can be formed for each sampling operation, for many applications it is crucial to know the inherent estimation error. Previous work in this area has been limited mainly to analyzing the estimator variance for particular methods, e.g., independent packet sampling. However, the variance is of limited use for more general sampling methods, where the estimate may not be well approximated by a Gaussian distribution. This motivates our paper, in which we establish Chernoff bounds on the likelihood of estimation error in a general multistage combination of measurement sampling and aggregation. We derive the scale against which errors are measured, in terms of the constituent sampling and aggregation operations. In particular this enables us to obtain rigorous confidence intervals around any given estimate. We apply our method to a number of sampling schemes both in the literature and currently deployed, including sampling of packet sampled NetFlow records, Sample and Hold, and Flow Slicing. We obtain one particularly striking result in the first case: that for a range of parameterizations, packet sampling has no additional impact on the estimator confidence derived from our bound, beyond that already imposed by flow sampling.