ppxscal/embedding_network huggingface dataset:
Predicting Corporate Acquisitions: An Application of Uncertain Reasoning Using Rule Induction
Authors: Srinivasan Ragothaman, Bijayananda Naik, Kumoli Ramakrishnan
Venue: Information Systems Frontiers (2003)

Artificial Intelligence (AI)-based rule induction techniques such as IXL and ID3 are powerful tools that can be used to classify firms as acquisition candidates or not, based on financial and other data. The purpose of this paper is to develop an expert system that employs uncertainty representation and predicts acquisition targets. We outline in this paper, the features of IXL, a machine learning technique that we use to induce rules. We also discuss how uncertainty is handled by IXL and describe the use of confidence factors. Rules generated by IXL are incorporated into a prototype expert system, ACQTARGET, which evaluates corporate acquisitions. The use of confidence factors in ACQTARGET allows investors to specifically incorporate uncertainties into the decision making process. A set of training examples comprising 65 acquired and 65 non-acquired real world firms is used to generate the rules and a separate holdout sample containing 32 acquired and 32 non-acquired real world firms is used to validate the expert system results. The performance of the expert system is also compared with a conventional discriminant analysis model and a logit model using the same data. The results show that the expert system, ACQTARGET, performs as well as the statistical models and is a useful evaluation tool to classify firms into acquisition and non-acquisition target categories. This rule induction technique can be a valuable decision aid to help financial analysts and investors in their buy/sell decisions.
Mining data records in Web pages
Authors: Bing Liu, Robert Grossman, Yanhong Zhai
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

A large amount of information on the Web is contained in regularly structured objects, which we call data records. Such data records are important because they often present the essential information of their host pages, e.g., lists of products or services. It is useful to mine such data records in order to extract information from them to provide value-added services. Existing automatic techniques are not satisfactory because of their poor accuracies. In this paper, we propose a more effective technique to perform the task. The technique is based on two observations about data records on the Web and a string matching algorithm. The proposed technique is able to mine both contiguous and non-contiguous data records. Our experimental results show that the proposed technique outperforms existing techniques substantially.
A novel multiresolution fuzzy segmentation method on MR image
Authors: Hong Mei Zhang, Zheng Zhong Bian, Ze Jian Yuan, Min Ye, Feng Ji
Venue: Journal of Computer Science and Technology (2003)

Multiresolution-based magnetic resonance (MR) image segmentation has attracted attention for its ability to capture rich information across scales compared with the conventional segmentation methods. In this paper, a new scale-space-based segmentation model is presented, where both the intra-scale and inter-scale properties are considered and formulated as two fuzzy energy functions. Meanwhile, a control parameter is introduced to adjust the contribution of the similarity character across scales and the clustering character within the scale. By minimizing the combined inter/intra energy function, the multiresolution fuzzy segmentation algorithm is derived. Then the coarse to fine leading segmentation is performed automatically and iteratively on a set of multiresolution images. The validity of the proposed algorithm is demonstrated by the test image and pathological MR images. Experiments show that by this approach the segmentation results, especially in the tumor area delineation, are more precise than those of the conventional fuzzy segmentation methods.
Repairing and querying inconsistent databases
Authors: Gianluigi Greco, Sergio Greco, Ester Zumpano
Venue: Effective databases for text & document management (2003)

The integration of knowledge from multiple sources is an important aspect in several areas such as data warehousing, database integration, automated reasoning systems, active reactive databases and others. Thus a central topic in databases is the construction of integration systems, designed for retrieving and querying uniform data stored in multiple information sources. This chapter illustrates recent techniques for computing repairs as well as consistent answers over inconsistent databases. Often databases may be inconsistent with respect to a set of integrity constraints, that is, one or more integrity constraints are not satisfied. Most of the techniques for computing repairs and queries over inconsistent databases work for restricted cases and only recently there have been proposals to consider more general constraints. In this chapter we give an informal description of the main techniques proposed in the literature.
A notion of cross-perfect bipartite graphs
Authors: Milind Dawande
Venue: Information Processing Letters (2003)

In this note, we consider four quantities defined on a bipartite graph B: the cross-chromatic index χ*(B), the biclique number w*(B), the cross-free matching number m*(B) and the biclique edge covering number β*(B). We mention several applications of these numbers and define a notion of cross-perfect bipartite graphs. A duality between these numbers for the class of cross-perfect graphs is examined.
Switching activity estimation of VLSI circuits using Bayesian networks
Authors: Sanjukta Bhanja, N. Ranganathan
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

Switching activity estimation is an important aspect of power estimation at circuit level. Switching activity in a node is temporally correlated with its previous value and is spatially correlated with other nodes in the circuit. It is important to capture the effects of such correlations while estimating the switching activity of a circuit. In this paper, we propose a new switching probability model for combinational circuits that uses a logic-induced directed-acyclic graph (LIDAG) and prove that such a graph corresponds to a Bayesian network (BN), which is guaranteed to map all the dependencies inherent in the circuit. BNs can be used to effectively model complex conditional dependencies over a set of random variables. The BN inference schemes serve as a computational mechanism that transforms the LIDAG into a junction tree of cliques to allow for probability propagation by local message passing. The proposed approach is accurate and fast. Switching activity estimation of ISCAS and MCNC circuits with random and biased input streams yield high accuracy (average mean error = 0.002) and low computational time (average elapsed time including CPU, memory access and I/O time for the benchmark circuits = 3.93s).
Quasi-Static Scheduling for Real-Time Systems with Hard and Soft Tasks
Authors: Luis Alejandro Cortés, Petru Eles, Zebo Peng
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

This paper addresses the problem of scheduling for realtime systems that include both hard and soft tasks. The relative importance of soft tasks and how the quality of results is affected when missing a soft deadline are captured by utility functions associated to soft tasks. Thus the aim is to find the execution order of tasks that makes the total utility maximum and guarantees hard deadlines. We consider time intervals rather than fixed execution times for tasks. Since a purely off-line solution is too pessimistic and a purely online approach incurs an unacceptable overhead due to the high complexity of the problem, we propose a quasi-static approach where a number of schedules are prepared at design-time and the decision of which of them to follow is taken at run-time based on the actual execution times. We propose an exact algorithm as well as different heuristics for the problem addressed in this paper.
Designing for Deep Conversation in a Scenarios-Based e-Learning Environment
Authors: Martin A. Siegel, Sean E. Ellis, Megan B. Lewis
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

While synchronous and asynchronous applications such as chat and email effectively foster casual communication, such applications are less successful in facilitating deep, insightful conversation. This is a particular challenge when asynchronous threaded discussion forums are used in e-learning settings. This paper examines the implementation of discussion forums in the context of WisdomTools Scenarios¿, an e-learning tool which exploits case-based narrative to provide authentic contexts for asynchronous, collaborative persistent conversations. An analysis of usage from two independent scenarios, one used in an academic context and the other in a corporate context, shows that embedding forums within narrative scenes encouraged learner involvement and focused conversation. At the same time, we identify directions for improving the interaction design of these forums, including the ability for learners to join and "catch up" in ongoing conversations, tools to view summarization postings and track learner participation, and the use of social proxies. Ultimately, our goal is to understand how narrative-based e-tools may lead to deeper learner insights, smarter strategies, and better judgments.
Cdm: code division multiplexing and its applications
Authors: Weerakhan Tantiphaiboontana
Venue:  (2003)

In high speed transmission, single carrier modulation formats suffer from a complexity increase in the receiver, which needs to compensate for severe intersymbol interference (ISI) caused by multiple delayed signals. The optimum receiver for ISI channels is the maximum likelihood sequence estimator (MLSE) whose complexity grows exponentially with the number of interfering paths. Other suboptimum receivers with lower complexity, cannot perform as well as the optimum MLSE. With the increasing demand for high data rate transmission in today's wireless applications, a more efficient modulation format is needed. In this dissertation, code division multiplexing (CDM) is introduced as an efficient modulation format in high speed communications over frequency selective fading channels with large delay spreads. We designed a transmitter and a receiver in the CDM system such that its performance is similar to that of single carrier modulation with MLSE while maintaining a linear complexity at the receiver. The performance analysis of CDM with a conventional receiver is given. An approximation technique called the chi-square approximation is proposed to ease the complicated expressions. It reduces the number of intergrations required in the analysis. Moreover, the asymptotic performance of the system with matched filters is obtained in a closed form. The approximation is then extended to the case with a partial parallel interference canceller. The performance analysis of the interference canceller is shown to be accurate at low to moderate signal to noise ratios. The performance of CDM is also investigated in coded environments. Two types of suboptimal receivers namely an iterative demodulator/decoder and a modified unwhitened decision feedback sequence estimator (MUDFSE) are presented. The performance obtained from these receivers is comparable to that of coded OFDM systems with a more powerful code. To ensure spatial diversity. CDM is applied to a space-time trellis code (STTC) system with multiple transmit antennas. It is able to convert a two transmit/one receive antenna system to an equivalent system with two separate channels. With the diversity assurance, the rank criterion in STTC code design can be ignored. Hence, it provides us larger freedom in selection of codes that offer better performance.
The Temporal and Topological Characteristics of BGP Path Changes
Authors: Di-Fa Chang, Ramesh Govindan, John Heidemann
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

BGP has been deployed in Internet for more than a decade. However, the events that cause BGP topological changes are not well understood. Although large traces of routing updates seen in BGP operation are collected by RIPE RIS and University of Oregon RouteViews, previous work examines this data set as individual routing updates. This paper describes methods that group routing updates into events. Since one event (a policy change or peeringfailure) results in many update messages, we cluster updates both temporally and topologically (based on the path vector information). We propose a new approach to analyzing the update traces, classifying the topological impact of routing events, and approximating the distance to the the Autonomous System originating the event. Our analysis provides some insight into routing behavior: First, at least 45% path changes are caused by events on transit peerings. Second, a significant number (23-37%) of path changes are transient, in that routing updates indicate temporary path changes, but they ultimately converge on a path that is identical from the previously stable path. These observations suggest that a content provider cannot guarantee end-to-end routing stability based solely on its relationship with its immediate ISP, and that better detection of transient changes may improve routing stability.
Evaluating Personalization and Customization from an Ethical Point of View: An Empirical Study
Authors: Horst Treiblmaier, Maria Madlberger, Nicolas Knotzer, Irene Pollach
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

This paper examines whether classic ethical theories can solve the ethical dilemmas associated with user-controlled customization and system-driven personalization of Web sites. Based on the notion that data sensitivity is not a universal concept but comes in different levels of intensity, we conducted an Internet-based survey among consumers to determine their level of data sensitivity and their attitudes towards personalization and customization. Our results have shown that users can be classified into different groups who differ significantly in terms of data sensitivity. Applying ethical theories to personalization and customization has led to conflicting conclusions, but they are in line with the findings from the survey, suggesting that customization is ethically less questionable than personalization.
On ideal-function-like functions
Authors: R. Balasubramanian, S. Kanemitsu, K. Ramachandra
Venue: Journal of Computational and Applied Mathematics (2003)

The aim of this paper is to extend the considerations of the first and the third authors and others to the setting of Suetuna, i.e. we consider some important sums of multiplicative ideal-functions in relative extensions of number fields. This contains most of the earlier work on those sums related to the divisor and the circle problems.
An automatic synthesizer for CMOS operational amplifiers
Authors: Chin-Yuan Kuo, Liang-Gee Chen, Tai-Ming Parng
Venue: Proceedings of the conference on European design automation (1991)

A design methodology with a good trade-off between design time and quality in the automatic synthesis of CMOS operational amplifiers is presented. It is based on an iterative device sizing approach in which a multivariate interpolation technique provides a way to improve the design and the SPICE simulator gives quantitative evaluation of the resultant circuit performance in each design iteration. The methodology has been implemented and proved to be very practical and promising.
On Koetter&rsquo;s Algorithm and the Computation of Error Values
Authors: Michael E. O’sullivan
Venue: Designs, Codes and Cryptography (2004)

In this article, we show that Koetter&rsquo;s algorithm for decoding one-point codes can compute error evaluator polynomials as well. We also show that the error evaluators do not need to be computed. The updating functions used in Koetter&rsquo;s algorithm can be used to compute error values instead.
Minimization of Error Functionals over Variable-Basis Functions
Authors: Paul C. Kainen, Vvera Kurková, Marcello Sanguineti
Venue: SIAM Journal on Optimization (2003)

Generalized Tikhonov well-posedness is investigated for the problem of minimization of error functionals over admissible sets formed by variable-basis functions, i.e., linear combinations of a fixed number of elements chosen from a given basis without a prespecified ordering. For variable-basis functions of increasing complexity, rates of decrease of infima of error functionals are estimated. Upper bounds are derived on such rates which do not exhibit the curse of dimensionality with respect to the number of variables of admissible functions. Consequences are considered for Boolean functions and decision trees.
Data Windows: A Data-Centric Approach for Query Execution in Memory-Resident Databases
Authors: Jayaprakash Pisharath, Alok Choudhary, Mahmut Kandemir
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

Structured embedded databases are currently becoming an integrated part of embedded systems, thus, enabling higher standards in system automation. These embedded databases are typically memory resident. In this paper, we present a data-centric approach called data windowing that optimizes multiple queries issued to an embedded database. Traditional approaches improve the performance by optimizing the control flow of operations, whereas we target performance improvements based on the data that is brought into the system.
Evolvable Hardware in Evolutionary Robotics
Authors: K. C. Tan, L. F. Wang, T. H. Lee, P. Vadakkepat
Venue: Autonomous Robots (2004)

In recent decades the research on Evolutionary Robotics (ER) has developed rapidly. This direction is primarily concerned with the use of evolutionary computing techniques in the design of intelligent and adaptive controllers for robots. Meanwhile, much attention has been paid to a new set of integrated circuits named Evolvable Hardware (EHW), which is capable of reconfiguring its architectures unlimited time based on artificial evolution techniques. This paper surveys the application of evolvable hardware in evolutionary robotics. The evolvable hardware is an emerging research field concerning the development of evolvable robot controllers at the hardware level to adapt to dynamic changes in environments. The context of evolvable hardware and evolutionary robotics is reviewed, and a few representative experiments in the field of robotic hardware evolution are presented. As an alternative to conventional robotic controller designs, the potentialities and limitations of the EHW-based robotic system are discussed and summarized.
SilkRoad II: mixed paradigm cluster computing with RC_dag consistency
Authors: Liang Peng, Weng-Fai Wong, Chung-Kwong Yuen
Venue: Parallel Computing (2003)

A parallel programming paradigm indicates the way to express applications. It also restricts the algorithms that may be used in the applications. Unfortunately, runtime systems for parallel computing often impose a particular programming paradigm. For a wider choice of algorithms, it is therefore desirable to support more than one paradigm.In this paper, we propose a formalism for modeling parallel programming paradigms from a graph-theoretic view of their execution instance dag and the memory consistency assumptions. This model allows us to formally reason about the properties of parallel programming paradigms that are hitherto only known informally and intuitively. We propose the concept of general paradigm and show that the single program multiple data, the divide and conquer, and the master/slave paradigms are all sub-sets of this general paradigm. We will also propose, a super set of these three paradigms which we called the mixed paradigm and introduce the RC_dag memory consistency model.We also present our work on SilkRoad II, a variant of the Cilk runtime system for cluster computing. What is unique about SilkRoad II is its memory model which supports multiple paradigms with the underlying software distributed shared memory. Our experimental results show that the stronger RC_dag can achieve performance comparable to LC of Cilk while supporting a bigger set of paradigms with rather good performance.
A taxonomy of players and activities across the ERP project life cycle
Authors: Toni M. Somers, Klara G. Nelson
Venue: Information and Management (2004)

An important problem in probabilistic description is to understand who are the key players, which activities associated with enterprise system implementations are important, and when their effect is most prevalent across the IT development stages. Using an information theory approach, we analyze the fit between their importance, as noted in the current literature, and the experiences reported by a cross-section of 116 organizations that completed an enterprise system implementation experience. Our results suggest that the early literature- and case-based research on enterprise systems does not take into account the importance of several key variables. These findings provide guidance to managers on how best to utilize their limited resources by employing such factors at the stage in the project's life cycle when they will have the greatest impact.
Using a Text-to-Speech Synthesizer to Generate a Reverse Turing Test
Authors: Tsz-Yan Chan
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Recognition of synthesized speech by a diphone synthesizer is thought to be easy for a machine due to the small variation of the synthesized speech. In this paper, we report the recognition rate of synthesized utterances in a noisy environment. Our experiments show that the performance of a HMM recognizer is not too bad even in the presence of background noise. These recognition results nearly approach the performance of a human. Thus, although there seems to be a gap in the ability of understanding synthesized speech with background noise between humans and computers, our results discourage using this gap to build an audio-based CAPTCHA (i.e., a reverse Turing test which can tell computers and humans apart). Moreover, we explored the possible use of a classification and regression tree to control the hardness of our CAPTCHA.
Formal Verification of Modules under Real Time Environment Constraints
Authors: Ansuman Banerjee, Pallab Dasgupta, P. P. Chakrabarti
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Recent approaches to modular verification rely on appropriatemodeling of the environment under which themodule is exercised. In order to apply model checking techniqueson open systems, an appropriate notion of fairness ofthe environment is required. This paper proposes a formalapproach for modular verification in the presence of untimedas well as real time constraints on the environment. Inthis paper, we address (possibly for the first time) the problemof formal verification of open systems under real-timefairness constraints on the environment. We show that determiningthe consistency of a set of real time environmentconstraints is NP hard, but inconsistencies in the specificationcan be avoided by some simple restrictions.