ppxscal/embedding_network huggingface dataset:
Introduction to the experience reports track
Authors: Constance Heitmeyer, Klaus Pohl
Venue: Proceedings of the 27th international conference on Software engineering (2005)

It is our great pleasure to welcome you to the Experience Reports Track of the 27th International Conference on Software Engineering (ICSE). The objective of the Experience Reports Track is to establish a dialogue between software practitioners and software engineering researchers on the benefits, obstacles, and weaknesses of applying software engineering principles, techniques, methods, processes, and tools in an industrial or organizational setting. In the call for papers, we invited four types of submissions: case studies, experience reports, experimental reports and problem statements. The call attracted 72 submissions from all over the world. The program committee of the Experience Reports Track accepted 14 submissions. The selection was based on at least three reviews per submission and the results of intensive consensus discussions prior to and during the Experience Reports Track program committee meeting, held on November 12, 2004 in Essen, Germany.The accepted papers of the ICSE 2005 Experience Reports Track cover topics such as agile methods, product lines, requirements engineering, software architecture, testing and verification. They document important lessons learned from applying software engineering principles, techniques, methods, processes, and tools in practice. Putting together the Experience Reports Track of ICSE 2005 was a team effort. We extend our sincerest gratitude to all of the people who helped us shape this event, especially to the members of our program committee and the ICSE 2005 organizing committee and to Richard van de Stadt, Andreas Metzger, and Nelufar Ulfat-Bunyadi. We hope that you find the Experience Reports Track of ICSE 2005 interesting and thought-provoking.
Bounded-Degree Independent Sets in Planar Graphs
Authors: Therese Biedl, Dana F. Wilkinson
Venue: Theory of Computing Systems (2005)

An independent set of a graph is a set of vertices without edges between them. Every planar graph has an independent set of size at least (1/4)n and there are planar graphs for which any independent set has size at most (1/4)n. In this paper similar bounds are provided for the problem of bounded-degree independent set, i.e., an independent set where additionally all vertices have degree less than a pre-specified bound D. Our upper and lower bounds match (up to a small constant) for D ¿ 16.
Ionosphere disturbances during rocket launches at Baikonur (Kazakhstan)
Authors: V. I. Drobzhev, G. I. Gordienko, S. N. Mukasheva
Venue: Mathematics and Computers in Simulation (2004)

A review of the ionosphere disturbances created by burning rockets is given. Published materials obtained by different authors are used in the review. Contemporary ionospheric data (f0 E, f0 F1, f0 F2, h'F, fmin, f0 Es) of ionosonde measurements obtained at the Alma-Ata [43.25N, 76.92E] and Novokazalinsk [45.77N, 62.12E] sounding stations taken for the time of rocket launching from Baikonur (Kazakhstan) in the periods of 1975, 1979 and October 2000-November 2001 are also analysed.The main characteristics of such disturbances seem to be the deficiency of electrons and strongly disturbed ionosphere structures (strong wave-like disturbances in electron density) occurring along the trajectory of burning rockets, which modify the propagation of radio waves.
Eye tracking in the wild
Authors: Dan Witzner Hansen, Arthur E. C. Pece
Venue: Computer Vision and Image Understanding (2005)

An active contour tracker is presented which can be used for gaze-based interaction with off-the-shelf components. The underlying contour model is based on image statistics and avoids explicit feature detection. The tracker combines particle filtering with the EM algorithm. The method exhibits robustness to light changes and camera defocusing; consequently, the model is well suited for use in systems using off-the-shelf hardware, but may equally well be used in controlled environments, such as in IR-based settings. The method is even capable of handling sudden changes between IR and non-IR light conditions, without changing parameters. For the purpose of determining where the user is looking, calibration is usually needed. The number of calibration points used in different methods varies from a few to several thousands, depending on the prior knowledge used on the setup and equipment. We examine basic properties of gaze determination when the geometry of the camera, screen, and user is unknown. In particular we present a lower bound on the number of calibration points needed for gaze determination on planar objects, and we examine degenerate configurations. Based on this lower bound we apply a simple calibration procedure, to facilitate gaze estimation.
Variable work function in MOS capacitors utilizing nitrogen-controlled TiNx gate electrodes
Authors: Jörgen Westlinder, Gustaf Sjöblom, Jörgen Olsson
Venue: Microelectronic Engineering (2004)

A substantial shift in the work function of TiN"x by as much as 0.7 eV is achieved by varying the nitrogen gas flow during the reactive sputter deposition of the metal gate, which indicates tunability for replacing poly-Si in a CMOS process. TiN"x MOS capacitors having multiple SiO"2 thicknesses have been evaluated and the work function of TiN"x can be altered from 4.2 to 4.9 eV depending on the nitrogen content. The values are stable after RTP annealing up to 600 ^oC in nitrogen gas for 30 s, although annealing at 800 ^oC changes the work function for the different compositions towards a mid-gap value. No variation in EOT with annealing temperature is observed for the TiN"x/SiO"2 stacks deposited at high nitrogen gas flow. The change in work function appears not to be correlated to the crystalline orientation of the TiN"x. The work function is instead believed to be affected by extrinsic states in the metal/dielectric interface.
A Built-in Self-Test Method for Write-only Content Addressable Memories
Authors: Dilip K. Bhavsar
Venue: Proceedings of the 23rd IEEE VLSI Test Symposium (2005)

A novel and pragmatic Built-in Self Test technique provides cost-effective and thorough testing and diagnosis of content addressable memories (CAMs). The method is particularly attractive for write-only CAMs, as neither the presence of a read port nor direct observability of CAM match -lines are required or testing. The underlying test algorithm uniquely exploits little known inherent properties of pseudorandom patterns generated by linear feedback shift registers in a test-time and hardware-efficient BIST implementation.
Corner and start-up singularities in porous flow
Authors: M. Chapwanya, S. B. G. O'Brien
Venue: Journal of Computational and Applied Mathematics (2005)

We consider the penetration of liquid into a porous medium which is, in part, impervious to the liquid. Corners arise at points where the medium becomes impervious and numerical difficulties can arise due to a conflict in the boundary conditions. In addition there are start-up problems associated with numerically modelling the flow problem because the flow domain is initially empty. We consider some techniques for exploiting similarity techniques to develop accurate numerical algorithms which avoid the above difficulties.
Reasoning about structure, behavior and function
Authors: B. Chandrasekaran, Rob Milne
Venue: Issue 93 (July 1985) (1985)

The last several years' of work in the area of knowledge-based systems has resulted in a deeper understanding of the potentials of the current generation of ideas, but more importantly, also about their limitations and the need for research both in a broader framework as well as in new directions. The following ideas seem to us to be worthy of note in this connection.
Language equations, maximality and error-detection
Authors: Lila Kari, Stavros Konstantinidis
Venue: Journal of Computer and System Sciences (2005)

We use some 'natural' language operations, such as shuffle (scattered insertion) and scattered deletion to model noisy channels, that is, nondeterministic processes transforming words to words. In this spirit, we also introduce the operation of scattered substitution and derive the closure properties of the language families in the Chomsky hierarchy under this operation. Moreover, we consider a certain type of language inequations involving language operations and observe that, by varying the parameters of such an inequation, we can define families of codes such as prefix and infix, as well as families of error-detecting languages. Our results on this type of inequations include a characterization of the maximal solutions, which provides a uniform method for deciding whether a given regular code of the type defined by the inequation is maximal.
A Hardware Acceleration Unit for MPI Queue Processing
Authors: Keith D. Underwood, K. Scott Hemmert, Arun Rodrigues, Richard Murphy, Ron Brightwell
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

With the heavy reliance of modern scientific applications upon the MPI Standard, it has become critical for the implementation of MPI to be as capable and as fast as possible. This has led some of the fastest modern networks to introduce the capability to offload aspects of MPI processing to an embedded processor on the network interface. With this important capability has come significant performance implications. Most notably, the time to process long queues of posted receives or unexpected messages is substantially longer on embedded processors. This paper presents an associative list matching structure to accelerate the processing of moderate length queues in MPI. Simulations are used to compare the performance of an embedded processor augmented with this capability to a baseline implementation. The proposed enhancement significantly reduces latency for moderate length queues while adding virtually no overhead for extremely short queues.
Verify Feature Models using protegeowl
Authors: Hai Wang, Yuan Fang Li, Jing Sun, Hongyu Zhang
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Feature models are widely used in domain engineering to capture common and variant features among systems in a particular domain. However, the lack of a widely-adopted means of precisely representing and formally verifying feature models has hindered the development of this area. This paper presents an approach to modeling and verifying feature diagrams using Semantic Web ontologies.
Book Review: Artificial Intelligence and Tutoring Systems: Computational and Cognitive Approaches to the Communication of Knowledge by Eitenne Wenger (Morgan Kaufmann Publishers)
Venue: Issue 109 (July 1989) (1989)

Upon first encountering Etienne Wenger's book, "Artificial Intelligence and Tutoring Systems: Computational and Cognitive Approaches to the Communication of Knowledge," I assumed that it was the sort of book that would serve only as a reference. To find out about the EXCHECK tutoring system, I would just look it up in the exhaustive subject index. To see what tutoring work Beverly Woolf had done, I would look up her name in the author index. But, upon further examination, Wenger's book was revealed to be a good introductory text, first laying out basic issues in Chapters 1 and 2, then covering systems from SCHOLAR and SOPHIE to GUIDON and ACTP in Chapters 3 through 13. Each review chapter ends with a summary and an excellent set of bibliographic notes, further reinforcing the utility of the book as a reference and introduction to the field. In addition, it became clear that the book had another facet. As John Seely Brown and James Greeno point out in the introduction, "... this book is no mere catalog of programs and techniques... he has also laid out a provocative framework for analyzing and comparing intelligent tutoring systems." This framework is presented in Chapters 14 through 20. Thus, Wenger's book serves three purposes: it acts as a reference, it provides a comprehensive introduction to intelligent tutoring systems, and it develops a coherent framework for thinking about issues in any intelligent system that must communicate its knowledge.
Robust object detection and segmentation by peripheral increment sign correlation image
Authors: Yutaka Satoh, Shun'ichi Kaneko, Satoru Igarashi
Venue: Systems and Computers in Japan (2004)

This paper proposes the peripheral increment sign correlation image, which can be used to evaluate sign changes of the neighborhood brightness. Based on the technique, a robust method is presented for detection and separation of the object emerging from the image time sequence, with the following features. (1) The result is not affected by the brightness distribution of the emerging object. (2) The result is not affected by brightness change of the background. The peripheral increment sign correlation image is constructed from only the trend of the brightness changes in the neighborhood of the pixel under consideration. Consequently, the image is highly robust to brightness changes over the sequence, and the similarity of the original texture pattern can be detected even if there is a brightness change. Furthermore, it does not require complex preprocessing or parameter setting, and a high-density difference image can be directly derived. Through experiments using real images with various conditions, it is verified that difference extraction which is robust to brightness change can be realized, indicating the effectiveness of the approach. An application experiment is performed to extract the emerging object area in a scene, and it is verified that segmentation can be performed while retaining good contours and continuity by adding a relatively simple filter sequence as postprocessing. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(9): 70&ndash;80, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10241
Two-dimensional behavior decompositions with Finite-Dimensional Intersection: A Complete Characterization
Authors: Mauro Bisiacco, Maria Elena Valcher
Venue: Multidimensional Systems and Signal Processing (2005)

In this paper, the following problem is addressed: given a two-dimensional complete behavior $${\cal B}$$ and one of its sub-behaviors $${\cal B}_B$$ , under what conditions a third complete behavior $${\cal B}_A$$ can be found, such that $${\cal B} = {\cal B}_A + {\cal B}_B$$ and $${\cal B}_A \cap {\cal B}_B$$ is finite-dimensional autonomous? This constitutes a complete generalization of the decomposition theorem, as it represents a decomposition with "minimal intersection", in which one of the two terms has been a priori fixed. The analysis carried on here completes the preliminary results reported in [Bisiacco and Valcher, Multidimensional Systems and Signal Processing, vol. 13,2002, pp. 289--315]. and completely generalizes the direct sum decomposition problem presented in [Bisiacco and Valcher, IEEE Transactions on Circuits and Systems Part I, CAS-I-48, no-4, 2001, pp. 490--494].
Using an expert panel to validate a requirements process improvement model
Authors: Sarah Beecham, Tracy Hall, Carol Britton, Michaela Cottee, Austen Rainer
Venue: Journal of Systems and Software (2005)

In this paper we present components of a newly developed software process improvement model that aims to represent key practices in requirements engineering (RE). Our model is developed in response to practitioner needs highlighted in our empirical work with UK software development companies. We have now reached the stage in model development where we need some independent feedback as to how well our model meets our objectives. We perform this validation through involving a group of software process improvement and RE experts in examining our RE model components and completing a detailed questionnaire. A major part of this paper is devoted to explaining our validation methodology. There is very little in the literature that directly relates to how process models have been validated, therefore providing this transparency will benefit both the research community and practitioners. The validation methodology and the model itself contribute towards a better understanding of modelling RE processes.
Minimizing Uncertainty in Determinants and Ratios of Determinants for Invariant Relationships Employed in SAR Imagery Pattern Recognition
Authors: Lewis Reynolds, Woody Kober
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Invariant relationships involving ratios of determinants have been proposed for the classification of an object in SAR imagery. The target detection decision-making process depends on the uncertainty involved in the measurements. At fixed experimental resolution, some determinants are simply better than others because they are much less sensitive to uncertainty. A geometrical interpretation of determinants is applied to assess the minimum relative uncertainty expected for a determinant employed in invariant relationships. Because much larger relative uncertainties can occur in some determinants, a method based on the perturbation of eigenvalues is proposed to identify determinants that are less sensitive to element errors. Symmetric alpha-stable probability distribution functions are employed to characterize error distributions in ratios of determinants.
Genetic algorithms for an improved parameter estimation with local refinement of tetrahedral meshes in a wind model
Authors: G. Montero, E. Rodríguez, R. Montenegro, J. M. Escobar, J. M. González-Yuste
Venue: Advances in Engineering Software (2005)

The efficiency of a mass-consistent model for wind field adjustment depends on several parameters that arise in various stages of the process. On one hand, those involved in the construction of the initial wind field using horizontal interpolation and vertical extrapolation of the wind measures registered at meteorological stations. On the other hand, the stability parameter which allows from a strictly horizontal wind adjustment to a pure vertical one. In general, the values of all of these parameters are based on empirical laws. The main goal of this work is the estimation of these parameters using genetic algorithms, such that some of the wind velocities observed at the measurement station are regenerated as accurately as possible by the model. In addition, we study the effect of the mesh refinement on the parameter estimation in several numerical experiments.
Improving information retrieval effectiveness by assigning context to documents
Authors: Vivek Chanana, Athula Ginige, San Murugesan
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

Recently we proposed a new context-based information retrieval system that has better retrieval effectiveness than the traditional key-word systems. In this system, each document is assigned context(s) based on the type of information. This paper presents context categories for documents in computing and information technology domain and offers a new methodology for assigning context to documents in a collection. This methodology showed promising results and the inter-assigner consistency quite comparable to the results reported in literature. The comparative evaluation of context-based information retrieval system with a baseline information retrieval system showed promising results.
A Unified Optimization Based Learning Method for Image Retrieval
Authors: Hanghang Tong, Jingrui He, Mingjing Li, Wei-Ying Ma, Changshui Zhang, Hong-Jiang Zhang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper, an optimization based learning method is proposed for image retrieval from graph model point of view. Firstly, image retrieval is formulated as a regularized optimization problem, which simultaneously considers the constraints from low-level feature, online relevance feedback and offline semantic information. Then, the global optimal solution is developed in both closed form and iterative form, providing that the latter converges to the former. The proposed method is unified in the senses that 1) it makes use of the information from various aspects in a global optimization manner so that the retrieval performance might be maximally improved; 2) it provides a natural way to support two typical query scenarios in image retrieval. The proposed method has a solid mathematical ground. Systematic experimental results on a general-purpose image database demonstrate that it achieves significant improvements over existing methods.
Receding Horizon Control for Legged Robot&ndash;Slack Variable Method for Swing Leg
Authors: Takeuchi Hiroki
Venue: Journal of Robotic Systems (2004)

The slack variable method is introduced into receding horizon control with inequality constraint, and formulation about swing leg is described. Generally, the conditions that swing leg does not fall under the floor altitude can be described as inequality state variable constraint. It is difficult to treat this as a states variable constraint, because there is not control input variable explicitly. In this paper, it proposes dealing this with a problem using slack variable. This simple formulation can be applied to a varied legged robot with any number of legs. &copy; 2004 Wiley Periodicals, Inc. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Measuring e-government impact: existing practices and shortcomings
Authors: Rob M. Peters, Marijn Janssen, Tom M. van Engers
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Public administrations of all over the world invest an enormous amount of resources in e-government. How the success of e-government can be measured is often not clear. E-government involves many aspects of public administration ranging from introducing new technology to business process (re-)engineering. The measurement of the effectiveness of e-government is a complicated endeavor.In this paper current practices of e-government measurement are evaluated. A number of limitations of current measurement instruments are identified. Measurement focuses predominantly on the front (primarily counting the number of services offered) and not on the back-office processes. Interpretation of measures is difficult as all existing measurement instruments lack a framework depicting the relationships between the indicators and the use of resources. The different measures may fit the aim of the owners of the e-governmental services, however, due to conflicting aims and priorities little agreement exists on a uniform set of measures, needed for comparison of e-government development. Traditional methods of measuring e-government impact and resource usage fall short of the richness of data required for the effective evaluation of e-government strategies.
Seamless texture atlases
Authors: Budirijanto Purnomo, Jonathan D. Cohen, Subodh Kumar
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

Texture atlas parameterization provides an effective way to map a variety of color and data attributes from 2D texture domains onto polygonal surface meshes. However, the individual charts of such atlases are typically plagued by noticeable seams. We describe a new type of atlas which is seamless by construction. Our seamless atlas comprises all quadrilateral charts, and permits seamless texturing, as well as per-fragment down-sampling on rendering hardware and polygon simplification. We demonstrate the use of this atlas for capturing appearance attributes and producing seamless renderings.