ppxscal/embedding_network huggingface dataset:
Reinforcement Learning with Extended Spatial and Temporal Learning Scale
Authors: Xiaodong Zhuang, Qingchun Meng, Bo Yin
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

In this paper, extended learning scale is proposed to improve the efficiency of reinforcement learning. The learning scale is defined and its impact on the performance of learning is investigated. Based on the correlation of the spatial or temporal neighboring states, fuzzy state and ant colony optimization are incorporated into reinforcement learning for the extension of learning scale. In the simulation experiments, the proposed learning methods with extended learning scale are applied in a robot path planning problem. The experimental results indicate that the extension of spatial and temporal learning scale improves the learning efficiency.
Icon-based Visualization of Large High-Dimensional Datasets
Authors: Ping Chen, Chenyi Hu, Wei Ding, Heloise Lynn, Yves Simon
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

High dimensional data visualization is critical todata analysts since it gives a direct view of originaldata. We present a method to visualize large amount ofhigh dimensional data. We divide dimensions of datainto several groups. Then, we use one icon to represent each group, and associate visual properties of eachicon with dimensions in each group. A high dimensional data record will be represented by multiple different types of icons located in the same position. Furthermore, we use summary icons to display local detailsof viewer's interests and the whole data set at meantime. We show its effectiveness and efficiency through a case study on a real large data set.
The Expected Number of 3D Visibility Events Is Linear
Authors: Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean
Venue: SIAM Journal on Computing (2003)

In this paper, we show that, amongst $n$ uniformly distributed unit balls in $\mathbb{R}^3$, the expected number of maximal nonoccluded line segments tangent to four balls is linear. Using our techniques we show a linear bound on the expected size of the visibility complex, a data structure encoding the visibility information of a scene, providing evidence that the storage requirement for this data structure is not necessarily prohibitive. These results significantly improve the best previously known bounds of $O(n^{8/3})$ [F. Durand, G. Drettakis, and C. Puech, {ACM Transactions on Graphics}, 21 (2002), pp. 176--206]. Our results generalize in various directions. We show that the linear bound on the expected number of maximal nonoccluded line segments that are not too close to the boundary of the scene and tangent to four unit balls extends to balls of various but bounded radii, to polyhedra of bounded aspect ratio, and even to nonfat three-dimensional objects such as polygons of bounded aspect ratio. We also prove that our results extend to other distributions such as the Poisson distribution. Finally, we indicate how our probabilistic analysis provides new insight on the expected size of other global visibility data structures, notably the aspect graph.
Determining core competences in the information development environment: an example
Authors: Anna M. Giardino, Stephen G. Pearce
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

Many articles have been written on how an organization can become more successful through building a core competence. Experience in this area has so far been gained mainly in manufacturing organizations. A different approach is necessary in other environments. This paper describes possible core competences inherent in the field of information development, and shows the methodology used to determine them. The methodology involves producing a series of matrixes that line up skills and customer requirements to arrive at the core competences.
Vision-Based Force Measurement
Authors: Michael A. Greminger, Bradley J. Nelson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--This paper demonstrates a method to visually measure the force distribution applied to a linearly elastic object using the contour data in an image. The force measurement is accomplished by making use of the result from linear elasticity that the displacement field of the contour of a linearly elastic object is sufficient to completely recover the force distribution applied to the object. This result leads naturally to a deformable template matching approach where the template is deformed according to the governing equations of linear elasticity. An energy minimization method is used to match the template to the contour data in the image. This technique of visually measuring forces we refer to as vision-based force measurement (VBFM). VBFM has the potential to increase the robustness and reliability of micromanipulation and biomanipulation tasks where force sensing is essential for success. The effectiveness of VBFM is demonstrated for both a microcantilever beam and a microgripper. A sensor resolution of less than +/- 3 nN for the microcantilever and +/- 3 mN for the microgripper was achieved using VBFM. Performance optimizations for the energy minimization problem are also discussed that make this algorithm feasible for real-time applications.
Systems, systems of systems, and the education of engineers
Authors: Stephen J. Lukasik
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

The thesis presented here is that the result of engineering is the design, construction, or operation of systems or their subsystems and components and that the teaching of systems must be central to engineering education. It is maintained that current undergraduate engineering curricula do not give the student adequate appreciation of this major intellectual element of their profession. Five proposals for approaches to correct this deficiency are offered: opportunities for clinical practice throughout all the undergraduate years; the use of distributed interactive simulation technology in semester-long projects; courses or course material on the phenomenology and behavior of systems; use of project management tools in engineering clinics; and encouraging engineering faculty to spend some part of their sabbaticals engaged in system design or operation. Issues of implementation are addressed, including the scaling of these ideas to universities that must meet the needs of large numbers of students.
NoCIC: a spice-based interconnect planning tool emphasizing aggressive on-chip interconnect circuit methods
Authors: Vishak Venkatraman, Andrew Laffely, Jinwook Jang, Hempraveen Kukkamalla, Zhi Zhu, Wayne Burleson
Venue: Proceedings of the 2004 international workshop on System level interconnect prediction (2004)

Performance and power of on-chip interconnects in the nanometer realm have been an increasing source of concern to designers. Network-on-Chip (NoC)structures have been proposed as a solution to achieve efficient and reliable communication. Even with the regularity of NoC structures, it is important for designers to acknowledge the physical layer interconnect issues to plan and quantify achievable performance. In this paper we present a spice-based tool: No-CIC: Network-on-Chip Interconnect Calculator, which enables NoC designers to assess the impact of interconnect circuit designs and understand the tradeoffs involved to achieve better a priori planning. NoCIC determines the interconnect performance and power based on select NoC and circuit parameters. The effects of each parameter on the interconnect performance and power are expressed through various two-dimensional and three-dimensional plots.
The Homomorphism Structure of Classes of Graphs
Authors: Jaroslav Nešetřil
Venue: Combinatorics, Probability and Computing (1999)

We consider three aspects of homomorphisms of graphs and hypergraphs which are related to the structure of colour classes: (1) density, (2) the fractal property and (3) the generation of colour classes. In particular, we prove a density theorem for hypergraphs and show that, for connected oriented graphs, all jumps are balanced (and give an example to show that connectivity is needed here). We also show that a Haj&oacute;s-type theorem holds for any colour class of undirected graphs, thus providing further evidence of the well-known &lsquo;non-effective&rsquo; character of Haj&oacute;s' theorem.
Efficent suboptimal state assignment for large sequential machines
Authors: Lech Jóźwiak
Venue: Proceedings of the conference on European design automation (1990)

Optimal state assignment is one of the most important problems in the automatic synthesis of sequential machines. State assignment approaches can be divided into: structural (that construct "suboptimal" assignments). and statistical (that generate assignments). We developed and implemented a new structural method. Analyzing the factors that influence the quality of assignments and performing experiments, we concluded that the distribution of solutions is close to a normal distribution. We introduced some probabilistic quality measures for assignments and assignment methods and we applied them both to the structural and random approach.We compared both approaches and indicated that the difficulty in evaluating the quality of an assignment by statistical approach is the main reason why structural approaches can be more efficient than statistical ones.
Representing geotechnical entities on the World Wide Web
Authors: D. G. Toll, A. C. Cubitt
Venue: Advances in Engineering Software (2003)

This paper describes the development of GeotechML, a mark-up language for representing geotechnical data on the web. GeotechML is a version of XML (Extensible Mark-up Language) specifically targeted at geotechnical engineering. The representation of geotechnical entities such as dams, retaining walls and foundations is presented. Stylesheets and Java applications have been developed to display the data graphically within a web browser. GeotechML will make it possible to search all geotechnical data available on the web. It is suggested that the World Wide Web will become an international repository of geotechnical information, avoiding the need to establish national or international geotechnical databases.
End user support usage
Authors: Robin Munkvold
Venue: Computing information technology: the human side (2003)

This study explores how different end user qualities affect actual use of support sources in organizations. It identifies three qualities: information technology-skills; computer self-efficacy; information technology (IT) - involvement. Sources of support are divided in: formal sources of support; informal sources of support; use of internal documentation and use of external documentation. Hypotheses are tested empirically through a cross sectional study in a large Norwegian organization. The results show end user qualities in varying degree may affect the end users' choice of different support sources. The study also shows access to a computer expert and giving collegial support might be important factors for explaining the variation in the end users' choices of support services.
Partitioning of embedded applications onto heterogeneous multiprocessor architectures
Authors: F. Salice, L. Del Vecchio, L. Pomante, W. Fornaciari
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper addresses the problem of designing heterogeneous multiprocessor embedded systems. The paper focuses on the basic steps of a proposed design flow with particular emphasis on the partitioning activity and the related metrics composing the cost function used to evaluate candidate design alternatives. Experimental results are also included, to show how to put in practice the proposed methodology.
An improved layout verification algorithm (LAVA)
Authors: Magdy S. Abadir, Jack Ferguson
Venue: Proceedings of the conference on European design automation (1990)

The correctness of a VLSI circuit layout can be verified by comparing the netlist extracted from the layout with the specification netlist. Ebeling and Zajicek [3, 4] showed that this problem can be solved by utilizing known techniques for solving classical graph isomorphism problem. In this paper we present an improved algorithm for solving the graph isomorphism problem associated with layout verification. This algorithm takes advantage of the hipartite nature of the graphs associated with the layout verification problem. The sum of the improvements in this algorithm tend to relieve the memory-intensive problems reported in [5], and accelerate the process.
An experimental comparison of computer-mediated and face-to-face focus groups
Authors: Christina Underhill, Murrey G. Olmsted
Venue: Social Science Computer Review (2003)

Conducting focus groups via computers is becoming an increasingly popular method for collecting data. The main benefits of Internet-based focus groups include lower cost, no travel expenses, automatic capture of the discussion data, and the ability to reach remote populations for participation. Although Internet-based focus groups are popular, little research has been done to compare the quantity and quality of the information obtained from traditional face-to-face focus groups and computer-based focus groups. This study compared the quantity and quality of information gained from face-to-face and two computer-based focus group conditions. Results indicated conducting focus groups using a computer produces similar amounts of information. Most important, the quality of the information obtained from computer-based focus groups is not significantly different from information obtained from face-to-face groups. Varying the levels of social interaction to cause different levels of perceived social presence did not produce differences in the quality or quantity of information.
Levelings, Image Simplification Filters for Segmentation
Authors: Fernand Meyer
Venue: Journal of Mathematical Imaging and Vision (2004)

Before segmenting an image, one has often to simplify it. In this paper we investigate a class of filters able to simplify an image without blurring or displacing its contours: the simplified image has less details, hence less contours. As the contours of the simplified image are as accurate as in the initial image, the segmentation may be done on the simplified image, without going back to the initial image. The corresponding filters are called levelings. Their properties and construction are described in the present paper.
Scheduling problems for parallel dedicated machines under multiple resource constraints
Authors: H. Kellerer, V. A. Strusevich
Venue: Discrete Applied Mathematics (2003)

The paper considers scheduling problems for parallel dedicated machines subject to resource constraints. A fairly complete computational complexity classification is obtained, a number of polynomial-time algorithms are designed. For the problem with a fixed number of machines in which a job uses at most one resource of unit size a polynomial-time approximation scheme is offered.
Bridging the requirements gap: policies, goals and domains
Authors: A. G. Sutcliffe, N. A. M. Maiden
Venue: Proceedings of the 7th international workshop on Software specification and design (1993)

A model for requirements engineering is described which uses a taxonomy of goal-types to guide further analysis. Goals are classified according to the desired system state described in requirements statements. Heuristics then prompt further description of functions according to each goal class. Other analyses encourage expansion of goal statements into specification of objects agents, activity and information processes. These link functional decomposition of requirements to object oriented modelling. Implications of the model and supporting tools are briefly reviewed.
Bottom-up education
Authors: Donald E. Knuth
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

People who discover the power and beauty of high-level, abstract ideas often make the mistake of believing that concrete ideas at lower levels are relatively worthless and might as well be forgotten. The speaker will argue that, on the contrary, the best computer scientists are thoroughly grounded in basic concepts of how computers actually work, and indeed that the essence of computer science is an ability to understand many levels of abstraction simultaneously. Therefore he has put considerable effort into the design of a RISC machine called MMIX, as an aid to computer science educators. MMIX is intended to be simple and clean yet realistic. Many tools have been built to simulate the MMIX architecture, and more are under development.
A design method for cold backward extrusion using FE analysis
Authors: K. D. Hur, Y. Choi, H. T. Yeo
Venue: Finite Elements in Analysis and Design (2003)

The dimensional accuracy of the cold forged products is strongly dependent on the elastic characteristics of the die. Therefore, a design method that makes the elastic deformation of the prestressed die as small as possible has been proposed for precision cold forging. For the purpose, applying the hard materials such as sintered carbide to the first stress ring is considered in die construction. For the design, Lamé's equation is used and the diameter ratios and interferences are determined by using the maximum inner pressure without yielding of rings after shrink fitting and during cold forging. The rigid-plastic FE analysis of backward extrusion process using DEFORM has been performed and the analysis of elastic deformation of the dies has been done by using ANSYS with non-linear contact. In the simulation results, it has been found that the use of high stiffness materials to the first stress ring of forging dies can reduce the elastic deformation of die insert without failure.
Mining confident co-location rules without a support threshold
Authors: Yan Huang, Hui Xiong, Shashi Shekhar, Jian Pei
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Mining co-location patterns from spatial databases may reveal types of spatial features likely located as neighbors in space. In this paper, we address the problem of mining confident co-location rules without a support threshold. First, we propose a novel measure called the maximal participation index. We show that every confident co-location rule corresponds to a co-location pattern with a high maximal participation index value. Second, we show that the maximal participation index is non-monotonic, and thus the conventional Apriori-like pruning does not work directly. We identify an interesting weak monotonic property for the index and develop efficient algorithms to mine confident co-location rules. An extensive performance study shows that our method is both effective and efficient for large spatial databases.
CHEOPS: an integrated VLSI floor planning and chip assembly system implemented in object oriented LISP
Authors: Christian Masson, Denis Barbier, Remy Escassut, Daniel Winer, Gregory Chevallier, Pierre François Zeegers
Venue: Proceedings of the conference on European design automation (1990)

This paper presents the architecture and capabilities of the CHEOPS Floor Planning and Chip Assembly System which was implemented in Le_Lisp (&reg; trademark from INRIA) using object-oriented programming.CHEOPS is a highly interactive system which allows the designer to smoothly monitor all the steps from initial floorplanning evaluations down to final chip composition and detailed routing. CHEOPS adresses full custom macro-cell layout. Its major feature is a memory data structure that uniformly models topological relationships and connectivity through all floorplan refinement steps.
Acceleration Schemes of the Discrete Velocity Method: Gaseous Flows in Rectangular Microchannels
Authors: D. Valougeorgis, S. Naris
Venue: SIAM Journal on Scientific Computing (2003)

The convergence rate of the discrete velocity method (DVM), which has been applied extensively in the area of rarefied gas dynamics, is studied via a Fourier stability analysis. The spectral radius of the continuum form of the iteration map is found to be equal to one, which justifies the slow convergence rate of the method. Next the efficiency of the DVM is improved by introducing various acceleration schemes. The new synthetic-type schemes speed up significantly the iterative convergence rate. The spectral radius of the acceleration schemes is also studied and the so-called H1 acceleration method is found to be the optimum one. Finally, the two-dimensional flow problem of a gas through a rectangular microchannel is solved using the new fast iterative DVM. The number of required iterations and the overall computational time are significantly reduced, providing experimental evidence of the analytic formulation. The whole approach is demonstrated using the BGK and S kinetic models.
Computer applications in higher education: a case study of students' experiences and perceptions
Authors: James Mcelhinney
Venue:  (2003)

The purpose of this qualitative study was to describe the educational experiences with computers of nine female international graduate students at Ball State University. Their experiences with computers before they came to the United States, their current use of computers during their study at Ball State University, challenges faced related to the use of computers during their graduate study in the United States, and the support received from the university to help them overcome these barriers were described. Descriptions of ways computers supplemented and enriched the experiences of female international graduate students in the completion of their graduate work at Ball State University were reported. Participants of the present study were nine female international graduate students from Ball State University. They were identified through cooperation with the Center For International Programs, which provided a list of names and e-mail addresses of female international graduate students who were enrolled in graduate studies at Ball State University. Nine female international graduate students were selected from the list. The researcher interviewed each participant for two hours on one occasion. Following each interview participants were asked to complete a brief questionnaire to identify age, country of origin, academic program, and length of time spent in the United States. The following conclusions were established based upon this research study: (1) most participants did not use computer applications on a daily basis during their undergraduate study in their native countries; (2) all participants used computer applications on a daily basis during their study at BSU; (3) some participants faced two important academic adjustments at the same time, the adjustment to the English language and the adjustment to the use of computer; (4) most participants received support from friends regarding the use of computers; (5) most participants faced problems regarding their typing skills; (6) using the library web site was a challenge for most participants; (7) all participants believed that the use of computers enriched their experiences during their study at BSU; and (8) all participants used the Self-Learning Theory to improve their computer skills.