ppxscal/embedding_network huggingface dataset:
A Fuzzy Based Approach for the Real-Time Capture and Dissemination of Visual Interest Information in Shared Environments
Authors: Rameshsharma Ramloll, Jaishree Beedasy
Venue: Proceedings of the Second International Conference on Coordinated & Multiple Views in Exploratory Visualization (2004)

Participants in collaborative sessions, whether in reality or virtuality, often experience difficulties interacting if all they can perceive about peer activities are actions without context. Contextual information has a significant influence on the evolution of collaborative interactions by allowing opportunities for timely interruptions and for peer intents to be identified. Computer Supported Cooperative Work (CSCW) researchers have demonstrated collaborative systems that allow geographically dispersed users to work together synchronously. Evaluations of this class of systems have confirmed the need for transmitting at a distance, contextual cues, some socially relevant and others task relevant, in addition to the actions of the participants. For example, in a real world collaborative drawing task, cues that help to establish context can take the form of peer gestures, e.g. hand movements, gaze pursuits, gaze fixations, and head shifts. Unfortunately, in real-time groupware systems, resources for context building often cannot be made available. System specific constraints restrict user representations to artifacts that do not have sufficient expressive power to describe gestures. Thus, we propose a strategy to deal with the lack of contextual linkage between views of a collaborative information space that do not lend themselves easily to effective peer user representations.
Secure Distributed DNS
Authors: Christian Cachin, Asad Samar
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

A correctly working Domain Name System (DNS) is essentialfor the Internet. Due to its significance and because ofdeficiencies in its current design, the DNS is vulnerable toa wide range of attacks. This paper presents the design andimplementation of a secure distributed name service on thelevel of a DNS zone. Our service is able to provide fault toleranceand security even in the presence of a fraction ofcorrupted name servers, avoiding any single point of failure.It further solves the problem of storing zone secretsonline without leaking them to a corrupted server, whilestill supporting secure dynamic updates. Our service usesstate-machine replication and threshold cryptography. Wepresent results from experiments performed using a prototypeimplementation on the Internet in realistic setups. Theresults show that our design achieves the required assuranceswhile servicing the most frequent requests in reasonable time.
An adaptive multiple retransmission technique for continuous media streams
Authors: Rishi Sinha, Christos Papadopoulos
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

Retransmission can be used for loss recovery in continuous media applications but the number of retransmission attempts is bounded by the size of the playout buffer. For efficient recovery, a protocol must attempt as many retransmissions as possible but avoid late retransmissions. This typically requires that the playout buffer be sized in round-trip time (RTT) multiples plus some margin for error. RTT-based timers are then used to trigger retransmissions. However, this approach is problematic due to (i) the high variation in RTT commonly encountered in the Internet, and (ii) the coarse granularity of timers typically used in protocol implementations.We present two new retransmission-based protocols, for unicast and multicast respectively, which eliminate RTT estimation and timer-triggered events. As a result, our protocols are immune to errors due to RTT jitter and timer granularity and recover more losses, while better suppressing unnecessary retransmission requests and retransmissions than timer-based protocols. At the same time, our protocols are simpler to implement and degrade more gracefully than timer-based protocols.
A Service Model for Component-Based Development
Authors: John Hutchinson, Gerald Kotonya, Ian Sommerville, Stephen Hall
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

The promise of component-based development - the development of large-scale applications from off-the-shelf software components - may remain elusive unless we complement the facilitating technologies with processes that are designed to take account - and advantage - of components right from the start. Blackbox components present a number of serious challenges whose impact may offset the potential benefits of their use unless they can be addressed successfully. We describe a process that makes use of a service-model to map user-requirements to components, and which offers support for some of the challenges posed: component-oriented requirements elicitation, negotiation, design, verification and change management. Our approach also supports a hybrid component/service-based development where off-the-shelf components and services can co-exist in the same system.
Novel Canonic Current Mode DDCC Based SRCO Synthesized Using a Genetic Algorithm
Authors: Varun Aggarwal
Venue: Analog Integrated Circuits and Signal Processing (2004)

A survey of the technical literature reveals that synthesis of Current Mode (CM) oscillators using single active building block (ABB) requires an additional identical or complementary current terminal to sense and take out the current output. The topologies of these oscillators are essentially based on the current mode approach. They use a Voltage Controlled Voltage Source (VCVS) and two current terminals to implement the CM oscillator. In the present paper, a novel DDCC (Differential Difference Current Conveyor, introduced in Chiu et al. (IEE Proc., Circuits, Devices, Syst., vol. 143, no. 2, pp. 91&ndash;96, 1996)) based canonic CM Single-Resistor Controlled Oscillator (SRCO) is presented, which uses a VCVS and a single current terminal to take out the output. Earlier, authors used DDCCC (Differential Difference Complementary Current conveyor), DVCCC (Differential Voltage Complementary Current Conveyor) to implement CM oscillators and hypothesized the requirement of an additional current terminal for the output. The synthesis of present topology indicates that DDCC is a versatile building block to implement canonic CM SRCOs and doesn't need any additional current terminal. This topology was synthesized using an innovative genetic algorithm. Spice simulations have been included and they verify theoretical results.
Deconstruction and Reconstruction of Heterogeneous Electronic Product Catalogues for Semantic Interoperation
Authors: Jingzhi Guo, Chengzheng Sun, David Chen
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

A very important issue in constructing global electronic markets is to enable semantic interoperation between fragmented electronic markets by constructing an interoperable electronic product catalogue (EPC) for product data exchange. Nevertheless, the heterogeneous EPCs are highly complex, which causes the severe semantic inconsistency that prevents from semantic interoperation between them. To reduce complexity and to provide a solution to semantic consistency maintenance, this paper has developed a theory of deconstruction and reconstruction. The theory deconstructs heterogeneous EPCs into ordered concepts, structures and semantic relations by a proposed articulation approach. It reconstructs the deconstructed units into a novel CONEX framework for component EPC integration. The CONEX maintains semantic consistency amongst heterogeneous component EPCs in structure, concept and context.
On the k-full number sequences
Authors: Xu Zhefeng
Venue: Smarandache Notions Journal (2004)

The main purpose of this paper is to study the asymptotic property of the k-full numbers (where k ≥ 2 is a fixed integer), and obtain some interesting asymptotic formulas.
Space-Conserving Optimal DNA-Protein Alignment
Authors: Pang Ko, Mahesh Narayanan, Anantharaman Kalyanaraman, Srinivas Aluru
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

DNA-protein alignment algorithms can be used to discover coding sequences in a genomic sequence, if the corresponding protein derivatives are known. They can also be used to identify potential coding sequences of a newly sequenced genome, by using proteins from related species. Previously known algorithms either solve a simplified formulation, or sacrifice optimality to achieve practical implementation. In this paper, we present a comprehensive formulation of the DNA-protein alignment problem, and an algorithm to compute the optimal alignment in O(mn) time using only four tables of size (m + 1) × (n + 1), wheremand n are the lengths of the DNA and protein sequences, respectively. We also developed a Protein and DNA Alignment program PanDA that implements the proposed solution. Experimental results indicate that our algorithm produces high quality alignments.
Requirements and Design of an Integrated European Environmental Information Communication System (IEEICS)
Authors: Keith Rennolls, Tim Richards, Alex Fedorec, Moh Ibrahim, Kevin McManus, Alun Butler
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The needs for various forms of information systems relating to the European environment and ecosystem are reviewed, and limitations indicated.. Existing information systems are reviewed and compared in terms of aims and functionalities. We consider TWO technical challenges involved in attempting to develop an IEEICS. First, there is the challenge of developing an internet-based communication system which allows fluent access to information stored in a range of distributed databases. Some of the currently available solutions are considered, i.e. Web Service Federations. The second main challenge arises from the fact that there is general intra-national heterogeneity in the definitions adopted, and the measurement systems used throughout the nations of Europe. Integrated strategies are needed.
Multiscale resolution in the computation of crystalline microstructure
Authors: S&#x00f6;ren Bartels, Andreas Prohl
Venue: Numerische Mathematik (2004)

This paper addresses the numerical approximation of microstructures in crystalline phase transitions without surface energy. It is shown that branching of different variants near interfaces of twinned martensite and austenite phases leads to reduced energies in finite element approximations. Such behavior of minimizing deformations is understood for an extended model that involves surface energies. Moreover, the closely related question of the role of different growth conditions of the employed bulk energy is discussed. By explicit construction of discrete deformations in lowest order finite element spaces we prove upper bounds for the energy and thereby clarify the question of the dependence of the convergence rate upon growth conditions and lamination orders. For first order laminates the estimates are optimal.
The complexity of pure Nash equilibria
Authors: Alex Fabrikant, Christos Papadimitriou, Kunal Talwar
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We investigate from the computational viewpoint multi-player games that are guaranteed to have pure Nash equilibria. We focus on congestion games, and show that a pure Nash equilibrium can be computed in polynomial time in the symmetric network case, while the problem is PLS-complete in general. We discuss implications to non-atomic congestion games, and we explore the scope of the potential function method for proving existence of pure Nash equilibria.
New Wide Band Low Power CMOS Current Conveyors
Authors: Wessam S. Hassanein, Inas A. Awad, Ahmed M. Soliman
Venue: Analog Integrated Circuits and Signal Processing (2004)

New Class-A second-generation CMOS current conveyor (CCII) suitable for high frequency applications is proposed. It provides low input impedance and accurate voltage and current tracking. Targeting low power dissipation, the Class-AB version of the proposed Class-A architecture is introduced as well. Simulation results are included.
Interactive Visual Exploration of Multidimensional Data: Requirements for CommonGIS with OLAP
Authors: Angi Voss, Vera Hernandez, Hans Voss, Simon Scheider
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper investigates requirements for a spatial and business intelligence tool. As a starting point it takes CommonGIS, an advanced software for interactive visual exploration of spatial data, and explores how to connect it to OLAP warehouses as another source of multidimensional data.
An integrative model of computer abuse based on social control and general deterrence theories
Authors: Sang M. Lee, Sang-Gun Lee, Sangjin Yoo
Venue: Information and Management (2004)

In spite of continuous organizational efforts and investments, computer abuse shows no sign of decline. According to social control theory (SCT), "organizational trust" can help prevent it by enhancing insiders' involvement in computer abuse. The aim of our study was to develop a new integrative model for analyzing computer abuse through assessing the role of Self Defense Intention (SDI) and Induction Control Intention (ICI). The results show that deterrence factors influence SDI and organizational factors significantly affect ICI and ICI decreases insiders' abuse. Interestingly, SDI negatively affects both insiders' and invaders' abuses.
Adaptive extraction and visualization of silhouette curves from volumetric datasets
Authors: Sagi Schein, Gershon Elber
Venue: The Visual Computer: International Journal of Computer Graphics (2004)

An algorithm for silhouette extraction from volumetric data is presented. Trivariate tensor product B-spline functions are used to represent the data. An offline phase that arranges the data in a lookup table is employed to improve the computation time during an interactive session. A subdivision scheme is employed to extract the silhouette curves from an implicit trivariate B-spline function. The produced results are smooth, high-quality silhouette curves when compared to voxel-based silhouette extraction schemes.
Predictive, Stochastic and Dynamic Extensions to Aversion Dynamics Scheduling
Authors: Gary W. Black, Kenneth N. McKay, Sherri L. Messimer
Venue: Journal of Scheduling (2004)

Schedulers' decisions in real factories deal with perceived risks and impacts. They proactively anticipate and reactively mitigate risky events by altering what would be considered a normal schedule to minimize associated impacts. These risk mitigation concepts are called aversion dynamics (AD). Aversion dynamics describes the aversion that jobs exhibit to impacts resulting from risky events in dynamic and unstable production environments. The aversion manifests itself in either advancing or delaying the work to avoid the risky period. This paper extends the first AD heuristic, Averse-1, to capture additional real-world dynamics and to make the heuristic predictive (proactive) as to when the perceived risky event may happen. In particular, predictive and stochastic elements are incorporated within a dynamic job arrival framework to create an extended heuristic called Averse-2.
Indices of nonlinearity in finger force interaction
Authors: Simon R. Goodman, Mark L. Latash, Vladimir M. Zatsiorsky
Venue: Biological Cybernetics (2004)

Experiments with force production by subsets of fingers within the human hand have shown that finger interaction may be significantly nonlinear. In particular, this nonlinearity is reflected in the phenomenon of force deficit, a drop of the peak force of a finger when several fingers act simultaneously. We describe nonlinear effects in force relations within finger pairs, triplets, etc. Finger forces are represented as the sums of components resulting from force interactions within all subsets of the explicitly involved (master) fingers. The values of these components computed at extreme values of control signals, zero and unity, are taken as indices of such &#x201c;elementary&#x201d; force interactions. Indices of the first order reflect purposeful force production by a single master finger and its effects on forces produced by other fingers (enslaving). Indices of the second order reflect additional influences from pairs of simultaneously recruited master fingers, etc. Force interaction indices were computed based on finger forces measured in earlier experiments. Signs of indices alternated with their order, being positive for the indices of the first order (enslaving), negative for the indices of the second order (force deficit), positive for the indices of the third order, and mostly negative for the indices of the fourth order. Indices of the third and fourth orders reflect phenomena of force interaction not reported earlier. The study emphasizes the importance of nonlinear interactions among finger forces and introduces a set of independent indices that can be used to quantify such interactions in different subpopulations and their possible changes with practice and/or rehabilitation of the hand function.
Lightweight coarse-grained coordination: a scalable system-level approach
Authors: Tiziana Margaria, Bernhard Steffen
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2004)

In this paper, our solution to the problem of modelling functionally complex communication systems at the application level, based on lightweight coordination, is extended to seamlessly capture system-level testing as well. This extension could be realized simply by self-application: the bulk of the work for integrating system-level testing into our development environment, the ABC, concerned domain modelling, which can be done using the ABC. Therefore, the extension of the ABC to cover system-level testing was merely an application development on the basis of the ABC, illustrated here in the domain of Computer Telephony Integration. Here the adoption of a coarse-grained approach to test design, which is central to the scalability of the overall testing environment, is the enabling aspect for system-level test automation. Together with our lightweight coordination approach this induces an understandable modelling paradigm of system-wide test cases that is adequate for the needs and requirements of industrial test engineers. In particular, it enables test engineers to graphically design complex test cases that, in addition, can even be automatically checked for their intended purposes via model checking.
Scheduling of Iterative Algorithms on FPGA with Pipelined Arithmetic Unit
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

This paper presents a scheduling technique for a libraryof arithmetic logarithmic modules for FPGA illustrated ona RLS filter for active noise cancellation. The problem underassumption is to find an optimal periodic cyclic schedulesatisfying the timing constraints. The approach is basedon a transformation to monoprocessor cyclic schedulingwith precedence delays. We prove that this problem is NP-hard and we suggest a solution based on Integer Linear Programming that allows to minimize completion time. Finallyexperimental results of optimized RLS filter are shown.
A Markov-Decision-Based Price Comparison Problem for Mobile AGent-based Internet Commerce System (MAGICS)
Authors: Perry P. Y. Lam, Henry C. B. Chan
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Mobile agents are well suited for facilitating the consumer buying process on the Internet, particularly for comparing prices. In this paper, we present a mobile agent-based e-commerce system, called MAGICS, that addresses some issues concerning price comparisons. After providing an overview of the MAGICS architecture, we use the Markov decision theory to formulate a price comparison problem. The objective of the problem is to obtain an optimal decision policy in order to buy a product at the lowest expected cost, including the traveling costs. The problem was solved using the backward induction algorithm. Some analytical results are presented and discussed.
Generalized Pre-Scheduler
Authors: Weirong Wang, Aloysius K. Mok, Gerhard Fohler
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

A pre-schedule is a list of "executives" generated offlinefor a set of time-driven jobs. If in addition there existsevent-driven workload competing for resources, sufficient slacks must be embedded in a valid pre-schedule. A pre-scheduler was defined in [13] with the following assumptions:the competing workload is modeled as sporadictasks and the time-driven jobs to be pre-scheduled are independent.In this paper, the pre-scheduling problem isgeneralized. First, the event-driven workload is no longerlimited to sporadic tasks or any specific task model. Instead,a new concept called "pre-scheduling space" is introducedso that the time-driven jobs to be pre-scheduledare inside the space, the competing event-driven workloadis outside the space, and resource competition is abstractedto the space bounded by a supply function and a supplycontract. Second, precedence constraints between the time-drivenjobs to be pre-scheduled are allowed. The generalizedpre-scheduler presented in this paper produces a validpre-schedule if and only if one exists under the constraintsof execution time bounds, valid scopes, precedence requirementsand supply contract; otherwise, it returns a notice offailure. The generalized pre-scheduler runs in time polynomialto the number of time-driven jobs.
Application of Squeak/Croquet Environment for Embedded Systems Development
Authors: Masahiro Sakai, Yasutaka Ishizaki, Atsushi Togawa, Tsuyoshi Yamamoto
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

Development processes of embedded systems havebeen discussed many years and there exist number ofadvanced development environments. A well-designeddevelopment system may give us a unified designconcept but such environment consists of componentsprovided by a single vender in most case. A mixedvender environment can pick up nice feature of eachsystem, however the coherency of concept andoperation may sacrifice. In this paper, we discussabout unification of design process based on UMLmethodology. We are developing prototype ofSqueak/Croquet based embedded system developmentenvironment in which mixed-vender designcomponents are integrated in unified operation style.
The Maximum Queue Length for Heavy-Tailed Service Times in the M/G/1 FB Queue
Authors: M. F. M. Nuyens
Venue: Queueing Systems: Theory and Applications (2004)

This paper treats the maximum queue length M, in terms of the number of customers present, in a busy cycle in the M/G/1 queue. The distribution of M depends both on the service time distribution and on the service discipline. Assume that the service times have a logconvex density and the discipline is Foreground Background (FB). The FB service discipline gives service to the customer(s) that have received the least amount of service so far. It is shown that under these assumptions the tail of M is bounded by an exponential tail. This bound is used to calculate the time to overflow of a buffer, both in stable and unstable queues.