ppxscal/embedding_network huggingface dataset:
Automated assessment of GUI programs using JEWL
Authors: John English
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

This paper describes a system for the automated assessment of GUI-based programs. This uses the JEWL library, a set of Java packages designed for use by complete beginners to Java which allows students to build GUI-based programs from the 'Hello world' stage onwards. This paper describes how JEWL has also been designed so that it can be used to assess such programs automatically.
A New Approach to Clustering Biological Data Using Message Passing
Authors: Huimin Geng, Dhundy Bastola, Hesham Ali
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Clustering algorithms are widely used in bioinformatics to classify data, as in the analysis of gene expression and in the building of phylogenetic trees. Biological data often describe parallel and spontaneous processes. To capture these features, we propose a new clustering algorithm that employs the concept of message passing. Message Passing Clustering (MPC) allows data objects to communicate with each other and produces clusters in parallel, thereby making the clustering process intrinsic. We have proved that MPC shares similarity with Hierarchical Clustering (HC) but offers significantly improved performance because it takes into account both local and global structure. We analyzed 35 sets of simulated dynamic gene expression data, achieving a 95% hit rate in which 639 genes out of total 674 genes were correctly clustered. We have also applied MPC to a real data set to build a phylogenetic tree from aligned mycobacterium sequences. The results show higher classification accuracies as compared to traditional clustering methods such as HC.
A New Approach of Lateral RF MEMS Switch
Authors: M. Tang, A. Q. Liu, A. Agarwal, Q. X. Zhang, P. Win
Venue: Analog Integrated Circuits and Signal Processing (2004)

This paper presents a novel lateral series microwave switch fabricated on a silicon-on-insulator (SOI) substrate with a finite ground coplanar waveguide (FGCPW) configuration which is laterally actuated by the electrostatic force. The switch is built with a cantilever beam in the direction of the signal line and a fixed electrode is located opposite the cantilever beam. The mechanical structures are fabricated using SOI deep reactive ion etching (DRIE) and shadow mask technology. The fabricated lateral RF MEMS switch has an isolation of 16 dB at 20 GHz. The insertion loss of the switch is 1 dB and return loss is 15 dB at 20 GHz. The threshold voltage is 19.2 V and switching time is 30 &mu;s.
Multi-bit storage through Si nanocrystals embedded in SiO2
Authors: S. Lombardo, D. Corso, I. Crupi, C. Gerardi, G. Ammendola, M. Melanotte, B. De Salvo, L. Perniola
Venue: Microelectronic Engineering (2004)

We have realized Si nanocrystal memory cells in which the Si dots have been deposited by CVD on SiO2 and then covered by a CVD control oxide. In this paper, we report a study on the potential of these cells for dual bit storage.
Network Based Intrusion Detection to Detect Steganographic Communication Channels - On the Example of Images
Authors: Danny Hesse, Jana Dittmann, Andreas Lang
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Today we find a wide variety of Intrusion Detection Systems (IDS). They can detect attacks against network services or certain hosts. These attacks often violate integrity, availability and confidentiality of a IT-System or its data. One attack against data is the loss of confidentiality. With the help of stegographic tools one can hide data in a cover media and transmit it over the network. At this time nowadays no Intrusion Detection System is available to detect this security violation. In this paper we discuss the design of an IDS that is able to detect steganographic communication in image data. Future Intrusion Response Systems (IRS) could be trigged by the IDS to react in accordance to the policy.
An Efficient Optimal Leaf Ordering for Hierarchical Clustering in Microarray Gene Expression Data Analysis
Authors: Jianting Zhang, Le Gruenwald
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The objective of this paper is to derive an efficient and optimal ordering method for genes produced by binary hierarchical clustering. The proposed method examines all possible 2{n-1} orderings in O(n^2) time complexity.
Distributed Algorithms for Balanced Zone Partitioning in Content-Addressable Networks
Authors: Daisuke Takemoto, Shigeaki Tagashira, Satoshi Fujita
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

In this paper, we propose several distributed zone partitioning schemes for Content-Addressable Networks (CAN), that is known as apure peer-to-peer system based on the DistributedHash Table (DHT). The main objective of the proposedschemes is to balance the load of nodes inthe CAN system, in such a way that every nodereceives almost the same number of inquiries fromthe other nodes in the system. The result of simulationsimplies that, by using the proposed schemesinstead of a randomized scheme originally implementedin the CAN system, we could reduce the response time for each inquiry to less than 75%.
Application of a Genetic Algorithm/K-Nearest Neighbor Method to the Classification of Renal Cell Carcinoma
Authors: Dongqing Liu, Ting Shi, Joseph A. DiDonato, John D. Carpten, Jianping Zhu, Zhong-Hui Duan
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

In this study, we use a genetic algorithm and k-nearest neighbor method to classify two subtypes of renal cell carcinoma using a set of microarray gene expression profiles of nine samples (three clear cell tumors and six papillary tumors). We show that the genetic algorithm/k-nearest neighbor method can be efficiently used in identifying a panel of discriminator genes. To test the robustness of the algorithm, we perform a bootstrapping analysis that removes one sample from the data set at a time and uses the remaining samples for gene selection. We show that each of the removed samples can be classified correctly. We also analyze the stability of the algorithm and the sensitivity of the algorithm with respect to different samples.
Automating Variations in Clinical Research Protocols Workflow
Authors: Massoud Vahabzadeh, Jia-Ling Lin, Anne Gupman, John Schmittner, Kenzie Preston
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Clinical research protocols follow rigorous methodologies requiring painstaking precisionin every step of the process. A variety of factors determine the required steps an individualparticipant will take throughout the protocol timeline. Such steps could easily become morecomplicated and complex in a research setting aimed at new discoveries, which requirevarious degrees of flexibility depending on the specific conditions at various points of thestudy. In this paper we describe our Protocol Workflow System (PWS), which is designed toaccommodate all of the current and potential future protocols while simultaneously providingthe capability for workflow adjustments during various phases of ongoing studies.Furthermore, it is robust enough to organize and handle participants who are enrolledconcurrently in multiple protocols. This automated system not only collects information at anoutpatient research center, but also automates the workflow and data collection pointsthroughout the clinic.
ARCOLite " An XML Based System for Building and Presenting Virtual Museum Exhibitions Using Web3D and Augmented Reality
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

This paper describes ARCOLite, our low costXML based client-server architecture for buildingand presenting digital heritage content in virtualmuseums. Our system includes components forcreation and refinement of virtual artefacts includingvirtual reconstruction of buildings; XML contentmanagement, XML technologies for contentrepositories and presentation; and contentvisualisation using Web3D, virtual and augmentedreality.
Very Low Voltage MOS Translinear Loops Based on Flipped Voltage Followers
Authors: Antonio J. López-Martín, Alfonso Carlosena, Jaime Ramirez-Angulo
Venue: Analog Integrated Circuits and Signal Processing (2004)

A novel technique for operating MOS Translinear loops at very low supply voltages is described, based on the use of Flipped Voltage Followers for biasing the loops. The resulting topologies, suited to standard CMOS processes, can be successfully applied to a varied repertory of low-voltage analog circuits, such as squarers, multipliers, filters, oscillators, and RMS-DC converters. Measurement results for a geometric-mean and a squarer/divider circuit demonstrate on silicon the usefulness of this technique.
Generic Insecurity of Cliques-Type Authenticated Group Key Agreement Protocols
Authors: Olivier Pereira, Jean-Jacques Quisquater
Venue: Proceedings of the 17th IEEE workshop on Computer Security Foundations (2004)

The A-GDH.2 and SA-GDH.2 authenticated group keyagreement protocols showed to be flawed at CSFW 2001.Even though the corresponding attacks (or some variantsof them) have been rediscovered in several different frameworks,no fixed version of these protocols has been proposeduntil now.In this paper, we describe a proof that it is in fact impossibleto design a scalable authenticated group key agreementprotocol based on the same building blocks as the A-GDHones. We proceed by providing a systematic way toderive an attack against any A-GDH-type protocol with atleast four participants (and exhibit protocols with two andthree participants which we cannot break). As far as weknow, this is the first generic insecurity result reported inthe literature concerning authentication protocols.
Modeling and simulation of product's surface design
Authors: Li Wenfeng, Wu Zhenyu, Chen Dingfang
Venue: Computers and Industrial Engineering (2004)

Surface design and structure design are two aspects of product design. Product information can be perfectly described only if both of them are organically united. The impact of a product's appearance on its performance and decoration has been given much attention in engineering and on the market. The existing CAD system does not suffice for surface design, which is still designed with experience and handicraft. This case does not accommodate new market development. To grapple with this problem, a representation of appearance features, an aided design of the figure and the surface design, which is based on mapping, are detailed in this paper. A design system of surface design and an instance of its application are given at the end of the paper.
A Choice of Weights for Convex Combination Methods in Estimating Partial Derivatives
Authors: Y. Ooi, L. H. T. Chang, Y. P. Wong, A. R. M. Piah
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

Weights in convex combination methods are important parameters in the estimation of partial derivative values in three dimensional scattered data points. In this paper, we introduce the three angles of the base triangle as weights in order to have more options for weight variety.
DataMover: Robust Terabyte-Scale Multi-file Replication over Wide-Area Networks
Authors: Alex Sim, Junmin Gu, Arie Shoshani, Vijaya Natarajan
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

Typically, large scientific datasets (order of terabytes)are generated at large computational centers,and stored on mass storage systems. However, largesubsets of the data need to be moved to facilitiesavailable to application scientists for analysis. Filereplication of thousands of files is a tedious, errorprone, but extremely important task in scientificapplications. The automation of the file replicationtask requires automatic space acquisition and reuse,and monitoring the progress of staging thousands offiles from the source mass storage system, transferringthem over the network, archiving them at thetarget mass storage system or disk systems, andrecovering from transient system failures. We havedeveloped a robust replication system, calledDataMover, which is now in regular use in High-Energy-Physics and Climate modeling experiments. Only a single command is necessary to request multi-filereplication or the replication of an entiredirectory. A web-based tool was developed todynamically monitor the progress of the multi-filereplication process.
Adaptive Resource Allocation Control with On-Line Search for Fair QoS Level
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Recently, applications of control theory to avoid overloadconditions have been studied. But, in conventionalfeedback theory, control input is determined by an error betweena reference value of a controlled signal and its currentvalue. In real-time systems, a set of active tasks maybe time-varying so that the reference value may change accordingto the set. In this paper, we proposed a novel controlmethod for a fair resource allocation and QoS levelsof tasks are used as controlled signals. The proposed adaptationcontroller allocates a CPU utilization factor to eachtask with on-line search for the fair QoS level, and the proposedcontrol rule is based on errors between the currentQoS levels and their average. Its computation time is smallso that it does not yield a heavy overhead.
VORPAL: a versatile plasma simulation code
Authors: Chet Nieter, John R. Cary
Venue: Journal of Computational Physics (2004)

VORPAL is a new plasma simulation code designed for maximum flexibility through use of advance C++ techniques. Through use of inheritance. VORPAL incorporates multiple models for the plasma and electromagnetic fields. The plasma models include both particle-in-cell and fluid models. Through C++ meta-template programming a single code can be used to simulate one-, two-, or three-dimensional systems with no less of performance. VORPAL can also be run in either serial or parallel, with the latter using a general domain decomposition. A new fluid algorithm that allows for regions of zero density was developed and incorporated into the code. VORPAL simulation results for the generation of laser wake fields through laser-plasma interaction are presented.
Observations in the computer room: L2 output and learner behaviour
Authors: Christine Leahy
Venue: ReCALL (2004)

This article draws on second language theory, particularly output theory as defined by Swain (1995), in order to conceptualise observations made in a computer-assisted language learning setting. It investigates second language output and learner behaviour within an electronic role-play setting, based on a subject-specific problem solving task and the Internet as source of primary information. Students were given a task which includes the collaborative development of a marketing strategy for a chosen product. Data collected consists of the following corpora: emails exchanged between groups, the recorded discussions between each group&rsquo;s members while engaged in the problem solving activity, oral presentation of the groups&rsquo; results as well as the individually written summaries. One area of particular interest is the analysis of the oral L2 output while solving a computer-assisted language learning task. How can the oral interaction be characterised? What kind of conclusions regarding the use of CALL can be drawn from the comparison of the oral interaction and the written output? Another area of interest is the analysis of the written L2 output. Is there evidence of second language acquisition and/or acquisition of content? Can such a CALL setting promote second language acquisition (SLA) and/or acquisition of content? Finally, the study aims to identify whether student-initiated focus on language form can be found. The article answers the questions posed above. Furthermore, the results of this study show that a very high percentage of all communication took place in L2 and occurrences of acquisition of content and language can be demonstrated.
Displacement rank of the Drazin inverse
Authors: Huaian Diao, Yimin Wei, Sanzheng Qiao
Venue: Journal of Computational and Applied Mathematics (2004)

In this paper, we study the displacement rank of the Drazin inverse. Both Sylvester displacement and the generalized displacement are discussed. We present upper bounds for the ranks of the displacements of the Drazin inverse. The general results are applied to the group inverse of a structured matrix such as close-to-Toeplitz, generalized Cauchy, Toeplitz-plus-Hankel, and Bezoutians.
Fast Optimization of Fixed-Polarity Reed-Muller Expansions over GF(5)
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

An efficient algorithm for optimization of Fixed-Polarity Reed-Muller (FPRM) expansions over GF(5) is developed in this paper. The new algorithm operates onFPRM expansion in polarity zero of a five-valued functionand completely generates its FPRM polarity matrix toobtain its best FPRM expansion. Due to the simplicity andrecursive nature of the algorithm, it can be implementedefficiently using fast parallel programming. This, togetherwith low computational cost enhances the effectiveness ofthis algorithm as shown by the presented experimentalresults. The proposed algorithm can also be utilized toderive FPRM expansions in specific polarities withoutfirst constructing the complete polarity matrix.
Foundation of the DISIMA Image Query Languages
Authors: Vincent Oria, M. Tamer Özsu, Paul J. Iglinski
Venue: Multimedia Tools and Applications (2004)

Because digital images are not meaningful by themselves, images are often coupled with some descriptive or qualitative data in an image database. These data, divided into syntactic (color, shape, and texture) and semantic (meaningful real word object or concept) features, necessitate novel querying techniques. Most image systems and prototypes have focussed on similarity searches based upon the syntactic features. In the DISIMA system, we proposed an object-oriented image data model that introduces two main types: image (that represents an image and its descriptive properties) and salient object (that represents the semantics of an image). We further defined operations on the images and the salient objects as new joins. This approach is necessary in order to envision a declarative query language for images. This paper summarizes the querying facilities implemented for the DISIMA system and gives their theoretical foundation: the data model and the complementary algebraic operations, the textual query language (MOQL) and its visual counterpart (VisualMOQL) based on an image calculus. Both languages are declarative and allow the combination of semantic and similarity queries.
Finite Element Methods in Local Active Control of Sound
Authors: Alfredo Bermúdez, Pablo Gamallo, Rodolfo Rodríguez
Venue: SIAM Journal on Control and Optimization (2004)

The active control of sound is analyzed in the framework of the mathematical theory of optimal control. After setting the problem in the frequency domain, we deal with the state equation, which is a Helmholtz partial differential equation. We show the existence of a unique solution and analyze a finite element approximation when the source term is a Dirac delta measure. Two optimization problems are successively considered. The first one concerns the choice of phases and amplitudes of the actuators to minimize the noise at the sensors' location. The second one consists of determining the optimal actuators' placement. Both problems are then numerically solved. Error estimates are settled and numerical results for some tests are reported.
An a priori error estimate for finite element discretizations in nonlinear elasticity for polyconvex materials under small loads
Authors: Carsten Carstensen, Georg Dolzmann
Venue: Numerische Mathematik (2004)

We prove optimal a priori error estimates in W1,p for finite element minimizers of polyconvex energy functionals with small applied loads. The proof relies on a quantitative version of Zhang&#x2019;s stability estimate (K. Zhang, Arch. Rat. Mech. Anal. 114 (1991), 95-117).
Quantum lower bounds for the collision and the element distinctness problems
Authors: Scott Aaronson, Yaoyun Shi
Venue: Journal of the ACM (JACM) (2004)

Given a function f as an oracle, the collision problem is to find two distinct indexes i and j such that f(i) = f(j), under the promise that such indexes exist. Since the security of many fundamental cryptographic primitives depends on the hardness of finding collisions, our lower bounds provide evidence for the existence of cryptographic primitives that are immune to quantum cryptanalysis. We prove that any quantum algorithm for finding a collision in an r-to-one function must evaluate the function &Omega;((n/r)1/3) times, where n is the size of the domain and r|n. This matches an upper bound of Brassard, H&oslash;yer, and Tapp. No lower bound better than constant was previously known. Our result also implies a quantum lower bound of &Omega;(n2/3) queries for the element distinctness problem, which is to determine whether n integers are all distinct. The best previous lower bound was &Omega;(&sqrt;n) queries.
Why there aren't more information security research studies
Authors: Andrew G. Kotulic, Jan Guynes Clark
Venue: Information and Management (2004)

Noting a serious lack of empirical research in the area of security risk management (SRM), we proposed a conceptual model based on the study of SRM at the firm level. Although considerable time and effort were expended in attempting to validate the usefulness of the proposed model, we were not successful. We provide here a description of our conceptual model, the methodology designed to test this model, the problems we faced while attempting to test the model, and our suggestions for those who attempt to conduct work in highly sensitive areas.
Robust query processing through progressive optimization
Authors: Volker Markl, Vijayshankar Raman, David Simmen, Guy Lohman, Hamid Pirahesh, Miso Cilimdzic
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation errors can occur due to the use of inaccurate statistics, invalid assumptions about attribute independence, parameter markers, and so on. Cardinality estimation errors may cause the optimizer to choose a sub-optimal plan. We present an approach to query processing that is extremely robust because it is able to detect and recover from cardinality estimation errors. We call this approach "progressive query optimization" (POP). POP validates cardinality estimates against actual values as measured during query execution. If there is significant disagreement between estimated and actual values, execution might be stopped and re-optimization might occur. Oscillation between optimization and execution steps can occur any number of times. A re-optimization step can exploit both the actual cardinality and partial results, computed during a previous execution step. Checkpoint operators (CHECK) validate the optimizer's cardinality estimates against actual cardinalities. Each CHECK has a condition that indicates the cardinality bounds within which a plan is valid. We compute this validity range through a novel sensitivity analysis of query plan operators. If the CHECK condition is violated, CHECK triggers re-optimization. POP has been prototyped in a leading commercial DBMS. An experimental evaluation of POP using TPC-H queries illustrates the robustness POP adds to query processing, while incurring only negligible overhead. A case-study applying POP to a real-world database and workload shows the potential of POP, accelerating complex OLAP queries by almost two orders of magnitude.