ppxscal/embedding_network huggingface dataset:
Machine Learning and Software Engineering
Authors: Du Zhang, Jeffrey J. P. Tsai
Venue: Software Quality Control (2003)

Machine learning deals with the issue of how to build programs that improve their performance at some task through experience. Machine learning algorithms have proven to be of great practical value in a variety of application domains. They are particularly useful for (a) poorly understood problem domains where little knowledge exists for the humans to develop effective algorithms; (b) domains where there are large databases containing valuable implicit regularities to be discovered; or (c) domains where programs must adapt to changing conditions. Not surprisingly, the field of software engineering turns out to be a fertile ground where many software development and maintenance tasks could be formulated as learning problems and approached in terms of learning algorithms. This paper deals with the subject of applying machine learning in software engineering. In the paper, we first provide the characteristics and applicability of some frequently utilized machine learning algorithms. We then summarize and analyze the existing work and discuss some general issues in this niche area. Finally we offer some guidelines on applying machine learning methods to software engineering tasks and use some software development and maintenance tasks as examples to show how they can be formulated as learning problems and approached in terms of learning algorithms.
On the Local Form and Transitions of Symmetry Sets, Medial Axes, and Shocks
Authors: Peter J. Giblin, Benjamin B. Kimia
Venue: International Journal of Computer Vision (2003)

In this paper we explore the local geometry of the medial axis (MA) and shocks (SH), and their structural changes under deformations, by viewing these symmetries as subsets of the symmetry set (SS) and present two results. First, we establish that the local form of the medial axis must generically be one of three cases, which we denote by the A notation explained below (here, it merely serves as a reference to sections of the paper): endpoints (A3), interior points (A12), and junctions (A13). The local form of shocks is a sub-classification of these points into six types. Second, we address the (classical) instabilities of the MA, i.e., abrupt changes in the representation with a slight changes in shape, as when a new branch appears with slight protrusion. The identification of these &lsquo;transitions&rsquo; is clearly crucial in robust object recognition. We show that for the medial axis only two such instabilities are generically possible: (i) when four branches come together (A14), and (ii) when a new branch grows out of an existing one (A1A3). Similarly, there are six cases of shock instabilities, derived as sub-classifications of the MA instabilities. We give an explicit example of a dent forming in an ellipse where many of the transitions described in the paper can be seen to appear.
Spike-driven synaptic dynamics generating working memory states
Authors: Daniel J. Amit, Gianluigi Mongillo
Venue: Neural Computation (2003)

The collective behavior of a network, modeling a cortical module of spiking neurons connected by plastic synapses is studied. A detailed spike-driven synaptic dynamics is simulated in a large network of spiking neurons, implementing the full double dynamics of neurons and synapses. The repeated presentation of a set of external stimuli is shown to structure the network to the point of sustaining working memory (selective delay activity). When the synaptic dynamics is analyzed as a function of pre- and postsynaptic spike rates in functionally defined populations, it reveals a novel variation of the Hebbian plasticity paradigm: in any functional set of synapses between pairs of neurons (e.g., stimulated-stimulated, stimulated-delay, stimulated-spontaneous), there is a finite probability of potentiation as well as of depression. This leads to a saturation of potentiation or depression at the level of the ratio of the two probabilities. When one of the two probabilities is very high relative to the other, the familiar Hebbian mechanism is recovered. But where correlated working memory is formed, it prevents overlearning. Constraints relevant to the stability of the acquired synaptic structure and the regimes of global activity allowing for structuring are expressed in terms of the parameters describing the single-synapse dynamics. The synaptic dynamics is discussed in the light of experiments observing precise spike timing effects and related issues of biological plausibility.
A fuzzy set approach to the evaluation of journal grades
Authors: Duanning Zhou, Jian Ma, Efraim Turban, Narasimha Bolloju
Venue: Fuzzy Sets and Systems (2002)

Many universities, research institutions and government agencies are continuously attempting to grade or rank journals for their academic value. Such grading is needed for personnel decisions and for funding and resource allocation purposes. The grading of journals is dependent both on objective information, such as the impact ratios of the journals, and on subjective information, such as experts' judgments about the journals. Also, the available information for decision may be incomplete or imprecise due to the problem nature and complexity of the decision process. This paper proposes a fuzzy set approach that integrates objective and subjective information for evaluating grades of journals. It provides a comprehensive method for dealing with incomplete and imprecise information to support the whole evaluation process. A Web-based decision support system that is based on the proposed fuzzy set approach has been implemented.
The future of internet security
Authors: Charles Adetokunbo Shoniregun
Venue: Ubiquity (2002)

Should common security technologies be blended with biometrics for accuracy and reliability?
Interpersonal trust and empathy online: a fragile relationship
Authors: Jinjuan Feng, Jenny Preece, Jonathan Lazar
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

An empirical study was conducted focusing on the effect of empathic accuracy and response type on online interpersonal trust in textual IM. The results suggest both empathic accuracy and response type have significant influence on online interpersonal trust. However, the interaction between empathic accuracy and response type is the dominant factor on interpersonal trust. The results also imply an interesting relationship between general trust attitude and online interpersonal trust.
Online dynamic reordering
Authors: Vijayshankar Raman, Bhaskaran Raman, Joseph M. Hellerstein
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2000)

We present a pipelining, dynamically tunable reorder operator for providing user control during long running, data- intensive operations. Users can see partial results and accordingly direct the processing by specifying preferences for various data items; data of interest is prioritized for early processing. The reordering mechanism is efficient and non-blocking and can be used over arbitrary data streams from files and indexes, as well as continuous data feeds. We also investigate several policies for the reordering based on the performance goals of various typical applications. We present performance results for reordering in the context of an online aggregation implementation in Informix and in the context of sorting and scrolling in a large-scale spreadsheet. Our experiments demonstrate that for a variety of data distributions and applications, reordering is responsive to dynamic preference changes, imposes minimal overheads in overall completion time, and provides dramatic improvements in the quality of the feedback over time. Surprisingly, preliminary experiments indicate that online reordering can also be useful in traditional batch query processing, because it can serve as a form of pipelined, approximate sorting.
Wireless in the classroom and beyond
Authors: Jay Dominick
Venue: Mobile commerce: technology, theory, and applications (2003)

The deployment of wireless data networks at American institutions of Higher Education has increased dramatically since the establishment of the 802.11 standards by the IEEE. These networks are generally deployed as extensions of the campus network to provide additional functionality to an increasingly mobile student population. As these networks become ubiquitous, they will increasingly be used for both classroom management and business m-commerce applications. Institutions with or considering wireless networks are advised to establish policies for the cooperative management of bandwidth, spectrum and security. Over time, the deployment of ubiquitous, standards-based networks will enable the deployment of an entirely new set of applications that will be useful throughout the university.
A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis
Authors: Tatsuya Akutsu, Satoru Miyano, Satoru Kuhara
Venue: Theoretical Computer Science (2003)

Inferring functional relations from relational databases is important for the discovery of scientific knowledge because many experimental data are represented in the form of tables and many rules are represented in the form of functions. A simple greedy algorithm has been known as an approximation algorithm for this problem. This paper presents an efficient implementation of the algorithm. This paper also shows that the algorithm can identify an exact solution for simple functions if input data for each function are generated uniformly at random and the size of the domain is bounded by a constant. Results of computational experiments using artificially generated data are presented to verify the approach.
The countable Erd&#x00F6;s-Menger conjecture with ends
Authors: Reinhard Diestel
Venue: Journal of Combinatorial Theory Series B (2003)

Erdös conjectured that, given an infinite graph G and vertex sets A, B ⊆ V(G), there exist a set P of disjoint A-B paths in G and an A-B separator X 'on' P, in the sense that X consists of a choice of one vertex from each path in P. We prove, for countable graphs G, the extension of this conjecture in which A, B and X are allowed to contain ends as well as vertices, and where the closure of A avoids B and vice versa. (Without the closure condition the extended conjecture is false.)
A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
Authors: Alain Hertz, Michel Mittaz
Venue: Transportation Science (2001)

The undirected capacitated arc routing problem (CARP) arises naturally in several applications where streets require maintenance, or customers located along road must be serviced. Basic algorithmic procedures have recently been developed for the design of heuristics in an arc routing context. This article reports on the use of these basic tools in a variable neighborhood descent algorithm for the solution of the undirected CARP.
Simultaneous classification and relevant feature identification in high-dimensional spaces: application to molecular profiling data
Authors: C. Bhattacharyya, L. R. Grate, A. Rizki, D. Radisky, F. J. Molina, M. I. Jordan, M. J. Bissell, I. S. Mian
Venue: Signal Processing (2003)

Molecular profiling technologies monitor many thousands of transcripts, proteins, metabolites or other species concurrently in a biological sample of interest. Given such high-dimensional data for different types of samples, classification methods aim to assign specimens to known categories. Relevant feature identification methods seek to define a subset of molecules that differentiate the samples. This work describes LIKNON, a specific implementation of a statistical approach for creating a classifier and identifying a small number of relevant features simultaneously. Given two-class data, LIKNON estimates a sparse linear classifier by exploiting the simple and well-known property that minimising an L1 norm (via linear programming) yields a sparse hyperplane. It performs well when used for retrospective analysis of three cancer biology profiling data sets, (i) small, round, blue cell tumour transcript profiles from tumour biopsies and cell lines, (ii) sporadic breast carcinoma transcript profiles from patients with distant metastases < 5 years and those with no distant metastases ≥ 5 years and (iii) serum sample protein profiles from unaffected and ovarian cancer patients. Computationally, LIKNON is less demanding than the prevailing filter-wrapper strategy; this approach generates many feature subsets and equates relevant features with the subset yielding a classifier with the lowest generalisation error. Biologically, the results suggest a role for the cellular microenvironment in influencing disease outcome and its importance in developing clinical decision support systems.
A new equation for the load balance scheduling based on the Smarandache f-inferior part function
Authors: Tatiana Tabirca, Sabin Tabirca
Venue: Smarandache notions (2002)

This article represents an extension of [Tabirca, 2000a]. A new equation for upper bounds is obtained based on the Smarandache f-inferior part function. An example involving upper diagonal matrices is given in order to illustrate that the new equation provide a better computation.
Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths
Authors: Elena Fernandez, Robert Garfinkel, Roman Arbiol
Venue: Operations Research (1998)

The Cartographic Institute of Catalonia (ICC) produces commercial aerial photographic maps of locations in Europe and South America. These maps are often so large that it is necessary to produce one map from two or more photographs, which are combined two at a time in a process called mosaicking. The objective is to make the final map appear to be the product of a single photograph by producing a seam that is invisible even to an expert cartographer. The problem and a variation are modeled via bottleneck shortest paths and cycles. Optimization algorithms are developed for both, and the first has been implemented with demonstrable impact on the company. The second represents a new class of constrained shortest cycle problems.
On nearest neighbor indexing of nonlinear trajectories
Authors: Charu C. Aggarwal, Dakshi Agrawal
Venue: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2003)

In recent years, the problem of indexing mobile objects has assumed great importance because of its relevance to a wide variety of applications. Most previous results in this area have proposed indexing schemes for objects with linear trajectories in one or two dimensions. In this paper, we present methods for indexing objects with nonlinear trajectories. Specifically, we identify a useful condition called the convex hull property and show that any trajectory satisfying this condition can be indexed by storing a careful representation of these objects in a traditional index structure. Since a wide variety of relevant nonlinear trajectories satisfy this condition, our result significantly expands the class of trajectories for which nearest neighbor indexing schemes can be devised. We also show that even though many non-linear trajectories do not satisfy the convex hull condition, an approximate representation can often be found which satisfies it. We discuss examples of techniques which can be utilized to find representations that satisfy the convex hull property. We present empirical results to demonstrate the effectiveness of our indexing method.
Who is Collecting Your Java Garbage?
Authors: Chia-Tien Dan Lo, Witawas Srisa-an, J. Morris Chang
Venue: IT Professional (2003)

Garbage collection can be a real drain on a Java system. Understanding the different GC algorithms your JVM might use is the first step toward improving system efficiency.
On a Parametrization of Purifications of a Qubit
Authors: Tiberiu Constantinescu, Viswanath Ramakrishna
Venue: Quantum Information Processing (2002)

This work provides, constructively, explicit one&ndash;one parametrizations of all purifications of a mixed state in dimension 2 and all joint purifications, if any, of two mixed states in the same dimension. The former is parametrized by SO(3, R), while the latter is parametrized by SO(2, R), except when the state being purified is already pure. These parametrizations are derived without any passage to the spectral decompositions of the state(s) being purified. Using this, we show how to calculate certain measures of quantum information. The appendix considers an alternative one&ndash;one parametrization of mixed states in C2 &otimes; C2, which provides a different explicit construction of joint purifications.PACS: 03.67-a; 03.67-Hk; 03.67-Lx
Probe-position error correction for time-domain planar near-field antenna measurements
Authors: M. Okhovvat, M. Hakkak
Venue: Iranian Journal of Science and Technology (2002)

In order to construct the far-field pattern of an antenna in the time domain from its near-field samples, uniform sampling techniques have been widely used. If a signal is unequally sampled due to probe position error, the reconstruction of far-field can not be obtained correctly. Therefore, we propose a method that first recovers uniformly spaced samples of the near-fields from their unequally spaced samples by 2-dimensional nonuniform interpolation techniques, and then proceeds to the computation of the far-field by near-field to far-field transformation. In this paper a comparative survey of some recent interpolation techniques is presented for finding their advantages and disadvantages of using them in our method.
The bondage and connectivity of a graph
Authors: Hailong Liu, Liang Sun
Venue: Discrete Mathematics (2003)

Let G =(V,E) be a simple graph. A subset S of V is a dominating set of G if for any vertex v ∈ V - S, there exists some vertex u ∈ S such that uv ∈ E(G). The domination number, denoted by γ(G), is the cardinality of a minimum dominating set of G. The bondage number, denoted by b(G), is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than γ(G). Dunbar et al. (Bondage, insensitivity and reinforcement, in: T.W. Haynes, S.T. Hedetniemi, P.J. Slater (Eds.), Domination in Graphs--Advanced Topics, Marcel Dekker, New York, 1998, pp. 471-489) conjectured that if G has vertex connectivity k(G) ≥ 1, then b(G) ≤ Δ(G) + k(G) - 1. In this paper, we provide a counterexample to this conjecture.
Scratchpad memory: design alternative for cache on-chip memory in embedded systems
Authors: Rajeshwari Banakar, Stefan Steinke, Bo-Sik Lee, M. Balakrishnan, Peter Marwedel
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

In this paper we address the problem of on-chip memory selection for computationally intensive applications, by proposing scratch pad memory as an alternative to cache. Area and energy for different scratch pad and cache sizes are computed using the CACTI tool while performance was evaluated using the trace results of the simulator. The target processor chosen for evaluation was AT91M40400. The results clearly establish scratehpad memory as a low power alternative in most situations with an average energy reducation of 40%. Further the average area-time reduction for the seratchpad memory was 46% of the cache memory.
The effectiveness of multiscale collaboration in virtual environments
Authors: Xiaolong Zhang, George W. Furnas
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Adding multiscale capabilities to collaborative virtual environments can potentially help people work on very large electronic worlds. Our experiment shows that the user performance on cross-scale tasks is indeed improved.
Nonstandard finite difference method by nonlocal approximation
Authors: Roumen Anguelov, Jean M.-S. Lubuma
Venue: Mathematics and Computers in Simulation (2003)

Two types of monotonic properties of solutions of differential equations are discussed and general finite difference schemes, which are stable with respect to these properties are investigated. Apart from being elementary stable, these schemes are also shown to preserve qualitative properties of nonhyperbolic fixed points of the differential equations. From the practical point of view, a systematic procedure based on nonlocal approximation, is proposed for the construction of qualitatively stable nonstandard finite difference schemes for the logistic equation, the combustion model and the reaction-diffusion equation.
Capability Exploitation and Building in a Foreign Market: Implications for Multinational Enterprises
Authors: Yadong Luo
Venue: Organization Science (2002)

This study examines environmental and organizational factors that influence a multinational enterprise's (MNE's) capability exploitation and building in a complex foreign market. Analysis of data from 167 MNE subunits in the People's Republic of China suggests that capability exploitation and capability building are inversely associated with environmental complexity and industrial uncertainty. Business cultural specificity impedes capability exploitation but not capability building. While capability exploitation is associated with the use of wholly owned entry mode, capability building is linked to the joint venture mode. MNEs seeking local market expansion also deploy greater capability exploitation and building than those seeking export market growth. Our analysis further suggests that the threats of environmental hazards on capability building are reduced when the joint venture entry mode is used. An appropriate alignment of capability exploitation or building with its identified determinants is found to be associated with high performance.
On filters of implicative semilattices
Authors: Young Bae Jun
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2002)

In this paper, we discuss how to generate a filter by a set.