ppxscal/embedding_network huggingface dataset:
Quality Evaluation of Web Services
Authors: Feng-Jyh Lin, Kunhuang Huarng, Yi-Min Chen, Shu-Ming Lin
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

The interest in measurement and management of service quality with web-based systems has been issues of concern in recent years. Many business-to-customer markets have become the web-based services and applied the new business models, such as virtual storefront, digital product providers, transaction brokers, on-line services, and auction houses. Although e-commerce applications vary significantly, most successful sites emphasize the important of interaction and service quality. In this study we examine the Chinese websites of the alexa ranking. The findings of our content analysis indicated that most firms use the marketing functions distributed evenly in service quality dimensions. Creating online brand and community is the primary objective on web service. The push technology is the future key function.
Smarandache semi-automaton and automaton
Authors: W. B. Vasantha Kandasamy
Venue: Smarandache Notions Journal (2004)

In this paper we study the Smarandache Semi-Automaton and Automaton using Smarandache free groupoids.
Misuse and Abuse Cases: Getting Past the Positive
Authors: Paco Hope, Gary McGraw, Annie I. Antón
Venue: IEEE Security and Privacy (2004)

Software development is all about making software do something: when software vendors sell their products, they talk about what the particular products do to make customerýs lives easier, such as improving business processes or something similarly positive. Following this trend,most systems for designing software also tend to describe positive features.
Self-Organisation in Agent-Based Mobile Computing
Authors: R. W. Collier, M. J. O'Grady, G. M. P. O'Hare, C. Muldoon, D. Phelan, R. Strahan, Y. Tong
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper describes two self-optimisation techniques that have been employed in the design of two exemplar agent-based mobile computing systems, namely Gullivers Genie and the Agents Channelling ContExt Sensitive Services (ACCESS) architecture. Specifically, we describe how agent cloning is used within Gullivers Genie as a basis for delivering a scalable architecture. Additionally, we describe the concept of collaborative agent tuning, a process in which multiple agents negotiate in order to optimise their overall performance while residing on a Personal Digital Assistant (PDA).
Improving Software Process in Agile Software Development Projects: Results from Two XP Case Studies
Authors: Outi Salo
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

One of the Agile principles is that software development teams should regularly reflect on how to improve their practices to become more effective. Some systematic approaches have been proposed on how to conduct such a self-reflection process, but little empirical evidence yet exits. In this paper, the empirical results are reported from two XP (Extreme Programming) projects where the project teams conducted "post-iteration workshops" after all process iterations in order to improve and optimize working methods. Both qualitative and quantitative data from the total of eight post-iteration workshops is presented in order to evaluate and compare the findings of the two projects. The results show the decline of both positive and negative findings, as well as the narrower variation of negative findings and process improvement actions towards the end of both projects. In both projects, the data from post-iteration workshops indicate increased satisfaction and learning of project teams.
Business Process Simulation with IT Depth
Authors: Akio Koide, Te-Kai Liu, Bala Ramachandran, Makoto Kano
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

We propose a framework for modeling and simulating business processes with IT depth. This enables both business level and IT level users to be supported by a common approach, by developing the models at different levels of granularity. We believe that such a common approach will also progress us toward reducing the gap between business and IT. This approach can be used by business users to analyze a business process to gain insight into the business process and analyze the tradeoffs between different key performance indicators. It can also be used by IT users to analyze the business process at an IT level to gain insight to the tradeoffs between performance and cost and analyze the infrastructure for sizing and capacity planning.
Unit verification: the CARA experience
Authors: Arnab Ray, Rance Cleaveland
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2004)

The computer-aided resuscitation algorithm, or CARA, is part of a US Army-developed automated infusion device for treating blood loss experienced by combatants injured on the battlefield. CARA is responsible for automatically stabilizing a patient&#x2019;s blood pressure by infusing blood as needed based on blood pressure data the CARA system collects. The control part of the system is implemented in software, which is extremely safety critical and thus must perform correctly .This paper describes a case study in which a verification tool, the Concurrency Workbench of the New Century (CWB-NC), is used to analyze a model of the CARA system. The huge state space of CARA makes it problematic to conduct traditional &#x201c;push-button&#x201d; automatic verification such as model checking. Instead, we develop a technique called unit verification, which entails taking small units of a system, putting them in a &#x201c;verification harness&#x201d; that exercises relevant executions appropriately within the unit, and then model checking these more tractable units. For systems like CARA whose requirements are localized to individual system components or interactions between small numbers of components, unit verification offers a means of coping with huge state spaces.
Gene Ontology Friendly Biclustering of Expression Profiles
Authors: Jinze Liu, Wei Wang, Jiong Yang
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

The soundness of clustering in the analysis of gene expression profiles and gene function prediction is based on the hypothesis that genes with similar expression profiles may imply strong correlations with their functions in the biological activities. Gene Ontology (GO) has become a well accepted standard in organizing gene function categories. Different gene function categories in GO can have very sophisticated relationships, such as ýpart ofý and ýoverlappingý. Until now, no clustering algorithm can generate gene clusters within which the relationships can naturally reflect those of gene function categories in the GO hierarchy. The failure in resembling the relationships may reduce the confidence of clustering in gene function prediction. In this paper, we present a new clustering technique, Smart Hierarchical Tendency Preserving clustering (SHTP-clustering), based on a bicluster model, Tendency Preserving cluster (TP-Cluster). By directly incorporating Gene Ontology information into the clustering process, the SHTP-clustering algorithm yields a TP-cluster tree within which any subtree can be well mapped to a part of the GO hierarchy. Our experiments on yeast cell cycle data demonstrate that this method is efficient and effective in generating the biological relevant TP-Clusters.
Framework for Real Time Cloud Rendering
Authors: Muhammad Azam Rana, Mohd Shahrizal Sunar, Mohd Norikhwan Nor Hayat
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

Computer Graphics (CG) is a key technology for producing visual contents. Currently computer generated imagery techniques are being developed and applied, particularly in the field of virtual reality applications, film production, training and flight simulators, to provide total composition of realistic computer graphic images. Clouds are an integral feature of the sky without them synthetic outdoor scenes seems unrealistic. Modeling and animating clouds is a difficult task. Most systems are difficult to use, as they require adjustment of numerous, complex parameters, and are non-interactive. This paper presents an intuitive, interactive system to artistically model, animate, and render visually convincing clouds using modern graphics hardware. A high-level interface models clouds through the visual use of cubes. Clouds are rendered as textured billboards by making use of hardware accelerated API - OpenGL. The resulting interactive design and rendering system produces perceptually convincing cloud models that can be used in any interactive system.
A two-stage mixture model for pseudo feedback
Authors: Tao Tao, ChengXiang Zhai
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Pseudo feedback is a commonly used technique to improve information retrieval performance. It assumes a few top-ranked documents to be relevant, and learns from them to improve the retrieval accuracy. A serious problem is that the performance is often very sensitive to the number of pseudo feedback documents. In this poster, we address this problem in a language modeling framework. We propose a novel two-stage mixture model, which is less sensitive to the number of pseudo feedback documents than an effective existing feedback model. The new model can tolerate a more flexible setting of the number of pseudo feedback documents without the danger of losing much retrieval accuracy.
Towards the next generation of tabletop gaming experiences
Authors: Carsten Magerkurth, Maral Memisoglu, Timo Engelke, Norbert Streitz
Venue: Proceedings of Graphics Interface 2004 (2004)

In this paper we present a novel hardware and software platform (STARS) to realize computer augmented tabletop games that unify the strengths of traditional board games and computer games. STARS game applications preserve the social situation of traditional board games and provide a tangible interface with physical playing pieces to facilitate natural interaction. The virtual game components offer exciting new opportunities for game design and provide richer gaming experiences impossible to realize with traditional media.This paper describes STARS in terms of the hardware setup and the software platform used to develop and play STARS games. The interaction design within STARS is discussed and sample games are presented with regard to their contributions to enhancing user experience. Finally, real-world experiences with the platform are reported.
EAML- Architecture Modeling Language for Enterprise Applications
Authors: Santonu Sarkar, Srinivas Thonse
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

A typical enterprise system comprises of a collection of applications that automate a set of business processes developed over time and distributed in distributed locations. Identifying the appropriate set of formal notations to describe the architecture aspects of an enterprise system is a challenge. Existing notations such as UML and popular ADLs serve the purpose partially. This observation has led us to define an architecture modeling language EAML to address the needs of enterprise systems. In this paper we present an overview of EAML notations and propose a set of views (expressed as diagrams) that uses these notations to describe the architecture through an example.
Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
Authors: Ran Adler, Yossi Azar
Venue: Journal of Scheduling (2003)

We consider the maximum disjoint paths problem and its generalization, the call control problem, in the on-line setting. In the maximum disjoint paths problem, we are given a sequence of connection requests for some communication network. Each request consists of a pair of nodes, that wish to communicate over a path in the network. The request has to be immediately connected or rejected, and the goal is to maximize the number of connected pairs, such that no two paths share an edge. In the call control problem, each request has an additional bandwidth specification, and the goal is to maximize the total bandwidth of the connected pairs (throughput), while satisfying the bandwidth constraints (assuming each edge has unit capacity). These classical problems are central in routing and admission control in high speed networks and in optical networks.We present the first known constant-competitive algorithms for both problems on the line. This settles an open problem of Garay et al. and of Leonardi. Moreover, to the best of our knowledge, all previous algorithms for any of these problems, are Ω(log n)-competitive, where n is the number of vertices in the network (and obviously noncompetitive for the continuous line). Our algorithms are randomized and preemptive. Our results should be contrasted with the Ω(log n) lower bounds for deterministic preemptive algorithms of Garay et al. and the Ω(log n) lower bounds for randomized non-preemptive algorithms of Lipton and Tomkins and Awerbuch et al. Interestingly, nonconstant lower bounds were proved by Canetti and Irani for randomized preemptive algorithms for related problems but not for these exact problems.
Filtering of linear partially observe stochastic systems: the fuzzy logic approach
Authors: T. E. Dabbous
Venue: Dynamics and Control (2001)

In this paper we consider the filtering problem for a class of partially observed systems governed by linear stochastic differential equations. Using Takagi-Sugeno linear fuzzy model and assuming membership functions of Gaussian type, we have proposed minimum unbiased linear fuzzy filter, driven by the observed process, with the help of which the system states can be estimated from the observed data. Further, using calculus of variation, we have developed a set of necessary conditions of optimality on the basis of which filter parameters can be determined. Finally, numerical simulations are presented to illustrate the effectiveness of the proposed filter.
Support hull: relating the cayley-dixon resultant constructions to the support of a polynomial system
Authors: Arthur D. Chtcherba, Deepak Kapur
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

A geometric concept of the support hull of the support of a polynomial was used earlier by the authors for developing a tight upper bound on the size of the Cayley-Dixon resultant matrix for an unmixed polynomial system. The relationship between the support hull and the Cayley-Dixon resultant construction is analyzed in this paper. The support hull is shown to play an important role in the construction and analysis of resultant matrices based on the Cayley-Dixon formulation, similar to the role played by the associated convex hull (Newton polytope) for analyzing resultant matrices over the toric variety. For an unmixed polynomial system, the sizes of the resultant matrices (both dialytic as well as nondialytic) constructed using the Cayley-Dixon formulation are determined by the support hull of its support. Consequently, degree of the projection operator (which is in general, a nontrivial multiple of the resultant) computed from such a resultant matrix is determined by the support hull.The support hull of a given support is similar to its convex hull except that instead of the Euclidean distance, the support hull is defined using rectilinear distance. The concept of a support-hull interior point is introduced. It is proved that for an unmixed polynomial system, the size of the resultant matrix (both dialytic and nondialytic) based on the Cayley-Dixon formulation remains the same even if a term whose exponent is support-hull interior with respect to the support is generically added to the polynomial system. This key insight turned out to be instrumental in generalizing the concept of an unmixed polynomial system with a corner-cut support from 2 dimensions to arbitrary dimension as well as identifying an unmixed polynomial system with almost corner-cut support in arbitrary dimension.An algorithm for computing the size (and the lattice points) of the support hull of a given support is presented. It is proved that determining whether a given lattice point is not in the support hull, is NP-complete. A heuristic for computing a good variable ordering for constructing Dixon matrices for mixed as well as unmixed polynomial systems is proposed using the support hull and its projections. This is one of the first results on developing heuristics for variable orderings for constructing resultant matrices. A construction for a Sylvester-type resultant matrix based on the support hull of a polynomial system is also given.
Life-Inspired Systems
Authors: Lech Jozwiak
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

The recent rapid progress in modern microelectronic technology that enabled implementation of a complete complex information processing system on a single chip or in a single package created new important opportunities, but also new serious difficulties. These difficulties mainly result from the huge and rapidly growing silicon and system complexity, and from the remarkable and growing role of the information technology systems. An adequate solution of these new problems can only be achieved through development and application of new more suitable system and design paradigms, methods and means. This paper aims at a brief analysis of the current situation, future trends and problems in the field of the modern microelectronic-based systems, and a proposal and discussion of a new system paradigm of the life-inspired systems.
On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm
Authors: Nobuo Yamashita, Hiroshige Dan, Masao Fukushima
Venue: Mathematical Programming: Series A and B (2004)

In this paper we focus on the problem of identifying the index sets P(x):={i|xi>0}, N(x):={i|Fi(x)>0} and C(x):={i|xi=Fi(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.
Towards the Design of an Energy-Efficient, Location-Aware Routing Protocol for Mobile, Ad-hoc Sensor Networks
Authors: Aris A. Papadopoulos, Julie A. McCann
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Developments in wireless, mobile communications combined with advancements in electronics have contributed to the emergence of a new class of networks: Wireless ad-hoc sensor networks. Tiny, smart, network-enabled sensing nodes can be deployed to construct sensor fields that form the infrastructure for various self-adaptive and autonomic applications. In this paper we identify the requirements and properties that still need to be addressed and discuss possible approaches that could be adopted in the design of efficient routing protocols for such networks.
Communication-Aware Task Scheduling and Voltage Selection for Total Systems Energy Minimization
Authors: Girish Varatkar, Radu Marculescu
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

In this paper, we present an interprocessor communication-aware task scheduling algorithm applicable to a multiprocessor system executing an application with dependent tasks. Our algorithm takes the application task graph and the architecture graph as inputs,assigns the tasks to processors and then schedules them. As main theoreticalcontribution, the algorithm we propose reduces the overallsystems energy by (i) reducing the total interprocessor communicationand (ii) executing certain cycles at a lower voltage level. Experimentalresults show that by tuning the parameter for communicationawareness, a schedule using our algorithm can reduce upto 80%interprocessor communication in a complex video/audio application(compared to a schedule which is only voltage-selection aware) withoutlosing much in the number of cycles executed at lower voltage.
Designing a High Speed Decoder for Cyclic Codes
Authors: A. M'Sir, F. Monteiro, A. Dandache, B. Lepley
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

This paper proposes a new parallel implementationscheme to increase the bit rate of a cyclic code decoder.The principle is based on the partition of the architectureinto a syndrome calculation bloc and an error accumulationbloc, in order to eliminate the error "decision" functionfrom the feedback loop in the cyclic code decoder.This approach allows effective parallel and pipeliningtechniques to be applied.The resulting high speed parallel architecture hasbeen implemented on FPGA devices from the Altera/Flex10KE family. Bit rates up to 6.8 Gbits/s have been achieved with parallelism level up to 31.
Adaptive Scene Synchronization for Virtual and Mixed Reality Environments
Authors: Felix G. Hamza-Lup, Jannick P. Rolland
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

Technological advances in virtual environmentsfacilitate the creation of distributed collaborativeenvironments, in which the distribution of three-dimensionalcontent at remote locations allows efficientand effective communication of ideas. One of thechallenges in distributed shared environments ismaintaining a consistent view of the shared information,in the presence of inevitable network delays and variablebandwidth. A consistent view in a shared 3D scene maysignificantly increase the sense of presence amongparticipants and improve their interactivity. This paperintroduces an adaptive scene synchronization algorithmand a framework for integration of the algorithm in adistributed real-time virtual environment. In spite ofsignificant network delays, results show that objects canbe synchronous in their viewpoint at multiple remotelylocated sites. Furthermore residual asynchronicity isquantified as a function of network delays and scalability.
Characterizing Power Consumption and Delay of Functional/Library Components for Hardware/Software Co-Design of Embedded Systems
Authors: Amjad Mohsen, Richard Hofmann
Venue: Proceedings of the 15th IEEE International Workshop on Rapid System Prototyping (2004)

This article introduces a library of pre-characterizedcomponents to support hardware/software co-design ofreal-time embedded systems starting from high abstractionlevels, e.g. formal description techniques. The library includeshardware components of different types and granularitymodelled for power consumption, delay and area.Software components are also modelled. These softwarecomponents range from the basic instructions set of a processorto a set of optimized library functions and IP coresused in the areas of DSP and image processing. Designtradeoffs enabled by the presence of different types of thesame component can be efficiently utilized by the cosynthesisprocess. The co-synthesis process is refined inthis article by an allocation-refinement step for this purpose.