ppxscal/embedding_network huggingface dataset:
Zero-Knowledge Proofs of Identity Based on ELGAMAL on Conic
Authors: Dalu Zhang, Min Liu, Zhe Yang
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

A protocol for zero-knowledge proofs of identity based on ElGamal on conic is proposed in this paper. The solution to a hard puzzle is divided into two parts, and the P (prover) provides one of them according to the V (verifier)ýs random bit. The eavesdropper cannot obtain any useful knowledge about the P (prover)'s identity during the process of authentication. No adversary in this protocol can cheat each other or get the privacy of each other. The security of this protocol relies on the discrete logarithm problem on conic over finite fields. Compared with those identification protocols implemented on elliptic, these kinds of identification protocols implemented on conic can be designed and implemented easier. Corresponding to the simple version, a parallel version is presented subsequently. The characteristic of ZKp and security of the simple version is proved. The trait of our identification protocol is given. We also analyzed the "soundness", the "completeness", before analyzed the amount of computation in the protocol. A simple solution considering t{timeout} is proposed to prevent a potential leak of our protocol. Some problems need to be solved in the future is brought forward at the end of this paper.
A Generalized Method for Computing Oscillator Phase Noise Spectra
Authors: Piet Vanassche, Georges Gielen, Willy Sansen
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

This paper presents a generalized semi-analytic method for computingoscillator phase noise spectra, including the details veryclose to the oscillation frequency. The starting point is a generalrelation between an oscillator's output power spectral density andthe characteristics of the input noise processes. For weak inputnoise processes that vary sufficiently fast over time, this relation reducesto an analytic expression. For cases that do not satisfy theseconditions, the relation is, in part, evaluated numerically. This isaccomplished using techniques for exponential data fitting. The resultingmethod is able to compute oscillator phase noise spectra fora wide range of input noise characteristics.
Dependable Adaptive Real-Time Applications in Wormhole-based Systems
Authors: Pedro Martins, Paulo Sousa, Antonio Casimiro, Paulo Verissimo
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

This paper describes and discusses the work carried onin the context of the CORTEX project, for the developmentof adaptive real-time applications in wormhole based systems. The architecture of CORTEX relies on the existence of a timeliness wormhole, called Timely Computing Base(TCB), which we have described in previous papers. Herewe focus on the practical demonstration of the wormholeconcept, through a demo with two complementary facets.The objective is to illustrate the effectiveness of the conceptfrom a practical, yet rigorous, perspective, which is donewith the help of an emulation framework that we present inthe paper. Furthermore, the paper also describes two different ways of implementing timeliness wormholes on top of both wired and wireless infrastructures.
A Graph Analysis Method to Detect Metabolic Sub-Networks Based on Phylogenetic Profile
Authors: Shoko Miyake, Yoichi Takenaka, Hideo Matsuda
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

To elucidate fundamental constituting principle of functional modules or building blocks of metabolic networks, computational methods to analyze the network structure of metabolism are getting much attention. We propose a graph search method to extract highly conserved sub-networks of metabolic networks based on phylogenetic profile. We formulated reaction-conservation score for the measure of the phylogenetic conservation of reactions. We also formulated compound-conservation score to eliminate biologically-meaningless compounds and reduce the size of the networks. By applying our approach to the metabolic networks of 19 representative organisms selected from bacteria, archaea, and eukaryotes in the KEGG database, we detected some highly conserved sub-networks among the organisms. Comparing them to the metabolic maps in KEGG, we found they were mainly included in energy metabolism, sugar metabolism, and amino acid metabolism.
Mappings for rapid prototyping
Authors: Martin S. Feather
Venue: Proceedings of the workshop on Rapid prototyping (1982)

The transformational methodology for software development is adapted to perform rapid conversion of specifications into prototypes. This makes feasible testing of specifications to observe their behaviours and assuring that specifications can indeed be implemented.The approach is centered on gathering techniques to map each type of specification language construct into a reasonably efficient implementation. Instances of these constructs in an actual specification may then serve as the focal points for the conversion process.
Determining Collisions between Moving Spheres for Distributed Virtual Environments
Authors: Kier Storey, Fengyun Lu, Graham Morgan
Venue: Proceedings of the Computer Graphics International (2004)

We present an approach to collision detection thatis appropriate for satisfying the requirements ofinterest management schemes used in distributedvirtual environments. Such environments arecharacterized by their distributed deployment overnumber of nodes connected via a computer network.The aim of an interest management scheme is toidentify when objects that populate a simulationsupported by a distributed virtual environment (objectscould be hosted on different nodes) should beinteracting via message exchange while preventingobjects that should not be interacting from exchangingmessages. The approach to collision detectionpresented in this paper produces accurate results whendetermining object interactions. Furthermore, wepresent variations on our approach that exploit anycoherence that may exist in a simulation to providesolution that may scale for large numbers of objects.
Model-Based Generation of Business Component Architectures
Authors: Hugo Vidal Teixeira, Regina M. Braga, Claudia M. L. Werner
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

The definition of business component architecture represents a challenging goal in component-based software engineering.Despite the several approaches to this subject, difficulties still arise when designing and assembling components to provide an integrated solution. The problem we focus on this work is the absence of rules that make use of analysis models to guide the architect throughout the specification of a component-based architecture.This lack of support results in a series of laborious and non-automated activities.In order to increase the abstraction level of the business component architecture specification task and reduce design efforts, this work presents a practical proposal aimed at generating business components from analysis models.To achieve this goal, some rules and procedures have been researched and evolved, guiding the software architect during the development process.
Selection of Patient Samples and Genes for Outcome Prediction
Authors: Huiqing Liu, Jinyan Li, Limsoon Wong
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Gene expression profiles with clinical outcome data enable monitoring of disease progression and prediction of patient survival at the molecular level. We present a new computational method for outcome prediction. Our idea is to use an informative subset of original training samples. This subset consists of only short-term survivors who died within a short period and long-term survivors who were still alive after a long follow-up time. These extreme training samples yield a clear platform to identify genes whose expression is related to survival. To find relevant genes, we combine two feature selection methods ¿ entropy measure and Wilcoxon rank sum test ¿ so that a set of sharp discriminating features are identified. The selected training samples and genes are then integrated by a support vector machine to build a prediction model, by which each validation sample is assigned a survival/relapse risk score for drawing Kaplan-Meier survival curves. We apply this method to two data sets: diffuse large-B-cell lymphoma (DLBCL) and primary lung adenocarcinoma. In both cases, patients in high and low risk groups stratified by our risk scores are clearly distinguishable. We also compare our risk scores to some clinical factors, such as International Prognostic Index score for DLBCL analysis and tumor stage information for lung adenocarcinoma. Our results indicate that gene expression profiles combined with carefully chosen learning algorithms can predict patient survival for certain diseases.
Real-time update of access control policies
Authors: Indrakshi Ray
Venue: Data Knowledge Engineering (2004)

Access control policies are security policies that govern access to resources. The need for real-time update of such policies while they are in effect and enforcing the changes immediately, arise in many scenarios. Consider, for example, a military environment responding to an international crisis, such as a war. In such situations, countries change strategies necessitating a change of policies. Moreover, the changes to policies must take place in real-time while the policies are in effect. In this paper we address the problem of real-time update of access control policies in the context of a database system. Access control policies, governing access to the data objects, are specified in the form of policy objects. The data objects and policy objects are accessed and modified through transactions. We consider an environment in which different kinds of transactions execute concurrently some of which may be policy update transactions. We propose algorithms for the concurrent and real-time update of security policies. The algorithms differ on the basis of the concurrency provided and the semantic knowledge used.
After you
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

A power struggle for one and simply an act of kindness for another. There is a thin line between good manners and manipulative behavior. "After You" is a comical play derived from that very line. Copyright held by creator.
A Unified Framework for User-Controlled Simplification
Authors: Muhammad Hussain, Yoshihiro Okada, Koichi Niijima
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

Polygonal Models are ubiquitous in every application of Computer Graphics but their real time manipulation and rendering in such interactive application environments as are sensitive to their sizes and complexity have become a threat. A whole family of automatic algorithms emerged during the last decade to help out this problem, but they reduce the complexity of the models uniformly without caring about semantic importance of localized parts of a mesh. Only a few algorithms deal with adaptive simplification of polygonal models. We propose a new unified framework for user-driven simplification exploiting the simplification hierarchy and hypertriangulation model [1], which lends a user the most of the functionalities of existing adaptive simplification algorithms in one place. The proposed new underlying data structures are compact and support real time navigation across continuous LODs of a model. Comparison with related work shows that the proposed framework provides combined environment at reduced overhead of memory space usage and faster running times.
QoS Control Strategies for High-Quality Video Processing
Authors: Clemens C. Wust, Liesbeth Steffens, Reinder J. Bril, Wim F. J. Verhaegh
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

Video processing in software is often characterized byhighly fluctuating, content-dependent processing times, anda limited tolerance for deadline misses. We present anapproach that allows close-to-average-case resource allocationto a single video processing task, based on asynchronous,scalable processing, and QoS adaptation. TheQoS adaptation balances different QoS parameters that canbe tuned by user-perception experiments: picture quality,deadline misses, and quality changes. We model the balancingproblem as a discrete stochastic decision problem, andpropose two closely related solution strategies, for whichthe processing-time statistics are determined off line and atrun time, respectively. We enhance both strategies with acompensation for structural (non-stochastic) load fluctuations.Finally, we validate our approach by means of simulationexperiments, and conclude that both enhanced strategiesperform close to the theoretical optimum.
Exigo
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

Through the realistic fantasy world of the Exigo computer game, the film portrays the death of a nameless soldier in the land of the Mordens. In making the animation, DICK Pictures gathered together Hungary's most experienced CG artists. Primary aims were to fully execute all details, reflected in the extremely thorough models, character textures and fineness of movement, and to create a visual world which uses graphics originally yet remains photorealistic, moving the viewer deeply both in detail and as a whole. Copyright held by creator.
The Effects of Spatial Resolution on an Automated Diabetic Retinopathy Screening System's Performance in Detecting Microaneurysms for Diabetic Retinopathy
Authors: B. Raman, E. S. Bursell, M. Wilson, G. Zamora, I. Benche, S. C. Nemeth, P. Soliz
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

This paper presents the effects of image quality, given by the number of pixels used todefine the image. A microaneurysm (MA) segmentation algorithm that has been shown toachieve about 90% sensitivity and specificity for clinical classification using high resolutionimages of those diabetic patients who present with MAs was applied to low resolution imagesto assess the effects of lower resolution of sensitivity and specificity. The low resolution (640by 480 pixels) 45° field of view (FOV) was provided by a non-mydriatic camera. Highresolutions images from a mydriatic fundus camera were acquired by digitizing 35mm colorfilm slides to 1400 x 1200 pixels for a 30° FOV. The image quality of the digitized 35mmimages was considerably better than those from the non-mydriatic camera. Segmentation ofmicroaneurysms (MAs) was performed using the green channel image of the two modalities.The images were contrast enhanced and corrected for uneven illumination. The images werethen filtered using a tophat morphological filter and a threshold applied to segment thecandidate MAs. Because the retinal vessels are similar in intensity and contrast to MAs, theretinal vasculature was segmented using matched filters to remove the vessel artifacts fromthe image. Ground truth, which was provided by an ophthalmic analyst, was used in thetuning step to find the bounds of the different intensity and shape features that characterizethe MAs. These features were used to distinguish between MAs from other artifactual objectson the image. The best result that could be achieved with the lower resolution images was70% sensitivity and specificity. We have found that the effects of pixel resolution on anautomated segmentation routine to be of significant in obtaining higher sensitivity andspecificity.
Software assurance by bounded exhaustive testing
Authors: Kevin Sullivan, Jinlin Yang, David Coppit, Sarfraz Khurshid, Daniel Jackson
Venue: ACM SIGSOFT Software Engineering Notes (2004)

The contribution of this paper is an experiment that shows the potential value of a combination of selective reverse engineering to formal specifications and bounded exhaustive testing to improve the assurance levels of complex software. A key problem is to scale up test input generation so that meaningful results can be obtained. We present an approach, using Alloy and TestEra for test input generation, which we evaluate by experimental application to the Galileo dynamic fault tree analysis tool.
Association Tests and Estimation of Haplotype Frequencies and of Penetrance-Related Parameters in a Case-Control Study
Authors: Shiori Furihata, Toshikazu Ito, Naoyuki Kamatani
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

This study shows the applicability of our algorithm which tests haplotype and qualitative phenotype association, in a case-control study. Although our algorithm named PENHAPLO is originally developed for analysis of a cohort study, it is shown that PENHAPLO is a useful tool for analysis of case-control studies as well. Simulations confirms that type I errors under null hypothesis are accurately estimated. The statistical power for alternative hypothesis calculated using the algorithm is comparable to those analyzed using known-phase data.
On the necessity of cryptanalytic exhaustive search
Authors: Martin E. Hellman, Ehud D. Karnin, Justin Reyneri
Venue: ACM SIGACT News (1983)

It is shown that the amount of computation required for a general cryptanalytic method is equivalent to an exhaustive search over the key space. In particular, any general time-memory tradeoff must do an exhaustive search as a part of the pre- or post-computation.
Resource Estimation and Task Scheduling for Multithreaded Reconfigurable Architectures
Authors: Arvind Sudarsanam, Mayur Srinivasan, Sethuraman Panchanathan
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Reconfigurable computing is an emerging paradigm of research that offers cost-effective solutions for computationally intensive applications through hardware reuse. There is agrowing need in this domain for techniques to exploit parallelisminherent in the target application and to schedule the parallelizedapplication. This paper proposes a method to estimate theoptimal number of resources through critical path analysis whilekeeping resource utilization near optimal. We also propose anovel algorithm to optimally schedule the parallel threads ofexecution in linear time. Our algorithm is based on the ideaof enhanced Partial Critical Path (ePCP) and handles memorylatencies and reconfiguration overheads. Results obtained showthe effectiveness of our approach over other critical path based methods.
Polynomial equation solving by lifting procedures for ramified fibers
Authors: A. Bompadre, G. Matera, R. Wachenchauzer, A. Waissbein
Venue: Theoretical Computer Science (2004)

Let be given a parametric polynomial equation system which represents a generically unramified family of zero-dimensional algebraic varieties. We exhibit an efficient algorithm which computes a complete description of the solution set of an arbitrary parameter instance from a complete description of the infinitesimal structure of a particular ramified parameter instance of our family. This generalizes in the case of space curves previous methods of Heintz et al. and Schost, which require the given parameter instance to be unramified. We illustrate our method solving particular polynomial equation systems by deformation techniques.
Rate-Based and Queue-Based Dynamic Load Balancing Algorithms in Distributed Systems
Authors: Zeng Zeng, Bharadwaj Veeravalli
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

In this paper, we classify the dynamic, decentralized loadbalancing algorithms for heterogenous distributed computersystems into three policies: queue adjustment policy(QAP), rate adjustment policy (RAP) and Queue and RateAdjustment Policy (QRAP). We propose two efficient algorithms,referred to as Rate based Load Balancing via VirtualRouting (RLBVR) and Queue based Load Balancing viaVirtual Routing (QLBVR), which belong to the above RAPand QRAP policies, respectively. We also consider algorithmsEstimated Load Information Scheduling Algorithm(ELISA) that was introduced in the literature, to implementQAP policy. Our focus is to analyze and understand the behaviorsof these algorithms in terms of their load balancingability under varying load conditions (light, moderate, orhigh) and the minimization of mean response time of jobs.We compare the above classes of algorithms by a number ofrigorous simulation experiments to elicit their behavior undersome influencing parameters. From these experiments,recommendations are drawn to prescribe the suitability ofthe algorithms under various situations.
Distributed server replication in large scale networks
Authors: Bong-Jun Ko, Dan Rubenstein
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

Quality of service for high-bandwidth or delay-sensitive applications in the Internet, such as streaming media and online games, can be significantly improved by replicating server content. We present a decentralized algorithm that allocates server resources to replicated servers in large-scale client-server networks to reduce network distance between each client and the nearby replicated server hosting the resources of interest to that client. Preliminary simulation results show that our algorithm converges quickly to an allocation that reduces the expected client-server distance by almost half compared to the distance when the assignment of replicated servers is done at random.
The E-Salesman System
Authors: Magdalene P. Ting, Vishal Seth, Jerry Gao
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Current e-commerce websites employ designs that are elaborate displays of product catalogs. The drawback is the presence of complex navigation and keyword searches to find products. Customers rely solely on their own decision to purchase a product. In addition, itýs difficult to distinguish online retailers from one another based on the web-front; the identity of the web business and the portrayal of genuineness are lost. The human and personal element seen in traditional shopping is most often not present when shopping online. This paper discusses and proposes a solution to these problems. The e-Salesman System (eSS) aims to simulate the human element of traditional shopping for online sales.
Conditional selectivity for statistics on query expressions
Authors: Nicolas Bruno, Surajit Chaudhuri
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Cardinality estimation during query optimization relies on simplifying assumptions that usually do not hold in practice. To diminish the impact of inaccurate estimates during optimization, statistics on query expressions (SITs) have been previously proposed. These statistics help directly model the distribution of tuples on query sub-plans. Past work in statistics on query expressions has exploited view matching technology to harness their benefits. In this paper we argue against such an approach as it overlooks significant opportunities for improvement in cardinality estimations. We then introduce a framework to reason with SITs based on the notion of conditional selectivity. We present a dynamic programming algorithm to efficiently find the most accurate selectivity estimation for given queries, and discuss how such an approach can be incorporated into existing optimizers with a small number of changes. Finally, we demonstrate experimentally that our technique results in superior cardinality estimations than previous approaches with very little overhead.