ppxscal/embedding_network huggingface dataset:
Organizational Culture and Knowledge Management Success: Assessing The Behavior-Performance Continuum
Authors: Pierre A. Balthazard, Robert A. Cooke
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Traditionally, culture has been assessed by qualitative methods. However, quantitative approaches such as culture surveys offer important advantages for both cross-sectional organizational research and knowledge-based cultural change initiatives. The OrganizationalCulture Inventory© (OCI), an instrument designed for such uses, profiles the culture of organizations and their sub-units in terms of behavioral norms and expectations. Following a review of seminal concepts relevant to organizational culture, this paper presents a framework depicting the relationship between culture and outcomes that are consistent with successful KM environments. An examination of the data provided by approximately 60,000 OCI respondents indicates that the inventory is a powerful indicator of outcomes, which are related to both individual and organizational criteria.
Email as spectroscopy: automated discovery of community structure within organizations
Authors: Joshua R. Tyler, Dennis M. Wilkinson, Bernardo A. Huberman
Venue: Communities and Technologies (2003)

We describe a method for the automatic identification of communities of practice from email logs within an organization. We use a betweenness centrality algorithm that can rapidly find communities within a graph representing information flows. We apply this algorithm to an email corpus of nearly one million messages collected over a two-month span, and show that the method is effective at identifying true communities, both formal and informal, within these scale-free graphs. This approach also enables the identification of leadership roles within the communities. These studies are complemented by a qualitative evaluation of the results in the field.
Privacy in the global e-village
Authors: Gregory J. Pottie
Venue: Communications of the ACM (2004)

Embed responsibility for privacy into radio-frequency identification tags and other information technology designed to network the physical world.
Tracking a moving object with a binary sensor network
Authors: Javed Aslam, Zack Butler, Florin Constantin, Valentino Crespi, George Cybenko, Daniela Rus
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

In this paper we examine the role of very simple and noisy sensors for the tracking problem. We propose a binary sensor model, where each sensor's value is converted reliably to one bit of information only: whether the object is moving toward the sensor or away from the sensor. We show that a network of binary sensors has geometric properties that can be used to develop a solution for tracking with binary sensors and present resulting algorithms and simulation experiments. We develop a particle filtering style algorithm for target tracking using such minimalist sensors. We present an analysis of fundamental tracking limitation under this sensor model, and show how this limitation can be overcome through the use of a single bit of proximity information at each sensor node. Our extensive simulations show low error that decreases with sensor density.
Tradeoffs in certificate revocation schemes
Authors: Peifang Zheng
Venue: ACM SIGCOMM Computer Communication Review (2003)

Cryptographic certificates are a powerful tool for security concerned applications where the participants must be authenticated in order to access some resources or commit a transaction. However, due to various reasons, the validity of such certificates can change over time, introducing the risk of an invalid certificate being used to authenticate an entity. Various methods of mitigating this risk have been devised, known broadly as "certificate revocation" schemes. In this paper, we categorize and analyze them based on our identified characteristics. We further discuss tradeoffs among them and suggest how system designers might apply the analyses.
Path runner: an accurate and fast timing analyser
Authors: D. Deschacht, P. Pinede, M. Robert, D. Auvergne
Venue: Proceedings of the conference on European design automation (1990)

As a necessary aid to system integration, we present a pattern-dependent-timing analysis tool, organized around an explicit formulation of elementary units and allowing accurate and fast evaluation of CMOS data paths.It can process large circuits accurately in reduced CPU time, thus allowing safe and fast temporal evaluation of CMOS VLSI circuits.
Characterisation of JSR's spin-on hardmask FF-02
Authors: A. Das, Q. T. Le, Y. Furukawa, V. H. Nguyen, V. Terzieva, F. de Theije, C. M. Whelan, M. Maenhoudt, H. Struyf, Zs. Tókei, F. Iacopi, M. Stucchi, L. Carbonell, I. Vos, H. Bender, M. Patz, G. Beyer, M. Van Hove, K. Maex
Venue: Microelectronic Engineering (2003)

Some of the spin-on interlayer dielectrics (ILD) with dielectric constant k below 2.3, targeted for the 65 nm node and below, are available with their spin-on hard masks (SoHM) to reduce the total effective capacitance and to provide high selectivity to their respective ILDs during integration. In this work, FF-02, JSR's SoHM is characterised. Its thermal stability, chemical compatibility to stripping solutions and resistance to moisture are investigated. Methods to seal the surface of FF-02 to chemicals are explored. Electrical properties including the dielectric constant, leakage current and breakdown fields are evaluated in planar capacitors and in single damascene structures.
The Hybrid Poisson Aspect Model for Personalized Shopping Recommendation
Authors: Chun-Nan Hsu, Hao-Hsiang Chung, Han-Shen Huang
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Predicting an individual customer's likelihood of purchasinga specific item forms the basis of many marketingactivities, such as personalized shopping recommendation.Collaborative filtering and association rule miningcan be applied to this problem, but in retail supermarkets,the problem becomes particularly challenging because ofthe sparsity and skewness of transaction data. This paperpresents HyPAM(Hybrid Poisson Aspect Model), a newprobabilistic graphical model that combines a Poisson mixturewith a latent aspect class model to model customers'shopping behavior. We empirically compare HyPAM withtwo well-known recommenders, GroupLens (a correlation-basedmethod), and IBM SmartPad (association rules andcosine similarity). Experimental results show that HyPAMoutperforms the other recommenders by a large margin fortwo real-world retail supermarkets, ranking most of actualpurchases in the top ten percent of the most likely purchaseditems. We also present a new visualization method, rankplot, to evaluate the quality of recommendations.
The Design and Implementation of a Repository for the Management of Spatial Data Integrity Constraints
Authors: Sophie Cockcroft
Venue: Geoinformatica (2004)

This paper reviews the key features of an environment to support domain users in spatial information system (SIS) development. It presents a full design and prototype implementation of a repository system for the storage and management of metadata, focusing on a subset of spatial data integrity constraint classes. The system is designed to support spatial system development and customization by users within the domain that the system will operate.
Testing a cancer meta spider
Authors: Hsinchun Chen, Haiyan Fan, Michael Chau, Daniel Zeng
Venue: International Journal of Human-Computer Studies (2003)

As in many other applications, the rapid proliferation and unrestricted Web-based publishing of health-related content have made finding pertinent and useful healthcare information increasingly difficult. Although the development of healthcare information retrieval systems such as medical search engines and peer-reviewed medical Web directories has helped alleviate this information and cognitive overload problem, the effectiveness of these systems has been limited by low search precision, poor presentation of search results, and the required user search effort. To address these challenges, we have developed a domain-specific meta-search tool called Cancer Spider. By leveraging post-retrieval document clustering techniques, this system aids users in querying multiple medical data sources to gain an overview of the retrieved documents and locating answers of high quality to a wide spectrum of health questions. The system presents the retrieved documents to users in two different views: (1) Web pages organized by a list of key phrases, and (2) Web pages clustered into regions discussing different topics on a two-dimensional map (self-organizing map). In this paper, we present the major components of the Cancer Spider system and a user evaluation study designed to evaluate the effectiveness and efficiency of our approach. Initial results comparing Cancer Spider with NLM Gateway, a premium medical search site, have shown that they achieved comparable performances measured by precision, recall, and F-measure. Cancer Spider required less user searching time, fewer documents that need to be browsed, and less user effort.
Ulysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network
Authors: Abhishek Kumar, Shashidhar Merugu, Jun (Jim) Xu, Xingxing Yu
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

A number of Distributed Hash Table (DHT)-based protocols have been proposed to address the issue of scalability in peer-to-peer networks. In this paper, we present Ulysses, a peer-to-peer network based on the butterfly topology that achieves the theoretical lower bound of \frac{{\log n}}{{\log \log n}} on network diameter when the average routing table size at nodes is no more than log n. Compared to existing DHT-based schemes with similar raouting table size, Ulysses reduces the network diameter by a factor of log log n, which is 2-4 for typical configurations. This translates into the same amount of reduction on query latency and average traffic per link/node. In addition, Ulysses maintains the same level of robustness in terms of routing in the face of faults and recovering from graceful/ungraceful joins and departures, as provided by existing DHT-based schemes. The performance of the protocol has been evaluated using both analysis and simulation.
A foundation for machine learning in design
Authors: Siang Kok Sim, Alex H. B. Duffy
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

This paper presents a formalism for considering the issues of learning in design. A foundation for machine learning in design (MLinD) is defined so as to provide answers to basic questions on learning in design, such as, &ldquo;What types of knowledge can be learnt?&rdquo;, &ldquo;How does learning occur?&rdquo;, and &ldquo;When does learning occur?&rdquo;. Five main elements of MLinD are presented as the input knowledge, knowledge transformers, output knowledge, goals/reasons for learning, and learning triggers. Using this foundation, published systems in MLinD were reviewed. The systematic review presents a basis for validating the presented foundation. The paper concludes that there is considerable work to be carried out in order to fully formalize the foundation of MLinD.
Specification and refinement of a message router
Authors: H. Conrad Cunningham, Yinxiu Cai
Venue: Proceedings of the 7th international workshop on Software specification and design (1993)

This paper considers a variant of the message router problem discussed during the Concurrency and Distribution sessions of IWSSD-6. First, it presents a high-level specification of the router as a reactive system expressed in the UNITY logic. Second, it refines the interface of the router using a new approach called the reactive envelope heuristic. Third, it decomposes the router into a grid of switches. In closing, the paper analyzes the specification and refinement techniques used in this study and proposes future research.
eXtreme Programming as a Framework for Student-Project Coaching in Computer Science Capstone Courses
Authors: Yael Dubinsky, Orit Hazzan
Venue: Proceedings of the IEEE International Conference on Software-Science, Technology & Engineering (2003)

This article presents eXtreme Programming as a frame-workfor coaching student projects in computer science capstonecourses. The work presented here is based on a retrospectiveprocess of four coaches who, during the academicyear 2002-2003, coached and guided students in the developmentof software projects within the framework of eXtremeProgramming. The rationale for this work stems fromthe fact that software engineering methods are difficult toimplement, even in the academia. eXtreme Programming,one of the agile software development methods, specifiestechnical and social guidelines to be followed by softwaredevelopers during the entire process of software development.As illustrated in this article, these guidelines create asuitable framework for coaching student software projects,as well as for training the coaches themselves for the coachingtask.
Higher dimensional automata revisited
Authors: Vaughan Pratt
Venue: Mathematical Structures in Computer Science (2000)

The dual of a true concurrency schedule appears to be a false concurrency automaton, a paradox we resolved in a previous paper by extending the latter to higher dimensions. This extension may be formalized via such discrete geometries as n-categories, simplicial complexes, cubical complexes and Chu spaces. We advocate the last as having a clear notion of event, a well-defined process algebra uniformly extending that for event structures, and ease of extension beyond the basic before-during-after analysis.
A case study on visualization for boundary value problems
Authors: Gábor Domokos, Randy Paffenroth
Venue: Proceedings of the conference on Visualization '94 (1994)

In this paper we present a method, and a software based on this method, making highly inter-active visualization possible for computational results on nonlinear BVPs associated with ODEs. The program PCR relies partly on computer graphics tools and partly on real-time computations, the combination of which not only helps the understanding of complex problems, it also permits the reduction of stored data by orders of magnitude. The method has been implemented on PCs (running on DOS) and on the Application Visualization System (AVS) for UNIX machines, this paper provides a brief introduction to the latter version besides describing the mathematical background of the method.
Tool communication in an integrated synthesis environment
Authors: Bernd Kleinjohann, Elisabeth Kupitz
Venue: Proceedings of the conference on European design automation (1991)

A tight integration strategy developed during the realization of a hardware synthesis system is described. It allows online visualization of data changes caused for example by a synthesis tool. Common data schemas for various design views were designed. For manipulation of each design view one abstract data type is provided, avoiding redundant implementations. Communication structures for concurrent manipulation of common data structures were developed. The system architecture allows easy system extension/configuration.
Visualizations of binary data: a comparative evaluation
Authors: Michael D. Lee, Marcus A. Butavicius, Rachel E. Reilly
Venue: International Journal of Human-Computer Studies (2003)

Data visualization has the potential to assist humans in analysing and comprehending large volumes of data, and to detect patterns, clusters and outliers that are not obvious using nongraphical forms of presentation. For this reason, data visualizations have an important role to play in a diverse range of applied problems, including data exploration and mining, information retrieval, and intelligence analysis. Unfortunately, while various different approaches are available for data visualization, there have been few rigorous evaluations of their effectiveness. This paper presents the results of three controlled experiments comparing the ability of four different visualization approaches to help people answer meaningful questions for binary data sets. Two of these visualizations, Chernoff faces and star glyphs, represent objects using simple icon-like displays. The other two visualizations use a spatial arrangement of the objects, based on a model of human mental representation, where more similar objects are placed nearer each other. One of these spatial displays uses a common features model of similarity, while the other uses a distinctive features model. The first experiment finds that both glyph visualizations lead to slow, inaccurate answers being given with low confidence, while the faster and more confident answers for spatial visualizations are only accurate when the common features similarity model is used. The second experiment, which considers only the spatial visualizations, supports this finding, with the common features approach again producing more accurate answers. The third experiment measures human performance using the raw data in tabular form, and so allows the usefulness of visualizations in facilitating human performance to be assessed. This experiment confirms that people are faster, more confident and more accurate when an appropriate visualization of the data is made available.
Orthogonality of decision boundaries in complex-valued neural networks
Authors: Tohru Nitta
Venue: Neural Computation (2004)

This letter presents some results of an analysis on the decision boundaries of complex-valued neural networks whose weights, threshold values, input and output signals are all complex numbers. The main results may be summarized as follows. (1) A decision boundary of a single complex-valued neuron consists of two hypersurfaces that intersect orthogonally, and divides a decision region into four equal sections. The XOR problem and the detection of symmetry problem that cannot be solved with two-layered real-valued neural networks, can be solved by two-layered complex-valued neural networks with the orthogonal decision boundaries, which reveals a potent computational power of complex-valued neural nets. Furthermore, the fading equalization problem can be successfully solved by the two-layered complex-valued neural network with the highest generalization ability. (2) A decision boundary of a three-layered complex-valued neural network has the orthogonal property as a basic structure, and its two hypersurfaces approach orthogonality as all the net inputs to each hidden neuron grow. In particular, most of the decision boundaries in the three-layered complex-valued neural network inetersect orthogonally when the network is trained using Complex-BP algorithm. As a result, the orthogonality of the decision boundaries improves its generalization ability. (3) The average of the learning speed of the Complex-BP is several times faster than that of the Real-BP. The standard deviation of the learning speed of the Complex-BP is smaller than that of the Real-BP. It seems that the complex-valued neural network and the related algorithm are natural for learning complex-valued patterns for the above reasons.
A bound for the number of columns &#x2113;(c,a,b) in the intersection array of a distance-regular graph
Authors: S. Bang, J. H. Koolen, V. Moulton
Venue: European Journal of Combinatorics (2003)

In this paper we give a bound for the number l(c,a,b) of columns (c, a, b)T in the intersection array of a distance-regular graph. We also show that this bound is intimately related to the Bannai-Ito conjecture.
Circuit partitioning for waveform relaxation
Authors: W. John, W. Rissiek, K. L. Paap
Venue: Proceedings of the conference on European design automation (1991)

In this paper new partitioning strategies for the simulation of bipolar circuits using the waveform relaxation method are presented. On the one hand concepts known from layout-generation and node tearing simulation are used. On the other hand the hierarchical structure of the circuit description list and a minimal-cut criterion is used to find a good partitioning.With the help of these new partitioning algorithms it is possible for the first time to simulate large bipolar circuits using waveform relaxation. The applicability of the algorithms is demonstrated by the simulation of real-life circuits.
High-level macro-modeling and estimation techniques for switching activity and power consumption
Authors: Anand Raghunathan, Sujit Dey, Niraj K. Jha
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

We present efficient techniques for estimating switching activity and power consumption at the register-transfer level (RTL), using a combination of macro-modeling for datapath blocks, and control logic analysis techniques based on partial delay information. Previous work on estimating switching activity and power at the RTL has ignored the presence of glitches at various datapath and control signals. We demonstrate that glitches can form a significant component of the switching activity at signals in typical RTL circuits. In particular, for control-flow intensive designs, we show that the controller substantially affects the activity and power consumption in the datapath due to the presence of glitches at control signals. Since the final implementation of the controller is not available during high-level design iterations, we develop techniques that estimate glitching activity at control signals using control expressions and partial delay information. For datapath blocks that operate on word-level data, we construct piecewise linear models that capture the variation of output glitching activity and power consumption with various word-level parameters like mean, standard deviation, spatial and temporal correlations, and glitching activity at the block's inputs. For RTL blocks that operate on bit vectors that need not have an associated word-level value, we present accurate bit-level modeling techniques for glitching activity as well as power consumption. This allows us to perform accurate power estimation for control-flow intensive circuits, where most of the power consumed is dissipated in non-arithmetic components like multiplexers, registers, vector logic operators, etc. Experimental results on several RTL designs demonstrate the accuracy of the proposed estimation techniques. Our RTL power estimator produced estimates that were within 7% of those produced by an in-house power analysis tool on the final gate-level implementation, while being over 50 × faster than its gate-level counterpart.
Automatic knowledge acquisition in a digital circuit design system
Authors: Jung-Gen Wu
Venue: Proceedings of the conference on European design automation (1990)

Knowledge acquisition is the key task in building an expert system. Existing expert systems for digital circuit design need human knowledge engineers to update their rule bases whenever a new component is added into the system. This manual knowledge acquisition process is quite error prone and time consuming. To solve these problems, we use the automated reasoning method to find applications of a new structural module based on its basic behavior.
PLATO: a CAD tool for logic synthesis based on decomposition
Authors: Tedeusz Luba, Jerzy Kalinowski, Krzysztof Jasiński
Venue: Proceedings of the conference on European design automation (1991)

In this paper a CAD system for logic synthesis (PLATO system) that exploits logic decomposition to optimize the actual circuit is presented. Unlike the traditional approach, where the partitioning or decomposition follows logic minimization, decomposition process is carried out in the PLATO system as the very first step in the logic synthesis. Experimental results indicate that a significant reduction of the silicon area can be obtained using this new design strategy.