ppxscal/embedding_network huggingface dataset:
Evaluating the effect of inter-programmer communication: levels on productivity by varying programming team structure
Authors: John W. Bailey, Ken Christensen, Helmut Krcmar, Jean-Louis Lassez, Vincent Y. Shen, Scott N. Woodfield
Venue: ACM SIGSOFT Software Engineering Notes (1982)

Various methods exist for estimating the complexity of single modules and the complexity of interacting modules. We propose to demonstrate how the degree of programmer inter-communication in a multi-programmer project also has a significant effect on productivity. Specifically, projects which use programming team structures which require more inter-programmer communication will experience lower productivities than projects which use team structures which minimize the need for inter-programmer communications.The design proposed here involves the simultaneous re-implementation of an existing, well-documented design by teams of seven graduate-level students. It offers the advantage of alternate levels of work depending upon the amount of data collection and analysis to be underwritten. The results of even the least demanding study will be of significance to any medium to large scale development environment as a guide to selecting programming team structure. The more involved study will give more general results as to the effects of unconstrained communication paths in a team environment.
Integrating Intensity and Boundary Information for Tissue Classification
Authors: Dzung L. Pham
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

A new algorithm is proposed for performing unsupervised tissue classification in medical images by integrating conventional clustering techniques with edge-adaptive segmentation techniques. Based on the fuzzy C-means algorithm, the algorithm computes a smooth segmentation while simultaneously estimating an edge field. Unlike most tissue classification algorithms that incorporate a smoothness constraint, the edge field estimation prevents the algorithm from smoothing across tissue boundaries, thereby producing robust yet accurate results. The algorithm is formulated as the minimization of an objective function that includes penalty terms to ensure that both the segmentation and edge field are relatively smooth.
A joint framework for collaborative and content filtering
Authors: Justin Basilico, Thomas Hofmann
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

This paper proposes a novel, unified, and systematic approach to combine collaborative and content-based filtering for ranking and user preference prediction. The framework incorporates all available information by coupling together multiple learning problems and using a suitable kernel or similarity function between user-item pairs. We propose and evaluate an on-line algorithm (JRank)that generalizes perceptron learning using this framework and shows significant improvement over other approaches.
Expanding Trust Beyond Reputation in Peer-To-Peer Systems
Authors: Terry Bearly, Vijay Kumar
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The issue of trust in Peer-to-Peer (P2P) needs to be addressed, especially if it is to evolve into a general information exchange system beyond file sharing. Mechanisms must be included, either directly into the peer-to-peer protocols, or as a separate protocol that is used with the peer-to-peer protocol. In this paper we propose a universal trust set based on Bayesian network that is user extensible, and a protocol on usage of trust data. The flexibility of this approach allows it to work like the trust models that have been proposed, and also allows for implementing more complex and fully encompassing models.
SuPREME: Substrate and Power-delivery Reluctance-Enhanced Macromodel Evaluation
Authors: Tsung-Hao Chen, Clement Luk, Charlie Chung-Ping Chen
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

The recent demand for system-on-chip RF mixed-signal designand aggressive supply-voltage reduction require chip-level accurateanalysis of both the substrate and power delivery systems.Together with the rising frequency, low-k dielectric, copper interconnects,and high conductivity substrate, the inductance effectsraised serious concern recently.However, the increasing designcomplexity creates tremendous challenges for chip-level power-deliverysubstrate co-analysis.In this paper, we propose a noveland efficient reluctance-based passive model order reduction techniqueto serve these tasks.Our work, SuPREME(Substrate andPower-delivery Reluctance-Enhanced Macromodel Evaluation) notonly greatly reduces the computational complexity of previousreluctance-based model order algorithms but is also capable ofhandling large number of noise sources efficiently.To facilitatethe analysis of inductive substrate return paths and evaluate thehigh-frequency substrate coupling effects, we derive a novel RLKCsubstrate model from Maxwell's equations for the first time.Experimentalresults demonstrate the superior runtime and accuracyof SuPREME compared to the traditional MNA-based simulation.
Optimizing the Defuzzifier Timing for the Fuzzy Control of a Servodrive
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

The paper deals with the implementation a fuzzy logiccontroller for a fast electrical drive system using a low-costmicrocontroller. Thereby a careful research is madeboth for an appropriate off-line conditioning problem asfor an on-line optimal management of the targetprocessor resources. Many considerations concernoriginal control principles and an interrupts basedalgorithm, computation effort reduction keeping a highmotion resolution and experimental data. Many modelsand simulations give reasons for the best solution choice.The author proves, finally by experiment, that fuzzy logicis able to lead to some unexpected results in accuracy.
A New Layered P2P Architecture with Efficient Resource Location Strategy
Authors: Hai Jin, Xiangzhou Guo, Chao Zhang, Quan Yuan
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

The usability of Peer-to-Peer (P2P) systems depends on effective techniques to find and retrieve data. In this paper, we propose a scalable structure for P2P system, with hierarchical topology and an efficient resource location strategy. Furthermore, performance evaluation for the propose search strategy by comparing with flooding scheme and k-walker random walk are also provided.
Identifying Linking-Pin Organizations in Inter-Organizational Networks
Authors: Patrick Doreian, Kayo Fujimoto
Venue: Computational Mathematical Organization Theory (2004)

Within the large literature on inter-organizational networks, there has been some discussion of linking-pin organizations and the role they play in integrating these networks. Based on this verbal specification of linking-pin organizations, we construct operational criteria and empirical methods for identifying these structurally important organizations in potentially large and complex inter-organizational networks. These methods are based on ideas drawn from blockmodeling, structural holes, centrality and centralization of networks, and identifying cut-points in networks. These methods are applied to a constructed example and then to real empirical inter-organizational networks. Implications and contrasts with other methods are discussed, together with some open problems.
ShanghaiGrid: Services to the People
Authors: Minglu Li
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

The goal of ShanghaiGrid is providing information services to the people. ShanghaiGrid is a long term plan sponsored by Science and Technology Commission of Shanghai Municipality with 50 million RMB funds (about 6 million USD) from the government and others. It aims at constructing metropolis-area information services grid infrastructure and establishing an open standard for widespread upper-layer applications from both research communities and official departments. This paper reviews the state of the art of the advances in ShanghaiGrid, the one of the top five grand grid projects in China.
Initial thoughts on rapid prototyping techniques
Authors: Tamara Taylor, Thomas A. Standish
Venue: Proceedings of the workshop on Rapid prototyping (1982)

This paper sets some context, raises issues, and provides our initial thinking on the characteristics of effective rapid prototyping techniques.After discussing the role rapid prototyping techniques can play in the software lifecycle, the paper looks at possible technical approaches including: heavily parameterized models, reusable software, rapid prototyping languages, prefabrication techniques for system generation, and reconfigurable test harnesses.The paper concludes that a multi-faceted approach to rapid prototyping techniques is needed if we are to address a broad range of applications successfully --- no single technical approach suffices for all potentially desirable applications.
Nonlinear population codes
Authors: Maoz Shamir, Haim Sompolinsky
Venue: Neural Computation (2004)

Theoretical and experimental studies of distributed neuronal representations of sensory and behavioral variables usually assume that the tuning of the mean firing rates is the main source of information. However, recent theoretical studies have investigated the effect of crosscorrelations in the trial-to-trial fluctuations of the neuronal responses on the accuracy of the representation. Assuming that only the first-order statistics of the neuronal responses are tuned to the stimulus, these studies have shown that in the presence of correlations, similar to those observed experimentally in cortical ensembles of neurons, the amount of information in the population is limited, yielding nonzero error levels even in the limit of infinitely large populations of neurons.In this letter, we study correlated neuronal populations whose higher-order statistics, and in particular response variances, are also modulated by the stimulus. We ask two questions: Does the correlated noise limit the accuracy of the neuronal representation of the stimulus? and, How can a biological mechanism extract most of the information embedded in the higher-order statistics of the neuronal responses? Specifically, we address these questions in the context of a population of neurons coding an angular variable. We show that the information embedded in the variances grows linearly with the population size despite the presence of strong correlated noise. This information cannot be extracted by linear readout schemes, including the linear population vector. Instead, we propose a bilinear readout scheme that involves spatial decorrelation, quadratic non-linearity, and population vector summation. We show that this nonlinear population vector scheme yields accurate estimates of stimulus parameters, with an efficiency that grows linearly with the population size. This code can be implemented using biologically plausible neurons.
User biased document language modelling
Authors: L. Azzopardi, M. Girolami, C. J. van Rijsbergen
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Capitalizing on the intuitive underlying assumptions of Language Modelling for Ad-Hoc Retrieval we present a novel approach that is capable of injecting the user's context of the document collection into the retrieval process. The preliminary findings from the evaluation undertaken suggest that improved IR performance is possible under certain circumstances. This motivates further investigation to determine the extent and significance of this improved performance.
Electrical characterization of photo-oxidized Si1-x-yGexCy films
Authors: Peter J. Bjeletich, Jeff J. Peterson, Ángel Cuadras, Qi Fang, Jun-Ying Zhang, McDonald Robinson, Ian W. Boyd, Charles E. Hunt
Venue: Microelectronic Engineering (2004)

Strained silicon germanium carbon (Si1-x-yGexCy or SiGeC) on silicon was oxidized using a novel photooxidation process. The growth rate of the oxide was investigated and found to depend heavily on the germanium and carbon concentrations. MOS capacitors were fabricated with the resulting oxide and electrical characterization was done. The SiGeC MOS capacitors proved to have high leakage current through the gate oxide. The leakage current was found to be highly dependent on carbon concentration, and to a lesser degree, on germanium concentration, as well. Fixed oxide charge and interface state density were found to increase by a factor of ten over photo-oxidized silicon.
Benchmarking access methods for time-evolving regional data
Authors: Theodoros Tzouramanis, Michael Vassilakopoulos, Yannis Manolopoulos
Venue: Data Knowledge Engineering (2004)

In this paper we present a performance comparison of access methods for time-evolving regional data. Initially, we briefly review four temporal extensions of the Linear Region Quadtree: the Time-Split Linear Quadtree, the Multiversion Linear Quadtree, the Multiversion Access Structure for Evolving Raster Images and Overlapping Linear Quadtrees. These methods comprise a family of specialized access methods that can efficiently store and manipulate consecutive raster images. A new simpler implementation solution that provides efficient support for spatio-temporal queries referring to the past through these methods, is suggested. An extensive experimental space and time performance comparison of all the above access methods follows. The comparison is made under a common and flexible benchmarking environment in order to choose the best technique depending on the application and on the image characteristics. These experimental results show that in most cases the Overlapping Linear Quadtrees method is the best choice.
XML Document Summarization: Using XQuery for Synopsis Creation
Authors: Sara Comai, Stefania Marrara, Letizia Tanca
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper presents a methodology to support approximate queries over massive and heterogeneous XML datasets, based on concise data statistics such as histograms or other statistical techniques. The basic idea for approximate answers is to store pre-computed summaries of the XML data, also called synopses, and to query them instead of the original database, thus saving time and computational costs. In particular, in this paper we concentrate on a set of XQuery transformation rules for the construction of the synopses collection and for querying the synopsis.
Model based testing in incremental system development
Authors: Alexander Pretschner, Heiko Lötzbeyer, Jan Philipps
Venue: Journal of Systems and Software (2004)

The spiraling nature of evolutionary software development processes produces executable parts of the system at the end of each loop. It is argued that these parts should consist not only of programming language code, but of executable graphical system models. As a main benefit of the use of more abstract, yet formal, modeling languages, a method for model based test sequence generation for reactive systems on the grounds of Constraint Logic Programming as well as its implementation in the CASE tool AUTOFOCUS is presented.
BioMap: Gene Family based Integration of Heterogeneous Biological Databases Using AutoMed Metadata
Authors: Michael Maibaum, Galia Rimon, Christine Orengo, Nigel Martin, Alexandra Poulovassilis
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper presents an extensible architecture that can be used to support the integration of biological data sets. Biological research frequently requires this kind of synthesis. However, the data models on which biological data setshave been constructed are heterogeneous and difficult to use together. Our architecture uses the AutoMed data integration toolkit to store the schemas of data sources, together with the transformation from these schemas into a global integrated schema. The transformation encompasses two parts; the incremental construction of a global schema which unifies the various data source schemas, and the identification of semantically identical labels for entities. Entities in the unified resource are integrated using PFS-cape. This categorises the entities into clusters based on sequence similarity, allowing the use of family information in the annotation of expression data and experimental target selection.
On the Value of a Random Minimum Weight Steiner Tree
Authors: B&#x00e9;la Bollob&#x00e1;s, David Gamarnik, Oliver Riordan, Benny Sudakov
Venue: Combinatorica (2004)

Consider a complete graph on n vertices with edge weights chosen randomly and independently from an exponential distribution with parameter 1. Fix k vertices and consider the minimum weight Steiner tree which contains these vertices. We prove that with high probability the weight of this tree is (1+o(1))(k-1)(log n-log k)/n when k =o(n) and n&#x2192;&#x221e;.
Pseudo-arithmetic sets and Ramsey theory
Authors: Peter Floodstrand Blanchard
Venue: Journal of Combinatorial Theory Series A (2004)

Given a set A of natural numbers, let d(A) = {(y - x) | x < y ∈ A} and let m(A) = min(d(A)). The set A is said to be pseudo-arithmetic if m(A) | (x - y) for all x, y ∈ A. We prove a pseudo-arithmetic Ramsey theorem: for any c, k, n > 0 there is a number p = P(n: c, k), so that for any c-coloring f : [p]k → [c], there is a pseudo-arithmetic set A with |A| = n and f constant on [A]k. We prove that P(3: 2, 2) = 13, and show that P(3.3, 2) ≥ 614. We prove a divisible Schur theorem: for any c > 0 there is a number s = Sd(c), so that for any c-coloring χ : [s] → [c], there is a monochromatic set {x, y, x + y} with x|y.
Generation of metastable electron traps in the near interfacial region of SOI buried Oxides by ion implantation and their effect on device properties
Authors: J. R. Schwank, D. M. Fleetwood, H. D. Xiong, M. R. Shaneyfelt, B. L. Draper
Venue: Microelectronic Engineering (2004)

Implanting the buried oxide of silicon-on-insulator technologies can create electron traps throughout the buried oxide that can compensate the buildup of radiation-induced positive charge. These can be used as an effective method for total-dose hardening buried oxides in SOI devices. In this work, we show that implanting buried oxides can also create thermally activated metastable electron traps near the top Si/SiO2 border. These metastable electron traps can produce significant bias instabilities in the back-gate transistor characteristics and lead to threshold voltage instabilities in fully-depleted devices.
Digital Campus Project: A "Dream University" over the Internet Web
Authors: Ryo Nishide, Shinichi Ueshima
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

This paper presents the lifestyle of a "Dream University"of the future, digitalized out of a real University Campus.This "Dream University" is actually a multipurposeDigital Campus facilitating for a better e-Learning environmentas the core of the research. It is an elaborate DigitalCampus created with Virtual Collaborative Environment in3D system in the virtual world where users can learn andexperience the campus life of the university while collaboratingwith other users involved. We propose all the availablefeatures that the Digital Campus can provide and discussthe points that have been proved to be advantageousfor the users. Our goal is to create a dream university on theWeb so that anybody can participate anytime, anywhere, dependingupon his/her needs, removing all the barriers andsolving problems involved in the real university.
Supporting federated information sharing communities (abstract only)
Authors: Bicheng Liu
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Increasingly, the World Wide Web is being viewed as a means of creating web communities rather than simply as a means of publishing and delivering documents and services. In this research we develop the concept of Federated Information Sharing Communities (FISC), and associated architecture, that enables community-centred information systems to be constructed. Such systems provide a way for organisations, distributed workgroups and individuals to build up a federated community based on their common interests over the World Wide Web. To support communities, we develop capabilities that go beyond the generic retrieval of documents to include the ability to retrieve people, their interests and inter-relationships. We focus on providing social awareness "in the large" to help users understand the members within a community and the relationships between them: who is working on what topic, and who is working with whom. Within the FISC framework, we provide a viewpoint retrieval service to enable a user to construct visual contextual views of the community from the perspective of any community member. To evaluate these ideas we develop test beds to compare individual component technologies such as user and group profile construction and similarity matching, and we develop prototypes (Web Network and "CiteSeer Community") to explore the broader architecture and usage issues.
A finite difference method to solve the forward problem in electroencephalography (EEG)
Authors: Véronique Hédou-Rouillier
Venue: Journal of Computational and Applied Mathematics (2004)

In this paper, a three-dimensional finite difference method to solve the forward problem in electroencephalography is developed. The aim is to compute the electric potential in the whole head.Some three-dimensional conservative difference schemes are defined on a regular grid for elliptic equations with strongly discontinuous coefficients. For each scheme, the error of approximation is estimated by making some assumptions on surface locations with respect to the grid. These assumptions are due to a lack of knowledge of the real discontinuity surfaces. Numerical results allow the comparison of the accuracy of the different schemes when surfaces do not satisfy the previously mentioned assumptions, which is the case in most real-life applications. Such applications will be discussed in conclusion.
A single-point mutation evolutionary programming
Authors: Mingjun Ji, Huanwen Tang, Juan Guo
Venue: Information Processing Letters (2004)

In this paper, we propose an improved evolutionary programming based on single-point mutation, which is named Single-Point Mutation Evolutionary Programming (SPMEP). The distinctions between SPMEP and the classical evolutionary programming (EP) are the single-point mutation for each solution in each iteration and the fixed mutation scheme for deviation η. Simulation results show that SPMEP is obviously superior to the classical EP, fast EP and generalized EP for multimodal and high-dimensional functions.