ppxscal/embedding_network huggingface dataset:
Developing a Database for Proteomic Analysis of Extracytosolic Plant Proteins
Authors: Yang Wang, Osmar R. Zaiane, Randy Goebel, Jennafer L. Southron, Urmila Basu, Randy M. Whittal, Julie L. Stephens, Gregory J. Taylor
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Extracytosolic plant proteins are involved in numerous processes including nutrient acquisition, communication with other soil organisms, protection from pathogens, and resistant to disease and toxic metals. We have developed an on-line database to provide the plant biology community with relevant information about extracytosolic plant proteins. Data for Brassica napus (canola) proteins identified using proteomics tools can be accessed using this database. Several textual and graphical query capabilities allow biologists to populate and query this database. Results are displayed with active links to other databases. The system has an open API allowing other applications to access this database as a Web service. In addition, the database is augmented with a repository of tools that can be used in data analysis and mining tasks.
A Defense-Centric Taxonomy Based on Attack Manifestations
Authors: Kevin S. Killourhy, Roy A. Maxion, Kymie M. C. Tan
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Many classifications of attacks have been tendered, oftenin taxonomic form. A common basis of these taxonomies isthat they have been framed from the perspective of an attacker - they organize attacks with respect to the attacker's goals, such as privilege elevation from user to root (fromthe well known Lincoln taxonomy). Taxonomies based onattacker goals are attack-centric; those based on defendergoals are defense-centric. Defenders need a way of determiningwhether or not their detectors will detect a given attack.It is suggested that a defense-centric taxonomy wouldsuit this role more effectively than an attack-centric taxonomy.This paper presents a new, defense-centric attack taxonomy,based on the way that attacks manifest as anomaliesin monitored sensor data.Unique manifestations, drawn from 25 attacks, wereused to organize the taxonomy, which was validated throughexposure to an intrusion-detection system, confirming attackdetectability. The taxonomy's predictive utility wascompared against that of a well-known extant attack-centrictaxonomy. The defense-centric taxonomy is shown to be amore effective predictor of a detector's ability to detect specificattacks, hence informing a defender that a given detectoris competent against an entire class of attacks.
On Pseudoentropy versus Compressibility
Authors: Hoeteck Wee
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

A source is comprehensible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high pseudo-entropy if it is computationally distiguishable from a source of high entropy. In this paper, we present a technique for proving lower bounds on compressibility in an oracle setting, which yields the following results:1. We exhibit oracles relative to which there exists samplable sources over {0, 1}^n of low pseudoentropy (say n/2) that cannot be compressed to length less than n - \omega (\log n) by polynomial size circuits. This matches the upper bounds in [4, 9], and provides an oracle separation between compressibility and pseudoentropy, thereby partially addressing an open problem posed in [6].2. We also provide a separation between 1/s-metric-type pseudoentropy and 1/s-Yao-type pseudoentropy ¿ which are two computational analogues of entropy introduced in [1] ¿ for the class of oracle circuits of sizes (s polynomially bounded). This is the first known separation result for metric-type and Yao-type pseudoentropy.3. In the random oracle model, we show that there exists in compressible functions as defined in [3] where any substantial compression of the output of the function must reveal something about the seed. This yields the first known practical realization of incompressible functions, under the assumption that random oracles may be realized using cryptographic hash functions.Finally, we show that computational assumptions are needed to separate compressibility and pseudoentropy for samplable sources. In particular, if one-way functions do not exist, then any samplable flat source of entropy k can be compressed by circuits to length k + 0(log n); furthermore, any such source has 1/2-Yao-type pseudoentropy k + 0(log n).
Common environment for undergraduate computer programming
Authors: Colin Price, John Price
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

We present an Integrated Environment suitable for learning and teaching computer programming which is designed for both students of specialised Computer Science courses, and also non-specialist students such as those following Liberal Arts. The environment is rich enough to allow exploration of concepts from robotics, artificial intelligence, social science, and philosophy as well as the specialist areas of operating systems and the various computer programming paradigms.
A globally convergent primal-dual interior-point filter method for nonlinear programming
Authors: Michael Ulbrich, Stefan Ulbrich, Lu&#x00ed;s N. Vicente
Venue: Mathematical Programming: Series A and B (2004)

In this paper, the filter technique of Fletcher and Leyffer (1997) is used to globalize the primal-dual interior-point algorithm for nonlinear programming, avoiding the use of merit functions and the updating of penalty parameters.The new algorithm decomposes the primal-dual step obtained from the perturbed first-order necessary conditions into a normal and a tangential step, whose sizes are controlled by a trust-region type parameter. Each entry in the filter is a pair of coordinates: one resulting from feasibility and centrality, and associated with the normal step; the other resulting from optimality (complementarity and duality), and related with the tangential step.Global convergence to first-order critical points is proved for the new primal-dual interior-point filter algorithm.
Incremental Satisfiability Counting for Real-Time Systems
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Testing constraints for real-time systems are usually verifiedthrough the satisfiability of propositional formulae. Inthis paper, we propose an alternative where the verificationof timing constraints can be done by counting the numberof truth assignments instead of boolean satisfiability. Thisnumber can also tell us how "far away" a given specificationis from satisfying its safety assertion. Furthermore,specifications and safety assertions are often modified in anincremental fashion, where problematic bugs are fixed oneat a time. To support this development, we propose an incrementalalgorithm for counting satisfiability. Our proposedincremental algorithm is optimal as no unnecessary nodesare created during each counting. This works for the classof expressions, known as pathRTL ([A graph-theoretic approach for timing analysis and its implementation, RTL and refutation by positive cycles]). To illustrate thisapplication, we show how incremental satisfiability countingcan be applied to a well-known rail-road crossing example,particularly when its specification is still being refined.
Infrared spectra of photochemically grown suboxides and OxyNitrides at the Si/SiO2 interface
Authors: Peter Hess, Jochen Lambers
Venue: Microelectronic Engineering (2004)

Photoinduced growth of ultrathin silicon-oxide and silicon-oxynitride layers on Si(111) and Si(110) was studied at room temperature using F2-laser irradiation (157 nm) in an O2 or N2O atmosphere. The appearance of Si-O, Si-N and N-O phonon bands in the 700-1400 cm1 region was monitored by FTIR-transmission spectroscopy with monolayer resolution. The differences in the IR spectra for normal and oblique incidence of the analyzing IR beam are discussed. The IR and XPS spectra of the ultrathin silicon-oxide and silicon-oxynitride layers of ∼1 nm thickness indicate suboxide species (SiOx, x < 2) in the transition region of several layers in the as-grown layers.
ARIS: an interface for application relocation in an interactive space
Authors: Jacob T. Biehl, Brian P. Bailey
Venue: Proceedings of Graphics Interface 2004 (2004)

By enabling users to better manage information across PDAs, laptops, graphics tablets, and large screens, the use of an interactive space could dramatically improve how users share information in collaborative work. To enable a user to better manage information in an interactive space, we iteratively designed an interactive space window manager called ARIS. We discuss the implementation of ARIS and we share lessons learned from user evaluations about how to design a more effective window manager for an interactive space and how to better evaluate low-fidelity prototypes in an interactive space. Our work can enable richer collaborations among users of an interactive space.
Hyperelliptic theta-functions and spectral methods
Authors: J. Frauendiener, C. Klein
Venue: Journal of Computational and Applied Mathematics (2004)

A code for the numerical evaluation of hyperelliptic theta-functions is presented. Characteristic quantities of the underlying Riemann surface such as its periods are determined with the help of spectral methods. The code is optimized for solutions of the Ernst equation where the branch points of the Riemann surface are parameterized by the physical coordinates. An exploration of the whole parameter space of the solution is thus only possible with an efficient code. The use of spectral approximations allows for an efficient calculation of all quantities in the solution with high precision. The case of almost degenerate Riemann surfaces is addressed. Tests of the numerics using identities for periods on the Riemann surface and integral identities for the Ernst potential and its derivatives are performed. It is shown that an accuracy of the order of machine precision can be achieved. These accurate solutions are used to provide boundary conditions for a code which solves the axisymmetric stationary Einstein equations. The resulting solution agrees with the theta-functional solution to very high precision.
Remote collaboration using Augmented Reality Videoconferencing
Authors: Istvan Barakonyi, Tamer Fahmy, Dieter Schmalstieg
Venue: Proceedings of Graphics Interface 2004 (2004)

This paper describes an Augmented Reality (AR) Videoconferencing System, which is a novel remote collaboration tool combining a desktop-based AR system and a videoconference module. The novelty of our system is the combination of these tools with AR applications superimposed on live video background displaying the conference parties' real environment, merging the advantages of the natural face-to-face communication of videoconferencing and AR's interaction capabilities with distributed virtual objects using tangible physical artifacts. The simplicity of the system makes it affordable for everyday use. We explain our system design based on concurrent video streaming, optical tracking and 3D application sharing, and provide experimental proof that it yields superior quality compared to pure video streaming with successive optical tracking from the compressed streams. We demonstrate the system's collaborative features with a volume rendering application that allows users to display and examine volumetric data simultaneously and to highlight or explore slices of the volume by manipulating an optical marker as a cutting plane interaction device.
Multi-scale Classification of Moving Objects Trajectories
Authors: Cedric du Mouza, Philippe Rigaux
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

In this paper we propose a classification model formoving objects trajectories.We assume that the classificationis based on a multi-scale map, and we simplydefine a trajectory pattern as the sequence of zones anobject crosses during its travel.These patterns constitutethe basis of classification operators.We also definea pattern-based query language which allows an onlineand continuous classification of moving objects.Finallya prototype which shows the validity of the approach isbriefly described.
Gender, educational, and occupational digital gaps 1983-2002
Authors: Susan Carol Losh
Venue: Social Science Computer Review (2004)

Using representative national surveys, this study tracks education, occupation, and gender access and use of digital technology among adults between 1983 and 2002. Although greater parity has occurred, substantial divisions remain. For individuals who owned a home computer, gender, education, and labor force gaps in home Internet access had largely disappeared by 2002, although better educated males still most often used home e-mail. Male college graduates most often had work web access or e-mail. Gender gaps in online time rose from 1995 to 2002; men and very well educated adults increased their hours the most. Occupational variables were critical: many gender differences in information technology (IT) access and use lessened when labor force participation or occupational type were controlled. Although disparities have diminished, digital gaps across gender and educational level and among those with different labor force experiences continue.
A Decentralized Algorithm for Erasure-Coded Virtual Disks
Authors: Svend Frolund, Arif Merchant, Yasushi Saito, Susan Spence, Alistair Veitch
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

A Federated Array of Bricks is a scalable distributedstorage system composed from inexpensive storage bricks.It achieves high reliability with low cost by using erasurecoding across the bricks to maintain data reliability inthe face of brick failures. Erasure coding generates n encodedblocks from m data blocks (n > m) and permits thedata blocks to be reconstructed from any m of these encodedblocks. We present a new fully decentralized erasure-codingalgorithm for an asynchronous distributed system.Our algorithm provides fully linearizable read-write accessto erasure-coded data and supports concurrent I/O controllersthat may crash and recover. Our algorithm relieson a novel quorum construction where any two quorums intersectin m processes.
Task allocation in a multi-server system
Authors: Sem Borst, Onno Boxma, Jan Friso Groote, Sjouke Mauw
Venue: Journal of Scheduling (2003)

We consider a slotted queueing system with C servers (processors) that can handle tasks (jobs). Tasks arrive in batches of random size at the start of every slot. Any task can be executed by any server in one slot with success probability α. If a task execution fails, then the task must be handled in some later time slot until it has been completed successfully. Tasks may be processed by several servers simultaneously. In that case, the task is completed successfully if the task execution is successful on at least one of the servers.We examine the impact of various allocation strategies on the mean number of tasks in the system and the mean response time of tasks. It is proven that both these performance measures are minimized by the strategy which always distributes the tasks over the servers as evenly as possible. Subsequently, we determine the distribution of the number of tasks in the system for a broad class of task allocation strategies, which includes the above optimal strategy as a special case. Some numerical experiments are performed to illustrate the performance characteristics of the various strategies.
Specification of Invocable Semantic Web Resources
Authors: Sudhir Agarwal
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

In this paper, we present a novel approach for specification of invocable semantic web resources in a unified manner. Our approach enables specification of web services,composite web services, web pages and web sites with onesingle process description language in a unified manner.The basic idea behind our work is, that different typesof invocable web resources differ mainly in the ommunication protocol and message formats. The language abstracts from various communication protocols and message formats and hence enables modeling of business logic without worrying much about technical details.Our approach in contrast to existing annotation techniques doesnot enforce the providers to modify their web resources.
Electrical characterization of TiO2 gate Oxides on strained-Si
Authors: C. K. Maiti, S. K. Samanta, G. K. Dalapati, S. K. Nandi, S. Chatterjee
Venue: Microelectronic Engineering (2004)

The electrical properties of low temperature (150 °C) plasma deposited TiO2 gate dielectrics on strained-Si are reported. The deposited films have been analyzed by X-ray photoelectron spectroscopy for chemical composition. The interfacial and electrical properties of the deposited films have been characterized using a metal-insulator-semiconductor (MIS) capacitor structure. The charge trapping properties in TiO2 gate dielectrics have been studied using constant current stressing. The leakage current has been found to be dominated by the Poole-Frenkel emission.
Bus-Driven Floorplanning
Authors: Hua Xiang, Xiaoping Tang, Martin D. F. Wong
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

In this paper, we present an integrated approach to floorplanningand bus planning, i.e., bus-driven floorplanning (BDF). We are givena set of circuit blocks and the bus specifications (i.e., the net list ofblocks for the buses). A feasible BDF solution is a placement ofall circuit blocks such that each bus can be realized as a rectangularstrip (horizontal or vertical) going through all the blocks connectedby the bus. The objective is to determine a feasible BDF solutionthat minimizes floorplan area and total bus area. Our approachis based upon the sequence-pair floorplan representation. After acareful analysis of the relationship between bus ordering and blockordering in the floorplan represented by a sequence pair, we derivefeasibility conditions on sequence pairs that give feasible BDFsolutions. Experimental results demonstrate the efficiency and effectivenessof our algorithm.
Approximation techniques for spatial data
Authors: Abhinandan Das, Johannes Gehrke, Mirek Riedewald
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage spatial objects such as points, lines, and hyper-rectangles, often have very high query processing costs. Accurate selectivity estimation during query optimization therefore is crucially important for finding good query plans, especially when spatial joins are involved. Selectivity estimation has been studied for relational database systems, but to date has only received little attention in SDBMS. In this paper, we introduce novel methods that permit high-quality selectivity estimation for spatial joins and range queries. Our techniques can be constructed in a single scan over the input, handle inserts and deletes to the database incrementally, and hence they can also be used for processing of streaming spatial data. In contrast to previous approaches, our techniques return approximate results that come with provable probabilistic quality guarantees. We present a detailed analysis and experimentally demonstrate the efficacy of the proposed techniques.
Coordinating Views for Data Visualisation and Algorithmic Profiling
Authors: Greg Ross, Alistair Morrison, Matthew Chalmers
Venue: Proceedings of the Second International Conference on Coordinated & Multiple Views in Exploratory Visualization (2004)

A number of researchers have designed visualisation systems that consist of multiple components, through which data and interaction commands flow. Such multistage (hybrid) models can be used to reduce algorithmic complexity, and to open up intermediate stages of algorithms for inspection and steering. In this paper we present work on aiding the developer and the user of such algorithms through the application of interactive visualisation techniques. We present a set of tools designed to profile the performance of other visualisation components, and provide further functionality for the exploration of high dimensional data sets. Case studies are provided, illustrating the application of the profiling modules to a number of data sets. Through this work we are exploring ways in which techniques traditionally used to prepare for visualisation runs, and to retrospectively analyse them, can find new uses within the context of a multi-component visualisation system.
Some problems concerning the Smarandache square complementary function (IV)
Authors: Maohua Le
Venue: Smarandache Notions Journal (2004)

In this paper we determine all solutions of an exponential diophantine equations concerning the Smarandache square complementary function.
Architectural Design and Implementation of Highly Available and Scalable Medical System with IBM WebSphere Middleware
Authors: Han Wang, Hao Wang, Jinmei Shen
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Medical systems require the end-to-end high availability and scalability. There are manycomponents in a medical system, and each individual component contributes to the overallsystem availability and scalability. We present the formulas to assess the overall systemavailability and capacity planning, and we architect approaches and technologies to make allcomponents highly available in all tiers by clustering, workload management, and replication.We discuss how to unify all medical systems and design the uniform framework for differentkinds of medical systems to hook up with this framework so that we can maintain a highlyavailable and highly scalable system with ease. We use the n-tier distributed component based architecture and J2EE technologies as well as web services to interact with .NET and others. We discuss how to program in the framework for high availability and scalability and how to upgrade application software without service interruption to achieve continuous availability. We show how to add or reduce hardware capacity in each tier and how to maintain hardware and software without service interruption as well as how to balance the capacity and availability among tiers.
RTL Power Optimization with Gate-Level Accuracy
Authors: Qi Wang, Sumit Roy
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Traditional RTL power optimization techniques committransformations at the RTL based on the estimation of area, delayand power. However, because of inadequate power and delayinformation, the power optimization transformations applied atthe RTL may cause unexpected results after synthesis, such asworsened delay or increased power dissipation. Our solution tothis problem is to divide RTL power optimization into two steps,namely RTL exploration and gate-level commitment. During RTLexploration phase potential candidates for applying some specificRTL transformation are identified where high level informationpermits faster and more effective analysis. These candidates aresimply "marked" on the netlist. Then during the gate-levelcommitment phase when accurate power and delay information isavailable, the final decision of whether accepting or rejecting thecandidate is made to achieve the best power and delay trade-offs.