ppxscal/embedding_network huggingface dataset:
Constitutive equations for polymer viscoelasticity derived from hierarchical models in cases of failure of time-temperature superposition
Authors: Nicole Heymans
Venue: Signal Processing (2003)

Hierarchical viscoelastic elements whose behaviour is intermediate between linear elasticity and Newtonian viscosity (springpots) have been introduced previously into classical analog models describing linear viscoelastic behaviour. This approach allows a concise description of typical polymer behaviour, including non-exponential relaxation, memory effects and hierarchy of viscoelastic transitions. This approach is extended in the present work to describe complex behaviour, including failure of time-temperature superposition in a semi-crystalline polymer, and the terminal transition from self-similar viscoelasticity to pure flow in a thermoplastic elastomer. Tschoegl's formulation of a finite Gross Marvin ladder model is generalized and applied to other models, and this approach is compared with Friedrich's method based on application of an exponential cutoff to the relaxation function. The method is illustrated using dynamic mechanical measurements on a triblock adhesive in isothermal frequency sweeps. This material displays thermorheological complexity precluding application of time-temperature superposition. Tschoegl's formulation affords a better description of this material than Friedrich's approach. The method described here is a useful alternative to time-temperature superposition requiring a limited number of adjustable parameters.
Meshed multipath routing with selective forwarding: an efficient strategy in wireless sensor networks
Authors: Swades De, Chunming Qiao, Hongyi Wu
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

Due to limited functionalities and potentially large number of sensors, existing routing strategies proposed for mobile ad hoc networks are not directly applicable to wireless sensor networks. In this paper, we present a meshed multipath routing (M-MPR) protocol with selective forwarding (SF) of packets and end-to-end forward error correction (FEC) coding. We also describe a meshed multipath searching scheme suitable for sensor networks, which has a reduced signaling overhead and nodal database. Our performance evaluations show that (1) M-MPR achieves a much improved throughput over conventional disjoint multipath routing with comparable power consumption and receiver complexity; (2) to successfully route a message using FEC coding, selective forwarding (SF) consumes much less network resources, such as channel bandwidth and battery power, than packet replication (or limited flooding).
Group Testing for Video Compression
Authors: Gidon Shavit, Michael F. Ringenburg, Jeff West, Richard E. Ladner, Eve A. Riskin
Venue: Proceedings of the Conference on Data Compression (2004)

Hong and Ladner used context-based group testing to implement bit-plane coding for image compression. We extend this technique to video coding,by replacing the quantization and entropy-coding stages, of an H.263 standard video coder, with bit-plane coding. We experiment with ways to improvebaseline coder, including different classification schemes and cross-frame adaptive coding. Our results indicate that our new coder, GTV (Group Testingfor Video), significantly outperforms H.263 at medium to high bit-rates (300+kbps) on most sequences, while allowing very precise rate scalability.
A Low Cost Individual-Well Adaptive Body Bias (IWABB) Scheme for Leakage Power Reduction and Performance Enhancement in the Presence of Intra-Die Variations
Authors: Tom W. Chen, Justin Gregg
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper presents a new method of adapting body biasing on a chip during post-fabrication testing in order to mitigate the effects of process variations. Individual well biasing voltages can be changed to be connected either to a chip wide well bias or to a different bias voltage through a self-regulating mechanism, allowing biasing voltage adjustments on a per well basis. The scheme requires only one bias voltage distribution network, but allows for back biasing adjustments to more effectively mitigate die-to-die and within-die process variations. The biasing setting for each well is determined using a modified genetic algorithm. Our experimental results show that binning yields as low as 17% can be improved to greater than 90% after using the proposed IWABB method.
InterMediActor: an environment for instructional content design based on competences
Authors: F. J. Valverde-Albacete, R. Pedraza-Jiménez, J. Cid-Sueiro, H. Molina-Bulla, P. Díaz-Pérez, A. Navia-Vázquez
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper describes the basic architecture and functional principles of a new instructional design system called InterMediActor (IMA). IMA provides an environment for instructional content design, production and reuse and student evaluation that is based on the decomposition of the learning objectives in a hierarchical structure of competences. The process of content production and learning in a competence-based systems is described, and the main advantages and differences in relation to other proposals, like SCORM and EML, are discussed.
Algorithmic Aspects of Partial List Colourings
Authors: M. Voigt
Venue: Combinatorics, Probability and Computing (2000)

Let G = (V, E) be a graph with n vertices, chromatic number &chi;(G) and list chromatic number &chi;&lscr;(G). Suppose each vertex of V(G) is assigned a list of t colours. Albertson, Grossman and Haas [1] conjectured that at least [formula here] vertices can be coloured properly from these lists.Albertson, Grossman and Haas [1] and Chappell [3] proved partial results concerning this conjecture. This paper presents algorithms that colour at least the number of vertices given in the bounds of Albertson, Grossman and Haas, and Chappell. In particular, it follows that the conjecture is valid for all bipartite graphs and that, for every bipartite graph and every assignment of lists with t colours in each list where 0 &le; t &le; &chi;&lscr;(G), it is possible to colour at least (1 &minus; (1&#x002F;2)t)n vertices in polynomial time. Thus, if G is bipartite and &Lscr; is a list assignment with &#x2223;L(v)&#x2223; &ge; log2 n for all v &isin; V, then G is &Lscr;-list colourable in polynomial time.
Implementation of a tagged architecture for block structured languages
Authors: L. N. McMahan, E. A. Feustel
Venue: Proceedings of a symposium on High-level-language computer architecture (1973)

This paper describes the implementation of a tagged architecture for a block structured language. First a model for the environment of block structured languages based on an extension to MADCAP VI is developed. Then the implementation of the model in hardware is described.
A service acquisition mechanism for the client/service model in cygnus
Authors: Rong N. Chang, Chinya V. Ravishankar, Jacob Slonim
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

This report addresses the issues arising when structuring large-scale distributed systems. It examines the client-server paradigm, points out its shortcomings, and proposes a new structuring method called the client-service paradigm. It also describes the principles underlying the design of the Cygnus distributed system.
A Java implementation of cross-domain mixed initiative spoken dialogue management
Authors: Ian O'Neill, Philip Hanna, Xingkun Liu, Des Greer
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

In this paper we describe how Java can be used to build an object-oriented dialogue manager for spoken language interactions between a user and an automated system. The approach is based on the DARPA (Defense Advanced Research Projects Agency) Communicator architecture. By creating object-based dialogue management components in Java we separate generic from domain-specific dialogue behaviour in the interests of maintainability and extensibility.
EDITORIAL
Authors: Tony Myatt
Venue: Organised Sound (2001)

As part of the evolution of our editorial structures for Volume 6 we were delighted to be able to establish a post on our Editorial Board for a representative of the International Computer Music Association (ICMA). We hoped to support the ICMA in a fruitful way, and I am now delighted once again to be able to announce that Organised Sound will be devoting its third issue annually to an ICMA theme and the work of the association's members (from Volume 7 Number 3). We hope that this will provide an additional dissemination vehicle for the organisation, allow its conference papers to be developed and expanded, provide an opportunity to publish work based upon the ICMA special interest groups and the association's affiliates. A representative of the ICMA will become a Guest Editor alongside the Organised Sound team of Editors and international referees for the third issue in each year.
Efficient shape curve construction in floorplan design
Authors: Ting-Chi Wang, D. F. Wong
Venue: Proceedings of the conference on European design automation (1991)

In this paper, we present an efficient algorithm to construct shape curves for floorplans. Our algorithm is based on extensions of the tree-restructuring technique in [5] and the curve-adding technique in [2]. We assume each module in the floorplan has an infinite number of non-redundant implementations specified (or approximated) by a piecewise linear decreasing shape curve. Our algorithm constructs a shape curve that contains all non-redundant implementations of the floorplan. Experimental results indicate that our algorithm performs well.
A Posteriori Error Estimates for a Discontinuous Galerkin Approximation of Second-Order Elliptic Problems
Authors: Ohannes A. Karakashian, Frederic Pascal
Venue: SIAM Journal on Numerical Analysis (2003)

Several a posteriori error estimators are introduced and analyzed for a discontinuous Galerkin formulation of a model second-order elliptic problem. In addition to residual-type estimators, we introduce some estimators that are couched in the ideas and techniques of domain decomposition. Results of numerical experiments are presented.
Semantic Web Processes: Semantics Enabled Annotation, Discovery, Composition and Orchestration of Web Scale Processes
Authors: Jorge Cardoso, Amit Sheth
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

This tutorial deals with the evolution of inter-Enterprise and Web scale process to support e-commerce and e-services. It taps into the promises of two of the hottest R&D and technology areas: Web services and the Semantic Web. It presents how applying semantics to each of the steps in the Semantic Web Process lifecycle can help address critical issues in reuse, integration and scalability.
A New Approach To Topology Selection For Cell-Level Analog Circuits
Authors: S. Nagar, B. Mazhari
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

A new approach for selecting a topology fromamong a fixed set of alternatives for cell-level analogcircuits is presented. The topology selection is basedon the description of each circuit topology as a set ofconstraints among the specifications expressed in theform of analytical equations. The proposed topologyselection methodology is illustrated using the exampleof CMOS current sources, voltage amplifiers anddifferential pair.
Topology of subgroup lattices of symmetric and alternating groups
Authors: John Shareshian
Venue: Journal of Combinatorial Theory Series A (2003)

We determine the homotopy type of the order complex of the subgroup lattice of the symmetric group Sn when n is a prime or a power of two. (The prime case has been treated previously in unpublished work of G. Ivanyos.) We do the same for alternating groups of prime degree. In addition, we show that, for any n > 1, the homology of the order complex of the subgroup lattice of Sn has rank at least n!/2 in dimension n - 3.
Tractable Group Detection on Large Link Data Sets
Authors: Jeremy Kubica, Andrew Moore, Jeff Schneider
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Discovering underlying structure from co-occurrencedata is an important task in a variety of fields, including:insurance, intelligence, criminal investigation, epidemiology,human resources, and marketing.Previously Kubicaet. al. presented the group detection algorithm (GDA) - analgorithm for finding underlying groupings of entities fromco-occurrence data.This algorithm is based on a probabilisticgenerative model and produces coherent groups thatare consistent with prior knowledge.Unfortunately, the optimizationused in GDA is slow, potentially making it infeasiblefor many large data sets.To this end, we present k-groups - an algorithm that uses an approach similar tothat of k-means to significantly acclerate the discovery ofgroups while retaining GDA's probabilistic model.We comparethe performance of GDA and k-groups on a variety ofdata, showing that k-groups' sacrifice in solution quality issignificantly offset by its increase in speed.
Managing document taxonomies in relational databases
Authors: Ido Millet
Venue: Effective databases for text & document management (2003)

This chapter addresses the challenge of applying relational database technologies to manage taxonomies, which are commonly used to classify documents, knowledge and websites into a hierarchy of topics. It first describes how denormalizing the data model can facilitate data retrieval from such topic hierarchies. It then shows how the typical data maintenance difficulties associated with denormalized data models can be solved using database triggers.
Ecological interface design: a new approach for visualizing network management
Authors: Catherine M. Burns, Johnson Kuo, Sylvia Ng
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

Effective network management is a key to maximizing the performance of today's networks. Active monitoring of networks is still largely the domain of human network managers and yet, the support tools provided to these operators are typically not integrated and dated in their interface design. Ecological interface design (EID) is a systematic approach, drawn from nuclear power plant control, for designing visualizations that uses a multi-level analysis to develop graphics designed to support problem solving and management activities. We demonstrate the adaptation of this approach to network management and show how visualization tools can be designed. Finally we evaluated the EID tool against an industry tool, HPOpenView Network Node Manager in a series of detection and diagnosis tasks. While we observed slightly faster detection times with Network Node Manager, the EID tool generated faster diagnosis times and more accurate diagnoses. Finally we took our tool to professional network managers for a qualitative evaluation.
Blocking Performance Analysis on Adaptive Routing over WDM Networks with Sparse Wavelength Conversion
Authors: Aijun Ding, Sun-Teck Tan, Gee-Swee Poo
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

This paper proposes an analytical model for theblocking performance of adaptive routing over WDMnetworks with sparse wavelength conversion. Two keycomponents of the model are 1) separate routes intosegments, and calculate the blocking performance of eachsegment; and 2) calculate overflow traffic to wavelengthconvertible node, and then get the blocking probability ofthe node. The blocking probability of the whole network isthen calculated as the combination of the blockingprobability of segments and nodes. Based on the model,an adaptive routing algorithm is proposed, which is ableto finish routing and wavelength assignment in one singlestep. Numerical results show that among the parametersconsidered, the number of wavelengths turns out to be theprimary factor for the blocking performance.
Impact of heterogeneity and collaborative conflict management style on the performance of synchronous global virtual teams
Authors: Souren Paul, Priya Seetharaman, Imad Samarah, Peter P. Mykytyn
Venue: Information and Management (2004)

Virtual teams cut across organizational cultures, national cultures, and functional areas, thereby increasing group heterogeneity, which may result in increased conflict among team members and less effective performance of the team. Our study explored the relationships that might exist among the heterogeneity of the virtual teams, their collaborative conflict management style, and their performance outcomes. The paper reports the findings of a laboratory experiment in which homogeneous and heterogeneous virtual teams, consisting of subjects from the USA and India, worked independently on a decision task involving the adoption of a computer use fee by an online university. Team members, used a web-based group decision support system (GDSS) that allowed them the opportunity to discuss task options, critique suggestions, and vote on the result. The data analyses suggested that collaborative conflict management style positively impacted satisfaction with the decision making process, perceived decision quality, and perceived participation of the virtual teams. There was weak evidence that links a group's heterogeneity to its collaborative conflict management styles.
Addressing E-business privacy concerns: the roles of trust and value compatibility
Authors: Joseph A. Cazier, Benjamin B. M. Shao, Robert D. St. Louis
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Collecting information is an important part of knowing the customer and growing a business. Understanding the factors that affect a person's willingness to disclose personal information is crucial for learning how to collect and utilize that information. In this paper, a privacy model is proposed in which trust and the compatibility of the values of an individual and an organization are expected to enhance a person's willingness to disclose personal information. A survey is conducted to examine the impact of value compatibility on trust, the impact of trust on information disclosure, and the impact of value compatibility on information disclosure. Strong empirical support is found for the effect of value compatibility on trust and for the effect of trust on information disclosure. Conditional support is found for the effect of value compatibility on information disclosure, dependent on the sensitivity levels of the information items.
Vectorizing for a SIMdD DSP architecture
Authors: Dorit Naishlos, Marina Biberstein, Shay Ben-David, Ayal Zaks
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

The Single Instruction Multiple Data (SIMD) model for finegrained parallelism was recently extended to support SIMD operations on disjoint vector elements. In this paper we demonstrate how SIMdD (SIMD on disjoint data) supports e#ective vectorization of digital signal processing (DSP) benchmarks, by facilitating data reorganization and reuse. In particular we show that this model can be adopted by a compiler to achieve nearoptimal performance for important classes of kernels.
An Efficient Algorithm for Lossless Compression of IEEE Float Audio
Authors: Florin Ghido
Venue: Proceedings of the Conference on Data Compression (2004)

Audio data in the IEEE float format is used by the professional quality audioeditors as the format of choice during the editing process and also for storingthe intermediate results. The proposed algorithm transforms the floating-pointvalues into integer values, in a completely portable way across architectures andcompilers. The transform maintains all the important properties of the originalvalues, such as magnitude relations, linear temporal relations and, most importantly,compressibility. It produces a sequence of integers and an additionalbinary stream used for lossless reconstruction of the original values. Furthermore,the proposed algorithm can be successfully applied to other areas suchas medical, science and space data compression. Our algorithm obtains on average7% better compression than the existing multimedia-aware compressionalgorithms, while being also faster.
A Non-Interior Path Following Method for Convex Quadratic Programming Problems with Bound Constraints
Authors: Song Xu
Venue: Computational Optimization and Applications (2004)

We propose a non-interior path following algorithm for convex quadratic programming problems with bound constraints based on Chen-Harker-Kanzow-Smale smoothing technique. Conditions are given under which the algorithm is globally convergent or globally linearly convergent. Preliminary numerical experiments indicate that the method is promising.
Criteria for Project Assignments in Multiple-Project Environments
Authors: Peerasit Patanakul, Dragan Z. Milosevic, Timothy R. Anderson
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Project assignment, assigning a project to a project manager, is one of the organization's most strategically important decisions since it is a determinant of the project performance and the organizational performance. Despite its importance, project assignment is not well studied in the literature and it is performed intuitively in practice. By using concepts of case study research, this study explores project assignment processes in their real-life contexts. Then, the project assignment criteria obtained from the case studies are validated by a panel of experts, following the concepts of the Delphi method. In this paper, some of the research results are presented. In particular, we propose an integrated set of project assignment criteria, including some already proposed in the literature, and others that are new. As part of the criteria, we place a special emphasis on an integrated set of project managers' competencies that is applicable to the current multiple-project environments. In future research, we will use the criteria to build a model for project assignments. The conceptual outline of the model is presented.
On the k-layer planar subset and via minimization problems
Authors: Jason Cong, C. L. Liu
Venue: Proceedings of the conference on European design automation (1990)

An important problem in performance-driven routing is the k-layer planar subset problem which is to choose a maximum (weighted) subset of nets such that each net in the subset can be routed in one of k "preferred" layers. Related to the k-layer planar subset problem is the k-layer topological via-minimization problem which is to determine the topology of each net using k routing layers such that a minimum number of vias is used. For the case k = 2, the topological via minimization problem has been studied by CAD researchers for a long time because of its practical and theoretical importance. In this paper, we show that both the general k-layer planar subset problem and the k-layer topological via minimization problem are NP-complete. Moreover, we show that both problems can be solved in polynomial time for a large class of channels, called crossing channels. It can be shown that under a realistic assumption, all the channels for interblock connections in the general cell design style are crossing channels. Our algorithms are based on an efficient algorithm for computing a maximum weighted k-cofamily in a partially ordered set.
Generating Random Regular Graphs Quickly
Authors: A. Steger, N. C. Wormald
Venue: Combinatorics, Probability and Computing (1999)

We present a practical algorithm for generating random regular graphs. For all d growing as a small power of n, the d-regular graphs on n vertices are generated approximately uniformly at random, in the sense that all d-regular graphs on n vertices have in the limit the same probability as n &rarr; &infin;. The expected runtime for these ds is &Oscr;(nd2).