ppxscal/embedding_network huggingface dataset:
Non-linear dynamic response of superparamagnetic nanoparticles
Authors: Yu. L. Raikher, V. I. Stepanov
Venue: Microelectronic Engineering (2003)

Odd-order dynamic magnetic susceptibilities of an assembly of single-domain uniaxial particles in the low-temperature limit are considered. The solution of the micromagnetic Fokker-Planck equation is presented in the form of asymptotic series with respect to the parameter σ that is the ratio of the anisotropy energy barrier height to the thermal energy. The expressions for the set of susceptibilities up to the fifth order are presented for the case of an assembly of particles randomly oriented in a solid matrix. The validity of the derived asymptotic representation in a wide range of σ is proved by comparison with the numerical solution of the Fokker-Planck equation.
Seven-Set Venn Diagrams with Rotational and Polar Symmetry
Authors: A. W. F. Edwards
Venue: Combinatorics, Probability and Computing (1998)

A class of completely symmetric simple Venn diagrams for seven sets is constructed and displayed.
Variable step-size St&#x00F6;rmer methods
Authors: H. Ramos, J. Vigo-Aguiar
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Although it is possible to integrate a special second-order differential equation of the form y''(x) = f(x,y(x)), y(x0) = y0, y'(x0) = y'0 (1) by reducing it to a first order system and applying one of the methods available for those systems, it seems more natural to provide numerical methods to integrate (1) directly without using first derivatives.The advantage of these approaches has to be with the fact that they are able to exploit special information about ODES, and this results in an increase in efficiency (that is, high accuracy at low cost). For instance, it is well-known that Runge-Kutta-Nyström methods for (1) involve a real improvement compared to standard Runge-Kutta methods, for a given number of stages [ 4, p. 285]. On the contrary, a linear k-step method for first-order ODEs becomes a 2k-step method for (1), [4, p. 461], increasing the computational work.
Information, Ethics, and Computers: The Problem of Autonomous Moral Agents
Authors: Bernd Carsten Stahl
Venue: Minds and Machines (2004)

In modern technical societies computers interact with human beings in ways that can affect moral rights and obligations. This has given rise to the question whether computers can act as autonomous moral agents. The answer to this question depends on many explicit and implicit definitions that touch on different philosophical areas such as anthropology and metaphysics. The approach chosen in this paper centres on the concept of information. Information is a multi-facetted notion which is hard to define comprehensively. However, the frequently used definition of information as data endowed with meaning can promote our understanding. It is argued that information in this sense is a necessary condition of cognitivist ethics. This is the basis for analysing computers and information processors regarding their status as possible moral agents. Computers have several characteristics that are desirable for moral agents. However, computers in their current form are unable to capture the meaning of information and therefore fail to reflect morality in anything but a most basic sense of the term. This shortcoming is discussed using the example of the Moral Turing Test. The paper ends with a consideration of which conditions computers would have to fulfil in order to be able to use information in such a way as to render them capable of acting morally and reflecting ethically.
Diversifying and Improving Business Process Management Systems by Service Cooperation Middleware
Authors: Shaohua Liu, Jun Wei, Wei Xu
Venue: Proceedings of the Third International Conference on Quality Software (2003)

Emerging service oriented business process management (BPM) systems require efficient middleware infrastructure. However, current techniques for middlewareare not optimal for that because they all do not have service-oriented natures themselves. This paper introduces a novel service cooperation middleware (SCM), which isdesigned to meet such requirements. It improves the development and integration of loosely coupled service oriented BPM system by applying several concepts suchas control flow semantic and projection operation, etc.Furthermore, based on the SCM architecture, the relatedProcess Integration Suit viz. ISProcessIntegration (PI)can be widely applied into all kinds of scenes, for exampleEAI, B2B, B2C, P2P, Cluster, with different topologies.
Regular cyclic coverings of regular affine maps
Authors: W. Christopher Schroeder, David B. Surowski
Venue: European Journal of Combinatorics (2003)

The regular coverings of regular affine algebraic maps are considered, and a large family of totally ramified coverings--the so-called Steinberg and Accola coverings--are fully classified.
Verification of synthesized circuits at register transfer level with flow graphs
Authors: Fridtjof Feldbusch, Ramayya Kumar
Venue: Proceedings of the conference on European design automation (1991)

This paper presents a new approach to the verification of automatically synthesized register transfer structures. Horizontal verification is performed on the flow graph which is largely a syntax independent representation of behavior. After extracting a flow graph from the register transfer structure by symbolic simulation, the extracted and the specified flow graphs are normalized into a normal form. A comparison of the normalized flow graphs gives the proof of correctness. The various synthesis steps have been classified into five classes and the normalization procedures have been evaluated.
Knowledge management systems acceptance
Authors: Fredrik Ericsson, Anders Avdic
Venue: Knowledge management: current issues and challenges (2003)

This chapter introduces a framework of knowledge management systems acceptance labeled Requirements of Acceptance Model (RAM). It argues that acceptance of knowledge management systems is dependent on perceived relevance, systems accessibility, and management support. Together these components constitute the RAM. Further, it argues that implementation of systems is at large a process of acceptance where the requirements of acceptance are attained. Finally, it argues that to achieve the requirements of acceptance, implementation should be iterative and cooperative between users and developers by continually developing, implementing, and testing prototypes.
Incorporation of Feature Tracking into Simultaneous Localization and Map Building via Sonar Data
Authors: Y. L. Ip, A. B. Rad
Venue: Journal of Intelligent and Robotic Systems (2004)

Simultaneous Localization and Map building (SLAM) is referred to as the ability of an Autonomous Mobile Robot (AMR) to incrementally extract the surrounding features for estimating its pose in an unknown location and unknown environment. In this paper, we propose a new technique for extraction of significant map features from standard Polaroid sonar sensors to address the SLAM problem. The proposed algorithm explicitly initializes and tracks the line (or wall) features from a comparison between two overlapping sensor measurements buffers. The experimental studies on a Pioneer 2DX mobile robot equipped with sonar sensors suggest that SLAM problem can be solved by the proposed algorithm. The estimated trajectory of AMR from the standard model based on Extended Kalman Filter (EKF) localization for the same experiment is also provided for comparison.
Sparseness of support vector machines
Authors: Ingo Steinwart
Venue: The Journal of Machine Learning Research (2003)

Support vector machines (SVMs) construct decision functions that are linear combinations of kernel evaluations on the training set. The samples with non-vanishing coefficients are called support vectors. In this work we establish lower (asymptotical) bounds on the number of support vectors. On our way we prove several results which are of great importance for the understanding of SVMs. In particular, we describe to which "limit" SVM decision functions tend, discuss the corresponding notion of convergence and provide some results on the stability of SVMs using subdifferential calculus in the associated reproducing kernel Hilbert space.
OaSis: An Application Specific Operating System for an Embedded Environment
Authors: Gurashish Singh Brar, Susmit Biswas, Sudipta Kundu, Arijit Mukhopadhyay, Pratik Worah, Anupam Basu
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Portable and affordable assistive devices are callingnecessities for the physically challenged populationputting forth the requirement of designing embeddedsystems tuned to specific assistive applications. In thispaper, we present a low footprint embedded operatingsystem, OaSis, which forms the core of embedded devicesbeing developed for the speech impaired, the visuallyimpaired and those with neuro-motor disorders. Thetarget hardware, housing OaSis and on which theapplications are ported is Geode GX1-233 processorbased POS-563 of Advantech. The system is presentlybeing ported to more energy efficient ARM basedplatform. This system currently supports threeapplications: Shruti - a Vernacular speech interface,Sanyog - a Visual Communication interface and a webbrowser. The OaSis embedded operating system hasbeen optimized to 90 KB and provides all the featuresrequired for the specific applications. The differentmodules of OaSis have been described and have beencompared with other operating systems.
Vector cascade algorithms and refinable function vectors in Sobolev spaces
Authors: Bin Han
Venue: Journal of Approximation Theory (2003)

In this paper we shall study vector cascade algorithms and refinable function vectors with a general isotropic dilation matrix in Sobolev spaces. By introducing the concept of a canonical mask for a given matrix mask and by investigating several properties of the initial function vectors in a vector cascade algorithm, we are able to take a relatively unified approach to study several questions such as convergence, rate of convergence and error estimate for a perturbed mask of a vector cascade algorithm in a Sobolev space Wpk(Rs) (1 ≤ p ≤ ∞, k ∈ N ∪ {0}). We shall characterize the convergence of a vector cascade algorithm in a Sobolev space in various ways. As a consequence, a simple characterization for refinable Hermite interpolants and a sharp error estimate of a vector cascade algorithm in a Sobolev space with a perturbed mask will be presented. The approach in this paper enables us to answer some unsolved questions in the literature on vector cascade algorithms and to comprehensively generalize and improve results on scalar cascade algorithms and scalar refinable functions to the vector case.
Mining Web Informative Structures and Contents Based on Entropy Analysis
Authors: Hung-Yu Kao, Shian-Hua Lin, Jan-Ming Ho, Ming-Syan Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--In this paper, we study the problem of mining the informative structure of a news Web site that consists of thousands of hyperlinked documents. We define the informative structure of a news Web site as a set of index pages (or referred to as TOC, i.e., table of contents, pages) and a set of article pages linked by these TOC pages. Based on the Hyperlink Induced Topics Search (HITS) algorithm, we propose an entropy-based analysis (LAMIS) mechanism for analyzing the entropy of anchor texts and links to eliminate the redundancy of the hyperlinked structure so that the complex structure of a Web site can be distilled. However, to increase the value and the accessibility of pages, most of the content sites tend to publish their pages with intrasite redundant information, such as navigation panels, advertisements, copy announcements, etc. To further eliminate such redundancy, we propose another mechanism, called InfoDiscoverer, which applies the distilled structure to identify sets of article pages. InfoDiscoverer also employs the entropy information to analyze the information measures of article sets and to extract informative content blocks from these sets. Our result is useful for search engines, information agents, and crawlers to index, extract, and navigate significant information from a Web site. Experiments on several real news Web sites show that the precision and the recall of our approaches are much superior to those obtained by conventional methods in mining the informative structures of news Web sites. On the average, the augmented LAMIS leads to prominent performance improvement and increases the precision by a factor ranging from 122 to 257 percent when the desired recall falls between 0.5 and 1. In comparison with manual heuristics, the precision and the recall of InfoDiscoverer are greater than 0.956.
A 60-dB 246-MHz CMOS variable gain amplifier for subsampling GSM receivers
Authors: Mohamed A. I. Mostafa, Sherif H. K. Embabi, Mostafa Elmala
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

A variable gain amplifier (VGA) is designed for a GSM subsampling receiver. The VGA is implemented in a 0.35-µm CMOS process and approximately occupies 0.64 mm2. It operates at an IF frequency of 246 MHz. The VGA provides a 60-dB digitally controlled gain range in 2-dB steps. The overall gain accuracy is less than 0.3 dB. The current is 9 mA at 3 V supply. The noise figure at maximum gain is 8.7 dB. The IIP3 is --4 dBm at minimum gain, while the OIP3 is -- 1 dBm at maximum gain. The group delay is 1.5 ns across 5-MHz bandwidth.
Shape Fitting with Outliers
Authors: Sariel Har-Peled, Yusu Wang
Venue: SIAM Journal on Computing (2004)

Given a set $\mathcal{H}$ of n hyperplanes in ${\Bbb R}^d$, we present an algorithm that $\eps$-approximates the extent between the top and bottom k levels of the arrangement of $\mathcal{H}$ in time $O(n + (k/\eps)^c)$, where c is a constant depending on d. The algorithm relies on computing a subset of $\mathcal{H}$ of size $O(k/\eps^{d-1})$, in near linear time, such that the k-level of the arrangement of the subset approximates that of the original arrangement. Using this algorithm, we propose efficient approximation algorithms for shape fitting with outliers for various shapes. These are the first algorithms to handle outliers efficiently for the shape fitting problems considered.
Generating Formal Models for Real-Time Verification by Exact Low-Level Runtime Analysis of Synchronous Programs
Authors: G. Logothetis, K. Schneider, C. Metzler
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

Synchronous programming languages are well-suited forthe implementation and verification of real-time systems.The main benefit for the estimation of real-time constraintsis thereby that the macro steps provided by synchronousprograms can be directly used for runtime analysis: If synchronouscircuits are generated from these descriptions, themacro steps are implemented by combinatorial circuits, andif software is generated, they correspond to basic buildingblocks that do not contain loops. In this paper, we describemethods to generate timed transitions systems froma synchronous program by taking the final architecture intoaccount. For software synthesis, this requires to considerdifferent microprocessors and compilers, and for hardwaresynthesis, this requires to consider a hierarchy of clocks tooptimize the clock speed.
Economic Implications of B2B Electronic Markets: The Private and Social Desirability of Information Transparency
Authors: Kevin Zhu
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

This paper explores the private and social desirability of information transparency of a B2Bexchange that provides an online platform for information transmission. The abundance oftransaction data available on the Internet tends to make information more transparent in B2B electronic markets. In such a transparent environment, it becomes easier for firms to obtain information that may allow them to infer their rivals' costs than in a traditional, opaque market. Then, how does this benefit firms participating in the B2B exchanges? To what extent does information transparency affect consumers and the social welfare in a broader sense? Focusing on the informational effects, this study explores firms' incentives to join a B2B exchange by developing a game-theoretic model under asymmetric information. We then examine its effect on expected profits, consumer surplus, and social welfare. Our results challenge the "information transparency hypothesis" (i.e., open sharing of information in electronic markets is beneficial to all participating firms). In contrast to the popular belief, we show that information transparency could be a double-edged sword. Although its overall effect on social welfare is positive, its private desirability is deeply divided between producers and consumers, and even among producers themselves.
Supporting software maintenance by mining software update records
Authors: Stan Matwin, Timothy Lethbridge
Venue:  (2003)

It is well known that maintenance is the most expensive stage of the software life cycle. Most large real world software systems consist of a very large number of source code files. Important knowledge about different aspects of a software system is embedded in a rich set of implicit relationships among these files. Those relationships are partly reflected in system documentation at its different levels, but more often than not are never made explicit and become part of the expertise of system maintainers. Finding existing relations between source code components is a difficult task, especially in the case of legacy systems. When a maintenance programmer is looking at a piece of code in a source file, one of the important questions that he or she needs to answer is: &ldquo;which other files should I know about, i.e. what else might be relevant to this piece of code?&rdquo;. This is an example of a more general Relevance Relation that maps a set of entities in a software system into a relevance value. How can we discover and render explicit these relationships without looking over the shoulder of a programmer involved in a maintenance task? We turn to inductive methods that are capable of extracting structural patterns or models from data. They can learn concepts or models from experience observed in the past to predict outcomes of future unseen cases. This thesis lies at the intersection of two research fields, which has been widely ignored by researchers in the machine learning and software engineering communities. It investigates the application of inductive methods to daily software maintenance at the source code level. Therefore in this thesis we first lay out the general idea of relevance among different entities in a software system. Then using inductive learning methods and a variety of data sources used by maintenance programmers, we extract (i.e. learn) what we call a maintenance relevance relation among files in a large legacy system. In effect we learn from past maintenance experience in the form of problem reports and update records, to be able to make predictions that are useful in future maintenance activities. This relation, which is called the Co-update relation, predicts whether updating one source file may require a change in another file. To learn the Co-update relation we have performed a large number of experiments using syntactic features such as function calls or variable definitions. We have also performed experiments that use text based features such as source code comments and problem reports, and the combination of these features. The results obtained show that while using syntactic features is encouraging in terms of the predictive power of the results of learning, using text based features yields highly accurate models, with precision and recall measures that make these models viable to be used in a real world setting. As part of the contribution of this thesis we also report on challenges encountered in the process and the lessons learned.
Level-Hybrid Optoelectronic TESH Interconnection Network
Authors: Vijay Jain, Glenn Chapman
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

This paper discusses a hybrid optoelectronic scheme for a new interconnection network, "Toriconnected mESHes (TESH)". The major features of TESH are the following: it is hierarchical,thus allowing exploitation of computation locality as well as easy expansion up to a million processors or devices, it permits efficient VLSI/ULSI realization, it is designed to make use ofredundancy for defect circumvention, and it appears to be well suited for 3-D stacked implementation. Here, we discuss a novel extension to these capabilities through the provision of optical interconnections at the highest level, while keeping the lower levels electronic through metal wires. The advantages of the resulting architecture, dubbed as Level-Hybrid Optoelectronic TESH, are the elimination of bottlenecks which typically occur at the highest level due to the aggregation of traffic, and the reduction of cost by using traditional wire channels at the lower levels -- where optical links are deemed unnecessary.
Polynomial-time approximation of largest simplices in V-polytopes
Authors: Asa Packer
Venue: Discrete Applied Mathematics (2004)

This paper considers the problem of computing the squared volume of a largest j-dimensional simplex in an arbitrary d-dimensional polytope P given by its vertices (a "V-polytope"), for arbitrary integers j and d with 1 ≤ j ≤ d. The problem was shown by Gritzmann, Klee and Larman to be NP-hard. This paper examines the possible accuracy of deterministic polynomial-time approximation algorithms for the problem. On the negative side, it is shown that unless P = NP, no such algorithm can approximately solve the problem within a factor of less than 1.09. It is also shown that the NP-hardness and inapproximability continue to hold when the polytope P is restricted to be an affine crosspolytope.On the positive side, a simple deterministic polynomial-time approximation algorithm for the problem is described. The algorithm takes as input integers j and d with 1 ≤ j ≤ d and a V-polytope P of dimension d. It returns a j-simplex S ⊂ P such that vol2(T)/vol2(S) ≤ A(Bj)j, where T is any largest j-simplex in P, and A and B are positive constants independent of j, d, P.
Concurrent RF Test Using Optimized Modulated RF Stimuli
Authors: Sasikumar Cherubal, Ram Voorakaranam, Abhijit Chatterjee, John Mclaughlin, Jason L. Smith, David M. Majernik
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

With proliferation in wireless applications, RFcircuitry is being included in a large number ofIntegrated Circuit (IC) designs. The testing of RFdevices has become increasingly expensive due to thehigh cost of RF testers as well as the test times for RFcircuits. The use of a new concurrent test methodologyreduces RF test time by measuring multiple RFparameters in parallel using modulated RF stimuli.Experimental results on a GaAs Low-Noise Amplifier(LNA) are described.