ppxscal/embedding_network huggingface dataset:
3D Scattered Data Approximation with Adaptive Compactly Supported Radial Basis Functions
Venue: Proceedings of the Shape Modeling International 2004 (2004)

In this paper, we develop an adaptive RBF fitting procedurefor a high quality approximation of a set of pointsscattered over a piecewise smooth surface. We use compactlysupported RBFs whose centers are randomly chosenfrom the points. The randomness is controlled by the pointdensity and surface geometry. For each RBF, its supportsize is chosen adaptively according to surface geometry ata vicinity of the RBF center. All these lead to a noise-robusthigh quality approximation of the set. We also adapt our basictechnique for shape reconstruction from registered rangescans by taking into account measurement confidences. Finally,an interesting link between our RBF fitting procedureand partition of unity approximations is established and discussed.
A characterization of infinite planar primitive graphs
Authors: Mark E. Watkins, Jack E. Graver
Venue: Journal of Combinatorial Theory Series B (2004)

It is shown that the automorphism group of an infinite, locally finite, planar graph acts primitively on its vertex set if and only if the graph has connectivity 1 and, for some integer m ≥ 2, every vertex is incident with exactly m lobes, all of which are finite. Specifically, either all of the lobes are isomorphic to K4 or all are circuits of length p for some odd prime p.
An Effective Instruction Fetch Policy for Simultaneous Multithreaded Processors
Authors: Liqiang He, Zhiyong Liu
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

Simultaneous Multithreaded (SMT) processors improve the instruction throughput by allowing fetching and running instructions from several threads simultaneously at a single cycle. As the number of competing threads increasing, instruction throughput is largely impacted by fetch policy. In this paper, we first describe an ideal fetch model and then propose a new effective instruction fetch policy for SMT processors based on the ideal model. The basic idea of our new policy is to select two threads with least instructions in the instruction queue and feed as many as the needed number of instructions to every selected thread, up to eight in total. The key advantage of our policy is that it can utilize the fetch bandwidth more effectively than ICOUNT.2.8 policy, so that a significant increasing in IPC can be achieved. Execution-driven simulation results show that IPC improvements obtained is up to 45%, and 17% on average, over the ICOUNT.2.8 fetch policy.
Small Spans in Scaled Dimension
Authors: John M. Hitchcock
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

Juedes and Lutz (1995) proved a small span theoremfor polynomial-time many-one reductions in exponentialtime. This result says that for language A decidablein exponential time, either the class of languagesreducible to A (the lower span) or the class of problemsto which A can be reduced (the upper span) is smallin the sense of resource-bounded measure and, in particular,that the degree of A is small. Small span theorems havebeen proven for increasingly stronger polynomial-time reductions,and a small span theorem for polynomial-timeTuring reductions would imply BPP ¿ EXP. In contrast tothe progress in resource-bounded measure, Ambos-Spies,Merkle, Reimann, and Stephan (2001) showed that thereis no small span theorem for the resource-bounded dimensionof Lutz (2000), even for polynomial-time many-onereductions.Resource-bounded scaled dimension, recently introducedby Hitchcock, Lutz, and Mayordomo (2003), providesrescalings of resource-bounded dimension. We usescaled dimension to further understand the contrast betweenmeasure and dimension regarding polynomial-timespans and degrees. We strengthen prior results by showingthat the small span theorem holds for polynomial-timemany-one reductions in the -3^rd-order scaled dimension,but fails to hold in the -2^nd-order scaled dimension.Our results also hold in exponential space.As an application, we show that determining the -2^nd or-1^st-order scaled dimension in ESPACE of the many-onecomplete languages for E would yield a proof of P =BPP or P ¿ PSPACE. On the other hand, it is shown unconditionallythat the complete languages for E have -3^rd-orderscaled dimension 0 in ESPACE and-2^nd- and-1^st-orderscaled dimension 1 in E.
Interacting with big interfaces on small screens: a comparison of fisheye, zoom, and panning techniques
Authors: Carl Gutwin, Chris Fedak
Venue: Proceedings of Graphics Interface 2004 (2004)

Mobile devices with small screens are becoming more common, and will soon be powerful enough to run desktop software. However, the large interfaces of desktop applications do not fit on the small screens. Although there are ways to redesign a UI to fit a smaller area, there are many cases where the only solution is to navigate the large UI with the small screen. The best way to do this, however, is not known. We compared three techniques for using large interfaces on small screens: a panning system similar to what is in current use, a two-level zoom system, and a fisheye view. We tested the techniques with three realistic tasks. We found that people were able to carry out a web navigation task significantly faster with the fisheye view, that the two-level zoom was significantly better for a monitoring task, and that people were slowest with the panning system.
Building Personal Digital Photograph Libraries: An Approach with Ontology-Based MPEG-7 Dozen Dimensional Digital Content Architecture
Authors: Pei-Jeng Kuo, Terumasa Aoki, Hiroshi Yasuda
Venue: Proceedings of the Computer Graphics International (2004)

The current trend of image retrieval is to incorporatethe image visual features used in Content Based ImageRetrieval (CBIR) and semantics annotations used inMetadata Based Image Retrieval to enhance retrievalperformance. Because of the pervasive of consumerimaging devices, building personal digital photographlibraries became an increasingly interested domain.Personal digital photograph collections have specificcharacteristics compare to general purpose imagedatabases. Hence, annotation architecture speciallydesigned for that plays an important role in building aninteroperatable data repository for future indexing,browsing and retrieving purposes. We propose aMPEG-7 based multimedia content descriptionarchitecture, Dozen Dimensional Digital Content(DDDC), which annotates multimedia data with twelvemain attributes regarding its semantic representation.In addition, we also proposed a machine-understandable"Spatial and Temporal BasedOntology" representation for the above DDDCsemantics description to enable semi-automaticannotation process.
An analysis of the impact of MPI overlap and independent progress
Authors: Ron Brightwell, Keith D. Underwood
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

The overlap of computation and communication has long been considered to be a significant performance benefit for applications. Similarly, the ability of MPI to make independent progress (that is, to make progress on outstanding communication operations while not in the MPI library) is also believed to yield performance benefits. Using an intelligent network interface to offload the work required to support overlap and independent progress is thought to be an ideal solution, but the benefits of this approach have been poorly studied at the application level. This lack of analysis is complicated by the fact that most MPI implementations do not sufficiently support overlap or independent progress. Recent work has demonstrated a quantifiable advantage for an MPI implementation that uses offload to provide overlap and independent progress. This paper extends this previous work by further qualifying the source of the performance advantage (offload, overlap, or independent progress).
Student-oriented examination in a computer architecture course
Authors: Erik Larsson, Anders Larsson
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

Learning is a highly individual process.Some prefer learning by reading the course material, others learn best by listening to a lecture, while some like to learn in a trial-and-error way by themselves in a laboratory assignment. A good learning scheme is individual. A scheme that is good for some persons might not at all be good scheme for someone else. It is important to understand your own personal way to learn, but also when organizing a course individual learning alternatives should be acknowledged.Examination in a course can be seen as a test occasion or as a learning occasion. Traditionally, examination has been an occasion where knowledge is tested. Written exams can be used to test the theory and laboratory work to test practical aspects of the course material. For laboratory work the distinction between learning and test of learning is somewhat unclear.The learning and the test of learning are mixed. However, in general,examination can be seen as an occasion to learn and/or to test knowledge.We have, in a Computer Architecture course, taken the view that (1) learning is an individual process, and (2) that examination is a learning occasion. The consequence of our view (1) + (2) is basically that examination should be individual, or student-oriented. Alternatives to traditional examination is also supported when taking gender, cultural, and age perspectives. We therefore developed two examination tracks where the students in the beginning of the course decided what track to follow. Common for both tracks is that credits are given that can be counted for in the written exam. The students, individually or in pair, define their own laboratory task related to a course topic such as cache-memories or pipelines, solve the task and present the results in front of the class. Each student designs individually a multiple-choice pre-exam question (specifying what it tests, the question and correct answer). A student friend corrects the question and might improve it if needed. The teaching assistant selects questions for the multiple-choice pre-exam. Each student also creates individually one exam question, which a student friend corrects and if needed improves. Each part (lab presentation, creation and evaluation of pre-exam questions, pre-exam, and creation and evaluation of exam question) is given credits that are included in the written exam.
On Partial Clones containing Maximal Clones
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

The purpose of this note is to present some of our recent results on clones and partial clones, Let A be a non-singleton finite set and M be a maximal clone on A. If Mis determined by a prime affine or an h-universal relationon A, then we show thatM is contained in a family of partial clones on A of continuum cardinality.
Simulation Model for Self-Adaptive Applications in Pervasive Computing
Authors: Markus C. Huebscher, Julie A. McCann
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In Autonomic Computing, an application needs to be aware of its environment. While the term "environment" is not normally understood as being a physical environment, in Pervasive Computing many applications do actually need to monitor the physical environment in which they are deployed. Monitoring the environment often includes gathering information about the people working or living in this environment. Applications that self-adapt to changes in the monitored environment are known as context-aware. The environment is monitored using sensors, such as temperature, humidity, location sensors, etc., and use some form of logic to abduce a context. As the input of this context logic is environment sensor data, testing these applications usually requires deployment at a physical test location, often in a research laboratory. Our project aims to design a simulation model of contexts as a means to test the context logic of a context-aware application, by allowing sensor data to be produced from a description of contexts, i.e. the location and activities of people in this location, thereby allowing initial testing of a context-aware application without requiring physical deployment.
An Algorithm for Reconstruction of Markov Blankets in Bayesian Networks of Gene Expression Datasets
Authors: Catalin Barbacioru, Daniel J. Cowden, Joel Saltz
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

This paper presents an efficient algorithm, of polynomial complexity for learning Bayesian belief networks over a dataset of gene expression levels. Given a dataset that is large enough, the algorithm generates a belief network close to the underlying model by recovering the Markov blanket of every node. The time complexity is dependent on the connectivity of the generating graph and not on the size of it, and therefore yields to exponential savings in computational time relative to some previously known algorithms. We use bootstrap and permutation techniques in order to measure confidence in our finding. To evaluate this algorithm, we present experimental results on S.cerevisiae cellcycle mesurements of Spellman et al. (1998) [5].
Answer models for question answering passage retrieval
Authors: Andrés Corrada-Emmanuel, W. Bruce Croft
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Answer patterns have been shown to improve the perfor-mance of open-domain factoid QA systems. Their use, however, requires either constructing the patterns manually or developing algorithms for learning them automatically. We present here a simpler approach that extends the techniques of language modeling to create answer models. These are language models trained on the correct answers to training questions. We show how they fit naturally into a probabilis-tic model for answer passage retrieval and demonstrate their effectiveness on the TREC 2002 QA Corpus.
The Smarandache ϕ-sequence
Authors: Maohua Le
Venue: Smarandache Notions Journal (2004)

In this paper we completely determine the Smarandache ϕ-sequence.
Incremental Change in Object-Oriented Programming
Authors: Vaclav Rajlich, Prashant Gosavi
Venue: IEEE Software (2004)

Incremental changes add new functionality and new properties to software. They are the basis of software maintenance, evolution, incremental development, agile development, and other important software engineering processes. This article presents selected incremental change activitiesýchange request, concept extraction, concept location, impact analysis, actualization, incorporation, change propagation, refactoring, and role splittingýin which programming concepts and program dependencies play a key role. The authors provide an example that illustrates an incremental change in the open source software Drawlets.
Validation and automatic test generation on UML models: the AGATHA approach
Authors: David Lugato, C&#x00e9;line Bigot, Yannick Valot, Jean-Pierre Gallois, S&#x00e9;bastien G&#x00e9;rard, Fran&#x00e7;ois Terrier
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2004)

UML-based methodologies take more and more space in the software development domain. In addition, the need to validate applications as early as possible in the development cycle is now mandatory to satisfy cost and time-to-market constraints. In this context, this paper describes, first, how to bridge the gap between semiformal UML models and a formal technology ensuring test case generation. Second, the formal tool used to automatically generate test sequences, named AGATHA, is described in minute detail. Finally, this approach is illustrated throughout by a toy example of an elevator system.
Track maintenance train operators&#x2019; attitudes to job, organisation and management, and their correlation with accident/incident rate
Authors: Kenji Itoh, Boje Andersen, Masaki Seki
Venue: Cognition, Technology and Work (2004)

The present paper reports the results of a questionnaire-based survey of night train operators&#x2019; attitudes toward management, operating procedures, and other organisational issues that potentially impact on safety. Responses were collected from all of the operators of track maintenance trains servicing the Japanese high-speed railway (Shinkansen). Two versions of the questionnaire, the TMAQ (Train Management Attitudes Questionnaire), were developed based on Helmreich&#x2019;s FMAQ (Flight MAQ) and its derivative, the SMAQ (Ship MAQ). The TMAQ and its progenitor seek to elicit respondents&#x2019; views of, and attitudes to, a range of safety related factors including morale, motivation, leadership and human relations in their organisation.To identify dimensions of safety culture as elicited through the TMAQ, a principal component analysis was applied to the questionnaire responses of the original TMAQ. The analysis yielded seven attitude factors, including morale and motivation. Of the seven factors, a close correlation was identified between the factor scores representing operators&#x2019; morale and motivation and the actual accident/incident rates for each of the five branches belonging to a single-track maintenance company. A branch that employed train operators having relatively higher morale and motivation exhibited a lower accident/incident rate. Furthermore, the very same correlation was also found for company based responses collected from all track maintenance companies working for the high-speed railway.In addition to the branch and company based comparisons for track maintenance train operators, we also compared attitude factors between different groups of operators (drivers and supervisors), and between two different periods surveyed in a two year interval. Finally, we examined differences in terms of attitude factors between track maintenance operators and seafarers surveyed by applying slightly different variants of the same generic form of questionnaire (Helmreich&#x2019;s SMAQ). Based on these survey results, we discuss potential risk factors for accidents of track maintenance trains and some implications for improving railway safety.
Improving generalization capabilities of dynamic neural networks
Authors: Miroslaw Galicki, Lutz Leistritz, Ernst Bernhard Zwick, Herbert Witte
Venue: Neural Computation (2004)

This work addresses the problem of improving the generalization capabilities of continuous recurrent neural networks. The learning task is transformed into an optimal control framework in which the weights and the initial network state are treated as unknown controls. A new learning algorithm based on a variational formulation of Pontrayagin's maximum principle is proposed. Under reasonable assumptions, its convergence is discussed. Numerical examples are given that demonstrate an essential improvement of generalization capabilities after the learning process of a dynamic network.
A CAD-Based Investigation of Clock-Skew Hazards in Pipelined NORA Dynamic Logic Circuits
Authors: Fei Yuan
Venue: Analog Integrated Circuits and Signal Processing (2004)

This paper presents a detailed analysis of the clock-skew induced hazards in pipelined NORA dynamic circuits. We show that both NP-pipelined and PN-pipelined NORA dynamic circuits are sensitive to clock skew. In addition, by defining positive and negative clock skews, these circuits exhibit distinct clock skew sensitivities. These findings differ from the results given in the original paper in which NORA dynamic circuits were introduced (N. Goncalves and H. Den Man, J. Solid-State Circuits, vol. 18, pp. 261&ndash;266, 1983) and those in most text books on this subject. In assessment of these observations, two full adders implemented using PN- and NP-configurations are designed using a 0.35 micron CMOS technology. They are analyzed using Spectre from Cadence Design Systems in the presence of clock skews. Simulation results are presented.
On Steiner Versions of (bi)Connectivity in Network Problems
Authors: A. Volgenant, C. W. Duin
Venue: Graphs and Combinatorics (2004)

The notions of connectivity and biconnectivity can be generalized in the Steiner sense, i.e., they are restricted to a given subset of the vertices of a graph. We illustrate this generalization on two problems. The first problem is the bottleneck biconnected subgraph problem, the second one is the so-called bipartition problem. The adapted algorithms to solve the Steiner versions of these problems exploit depth-first search to attain respectively a running time of O(|E|+|V|log|V|) and O(|E|+|V|) with E denoting the set of edges and V the set of vertices of the given graph.
Modeling of the wet end part of a paper mill with Dymola
Authors: Gianantonio Bortolin, Stefan Borg, Per Olof Gutman
Venue: Mathematics and Computers in Simulation (2004)

This paper describes the ongoing research on the physical modeling of AssiDomän paper mill in Frövi (Sweden). This project includes the developing of a Modelica base library for thermohydraulic, pulp and paper systems. Up to now, the model includes the wet end part of the paper process, that is the approaching system from the mixing chests to the cyclone systems, the headboxes and the wires.
Scalable Cooperative Latency Estimation
Authors: Michal Szymaniak, Guillaume Pierre, Maarten van Steen
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

This paper discusses SCoLE, a scalable system to estimateInternet latencies. SCoLE is based on GNP, whichmodels Internet latencies in an N-dimensional Euclideanspace. In contrast to GNP and other GNP-based systems,however, SCoLE does not employ any global space whoseparameters must typically be negotiated by the participatinghosts. Instead, it allows each host to construct its "private"space and model inter-host latencies in that space. The privatespace parameters as well as the modeling algorithmcan be adjusted on a per-host basis, which improves systemflexibility. More importantly, the mutual independenceof private spaces results in higher SCoLE scalability, whichis bound neither by the global negotiation of space parametersnor by global knowledge of any kind. We show thatlatency estimates performed in different private spaces arehighly correlated. This allows SCoLE to be used in large-scaleapplications where consistent latency estimates needto be performed simultaneously by many independent hosts.