ppxscal/embedding_network huggingface dataset:
NoCGEN: A Template Based Reuse Methodology for Networks on Chip Architecture
Authors: Jeremy Chan, Sri Parameswaran
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

In this paper, we describe NoCGEN, a Network On Chip (NoC)generator, which is used to create a simulatable and synthesizable NoC description. NoCGEN uses a set of modularisedrouter components that can be used to form different routerswith a varying number of ports, routing algorithms, data widthsand buffer depths. A graph description representing the inter-connection between these routers is used to generate a top-levelVHDL description.A wormhole output-queued 2-D mesh router was created toverify the capability of NoCGEN. Various parameterized designs were synthesized to provide estimated gate counts of 129Kto 695K for a number of topologies varying from a 2 x 2 meshto a 4x4 mesh, with constant data bus size width of 32. TheNoC was simulated with random traffic using a mixed SystemC/ VHDL environment to ensure correctness of operation and toobtain performance and average latency. The results show anaccepted load of 53% to 55.6% with an increase in buffer depthfrom 8 to 32 flits for the 4x4 mesh router.
A hybrid multivariate classification technique and its application in tissue image analysis
Authors: Iyad Hatem
Venue:  (2003)

Discriminant analysis and neural network techniques were used in this work to develop a hybrid multivariate classification machine. The design of this machine was based on a theoretical interpretation of human recognition of patterns. This interpretation considers the pattern recognition task as a two-step process: difference detection and classifier training. The classification machine, called machine of classifiers (MC), has two components. The first component performs unsupervised clustering of data based on an iterative Fisher discriminant technique. The second component is a supervised classifier designed on the basis of the committee machine technique. The MC was tested on artificially-generated multivariate data. The results showed the effectiveness of the MC in classification. Two applications in tissue image analysis were investigated. The first application involved segmenting cartilage and bone areas from other tissues in beef vertebra images. This segmentation was essential for developing an image processing system to determine beef maturity. The MC was applied on image functions in two color systems and successfully segmented the cartilage and bone areas. The second application was meat tenderness prediction. In this application, near-infrared (NIR) images of beef samples were used for tenderness score prediction. The image features were used to develop an MC to predict meat tenderness. The MC was useful in classifying the samples into &ldquo;tough&rdquo; and &ldquo;tender&rdquo; groups.
Using spreadsheets as a decision support tool: an application for small businesses
Authors: Stephen Burgess, Don Schauder
Venue: Managing IT in government business & communities (2003)

This chapter discusses a model that has been set up to assist small businesses in the decision-making processes associated with setting up a Web site by which they can interact with their customers. Specifically, the chapter addresses the use of a spreadsheet to support decision-making processes in relation to the level of capital needed to devote to the Web site and who should be used to develop it. The chapter describes the process followed, from the initial SWOT analysis used to collect information about the business to the decision-making process modelled in the spreadsheet.
Information extraction from biomedical literature: methodology, evaluation and an application
Authors: L. Venkata Subramaniam, Sougata Mukherjea, Pankaj Kankar, Biplav Srivastava, Vishal S. Batra, Pasumarti V. Kamesam, Ravi Kothari
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Journals and conference proceedings represent the dominant mechanisms of reporting new biomedical results. The unstructured nature of such publications makes it difficult to utilize data mining or automated knowledge discovery techniques. Annotation (or markup) of these unstructured documents represents the first step in making these documents machine analyzable. In this paper we first present a system called BioAnnotator for identifying and annotating biological terms in documents. BioAnnotator uses domain based dictionary look-up for recognizing known terms and a rule engine for discovering new terms. The combination and dictionary look-up and rules result in good performance (87% precision and 94% recall on the GENIA 1.1 corpus for extracting general biological terms based on an approximate matching criterion). To demonstrate the subsequent mining and knowledge discovery activities that are made feasible by BioAnnotator, we also present a system called MedSummarizer that uses the extracted terms to identify the common concepts in a given group of genes.
Past, present and future challenge of density functional theory based methods in molecular sciences
Authors: Nino Russo, Tiziana Marino, Emilia Sicilia, Marirosa Toscano
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

In this talk we will briefly review the development of density functional methods starting from the 60s to nowadays and outline some future perspectives. Both conceptual and computational viewpoints will be treated. Particular emphasis will be given to the structure and performance of the new version of deMon code.Some applications in different fields of modern molecular sciences such as catalysis, surface and material science, organic and bioinorganic chemistry, metal-ligand interactions and molecular spectroscopy will be presented and discussed.
An assessment of systems and software engineering scholars and institutions (1998-2002)
Authors: R. L. Glass, T. Y. Chen
Venue: Journal of Systems and Software (2003)

This paper presents the findings of a five-year study of the top scholars and institutions in the Systems and Software Engineering field, as measured by the quantity of papers published in the journals of the field. The top scholar is Khaled El Emam of the Canadian National Research Council, and the top institution is Carnegie Mellon University and its Software Engineering Institute.This paper is part of an ongoing study, conducted annually, that identifies the top 15 scholars and institutions in the most recent five-year period.
Knowledge representation for information integration
Authors: Marie-Christine Rousset, Chantal Reynaud
Venue: Information Systems (2004)

An information integration system provides a uniform query interface to a collection of distributed and heterogeneous information sources, giving users or other agents the illusion that they interrogate a centralized and homogeneous information system. In this paper, we focus on the use of knowledge representation techniques for building mediators for information integration. A mediator is based on the specification of a single mediated schema describing a domain of interest, and on a set of source descriptions expressing how the content of each source available to the system is related to the domain of interest. These source descriptions, also called mappings because they model the correspondence between the mediated schema and the schemas of the data sources, play a central role in the query answering process. We present two recent information integration systems, namely PICSEL and Xyleme, which are illustrative of two radically different choices concerning the expressivity of the mediated schema.
MAGE: Multi-Agent Environment
Authors: Zhongzhi Shi, Haijun Zhang, Mingkai Dong, Zhikung Zhao, Qiujian Sheng, Yuncheng Jiang, Yong Cheng
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Intelligent agent technology has been raised as the primary technology in the intelligent Internet and mobile computing. MAGE, will be introduced in this paper, which is an environment for rapidly developing distributed, heterogeneous multi-agent systems. Agent model, agent architecture, MAGE platforms, comparison between MAGE and other multi-agentframework will be presented in the paper. This paper will illustrate two application systems, such as e-business, parallel Web spider. The MAGE is written in Java and is a powerful tool to construct multi-agent systems for Internet applications.
Sensor deployment and target localization in distributed sensor networks
Authors: Yi Zou, Krishnendu Chakrabarty
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2004)

The effectiveness of cluster-based distributed sensor networks depends to a large extent on the coverage provided by the sensor deployment. We propose a virtual force algorithm (VFA) as a sensor deployment strategy to enhance the coverage after an initial random placement of sensors. For a given number of sensors, the VFA algorithm attempts to maximize the sensor field coverage. A judicious combination of attractive and repulsive forces is used to determine the new sensor locations that improve the coverage. Once the effective sensor positions are identified, a one-time movement with energy consideration incorporated is carried out, that is, the sensors are redeployed, to these positions. We also propose a novel probabilistic target localization algorithm that is executed by the cluster head. The localization results are used by the cluster head to query only a few sensors (out of those that report the presence of a target) for more detailed information. Simulation results are presented to demonstrate the effectiveness of the proposed approach.
Visualizing changes in the structure of data for exploratory feature selection
Authors: Elias Pampalk, Werner Goebl, Gerhard Widmer
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power available nowadays. Several visualization techniques have been developed to study the cluster structure of data, i.e., the existence of distinctive groups in the data and how these clusters are related to each other. However, only few of these techniques lend themselves to studying how this structure changes if the features describing the data are changed. Understanding this relationship between the features and the cluster structure means understanding the features themselves and is thus a useful tool in the feature extraction phase.In this paper we present a novel approach to visualizing how modification of the features with respect to weighting or normalization changes the cluster structure. We demonstrate the application of our approach in two music related data mining projects.
Implementing multi-stage languages using ASTs, Gensym, and reflection
Authors: Cristiano Calcagno, Walid Taha, Liwen Huang, Xavier Leroy
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

The paper addresses theoretical and practical aspects of implementing multi-stage languages using abstract syntax trees (ASTs), gensym, and reflection. We present an operational account of the correctness of this approach, and report on our experience with a bytecode compiler called MetaOCaml that is based on this strategy. Current performance measurements reveal interesting characteristics of the underlying OCaml compiler, and illustrate why this strategy can be particularly useful for implementing domain-specific languages in a typed, functional setting.
A Model for Conflict Resolution between Coverage and Cost in Cellular Wireless Networks
Authors: Roger M. Whitaker, Larry Raisanen, Steve Hurley
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

The antenna placement problem, or cell planning problem, involves locating and configuring infrastructure for cellular wireless networks. Many authors have looked at computationally efficient methods to create feasible or optimised cell plans. However in most approaches the tension between conflicting objectives is generally addressed implicitly rather than explicitly. Inthis paper we present a model for resolving the most fundamental tension, between service coverage and cost of base stations. The model is general in its approach, and its abstract representation means that state-of-theart multiple objective optimisation techniques can readilybe applied. We use a synthesised test problem to obtain typical results which demonstrate the tension between objectives and the diminishing return (in terms of service coverage) for additional investment.
Packet reservation window multiple access for microcellular voice/data transmission
Authors: Devrim Emrah Ayyildiz, Hakan Deli&ccedil
Venue: Wireless Networks (2003)

We propose a new packet reservation multiple access (PRMA) scheme for the joint transmission of voice and data traffics in a microcellular medium. The collision resolution protocol within the system is based on a modification of the window random access algorithm, which has superior properties compared to the conventional slotted Aloha. The proposed algorithm, which we call packet reservation window multiple access (PRWMA), works in distinct modes for voice and data without prioritization, and the user performs slightly different operations depending on the information type. Simulation results show that PRWMA outperforms PRMA by a significant margin in terms of voice user capacity.
A SCM Workflow Model for CMM Organizations
Authors: Pornthep Seawlho, Taratip Suwannasart
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Software Configuration Management (SCM) is aprocess of controlling changes made to software workproducts. The Capability Maturity Model (CMM)defines the SCM as a key process area that providesdetailed practices of controlling and managing thesoftware work products. Unfortunately, the CMMspecifies what would be expected in a software process,regardless of how the process is implemented. Thisresearch proposes a SCM workflow model that identifiessequences of practices that CMM organizations canfollow to achieve the SCM key process area.Furthermore, a SCM Activities Supporting system isdesigned and developed to accomplish the defined SCMpractices.
Stability and Control of Collective Systems
Authors: R. D. Robinett,  Iii, J. E. Hurtado
Venue: Journal of Intelligent and Robotic Systems (2004)

In this paper, decentralized, distributed feedback control laws are presented for cooperative robotic systems whose task is to localize unknown sources. The control laws follow from a second order representation of the source field. The stability of the proposed feedback control laws for the individual robots, and for the entire robot collective, is demonstrated using Lyapunov's direct method and a vector Lyapunov approach. Additional feedback control laws are proposed to achieve an additional level of coordination. In particular, control laws that achieve desired formations surrounding a localized source are developed.
D for democracy: on political ideals in participatory design
Authors: Anne Marie Kanstrup
Venue: Scandinavian Journal of Information Systems (2003)

This article joins the debate on political aspects in participatory design (PD) in Scandinavia. The article argues that the political aspect is not missing but rather inherent in current Scandinavian PD research. Democracy is brought forward as a core political ideal. It is discussed whether democracy is an outmoded political ideal and how to reach democracy. Finally, the article touches upon the discipline of handling political aspects in research.
Managing views in a program understanding tool
Authors: Kenny Wong
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

Program understanding tools typically offer built-in visual representations of the subject software, such as call graphs and class hierarchies, and textual representations, such as cross-reference listings and exactinterface reports. It is useful to bundle a number of these visual and textual frames, with some annotation, into a view for redocumentation purposes. For large, legacy software systems, however, the abundance of created views can be a major problem. This paper investigates a number of methods for improving the organization of these views for improved us-ability and scalability.
Consistency of Natural Relations on Sets
Authors: Akira Maruoka, Mike Paterson, Hirotaka Koizumi
Venue: Combinatorics, Probability and Computing (1998)

The natural relations for sets are those definable in terms of the emptiness of the subsets corresponding to Boolean combinations of the sets. For pairs of sets, there are just five natural relations of interest, namely, strict inclusion in each direction, disjointness, intersection with the universe being covered, or not. Let N denote {1, 2, &hellip;, n} and (N2) denote {(i, j)&#x2223;i, j&isin;N and i<j}. A function &mu; on (N2) specifies one of these relations for each pair of indices. Then &mu; is said to be consistent on M&sube;N if and only if there exists a collection of sets corresponding to indices in M such that the relations specified by &mu; hold between each associated pair of the sets. Firstly, it is proved that if &mu; is consistent on all subsets of N of size three then &mu; is consistent on N. Secondly, explicit conditions that make &mu; consistent on a subset of size three are given as generalized transitivity laws. Finally, it is shown that the result concerning binary natural relations can be generalized to r-ary natural relations for arbitrary r&ge;2.
Interval constraint networks for tolerance analysis and synthesis
Authors: Christopher C. Yang, Michael M. Marefat, Frank W. Ciarallo
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

This paper proposes interval constraint networks and interval propagation techniques for automatic tolerance design. To develop an intelligent automatic tolerance design mechanism, the following interrelated problems are addressed: (1) representing the relationships between the tolerances of the entities, attributes, and the functional requirements of a design component by a constraint network, (2) developing tolerance propagation techniques in the network that will satisfy the constraints between the entities, attributes and functional requirement. For the purpose of tolerance design, we propose new definitions for consistency of constraints and consistency of a constraint network. New forward and backward propagation techniques achieve worst-case tolerance analysis and synthesis, respectively. A tank design problem illustrates the use of the procedures for tolerance analysis and synthesis. The discussion and examples compare the new constraint network and propagation techniques with previous works.
Rapid Prototyping for Configurable System-on-a-Chip Platforms: A Simulation Based Approach
Authors: Jens Bieger, Sorin A. Huss, Michael Jung, Stephan Klaus, Thomas Steininger
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

The design of any application on a configurableSystem-on-a-Chip (SoC) like Atmel's FPSLIC is subjectto a lot of constraints stemming from requirements of theapplication and limitations of the architecture. In a top-downapproach a real-time MPEG 1 Layer 3 (MP3) decoderis designed on this SoC, which integrates FPGA resourcesand an AVR microcontroller core within a singlechip. An intensive design space exploration based on simulationson different levels of abstractions is fundamentalfor a real-time implementation on this limited architecture.After determining a suited functional partitioning aspecial DSP is implemented on the FPGA, wherefore aninstruction set simulator is build, which allows concurrentHW/SW development.
Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring
Authors: Klaus Jansen, Lorant Porkolab
Venue: Journal of Scheduling (2004)

We study the problem of scheduling independent multiprocessor tasks, where for each task in addition to the processing time(s) there is a prespecified dedicated subset (or a family of alternative subsets) of processors which are required to process the task simultaneously. Focusing on problems where all required (alternative) subsets of processors have the same fixed cardinality, we present complexity results for computing preemptive schedules with minimum makespan closing the gap between computationally tractable and intractable instances. In particular, we show that for the dedicated version of the problem, optimal preemptive schedules of bi-processor tasks (i.e., tasks whose dedicated processor sets are all of cardinality two) can be computed in polynomial time. We give various extensions of this result including one to maximum lateness minimization with release times and due dates. All these results are based on a nice relation between preemptive scheduling and fractional coloring of graphs. In contrast to the positive results, we also prove that the problems of computing optimal preemptive schedules for three-processor tasks or for bi-processor tasks with (possible several) alternative modes are strongly NP-hard.
Studying the effect of similarity in online task-focused interactions
Authors: Dan Cosley, Pamela Ludford, Loren Terveen
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Although the Internet provides powerful tools for social interactions, many tasks-for example, information-seeking-are undertaken as solitary activities. Information seekers are unaware of the invisible crowd traveling in parallel to their course through the information landscape. Social navigation systems attempt to make the invisible crowd visible, while social recommender systems try to introduce people directly. However, it is not clear whether users desire or will respond to social cues indicating the presence of other people when they are focused on a task. To investigate this issue, we created an online game-playing task and paired subjects to perform the task based on their responses to a short survey about demographics and interests. We studied how these factors influence task outcomes, the interaction process, and attitudes towards one's partner. We found that demographic similarity affected how people interact with each other, even though this information was not explicit, while similarities or differences in task-relevant interests did not. Our findings suggest guidelines for developing social recommender systems and show the need for further research into conditions that will help such systems succeed.
Hardware-assisted rendering of cylindrical panoramas
Authors: Dongho Kim, James K. Hahn
Venue: Journal of Graphics Tools (2002)

Cylindrical panorama is being used in many applications. Cylindrical panoramic viewers render the panorama from the center of the cylinder by projecting the cylindrical map onto a planar screen. This process involves nonlinear image warping, so many panoramic viewers are implemented in software. Hardware acceleration may be used if the panorama is resampled onto the polygonal models.This paper presents an algorithm to render cylindrical panorama with hardware acceleration while using the input panorama as is. The rendering equation of cylindrical panorama is decomposed into linear approximation and nonlinear residuals. Nonlinear parts are encoded as bump maps to perturb the texture coordinates on a per-pixel basis. This process can be performed by environment-mapped bump mapping (EMBM) hardware.