ppxscal/embedding_network huggingface dataset:
Composing Lineage Metadata with XML for Custom Satellite-Derived Data Products
Authors: Rajendra Bose, James Frew
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

As peer-to-peer dissemination of custom data productsevolves among Earth science research groups,investigators and data managers must consider how tocompose appropriate metadata for their researchcomputing activities. Because workflows may spanmultiple groups, it is critical that lineage (provenance)metadata also be assembled to document and preservethe origins and processing history of constituent dataproducts and transformations for future data consumers.To demonstrate methods for composing lineage metadatafor custom processing, we introduce our terminology forworkflow and employ a case study for the creation ofsatellite-derived ocean color data products. Our examplecontributes to a general metadata model for workflowthat incorporates lineage. We then discuss metadatarequirements for remote sensing-related data products.We propose two techniques for composing lineagemetadata, both based on accessory XML metadatadocuments that are paired with the data products andversioned data transformations they describe. The firsttechnique, implemented as a prototype, features adedicated lineage server that introduces the indirectionand flexibility necessary for Web-based lineagenavigation. The second, more promising techniqueinvolves defining a simple Resource DescriptionFramework (RDF) vocabulary for lineage metadata, andusing extant RDF/XML tools for query and navigation.These methods provide guidelines for composing lineagemetadata that are applicable to other domains.
Robust control of systems with fuzzy representation of uncertainties
Authors: C. W. Tao
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2004)

In this paper, an approach is proposed to design robust controllers for uncertain systems with the linguistic uncertainties represented by fuzzy sets. With a provided technique, the fuzzy sets are best approximated by intervals (crisp sets). Then the Kharitonov&#x2019;s theorem is applied to construct a robust PID controller for the uncertain plant with time-invariant uncertainties represented by interval models. Also, for the uncertain system with linguistic values of the time-varying uncertainties best approximated by intervals (which are bounded), a robust sliding mode controller is developed to stabilize the uncertain system if the sliding coefficient conditions are satisfied. Moreover, the best approximation intervals are shown to be more related to the possibility distribution of the elements in the universes of discourse of fuzzy sets than the type of membership functions used for fuzzy sets. Examples and simulation results are included to indicate the design approach and the effectiveness of the proposed robust controller.
Mapping of High-Level SDL Models to Efficient Implementations for TinyOS
Authors: Daniel Dietterle, Jerzy Ryman, Kai Dombrowski, Rolf Kraemer
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Wireless sensor networks have attracted much research effort in the past five years. With TinyOS, there exists a widely used, microthreaded operating system targeted for single processor sensor nodes. It requires only minimal processing and memory resources. Many research activities in the wireless sensor area focus on the design of efficient protocols in the MAC and network layer. SDL - a high-abstraction level formal description language - has long been used for modeling, simulation, and verification of communication protocols. In this paper, we present a mapping approach and optimizations to derive efficient component-based event-driven TinyOS applications from SDL models. We show, how the basic SDL concepts are reflected in the TinyOS component architecture.
Combining Sampling and Autoregression for Motion Synthesis
Authors: David Oziem, Neill Campbell, Colin Dalton, David Gibson, Barry Thomas
Venue: Proceedings of the Computer Graphics International (2004)

We present a novel approach to motion synthesis. It isshown that by splitting sequences into segments new sequencescan be created with a similar look and feel to theoriginal. Copying segments of the original data generatesa sequence which maintains detailed characteristics. Bymodelling each segment using an autoregressive process wecan introduce new segments and therefore unseen motions.These statistical models allow a potentially infinite numberof new segments to be generated. We show that this systemcan model complicated nonstationary sequences whicha single ARP is unable to do.
On the Function w(x)= &brvbar;{1 &le; s &le; k : x &equiv; as (mod ns)}&brvbar;
Authors: Zhi-Wei Sun
Venue: Combinatorica (2003)

For a finite system $$A = {\left\{ {a_{s} + n_{s} \mathbb{Z}} \right\}}^{k}_{{s = 1}}$$ of arithmetic sequences the covering function is w(x) = |{1 &#x2264; s &#x2264; k : x &#x2261; as (mod ns)}|. Using equalities involving roots of unity we characterize those systems with a fixed covering function w(x). From the characterization we reveal some connections between a period n0 of w(x) and the moduli n1, . . . , nk in such a system A. Here are three central results: (a) For each r=0,1, . . .,nk/(n0,nk)&#x2212;1 there exists a J<u>c</u>{1, . . . , k&#x2212;1} such that $${\sum\nolimits_{s \in J} {1/n_{s} = r/n_{k} } }$$. (b) If n1 &#x2264;&#x00b7;&#x00b7;&#x00b7;&#x2264;nk&#x2212;l <nk&#x2212;l+1 =&#x00b7;&#x00b7;&#x00b7;=nk (0 < l < k), then for any positive integer r < nk/nk&#x2212;l with r &#x2262; 0 (mod nk/(n0,nk)), the binomial coefficient $${\left( {\begin{array}{*{20}c} {l} \\ {r} \\ \end{array} } \right)}$$ can be written as the sum of some (not necessarily distinct) prime divisors of nk. (c) max(x&#x2208;&#x2124;w(x) can be written in the form $${\sum\nolimits_{{\left( {s = 1} \right)}}^k {m_{s} /n_{s} } }$$ where m1, . . .,mk are positive integers.
Translating unknown queries with web corpora for cross-language information retrieval
Authors: Pu-Jen Cheng, Jei-Wen Teng, Ruei-Cheng Chen, Jenq-Haur Wang, Wen-Hsiang Lu, Lee-Feng Chien
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

It is crucial for cross-language information retrieval (CLIR) systems to deal with the translation of unknown queries due to that real queries might be short. The purpose of this paper is to investigate the feasibility of exploiting the Web as the corpus source to translate unknown queries for CLIR. We propose an online translation approach to determine effective translations for unknown query terms via mining of bilingual search-result pages obtained from Web search engines. This approach can alleviate the problem of the lack of large bilingual corpora, translate many unknown query terms, provide flexible query specifications, and extract semantically-close translations to benefit CLIR tasks -- especially for cross-language Web search.
Extended technology acceptance model of internet utilization behavior
Authors: Hung-Pin Shih
Venue: Information and Management (2004)

Based on the belief-attitude-performance chain, this study combines Davis's technology acceptance model (TAM) and the information behavior model to develop an extended TAM for Internet use. The theoretical model was tested via a questionnaire survey of 203 Taiwanese office workers. The empirical results not only confirmed TAM, but also showed that the relevance of information needs strongly determines perceived usefulness, perceived ease of use, and user attitudes toward Internet use for information seeking, as well as strongly influencing individual performance during the information use stage. More importantly, relevance has greater positive effect on perceived performance and perceived usefulness for enterprise Intranet users than for simple/interactive Intraweb users. Enterprise Intranet users have more positive attitudes toward the Internet and more positive perceptions of system effectiveness for supporting office tasks than simple/interactive Intraweb users. Furthermore, perceived ease of use is the strongest determinant of user attitude toward Internet use in both enterprise Intranet and simple/interactive Intraweb applications. Overall, the extended TAM explains the behavior of enterprise Intranet users better than that of simple/ interactive Intraweb users. Limitations of this study are discussed.
An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a Multigraph
Authors: Harold N. Gabow
Venue: SIAM Journal on Discrete Mathematics (2005)

This paper gives a 3/2 approximation algorithm for the smallest 3-edge connected spanning subgraph of an undirected multigraph. The previous best algorithm of Khuller and Raghavachari [J. Algorithms, 21 (1996), pp. 434--450] has approximation ratio $5/3$. The algorithm of Cheriyan and Thurimella [SIAM J. Comput., 30 (2000), pp. 528--560] achieves ratio 3/2 for simple graphs. Our approach, based on the close relationship between an ear decomposition of a 2-edge connected graph and 3-edge connected components, enables us to achieve running time $O( m \alpha(m,n) )$.
Providing curricular assistance to a third world university computer science department
Authors: John Paxton, Karim Heredia
Venue: ACM SIGCSE Bulletin (2004)

Helping third world universities to improve their computer science curricula is an important obligation that first and second world computer science departments have. For third world countries, a technically skilled workforce that can compete in today's modern world is imperative for sustainable development.In this paper, we will describe a liaison between Montana State University (USA) and Don Bosco University (El Salvador) that resulted in the first author teaching three advanced computer science topics at Don Bosco University. The pedagogy related to teaching advanced topics to students of a different culture while being translated is described.We hope that this paper will convey how rewarding such an experience can be and to encourage other liaisons between computer science departments in the developed and developing parts of the world. Although the specifics of the experience described in this paper will almost certainly differ from your own, we believe that many of our general observations might be useful should you have the chance to be involved in a similar experience.
Content Integration from Web and Broadcast Information Sources
Authors: Katsumi Tanaka
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

It becomes possible to acquire information fromdiverse information sources of different media types.For instance, with the spreading of digital TVbroadcasting and broadband internet, it becomespossible for users to acquire more media-rich andmore comprehensive contents by integrating Webcontents and TV-program contents. Integration orfusion of contents from these multiple informationsources will require more effective ways of comparing,complementing and composing those diverseinformation.A notable difference between Web contents and TVprogram contents is a way of viewing information.Conventional Web browsing is basically based onactive viewing of information. That is, users arerequired to behave actively in order to accessinformation. On the other hand, conventional TVbroadcasting offers a passive way of viewinginformation. In order to integrate of Web contents andTV broadcast contents, not only contents themselvesbut also the difference of the viewing methods shouldbe considered.This paper summarizes our research activities thataim at exploring technologies for "content integrationfrom Web and broadcast information sources." Ourresearch results are summarized into the following:Content Transformation between Web and TVbroadcasting contents(Web2TV[1-6], TV2Web[7-8])Content Synchronization among Web contentsand TV broadcasting contents(CWB[9-10], WebTelop[11-15])
Universally Composable Signature, Certification, and Authentication
Authors: Ran Canetti
Venue: Proceedings of the 17th IEEE workshop on Computer Security Foundations (2004)

Recently some efforts were made towards capturingthe security requirements from digital signature schemesas an ideal functionality within a composable securityframework.This modeling of digital signatures potentiallyhas some significant analytical advantages (suchas enabling component-wise analysis of complex systemsthat use signature schemes, as well as symbolic and automatableanalysis of such systems).However, it turnsout that formulating ideal functionalities that capture theproperties expected from signature schemes in a way thatis both sound and enjoys the above advantages is not atrivial task.This work has several contributions.We first correctsome flaws in the definition of the ideal signature functionalityof Canetti, 2001, and subsequent formulations.Next we provide a minimal formalization of "ideal certificationauthorities" and show how authenticated communicationcan be obtained using ideal signatures and anideal certification authority.This is done while guaranteeingfull modularity (i.e., each component is analyzed asstand-alone), and in an unconditional and errorless way.This opens the door to symbolic and automated analysisof protocols for these tasks, in a way that is both modularand cryptographically sound.
A mathematical description for the fungal degradation process of biodegradable plastics
Authors: Byoung-In Sang, Katsutoshi Hori, Hajime Unno
Venue: Mathematics and Computers in Simulation (2004)

Fungal degradation of biodegradable plastics such as poly(3-hydroxybutyrate-co-3-hydroxyvalerate) (PHBV) occurred only on the surface covered with fungal hyphae capable to excrete depolymerase, and the fungal degradation of PHBV film was described mathematically. The surface growth of fungi was derived from the notion of equivalent symmetric tree model and was expressed for the two different growth phases, exponential phase and deceleration phase. PHBV degradation by fungi was expressed in terms of the degradation capability of a fungal hypha and the fraction of fungal biomass contributing to PHBV degradation. The proposed growth and degradation models simulated the experimental data obtained from fungal PHBV degradation in soil well and gave insight into fungal PHBV degradation process.
WAR: Weighted Association Rules for Item Intensities
Authors: Wei Wang, Jiong Yang, Philip Yu
Venue: Knowledge and Information Systems (2004)

In this paper, we extend the traditional association rule problem by allowing a weight to be associated with each item in a transaction to reflect the interest/intensity of each item within the transaction. In turn, this provides us with an opportunity to associate a weight parameter with each item in a resulting association rule; we call them weighted association rules (WAR). One example of such a rule might be 80% of people buying more than three bottles of soda will also be likely to buy more than four packages of snack food, while a conventional association rule might just be 60% of people buying soda will be also be likely to buy snack food. Thus WARs cannot only improve the confidence of the rules, but also provide a mechanism to do more effective target marketing by identifying or segmenting customers based on their potential degree of loyalty or volume of purchases. Our approach mines WARs by first ignoring the weight and finding the frequent itemsets (via a traditional frequent itemset discovery algorithm), followed by introducing the weight during the rule generation. Specifically, the rule generation is achieved by partitioning the weight domain space of each frequent itemset into fine grids, and then identifying the popular regions within the domain space to derive WARs. This approach does not only support the batch mode mining, i.e., finding WARs for the dataset, but also supports the interactive mode, i.e., finding and refining WARs for a given (set) of frequent itemset(s).
Survey of the Algorithms in the Column-Matching BIST Method
Authors: Petr Fiser, Hana Kubatova
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

We propose a discussion on possible heuristicalgorithms solving the major part of our BIST synthesismethod - the Column Matching. The main part of ourBIST design is an output decoder transformingpseudo-random LFSR code words into deterministic testspre-computed by an ATPG tool. Synthesis of this decoderis based on coupling as many of its outputs with theinputs as possible, which significantly reduces itscomplexity. This NP-hard problem has to be solved bysome heuristic algorithm.
Feasibility of Computer-Assisted Education in Patients with Multiple Sclerosis
Authors: J. Finkelstein, C. Martin, A. Bhushan, M. Arora, A. Joshi
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

This project is aimed to assess feasibility of a novel patient-centered education modelcombining behavioral theories and interactive computer media to promote patient-driven careThe following specific features of the proposed model has been implemented: 1) the educational intervention targets specific constructs, shown to facilitate patient self-care, in a unique way which accounts for psycho-social profile, disease history and personal preferences; 2) the educational intervention is linked and coordinated with patient electronic medical record; 3) computer-assisted education is driven by theories of adult learning and could be adapted to different levels of education, cognition or individual disabilities; 4) specific components has been included to achieve sustainability of benefits attained by initial patient education. Feasibility of the model in patients with multiple sclerosis has been evaluated.
View direction, surface orientation and texture orientation for perception of surface shape
Authors: Graeme Sweet, Colin Ware
Venue: Proceedings of Graphics Interface 2004 (2004)

Textures are commonly used to enhance the representation of shape in non-photorealistic rendering applications such as medical drawings. Textures that have elongated linear elements appear to be superior to random textures in that they can, by the way they conform to the surface, reveal the surface shape. We observe that shape following hache marks commonly used in cartography and copper-plate illustration are locally similar to the effect of the lines that can be generated by the intersection of a set of parallel planes with a surface. We use this as a basis for investigating the relationships between view direction, texture orientation and surface orientation in affording surface shape perception. We report two experiments using parallel plane textures. The results show that textures constructed from planes more nearly orthogonal to the line of sight tend to be better at revealing surface shape. Also, viewing surfaces from an oblique view is much better for revealing surface shape than viewing them from directly above.
Grey-box models for steam soil disinfestation simulation
Authors: R. Berruto, P. Gay, P. Piccarolo, C. Tortia
Venue: Mathematics and Computers in Simulation (2004)

Agricultural and biological processes often involve complex phenomena that depend not only on time but also on other independent variables, like spatial coordinates. These processes are intrinsically distributed parameter systems whose modelling requires the adoption of (non linear) partial differential equation. Due to their complexity these models often involve parameters difficult to be estimated, require time-consuming computations and could be not suitable for control purposes.In this paper, a new model structure for the simulation of steam soil disinfestation processes has been developed. The proposed model is based on a grey-box structure and it is mainly constituted by a couple of lumped linear parameter varying (LPV) switching model.Attention is focused on the simulation of sheet steaming soil disinfestation processes that are nowadays gaining growing interest as an ecological alternative to methyl bromide fumigation. To this extent, the model has been identified and validated using real data collected during greenhouse and open field steam treatments.
Inverse Protein Folding in 2D HP Mode (Extended Abstract)
Authors: Arvind Gupta, Jan Manuch, Ladislav Stacho
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

The inverse protein folding problem is that of designing an amino acid sequence which has a particular native protein fold. This problem arises in drug design where a particular structure is necessary to ensure proper protein-protein interactions. In this paper we show that in the 2D HP model of Dill it is possible to solve this problem for a broad class of structures. These structures can be used to closely approximate any given structure. One of the most important properties of a good protein is its stability ¿ the aptitude not to fold simultanously into other structures. We show that for a number of basic structures, our sequences have a unique fold.
Partial Bi-immunity and NP-Completeness
Authors: John M. Hitchcock, A. Pavan, N. V. Vinodchandran
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

The Turing and many-one completeness notions for NPhave been previously separated under measure, genericity,and bi-immunity hypotheses on NP. The proofs of all theseresults rely on the existence of a language in NP with almosteverywhere hardness.In this paper we separate the same NP-completeness notionsunder a partial bi-immunity hypothesis that is weakerand only yields a language in NP that is hard to solve onmost strings. This improves the results of Lutz and Mayordomo[15], Ambos-Spies and Bentzien [1], and Pavan andSelman [18]. The proof of this result is a significant departurefrom previous work.
A Generic Algorithmic Framework for Aggregation of Spatio-Temporal Data
Authors: Seung-Hyun Jeong, Alvaro A. A. Fernandes, Norman W. Paton, Tony Griffiths
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

Spatio-temporal databases are often associated withanalyses that summarize stored data over spatial, temporalor spatio-temporal dimensions. For example, a studyof traffic patterns might explore average traffic densitieson a road network at different times, over differentareas in space, and over different areas in space at differenttimes. The importance of temporal, spatial andspatio-temporal aggregation has been reflected in a significantnumber of proposals for algorithms for efficientcomputation of specific kinds of aggregation. However, althoughsuch proposals may be effective in particular cases,as yet there is no generic framework that provides efficientsupport for the wide range of partitioning and aggregationoperations that a spatio-temporal database managementsystem might be expected to support over bothstored and derived data. This paper proposes an algorithmicframework that can be applied to many differentforms of aggregation, and presents the results of performancestudies on an implementation of the framework.These show that the framework provides a scalable solutionfor the many cases in which the aggregationsrequired over stored and derived data may be widely variableand unpredictable.