ppxscal/embedding_network huggingface dataset:
Parametrized surfaces in huge P3 of bidegree (1,2)
Authors: Mohamed Elkadi, André Galligo, Thi Ha Lê
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

Parametrized surfaces of low degrees are very useful in applications, specially in Computer Aided Geometric Design and Geometric Modeling. The precise description of their geometry is not easy in general. Here we study surfaces of bidegree (1,2). We show that, generically up to linear changes of coordinates, they are classified by two continuous parameters (modulus). We present an elegant combinatorial description where these modulus appear as cross ratios. We provide compact implicit equations for these surfaces and for their singular locus together with a geometric interpretation.
Analysing Associations of Textual and Relational Data with a Multiple Views System
Authors: Christian Seeling, Andreas Becks
Venue: Proceedings of the Second International Conference on Coordinated & Multiple Views in Exploratory Visualization (2004)

Visualization interfaces that offer multiple coordinated views on a particular set of data items are useful for navigating and exploring complex information spaces. In application areas like customer relationship management (CRM) or business intelligence (BI), for example, structured customer or company data is often associated to text-based information like telemarketing transcripts or trade press articles. Supporting the analysis of such text information and related structured data is a major challenge for current CRM and BI tools. In this paper we present a system for visually analyzing these particular information spaces based on a multiple views paradigm. The system brings together views on text similarity, text categories, and associated relational attributes; visual overlay techniques help to keep track of navigation and selection operations in complementary views. The paper sketches an application example and summarizes results from an initial usability evaluation.
Large Scale, Type-Compatible Service Composition
Authors: Ion Constantinescu, Boi Faltings, Walter Binder
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

Service matchmaking and composition has recentlydrawn increasing attention in the research community.Most existing algorithms construct chains of servicesbased on exact matches of input/output types. However,this does not work when the available services onlycover a part of the range of the input type. We present an algorithmthat also allows partial matches and composesthem using switches that decide on the required serviceat runtime based on the actual data type. We report experimentson randomly generated composition problemsthat show that using partial matches can decrease the failurerate of the integration algorithm using only completematches by up to 7 times with no increase in the numberof directory accesses required. This shows that compositionwith partial matches is an essential and usefulelement of web service composition.
From Sequences of Dependent Instructions to Functions: An Approach for Improving Performance without ILP or Speculation
Authors: Sami Yehia, Olivier Temam
Venue: Proceedings of the 31st annual international symposium on Computer architecture (2004)

In this article, we present an approach for improving the performance of sequences of dependent instructions. We observe that many sequences of instructionscan be interpreted as functions. Unlike sequences of instructions, functions can be translated into very fast butexponentially costly two-level combinational circuits. Wepresent an approach that exploits this principle, speeds upprograms thanks to circuit-level parallelism/redundancy,but avoids the exponential costs.We analyze the potential of this approach, and thenwe propose an implementation that consists of a superscalar processor with a large specific functional unit associated with specific back-end transformations. The performance of the SpecInt2000 benchmarks and selectedprograms from the Olden and MiBench benchmark suitesimproves on average from 2.4% to 12% depending on thelatency of the functional units, and up to 39.6%; moreprecisely, the performance of optimized code sections improves on average from 3.5% to 19%, and up to 49%.
Learning Feature Weights from Customer Return-Set Selections
Authors: L. Karl Branting
Venue: Knowledge and Information Systems (2004)

This paper describes LCW, a procedure for learning customer preferences represented as feature weights by observing customers&#x2019; selections from return sets. An empirical evaluation on simulated customer behavior indicated that uninformed hypotheses about customer weights lead to low ranking accuracy unless customers place some importance on almost all features or the total number of features is quite small. In contrast, LCW&#x2019;s estimate of the mean preferences of a customer population improved as the number of customers increased, even for larger numbers of features of widely differing importance. This improvement in the estimate of mean customer preferences led to improved prediction of individual customers&#x2019; rankings, irrespective of the extent of variation among customers and whether a single or multiple retrievals were permitted. The experimental results suggest that the return set that optimizes benefit may be smaller for customer populations with little variation than for customer populations with wide variation.
A goal-driven and agent-based requirements engineering framework
Authors: Paolo Donzelli
Venue: Requirements Engineering (2004)

The paper presents a requirements engineering framework (REF), where advanced requirements engineering techniques are combined with software quality modelling approaches to provide an environment within which the stakeholders and the analysts can easily cooperate to discover, organise, reconcile and validate the requirements for a new system. By adopting a basic and essential graphical notation, and a clear top-down methodology, REF allows for an effective involvement of the stakeholders, assisting and driving them to an early definition of the desired system's functionalities and quality attributes, while supporting the redesign of the encompassing organisational context to better exploit the new system's capabilities. As a case study, REF is applied to support the requirements engineering process for a complex software-intensive simulation system. Results demonstrate the feasibility of REF and the benefits it offers to the requirements engineering process, but also to the subsequent system development phases. As illustrated through the case study REF can, in fact, be usefully applied as a forerunner for unified modelling language (UML)-based approaches.
Model of P-N+ junction in thin SOI MOS structures
Authors: Valentin N. Dobrovolsky, Sorin Cristoloveanu
Venue: Microelectronic Engineering (2004)

A theoretical model is developed which gives useful expressions for the characteristics of the depleted space-charge region of the P-N+ junction in thin SOI MOS structures. The two-dimensional distributions of the electric field and potential cardinally differ from expressions in bulk silicon. This is due to the electrostatic interaction between the gates and silicon film in the Silicon-On-Insulator (SOI) structure.
Designing probes for empathy with families
Authors: Willem Horst, Ties Bunt, Stephan Wensveen, Lisa Cherian
Venue: Proceedings of the conference on Dutch directions in HCI (2004)

In this paper we describe how we applied the method of cultural probes to get empathy with and inspiration from families. We illustrate this with a concrete research study in which we applied this method to investigate 'the need to stay in touch' present in different families. Firstly we discuss the problems that emerge when applying this method to a family as opposed to applying it to individuals. Secondly we discuss the design of the package, illustrated with examples, and finally we discuss the translation of the qualitative data into visualised contextual scenarios. We conclude with a reflection on how the research has affected our awareness of the design context.
Texture Overlay onto Deformable Surface Using HMD
Authors: Mototsugu Emori, Hideo Saito
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

We propose a system that overlays textures onto the deformablesurface of an object in real time using HMD. Weassume that the surface projected onto an HMD image consistsof curved surfaces which can be approximated by 2Dgeometric curved surface, so that we can deform texturesusing the matrix of 2D geometric transformation and thedeformed textures are overlaid onto the HMD image. Thesystem computes the transformation matrix in each frame,the textures are overlaid in real time even if an observerwith HMD moves or deforms the surface. In the system,we select a book as the object with deformable shape anddocuments as the textures. Therefore, the observer can readdigitized documents as if he reads real books.
Quasirandom permutations
Authors: Joshua N. Cooper
Venue: Journal of Combinatorial Theory Series A (2004)

Chung and Graham (J. Combin. Theory Ser. A 61 (1992) 64) define quasirandom subsets of Zn to be those with any one of a large collection of equivalent random-like properties. We weaken their definition and call a subset of Zn ε-balanced if its discrepancy on each interval is bounded by εn. A quasirandom permutation, then, is one which maps each interval to a highly balanced set. In the spirit of previous studies of quasirandomness, we exhibit several random-like properties which are equivalent to this one, including the property of containing (approximately) the expected number of subsequences of each order-type. We present a construction for a family of strongly quasirandom permutations, and prove that this construction is essentially optimal, using a result of Schmidt on the discrepancy of sequences of real numbers.
An Bayesian Method for Biological Pathway Discovery from High-Throughput Experimental Data
Authors: Wei Wang, Gregory F. Cooper
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

This poster describes a novel Bayesian method for discovering intra-cellular pathways from high throughput data. This Bayesian method is generalized from a deterministic algorithm [1], and it combines experimental data with prior belief to produce as output a probability distribution over the possible causal relationships between each pair of variables. We applied this algorithm to gene expression data [2] on galactose metabolism in yeast. The Area Under ROC curve (AUROC) for the Wagner algorithm 0.64. For the Bayesian algorithm the AUROC is 0.87, with a 95% confidence interval of (0.77 0.94). Thus, the Bayesian algorithm performs statistically significantly better than Wagner algorithm.
Disciplined, efficient, generalised folds for nested datatypes
Authors: Clare Martin, Jeremy Gibbons, Ian Bayley
Venue: Formal Aspects of Computing (2004)

Nested (or non-uniform, or non-regular) datatypes have recursive definitions in which the type parameter changes. Their folds are restricted in power due to type constraints. Bird and Paterson introduced generalised folds for extra power, but at the cost of a loss of efficiency: folds may take more than linear time to evaluate. Hinze introduced efficient generalised folds to counter this inefficiency, but did so in a pragmatic way: he did not provide categorical or equivalent underpinnings, so did not get the associated universal properties for manipulating folds. We combine the efficiency of Hinze&#x2019;s construction with the powerful reasoning tools of Bird and Paterson&#x2019;s.
Rational Abandonment from Tele-Queues: Nonlinear Waiting Costs with Heterogeneous Preferences
Authors: Nahum Shimkin, Avishai Mandelbaum
Venue: Queueing Systems: Theory and Applications (2004)

We consider the modelling of abandonment from a queueing system by impatient customers. Within the proposed model, customers act rationally to maximise a utility function that weights service utility against expected waiting cost. Customers are heterogeneous, in the sense that their utility function parameters may vary across the customer population. The queue is assumed invisible to waiting customers, who do not obtain any information regarding their standing in the queue during their waiting period. Such circumstances apply, for example, in telephone centers or other remote service facilities, to which we refer as tele-queues. We analyse this decision model within a multi-server queue with impatient customers, and seek to characterise the Nash equilibria of this system. These equilibria may be viewed as stable operating points of the system, and determine the customer abandonment profile along with other system-wide performance measures. We provide conditions for the existence and uniqueness of the equilibrium, and suggest procedures for its computation. We also suggest a notion of an equilibrium based on sub-optimal decisions, the myopic equilibrium, which enjoys favourable analytical properties. Some concrete examples are provided to illustrate the modelling approach and analysis. The present paper supplements previous ones which were restricted to linear waiting costs or homogeneous customer population.
SAMBA-Bus: A High Performance Bus Architecture for System-on-Chips
Authors: Ruibing Lu, Cheng-Kok Koh
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

A high performance communication architecture, SAMBA-bus, isproposed in this paper. In SAMBA-bus, multiple compatible bustransactions can be performed simultaneously with only a singlebus access grant from the bus arbiter. Experimental results showthat, compared with a traditional bus architecture, the SAMBA-busarchitecture can have up to 3.5 times improvement in the effectivebandwidth, and up to 15 times reduction in the average communicationlatency. In addition, the performance of SAMBA-bus architectureis affected only slightly by arbitration latency, because bustransactions can be performed without waiting for the bus accessgrant from the arbiter. This feature is desirable in SoC designs withlarge numbers of modules and long communication delay betweenmodules and the bus arbiter.
Support for Mobility and Fault Tolerance in Mykil
Authors: Jyh-How Huang, Shivakant Mishra
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

This paper describes the support provided for mobility and fault tolerance in Mykil, which is a key distribution protocol for large, secure group multicast. Mykil is based on acombination of group-based hierarchy and key-based hierarchysystems. Important advantages of Mykil include a fast andefficient rekeying operation for large group sizes, continuousavailability of the key management service in a disconnectednetwork environment, an ability to map group structure to theunderlying network infrastructure, fault tolerance, and supportfor member mobility and smaller hand-held devices.
A Novel Fault Tolerant Cache to Improve Yield in Nanometer Technologies
Authors: Amit Agarwal, Bipul C. Paul, Kaushik Roy
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

Process parameter variations are expected to be significantlyhigh in sub-50 nm technology regime, which can severely affectthe yield, unless very conservative design techniques areemployed. The parameter variations are random in nature andare expected to be more pronounced in minimum geometrytransistors commonly used in memories such as SRAM.Consequently, a large number of cells in a memory are expectedto be faulty due to variations in different process parameters. Inthis paper we analyze SRAM cell failure under process variationand propose a new fault tolerant cache architecture suitable forhigh performance applications. The faulty cells are dynamicallydetected and replaced by adaptively resizing the cache. Thegranularity of our resizing technique is low and hence, thetechnique can handle a large number of faults. This scheme istransparent to processor architecture and has negligible energyand area overhead. This scheme also does not affect the cacheaccess time and has minimum effect on processor performance.Experimental results on a 64K cache implemented using BPTM(Berkeley Predictive Technology Model) 45 nm technology showthat using our technique the effective yield can be increased to94% from its original 33%.
A New Approach Towards Procurement of Software Models Via Distributed Business Models
Authors: Ramin Nasiri, Ali Moeini, Ahmad Abdollahzadeh
Venue: The Journal of Supercomputing (2004)

Nowadays the distributive nature of many modern enterprises leads business strategists to look forward to new solutions which could take over this new requirement. The ever-increasing surge of e-business trend is another driving force for dealing with new distributed environment in addition to the serious need for core software components. On the other hand, the major role of these information systems in survival of business while tight competition exists is a facet which reveals another requirement focused on the robust relationship of business and the system(s) maintaining it. In this paper we aim to introduce a new approach to procure software models by means of the underlying business model. Since the introduction of UML as the latest OMG standard modeling language in 1997, a few researches have been done to use UML as a tool for business modeling. Unfortunately, recent trends are still immature and confronted with shortages and deficiencies. BSUP, which stands for Business to Software Unified Process, is our new approach to fulfill such a goal by means of a proprietary extension of UML. In this work, while analyzing the issues causing problems in the existing methods, we show how BSUP successfully resolves a few of such problems. Issues such as distributed processes, uncertainty in values and associations, ambiguity in the model, lack of precisely defined semantics and etc. may successfully be addressed and resolved. The BSUP is an ongoing work currently being evaluated in Paxan Corp,1 a mid-scale industrial environment and a leading manufacturer of cosmetics and detergent products in the region. So far a few encouraging benefits have been revealed as briefly discussed within this paper.
TSOtool: A Program for Verifying Memory Systems Using the Memory Consistency Model
Authors: Sudheendra Hangal, Durgam Vahia, Chaiyasit Manovit, Juin-Yeu Joseph Lu
Venue: ACM SIGARCH Computer Architecture News (2004)

In this paper, we describe TSOtool, a program to check thebehavior of the memory subsystem in a shared memorymultiprocessor. TSOtool runs pseudo-randomly generatedprograms with data races on a system compliant with theTotal Store Order (TSO) memory consistency model; it thenchecks the results of the program against the formal TSOspecification. Such analysis can expose subtle memory errorslike data corruption, atomicity violation and illegalinstruction ordering.While verifying TSO compliance completely is an NP-completeproblem, we describe a new polynomial timealgorithm which is incorporated in TSOtool. In spite of beingincomplete, it has been successful in detecting several bugs inthe design of commercial microprocessors and systems,during both pre-silicon and post-silicon phases of validation.
Model Checking a Fault-Tolerant Startup Algorithm: From Design Exploration To Exhaustive Fault Simulation
Authors: Wilfried Steiner, John Rushby, Maria Sorea, Holger Pfeifer
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

The increasing performance of modern model-checkingtools offers high potential for the computer-aided designof fault-tolerant algorithms. Instead of relying on humanimagination to generate taxing failure scenarios to probea fault-tolerant algorithm during development, we definethe fault behavior of a faulty process at its interfaces tothe remaining system and use model checking to automaticallyexamine all possible failure scenarios. We call this approach"exhaustive fault simulation". In this paper we illustrateexhaustive fault simulation using a new startup algorithmfor the Time-Triggered Architecture (TTA) and showthat this approach is fast enough to be deployed in the designloop. We use the SAL toolset from SRI for our experimentsand describe an approach to modeling and analyzingfault-tolerant algorithms that exploits the capabilities oftools such as this.
Central Clustering of Attributed Graphs
Authors: Brijnesh J. Jain, Fritz Wysotzki
Venue: Machine Learning (2004)

Partitioning a data set of attributed graphs into clusters arises in different application areas of structural pattern recognition and computer vision. Despite its importance, graph clustering is currently an underdeveloped research area in machine learning due to the lack of theoretical analysis and the high computational cost of measuring structural proximities. To address the first issue, we introduce the concept of metric graph spaces that enables central (or center-based) clustering algorithms to be applied to the domain of attributed graphs. The key idea is to embed attributed graphs into Euclidean space without loss of structural information. In addressing the second issue of computational complexity, we propose a neural network solution of the K-means algorithm for structures (KMS). As a distinguishing feature to improve the computational time, the proposed algorithm classifies the data graphs according to the principle of elimination of competition where the input graph is assigned to the winning model of the competition. In experiments we investigate the behavior and performance of the neural KMS algorithm.
Guest Editors' Introduction: Web Engineering--The Evolution of New Technologies
Authors: Athena I. Vakali, Georgios I. Papadimitriou
Venue: Computing in Science and Engineering (2004)

The Web is now the most popular environment for circulating information as network-accessible data; the exponential growth in this information's dissemination is contributing to the evolution of research topics in the field of Web engineering. This issue of CiSE magazine focuses on understanding and emphasizing engineering topics as they're applied in today's Web environment and infrastructure.