ppxscal/embedding_network huggingface dataset:
Successful Process Implementation
Authors: Anna Borjesson, Lars Mathiassen
Venue: IEEE Software (2004)

Traditional approaches to measuring software process improvement are typically lengthy, data intensive, and cost prohibitive. A simple indicator, the extent to which engineering practices change, can provide enough information to guide initiatives toward success. The authors performed such an analysis at Ericsson to learn how different improvement tactics influenced SPI outcome.
An asymptotic formula involving square complement numbers
Authors: Lou Yuanbing
Venue: Smarandache Notions Journal (2004)

The main purpose of this paper is to study the mean value properties of the square complement number sequence {S(n)}, and give an interesting asymptotic formula involving S(n).
A new proof of a characterisation of Pfaffian bipartite graphs
Authors: Serguei Norine, C. H. C. Little, Kee L. Teo
Venue: Journal of Combinatorial Theory Series B (2004)

In (J. Combin. Theory Ser. 18 (1975) 187) Little proved that a bipartite graph G is Pfaffian if and only if it does not contain an even subdivision H of K3.3 such that G - VH contains a l-factor. This paper gives a significantly shorter proof of this theorem.
Investigation of Copper removal efficiency on reclaimed wafers with HF-based solutions
Authors: A. Abbadie, S. Favier, C. Giroud, T. Billon
Venue: Microelectronic Engineering (2004)

Eliminating Cu contaminants is essential to preserve material integrity in silicon device fabrication. Cu must indeed be efficiently removed from wafer back-sides and front-sides to avoid any cross-contamination. It is all the more important when wafers are repetitively processed in a reclaim industry. In this paper, we investigate copper removal efficiency with different HF-based wet-cleans. We show that copper deposits on the Si surface thanks to an electrochemical reaction between Si and Cu. As this mechanism is influenced by the pH and the redox-potential of the solution, we have explored the effects of reagents such as HCl and oxidant additives such as H2O2 on copper removal. We have concentrated on the efficiency of these cleanings and on the front-side Si surface morphology after treatment. We find that for our applications, additives in the HF solution of the SC2/HF/SC2 clean do not improve the surface morphology. On the contrary, they underline a heterogeneous surface topographic aspect. We suspect that aggregates form, resulting from Cu gettering by impurities in the silicon lattice following an out-diffusion of copper. However, the morphology can be significantly improved by adding an oxidizing agent such as HF-HNO3 in HF-based solutions. A smooth surface is obtained with a good copper removal efficiency. We thus conclude that Cu etching is strongly dependant on the nature and on the amount of oxidants in the HF solutions as well as the oxido-reduction potential of the solution.
Covert channels and anonymizing networks
Authors: Ira S. Moskowitz, Richard E. Newman, Daniel P. Crepeau, Allen R. Miller
Venue: Proceedings of the 2003 ACM workshop on Privacy in the electronic society (2003)

There have long been threads of investigation into covert channels, and threads of investigation into anonymity, but these two closely related areas of information hiding have not been directly associated. This paper represents an initial inquiry into the relationship between covert channel capacity and anonymity, and poses more questions than it answers. Even this preliminary work has proven difficult, but in this investigation lies the hope of a deeper understanding of the nature of both areas. MIXes have been used for anonymity, where the concern is shielding the identity of the sender or the receiver of a message, or both. In contrast to traffic analysis prevention methods which conceal larger traffic patterns, we are concerned with how much information a sender to a MIX can leak to an eavesdropping outsider, despite the concealment efforts of MIXes acting as firewalls.
Community Story Exchange
Authors: Trevor Collins, Paul Mulholland, Zdenek Zdrahal
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Storytelling is a method by which members of a community communicate, learn and build identity. Here we describe Community Story Exchange (CSE), a generic storytelling environment customised for two quite different communities. One is a special interest community of adults engaged in heritage. The other is a virtual community of two schools. In trails, CSE was successfully used by both communities and further extensions were suggested including an extended range of collaboration models and the incorporation of synchronous events.
Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
Venue: International Workshop on Network and Operating System Support for Digital Audio and Video (2004)

Welcome to NOSSDAV 2004, the 14th International Workshop on Network and Operating Systems Support for Digital Audio and Video. The workshop is sponsored by ACM SIGMM, with support from Microsoft Research, the U.S. National Science Foundation, and Science Foundation Ireland, with secondary support by IBM Research, and is being held in cooperation with ACM SIGCOMM and ACM SIGMOBILE. We are delighted to have you join us in beautiful Kinsale, County Cork, Ireland. We'd like to say a few words about the program, how it was put together, and the many people who helped make it happen.NOSSDAV 2004 features a 2-day technical program featuring 24 technical papers, a keynote talk titled "Beyond Content Delivery: Applications to the Edge" by Bill Weihl, CTO of Akamai, and a panel moderated by Hui Zhang of Carnegie Mellon University. The technical papers span a wide range of topics, both traditional ones such as streaming, overlay networking, and congestion control & scheduling as well as emerging topics such as wireless multimedia and networked games. We do hope that you will find this rich and varied program stimulating.This year we received a total of 95 submissions from all over the world, a 75% increase over the number from last year. We employed a multi-phase reviewing process where each paper was reviewed initially by two PC members followed by additional reviews and PC discussion of papers where the decision wasn't clear. In the end, we selected 24 papers for presentation (yielding a selective 25% acceptance rate), based both on their technical contribution and potential for sparking discussion at the workshop.
The largest eigenvalue of nonregular graphs
Authors: Dragan Stevanović
Venue: Journal of Combinatorial Theory Series B (2004)

We give an upper bound for the largest eigenvalue of a nonregular graph with n vertices and the largest vertex degree Δ.
Calibration Issues for Projector-based 3D-Scanning
Venue: Proceedings of the Shape Modeling International 2004 (2004)

In this paper we want to introduce a new approachto 3D scanning of dynamic scenes. This implementationenables the user not only to manually move a scan head over theobject to scan but also to capture moving objects. Registrationfrom scan to scan is done in real-time. The user interacts withthe system and watches the scene assembling. He can immediatelyrespond on shadings that occur due to undercuts in thescene. The chosen structured light scan method uses a primarilyunknown speckle image that can be easily etched on a chrome-on-glass slide and projected using a strobe light. In the currentlarge scale implementation we are using a standard videobeamer and a standard digital camera. Miniaturization andadaptation for special purposes (i. e. medical applications) arescheduled for next year. Focus in this paper shall be laid oncalibration issues regarding camera and projector
Some Properties of Local Partial Clones on an Infinite Set
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

We investigate interpolation and extrapolationproperties of partial clones of infinite-valued logicfunctions. Maximal local partial clone on an infinite set Eis characterized by conditions on its intersections with thefull partial clone on every finite subset A \subset E, {\rm{2 }} \le \left| A \right| \le \infty.Next the criterion is given for a finite domain partialoperation of a local partial clone to be extendable toeverywhere defined operation from the same clone. Similarcriterion is also given for a local partial clone to beextendable. Finally, extendibility conditions for partialorders are obtained so that the clones of their partial n-endomorphismsbecome extendable.
Animating visible speech and facial expressions
Authors: Jiyong Ma, Ronald Cole
Venue: The Visual Computer: International Journal of Computer Graphics (2004)

We present four techniques for modeling and animating faces starting from a set of morph targets. The first technique involves obtaining parameters to control individual facial components and learning the mapping from one type of parameter to another through machine learning techniques. The second technique is to fuse visible speech and facial expressions in the lower part of a face. The third technique combines coarticulation rules and kernel smoothing techniques. Finally, a new 3D tongue model with flexible and intuitive skeleton controls is presented. The results of eight animated character models demonstrate that these techniques are powerful and effective.
Improving document representation by accumulating relevance feedback (abstract only): the relevance feedback accumulation algorithm
Authors: Razvan Stefan Bot
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

This paper presents a document representation improvement technique named the Relevance Feedback Accumulation (RFA) algorithm. Using prior relevance feedback assessments and a data mining measure called support this algorithm improves document representations and generates higher quality indexes. At the same time, the algorithm is efficient and scalable, suited for retrieval systems managing large document collections. The results of the preliminary evaluation reveal that the RFA algorithm is able to reduce the index dimensionality while improving retrieval effectiveness.
Using Temporal Logics for Modeling and Analysis of Workflows
Authors: Yuan Wang, Yushun Fan
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

In this paper, a method for modeling and analyzing workflows based on Temporal Logic of Actions is presented. After a brief review of TLA, present the semantic of workflow process using TLA and illustrate how to modeling and analysis workflow using TLA. In TLA, both the workflow model and its properties are modeled by TLA formulas. Analysis of workflow model in TLA is carried out by validating the implication relationship between two formulas. Finally, the process of modeling and analysis is validated through a case study.
Path Delay Estimation using Power Supply Transient Signals: A Comparative Study using Fourier and Wavelet Analysis
Authors: Abhishek Singh, Jitin Tharian, Jim Plusquellic
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Transient Signal Analysis (TSA) is a parametric device testingtechnique based on the analysis of dynamic (transient) current(i{DDT}) drawn by the core logic from the power supply pads in aCMOS digital circuit. In previous work, we develop a test procedurethat can be used both to detect signal variations caused bydefects and to obtain delay information in defect free chips. Phasespectra of transient signals obtained using discrete Fourier transformare shown to track path delays of defect-free chips under awide range of process variations. However, in recent work, wewere able to demonstrate through simulation experiments incorporatingdeep submicron transistor models, a circuit design andpath sensitization scenario in which our existing TSA method isnot able to yield accurate predictions of path delays. More specifically,a circuit composed of two inverter chains constructed withwidely varying transistor sizes was shown to produce path delaysthat were weakly correlated across a set of worst case processmodels. In this paper, an alternative wavelet-based analysis ofi{DDT} waveforms is shown to improve the accuracy of predictingmultiple path delays under these conditions.
Switch-Factor Based Loop RLC Modeling for Efficient Timing Analysis
Authors: Yu Cao, Xiao-dong Yang, Xuejue Huang, Dennis Sylvester
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Timing uncertainty caused by inductive and capacitivecoupling is one of the major bottlenecks in timing analysis. In thispaper, we propose an effective loop RLC modeling technique toefficiently decouple lines with both inductive and capacitivecoupling. We generalize the RLC decoupling problem based ontransmission line theory and a switch-factor, which is the voltageratio between two nets. This switch-factor is also known as theMiller factor and is widely used to model capacitive coupling.The proposed modeling technique can be directly applied to partialRLC netlists extracted using existing parasitic extraction toolswithout advance knowledge of the return path. The new modelaccurately captures the impact of neighboring switching activitywhen it significantly affects the size of current return loop. Asdemonstrated in our experiments, the new model accuratelypredicts both upper and lower delay bounds as a function ofneighboring switching patterns. Therefore, this approach can beeasily implemented into existing timing analysis flows such asmax-timing and min-timing analysis. Finally, we apply the newmodeling approach to a range of activities across the designprocess including timing optimization, static timing analysis, highfrequency clock design, and data-bus wire planning.
Architecture of Wireless Sensor Node using Novel Ultra-Wideband Modulation Scheme
Authors: Matthew D'Souza, Adam Postula
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Recently ultra-wideband (UWB) communications has emerged as an alternative to narrowband communications used in wireless sensor networks. One of UWB(s) most attractive feature for wireless sensors is that it can produce high data throughput rates at lower transmission power levels compared to narrow band wireless systems. Current UWB communication systems use narrow time pulse sequences to transmit information. This paper presents a wireless sensor node architecture that uses a novel UWB data modulation scheme based on pulse shaping. In this paper, the advantages and hardware requirements of the pulse shaping modulation system are compared against a conventional UWB system. The pulse shaping modulation scheme adds more flexibility for data modulation in UWB communication systems. The modulation scheme encodes data in both the timing and frequency spectrum of the transmitted pulse. This will lower interference between UWB and narrowband systems and allow for robust communications to be used by a large number of sensors in a small area.
A Note on the GI/GI/&infin; System with Identical Service and Interarrival-Time Distributions
Authors: E. A. Van Doorn, A. A. Jagers
Venue: Queueing Systems: Theory and Applications (2004)

We study the stationary distribution of the number of busy servers in a GI/GI/&infin; system in which the service-time distribution is identical to the interarrival-time distribution, and obtain several representations for the variance. As a result we can verify an expression for the variance, conjectured by Rajaratnam and Takawira (IEEE Trans. Vehicular Technol. 50 (2001) 954&ndash;970), when the common distribution of interarrival and service times is a gamma distribution.
GenSo-EWS: a novel neural-fuzzy based early warning system for predicting bank failures
Authors: W. L. Tung, C. Quek, P. Cheng
Venue: Neural Networks (2004)

Bank failure prediction is an important issue for the regulators of the banking industries. The collapse and failure of a bank could trigger an adverse financial repercussion and generate negative impacts such as a massive bail out cost for the failing bank and loss of confidence from the investors and depositors. Very often, bank failures are due to financial distress. Hence, it is desirable to have an early warning system (EWS) that identifies potential bank failure or high-risk banks through the traits of financial distress. Various traditional statistical models have been employed to study bank failures [J Finance 1 (1975) 21: J Banking Finance 1 (1977) 249; J Banking Finance 10 (1986) 511; J Banking Finance 19 (1995) 1073]. However, these models do not have the capabilily to identity the characteristics of financial distress and thus function as black boxes. This paper proposes the use of a new neural fuzzy system [Foundations of neuro-fuzzy systems, 1997], namely the Generic Self-organising Fuzzy Neural Network (GenSoFNN) [IEEE Trans Neural Networks 13 (2002c) 1075] based on the compositional rule of inference (CRI) [Commun ACM 37 (1975) 77], as an alternative to predict banking failure. The CRI based GenSoFNN neural fuzzy network, henceforth denoted as GenSoFNN-CRI(S), functions as an EWS and is able to identify the inherent traits of financial distress based on financial covariates (features) derived from publicly available financial statements. The interaction between the selected features is captured in the form of highly intuitive IF-THEN fuzzy rules. Such easily comprehensible rules provide insights into the possible characteristics of financial distress and form the knowledge base for a highly desired EWS that aids bank regulation. The performance of the GenSoFNN-CRI(S) network is subsequently benchmarked against that of the Cox's proportional hazards model [J Banking Finance 10 (1986) 511: J Banking Finance 19 (1995) 1073], the multi-layered perceptron (MLP) and the modified cerebellar model articulation controller (MCMAC) [IEEE Trans Syst Man Cybern: Part B 30 (2000) 491] in predicting bank failures based on a population of 3635 US banks observed over a 21 years period. Three sets of experiments are performed-bank failure classification based on the last available financial record and prediction using financial records one and two years prior to the last available financial statements. The performance of the GenSoFNN-CRI(S) network as a bank failure classification and EWS is encouraging.
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Authors: Mark Jerrum, Alistair Sinclair, Eric Vigoda
Venue: Journal of the ACM (JACM) (2004)

We present a polynomial-time randomized algorithm for estimating the permanent of an arbitrary n &times; n matrix with nonnegative entries. This algorithm---technically a "fully-polynomial randomized approximation scheme"---computes an approximation that is, with high probability, within arbitrarily small specified relative error of the true value of the permanent.
A Knowledge Base for Computational Pathway Reconstruction
Authors: Peng Wang, Zhengchang Su, Phuongan Dam, Ying Xu
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

The Synechococcus WH8102 knowledge base (http://www.csbl.bmb.uga.edu/WH8102) is a web based relational database developed to facilitate computational effort to reconstruct regulatory pathways and serve as a gateway for biologist to access the data. It is the repertoire that integrates a variety of knowledge derived both from literature and computational prediction. Those data are organized in hierarchical fashion. The basic building blocks are functional annotation and structure prediction of individual molecule. Those data are then organized into clusters based on computationally predicted operon, regulon and molecular complexes. Finally all data are complied into pathways derived from combined efforts of literature mining and computational prediction. A number of tools have been developed to facilitate the data retrieval including a SQL query engineer and several viewers to browse genome, molecular complexes and pathways.
On Designing a Flexible E-Payment System with Fraud Detection Capability
Authors: Antoinette Leung, Zhuang Yan, Simon Fong
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Nowadays security measures especially fraud detection has become an imperative issue in the design of online payment systems. In addition to standard network security schemes such as data encryption and firewalls, payment systems with internal logics that are capable of detecting fraud transaction, and even potential fraud transactions are preferred by both users and solution providers. Currently on the market one can easily purchase a software package for implementing an e-payment system with most standard payment functions. Fraud detection capability, usually implemented as an extra add-on internal logic in the system, however is not included in most packages. It would have to be built in-house. This paper sheds some light on the designing issues on this add-on fraud detection module, namely Fraud Detection Manager. The design is based on the concept of atomic transactions called Coupons that we implemented in e-wallet accounts. This is a relatively simple approach to deter fraud and resolve dispute without the use of digital signing [1]. Some issues in handling fraud transactions are discussed from our experiences in operating a commercial e-wallet service.
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard
Authors: I. Dinur, G. Kindler, R. Raz, S. Safra
Venue: Combinatorica (2003)

This paper shows the problem of &#xfb01;nding the closest vector in an n-dimensional lattice to be NP-hard to approximate to within factor nc/log log n for some constant c > 0.
Meaning Postulates in a Lexico-Conceptual Knowledge Base
Authors: Carlos Perinan-Pascual, Francisco Arcas-Tunez
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Some natural language processing systems, e.g. machine translation, require to have a knowledge base with conceptual representations reflecting the structure of human beings' cognitive system. In some other systems, e.g. automatic indexing or information extraction, surface semantics could be sufficient, but the construction of a robust knowledge base guarantees its use in most natural language processing tasks, consolidating thus the concept of resource reuse. This paper describes how meaning postulates can be built through FunGramKB, resulting in a knowledge base which provides deep semantics.
Numerical parameterization of affine varieties using
Authors: D. A. Aruliah, Robert M. Corless
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

In the present work, we extend the standard idea of numerical parameterization (i.e., parameterization by the numerical solution of initial-value problems (IVPs) for ordinary differential equations (ODEs) to affine varieties in &Copf;;n for n≥2. We use these results with an efficient implementation in Maple to explore the use of numerical parameterization for the visualization of Riemann surfaces.
An Object-Oriented Approach to GI Web Service Composition
Authors: C. Granell, J. F. Ramos
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In this paper we describe a novel approach to the incremental, semi-automated method for composition of web services in a geographical domain. First, we present the incremental component concept as a component that comprises both atomic and composite services under the same conceptual entity. Based on this concept, we describe an incremental methodology for composition by means of incremental component reuse. In addition, we present a prototype system in which this method is being tested in an emergency management scenario as part of the ACE-GIS project.