ppxscal/embedding_network huggingface dataset:
Teaching web-based database application development: an inexpensive approach
Authors: Michelle Moore, Carol Binkerd, Steve Fant
Venue: Journal of Computing Sciences in Colleges (2002)

At Texas A & M Corpus Christi (TAMU-CC), the university's required database management systems (DBMS) class teaches students the theory and practical skills required to create efficient database systems. In addition to the theory and skills, the DBMS class at TAMU-CC teaches students to become Web database application developers and to configure their own home PC's as Web servers for their databases. Projects are built upon real-world needs and actually implemented. This approach requires little or no expenditure by the university or the student, but gives the student a realistic project using readily available Web tools. This paper gives concrete examples of projects as well as where to obtain supporting components.
Neuro-Fuzzy Approach to the Segmentation of Psoriasis Images
Authors: J. S. Taur
Venue: Journal of VLSI Signal Processing Systems (2003)

In this paper, an automatic method for psoriasis image segmentation using neuro-fuzzy techniques is proposed. It can be used in a therapy evaluation system. Since the psoriasis is a chronic disease, it is important to track the condition of the patient to select a proper treatment. In our design, the psoriasis images are segmented into normal skin regions and abnormal regions automatically. The areas of each kind of regions of a patient at different points of time can then be estimated. This information can be used to give a quantitative measure of the progress of the treatment. The provided information can avoid the variation of the human factor in the evaluation procedure and can offer a objective index for the doctor to select the most suitable treatment for the patient. The essential techniques required include feature extraction and image segmentation (classification) methods. The two-dimensional histogram of the hue and saturation components of the color image and the fuzzy texture spectrum of the gray-level image are used as the feature vectors to locate the homogeneous regions. Then these regions are used to train the neuro-fuzzy classifier to obtain a more accurate segmentation. After the image is segmented into normal and psoriasis regions, the area of psoriasis regions can be easily calculated to obtain the information required for the therapy evaluation system. For comparison, a color clustering algorithm which was used to segment digitized dermatoscopic images is also implemented. In the experiments, the proposed approach provides better performance.
Message-passing in lower-level computer science courses
Authors: Timothy J. McGuire
Venue: Journal of Computing Sciences in Colleges (2003)

The paper shares recent experience using message-passing as an introduction to distributed processing in lower-level CS courses. These experiences come mainly from using MPI in the CSI course, and comparing the experience with a similar assignment in an upper-level (operating systems) course.
Investment using technical analysis and fuzzy logic
Authors: Hussein Dourra, Pepe Siy
Venue: Fuzzy Sets and Systems (2002)

Deploy fuzzy logic engineering tools in the finance arena, specifically in the technical analysis field. Since technical analysis theory consists of indicators used by experts to evaluate stock prices, the new proposed method maps these indicators into new inputs that can be fed into a fuzzy logic system. The only required inputs to these indicators are past sequence of stock prices. This method relies on fuzzy logic to formulate a decision making when certain price movements or certain price formations occur. The success of the system is measured by comparing system output versus stock price movement. The new stock evaluation method is proven to exceed market performance and it can be an excellent tool in the technical analysis field. The flexibility of the system is also demonstrated.
A dynamic equilibrium approach: the application in long-term energy planning
Authors: Y. June Wu
Venue: Scientific computing and applications (2001)

In this paper, I present the multi-period market equilibrium model with the geometric distributed lag (GDL) demand, called the GDL equilibrium model, as well as its solution technique, called the decoupling algorithm. The dynamic equilibrium approach, including the GDL equilibrium model and the decoupling algorithm, can be valuable aids in long-run energy planning and energy-related CO2 emission control decision-making, in order to represent the time-lagged effect. In the energy GDL equilibrium model, the demand is represented by a function of the prices not only in the current time period but also in previous time periods through the GDL structure, and the supply is a cost-minimizing linear energy process submodel. The solution technique employs sequential nonlinear programming to calculate the intertemporal equilibrium of energy supplies and demands, along with the corresponding CO2 emission control submodel. The methods of analysis for the economic impact of CO2 emission control are carefully explored.
Resonance problems for p-Laplacian
Authors: Jiří Bouchala
Venue: Mathematics and Computers in Simulation (2003)

We study the existence of the weak solution of the nonlinear boundary value problem -(|u'|p-2u')' = λ|u|p-2u + g(u) - h(x) in (0, π), u(0) = u(π) = 0, where p and λ are real numbers, p > 1, h ∈ LP' (0, π)(p' = p/(p - 1)) and the nonlinearity g : R → R is a continuous function of the Landesman-Lazer type. Our results generalize previously published results about the solvability of our problem.
On Derivative Estimation of the Mean Time to Failure in Simulations of Highly Reliable Markovian System
Authors: Tamas Solymosi, Harry Aarts, Theo Driessen, Marvin K. Nakayama
Venue: Operations Research (1998)

The mean time to failure (MTTF) of a Markovian system can be expressed as a ratio of two expectations. For highly reliable Markovian systems, the resulting ratio formula consists of one expectation that cannot be estimated with bounded relative error when using standard simulation, while the other, which we call a nonrare expectation, can be estimated with bounded relative error. We show that some derivatives of the nonrare expectation cannot be estimated with bounded relative error when using standard simulation, which in turn may lead to an estimator of the derivative of the MTTF that has unbounded relative error. However, if particular importance-sampling methods (e.g., balanced failure biasing) are used, then the estimator of the derivative of the nonrare expectation will have bounded relative error, which (under certain conditions) will yield an estimator of the derivative of the MTTF with bounded relative error.
Information Processing Moderators of the Effectiveness of Trust-Based Governance in Interfirm R&D Collaboration
Authors: Stephen J. Carson, Anoop Madhok, Rohit Varman, George John
Venue: Organization Science (2003)

It is generally assumed that improved outcomes accompany the use of trust as a governance mechanism in an interfirm relationship. Briefly, trust is a social lubricant that reduces the friction costs of existing trade and/or serves to increase the scope of trade. In contrast to this universalistic view, we posit that the performance of trust-based governance is contingent on the ability of trading partners to "read" each other and learn about counterpart behavior. These information-processing abilities allow firms to assess partner trustworthiness better, which reduces the risk of misplaced trust. The increased efficacy of communication and learning from one another also enables them to better capitalize from the adaptation and revision possibilities uncovered through trust-based governance during the task-execution phase. Given the central role of these cognitive requirements, we assess these contingent effects with data from a knowledge-intensive task setting. Using a sample of 129 firms that have engaged outside contractors on client-sponsored R&D projects, we find strong support for our thesis. Specifically, we find that trust-based governance has a larger positive impact on task performance when the client is more skilled at understanding the outsourced tasks at hand, the task itself requires skills that are relatively more readily taught (less tacit), and the task itself is organized in parallel with work being done at the contractor as well as the client. As a corollary, we also find that firms adopt trust-based governance to a greater extent as these information-processing abilities increase, as well as with the colocation of the contractor and client. Suggestions for engineering trust-based governance are offered.
Symplectic matroids, independent sets, and signed graphs
Authors: Timothy Y. Chow
Venue: Discrete Mathematics (2003)

We give an independent set axiomatization of symplectic matroids, a large and important class of Coxeter matroids. As an application, we construct a new class of examples of symplectic matroids from graphs. As another application, we prove that symplectic matroids satisfy a certain "basis exchange property," and we conjecture that this basis exchange property in fact characterizes symplectic matroids.
Animating volumetric models
Authors: Nikhil Gagvani, Deborah Silver
Venue: Graphical Models (2001)

This paper describes a technique to animate three-dimensional sampled volumes. The technique gives the animator the ability to treat volumes as if they were standard polygonal models and to use all of the standard animation/motion capture tools on volumetric data. A volumetric skeleton is computed from a volumetric model using a multi-resolution thinning procedure. The volumetric skeleton is centered in the object and accurately represents the shape of the object. The thinning process is reversible in that the volumetric model can be reconstructed from the volumetric skeleton. The volumetric skeleton is then connected and imported into a standard graphics animation package for animation. The animated skeleton is used for reconstruction, which essentially recreates a deformed volume around the deformed skeleton. Polygons are never computed and the entire process remains in the volumetric domain. This technique is demonstrated on one of the most complex 3D datasets, the Visible Male, resulting in actual "human animation,"
GSTE through a case study
Authors: Jin Yang, Amit Goel
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Generalized Symbolic Trajectory Evaluation (GSTE) [17, 18, 19] is a very significant extension of STE that has the power to verify all &omega;-regular properties but at the same time preserves the benefits of the original STE [16]. It also extends the symbolic quaternary model used by STE to support seamless model refinement for efficiency and accuracy trade-off in GSTE model checking. In this paper, we present a case study on FIFO verification to illustrate the strength of GSTE and demonstrate its methodology in specifying and verifying large scale designs.
Integrated Planning for School and Community: the Case of Johnston County, North Carolina
Authors: Raymond G. Taylor, Michael L. Vasu, James F. Causby
Venue: Interfaces (1999)

OR/Ed Laboratories and the Johnston County schools created a planning system, Integrated Planning for School and Community, to forecast enrollments, to compare the enrollment projections to capacity, to find the optimal locations for new school buildings, and to set distance-minimized boundaries forall schools to avoid over crowding and to meet racial balance guidelines. Implementing the system has increased the school district's success in passing bond issues, reduced pupil transportation costs, and eliminated frequent adjustments to school-attendance boundaries.
A capacity planning model of unreliable multimedia service systems
Authors: Kiejin Park, Sungsoo Kim
Venue: Journal of Systems and Software (2002)

To analyze the performance of multimedia service systems, which have unreliable resources, and to estimate the capacity requirement of the systems, we have developed a capacity planning model using an open queueing network. By acquisition of utilization, queue length of the resources and packet delay, and reliability of the systems, we have derived the service capacity of the systems along with the arrival rates of clients and the failure rates of the resources. We have validated the proposed capacity planning model by comparison of analytic results with simulation output.
Performance modelling of a network processor using POOSL
Authors: B. D. Theelen, J. P. M. Voeten, R. D. J. Kramer
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

The increasing complexity of innovative real-time hardware/software systems forced industry to consider system-level design methods. Before actually implementing a system with hardware and software components, system-level design methods enable analysing the performance of different design alternatives that realise the required functionality. In order to develop performance models early in the design process, the parallel object-oriented specification language (POOSL) can be used. POOSL is an expressive modelling language for analysing complex real-time distributed hardware/software systems. Being equipped with a formal semantics, POOSL ensures unambiguous execution of models and proper application of performance analysis techniques. This paper discusses the use of POOSL for analysing the performance of a network processor. A network processor consists of components that perform their behaviour in a synchronously concurrent way, whereas POOSL is based on an asynchronous modelling paradigm. In this paper, we illustrate that constructing abstract models of synchronous systems for the purpose of performance analysis may benefit from an asynchronous modelling approach.
Utilizing a computing lab to improve retention and recruiting of computer science and computer information science students
Authors: Bruce A. Wooley
Venue: Journal of Computing Sciences in Colleges (2003)

A computer lab specific for Computer Science/Computer Information Science (CS/CIS) majors has many benefits in recruiting and retaining students for these disciplines and provides additional educational benefits both in the class and for extra curricular activities for both students and faculty. The lab may be used for recruiting new students by providing an impressive facility for prospective students and by utilizing it for workshops offered to high school students in computer related subjects that are not typically offered on local high school campuses. For college students, the lab would promote student interaction and enhance learning by providing an environment conducive for research and experimentation in computer science. Placing this lab under the supervision of the CS/CIS department provides benefits for faculty, including faster response to new software installation and problems, and opportunities for faculty to take advantage of the lab for special course requirements such as loading a special operating system in the Operating Systems course. Hiring student workers for system administration also aids in teaching students the responsibility of interacting with customers (faculty in this case) and the need for responsiveness to customer requests.
An error analysis of two related quadrature methods for computing zeros of analytic functions
Authors: Tetsuya Sakurai, Peter Kravanja, Hiroshi Sugiura, Marc Van Barel
Venue: Journal of Computational and Applied Mathematics (2003)

We present an error analysis for two related quadrature methods (the Delves-Lyness method and its modification by Kravanja, Sakurai and Van Barel) for computing all the zeros of an analytic function that lie inside the unit circle. We consider the forward as well as the backward approximation error in case the integrals are computed via the trapezoidal rule on the unit circle. Contrary to the Delves-Lyness method, the quadrature error that arises from the zeros located inside the unit circle does not affect the results of the approach of Kravanja et al. Numerical experiments illustrate our main results.
Dating example for information architecture
Authors: Ray Henderson, TaRan Wilson, Miyuki Shimbo
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

This paper provides the documented explanations of our submitted poster to CHI 2003 about the process of Information Architecture (IA). The general theme of CHI 2003 was to deliver an innovative way of presenting IA in order to better the IA community through a given theme or use of a metaphor. Our poster, IA Dating Example for Information Architecture, explains how IA is related to everyone's daily lives. In this document, we describe the similarities of IA in the web field and in dating in each step of the IA process.
Optimizing parallel performance of unstructured volume rendering for the Earth Simulator
Authors: Li Chen, Issei Fujishiro, Kengo Nakajima
Venue: Parallel Computing (2003)

A scalable and high-performance parallel visualization subsystem has been developed in GeoFEM for the Earth Simulator (ES). As part of the ES project in Japan, the proposed sub-system is effective for the visualization of huge-scale unstructured datasets, and can be concurrent with computation on the same high-performance parallel computer. Moreover, some parallel visualization modules have obtained a good parallel performance, covering scalar, vector and tensor fields. This paper will take volume rendering method as an example to describe a number of efficient parallel performance optimization strategies we adopted for large-scale unstructured data visualization on SMP cluster machines, including suitable design of visualization method, the three-level hybrid parallelization which means message passing for inter-SMP node communication, loop directives for intra-SMP node parallelization, and vectorization for each processing element, plus dynamic load balancing. Good visualization images and high parallel performance have been achieved on the ES, thus demonstrating the feasibility and effectiveness of the proposed method.
Inserting Test Points to Control Peak Power During Scan Testing
Authors: Ranganathan Sankaralingam, Nur A. Touba
Venue: Proceedings of the 17th IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2002)

This paper presents a procedure for inserting test points at the outputs of scan elements of afull-scan circuit in such a manner that the peak power during scan testing is kept below a specified limit while maintaining the original fault coverage. If the power in a clock cycle during scan testing exceeds a specified limit (which depends on the peak power the chip has been designed to supply), a "peak power violation" is said to occur. Given a set of vectors, simulation is used to identify the cycles in which peak power violations occur (called "violating cycles"). For each violating cycle, the reduction in power caused by a control-0 and control-1 test point at each scan element is determined by simulation. The optimization problem then is to select as few test points as possible to eliminate all violating cycles. We present a heuristic procedure for minimizing the number of test points using integer linear programming techniques. The test points are activated and deactivated in a manner such that there is neither any loss in fault coverage nor peak power violations in the capture cycle. Experimental results indicate that the proposed procedure is very effective in controlling peak power during scan testing using a small number of test points.
Asymptotic properties of the spectral test, diaphony, and related quantities
Authors: Hannes Leeb
Venue: Mathematics of Computation (2002)

This paper presents the limit laws of discrepancies defined via exponential sums, and algorithms (with error bounds) to approximate the corresponding distribution functions. The results cover the weighted and the nonweighted spectral test of Hellekalek and various instances of the general discrepancies of Hiekernell and Hoogland and Kleiss for the exponential function system, as well as classical quantities like the spectral test, diaphony, and the Zaremba figure of merit.
Methods for identifying versioned and plagiarized documents
Authors: Timothy C. Hoad, Justin Zobel
Venue: Journal of the American Society for Information Science and Technology (2003)

The widespread use of on-line publishing of text promotes storage of multiple versions of documents and mirroring of documents in multiple locations, and greatly simplifies the task of plagiarizing the work of others. We evaluate two families of methods for searching a collection to find documents that are coderivative, that is, are versions or plagiarisms of each other. The first, the ranking family, uses information retrieval techniques; extending this family, we propose the identity measure, which is specifically designed for identification of co-derivative documents. The second, the fingerprinting family, uses hashing to generate a compact document description, which can then be compared to the fingerprints of the documents in the collection. We introduce a new method for evaluating the effectiveness of these techniques, and demonstrate it in practice. Using experiments on two collections, we demonstrate that the identity measure and the best fingerprinting technique are both able to accurately identify coderivative documents. However, for fingerprinting parameters must be carefully chosen, and even so the identity measure is clearly superior.
Labview programming for internet-based measurements
Authors: Korinne Resendez, Ray Bachnak
Venue: Journal of Computing Sciences in Colleges (2003)

Advances in networking technologies and the introduction of recent software development tools have made Internet-Based measurements a reality. This paper shows how LabVIEW can be used to perform data acquisition and remotely control hardware devices through the Internet. A front panel displays the real-time results and allows storage of acquired data for later processing. Applications may be monitored and controlled from any web browser, anywhere in the world.
Choice of a 2-D causal autoregressive texture model using information criteria
Authors: Olivier Alata, Christian Olivier
Venue: Pattern Recognition Letters (2003)

In the context of parametric modeling for image processing, we derive an estimation method for both the order and the parameters of 2-D causal autoregressive model with different geometries of support. Model parameters are estimated from a lattice representation, i.e. based on reflection coefficients. Lattice parameter estimation algorithms offer advantages compared to the Yule-Walker method: they do not require matrix inversion and their computation are robust and fast. For order selection, information criterion (IC) methods are the most commonly used. Therefore our order selection method is based on the combination of an IC and the prediction errors of models computed from the lattice parameter estimation algorithm. In this paper, we favour two consistent criteria compared to the nonconsistent Akaike criterion: the first criterion is a 2-D extension of Bayesian information criterion; the second criterion, noted φβ, extended here to the 2-D case, is a generalization drawn on Rissanen's works. Simulations are provided on synthetic and natural textures with quarter plane support and non-symmetrical half plane support. We validate our results on natural textures using the Kullback divergence. The results show the interest of the combination of 2-DFLRLS algorithm and φβ, criterion to characterize natural textures.