ppxscal/embedding_network huggingface dataset:
A smooth spiral tool path for high speed machining of 2D pockets
Authors: Martin Held, Christian Spielberger
Venue: Computer-Aided Design (2009)

We introduce a new algorithm for generating a spiral tool path for high-speed machining of pockets without islands. The pocket may be an arbitrary simply-connected 2D shape bounded by straight-line segments and circular arcs. The tool path is generated by interpolating growing disks placed on the medial axis of the pocket. It starts inside the pocket and spirals out to the pocket boundary. The tool path is guaranteed to be free of self-intersections and allows machining of the pocket without tool retractions. The start point of the spiral may be chosen freely by the user anywhere within the pocket. Most importantly, the spiral tool path complies with a user-specified maximum cutting width. The output of our algorithm is a G^1-continuous spiral path. However, in a post-processing step, a properly adapted variant of the recent ''PowerApx'' package [Heimlich M, Held M. Biarc approximation, simplification and smoothing of polygonal curves by means of Voronoi-based tolerance bands. International Journal of Computational Geometry & Applications 2008;18(3):221-50] can be used to boost the tool path to C^2-continuity. Our new algorithm was implemented and tested successfully on real-world data. We conclude our paper by an analysis of sample tool paths produced by our implementation.
Interactive Correction and Recommendation for Computer Language Learning and Training
Authors: Claus Pahl, Claire Kenny
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

Active learning and training is a particularly effective form of education. In various domains, skills are equally important to knowledge. We present an automated learning and skills training system for a database programming environment that promotes procedural knowledge acquisition and skills training. The system provides meaningful knowledge-level feedback such as correction of student solutions and personalized guidance through recommendations. Specifically, we address automated synchronous feedback and recommendations based on personalized performance assessment. At the core of the tutoring system is a pattern-based error classification and correction component that analyzes student input in order to provide immediate feedback and in order to diagnose student weaknesses and suggest further study material. A syntax-driven approach based on grammars and syntax trees provides the solution for a semantic analysis technique. Syntax tree abstractions and comparison techniques based on equivalence rules and pattern matching are specific approaches.
Unit testing in Java
Authors: Viera K. Proulx, Weston Jossey
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

The design of unit tests is a fundamental part of learning to design programs. We present a Java library that supports the design of tests for a novice programmer, together with the test evaluation, and the reporting of test results in an informative manner. The tester library has been used at a number of universities with a great success.
A spectral solution of nonlinear mean field dynamo equations: With inertia
Authors: Mohammad M. Rahman, David R. Fearn
Venue: Computers Mathematics with Applications (2009)

This paper presents a numerical solution method for the nonlinear mean field dynamo equations in a rotating fluid spherical shell. A finite amplitude field drives a flow through the Lorentz force in the momentum equation and this flow feeds back on the field-generation process in the magnetic induction equation, equilibrating the field. This equilibration process is a key aspect of the full hydrodynamic dynamo as well as mean field dynamo. Including full inertial term we present pseudo-spectral time-stepping procedure to solve the coupled nonlinear momentum equation and induction equation with no-slip velocity boundary conditions in the core for a finitely conducting inner core and an insulating mantle. The method is found suitable for solving many geophysical problems.
Quantifying scaling effects on satellite-derived forest area estimates for the conterminous USA
Authors: Daolan Zheng, L. S. Heath, M. J. Ducey, J. E. Smith
Venue: International Journal of Remote Sensing (2009)

We quantified the scaling effects on forest area estimates for the conterminous USA using regression analysis and the National Land Cover Dataset 30 m satellite-derived maps in 2001 and 1992. The original data were aggregated to: (1) broad cover types (forest vs. non-forest); and (2) coarser resolutions (1 km and 10 km). Standard errors of the model estimates were 2.3% and 4.9% at 1 km and 10 km resolutions, respectively. Our model improved the accuracies for 1 km by 0.6% (12 556 km2) in 2001 and 1.9% (43 198 km2) in 1992, compared to the forest estimates before the adjustments. Forest area observed from Moderate Resolution Imaging Spectroradiometer (MODIS) 2001 1 km land-cover map for the conterminous USA might differ by 80 811 km2 from what would be observed if MODIS was available at 30 m. Of this difference, 58% (46 870 km2) could be a relatively small net improvement, equivalent to 1444 Tg (or 1.5%) of total non-soil forest CO2 stocks. With increasing attention to accurate monitoring and evaluation of forest area changes for different regions of the globe, our results could facilitate the removal of bias from large-scale estimates based on remote sensors with coarse resolutions.
Controlling and disclosing your personal information
Authors: Norjihan Abdul Ghani, Zailani Mohamed Sidek
Venue: WSEAS Transactions on Information Science and Applications (2009)

As organizations come to rely on the collection and use of personal information in order to complete the transactions and providing good services to their users, more and more user personal information is being shared with web service providers leading to the need to protect the privacy. Personal information is processed, stored and disclosed and often it generated in the course of making a commercial exchange. Credit card numbers, individual identity number, purchase records, monthly income, and related types of personal information all have important role with his this commercial information system. However this creation and use of personal information raises issues of privacy not only for the individual, but also for organizations. Easy access to private personal information will cause the misuse of data, no control over the information and others. Because of this, it's important to protect the information not only from external threats but also from insider threats. Data disclosure when performing a task in web-based application should be ensured. Within the electronic scenario, personal information have been collected, stored, manipulated and disclosed without the owner's consent. This paper will discuss on the relationship between personal information and its privacy. We also extended the model introduced by Al-Fedaghi as a way to control the personal information disclosure. We also suggested that the use of Hippocratic Database concepts as a way to control the personal information disclosure.
Reconstruction of Branching Surface and Its Smoothness by Reversible Catmull-Clark Subdivision
Authors: Kailash Jha
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

In the current research a new algorithm has been developed to get surface from the contours having branches and a final smooth surface is obtained by reversible Catmull-Clark Subdivision. In branching, a particular layer has more than one contour, corresponds with the contour at the adjacent layer. The layer having more than one contour is converted into a 3D composite curve by inserting points between the layers. The points are inserted in such a way that the center of contours should merged to the center of the contours at the adjacent layer. This process is repeated for all layers having branching problems. In the next step, 3D composite curves are converted into different polyhedrons by the help of the contours at adjacent layers. Number of control points at different layer for contours and 3D curves may not be the same, in this case a special polyhedron construction technique has been developed. The polyhedrons are subdivided using reversible Catmull-Clark subdivision to give a smooth surface.
Microsoft Office Access 2007 in Business
Authors: Joseph Manzo
Venue:  (2007)

The In Business system is the only series that prepares you expressly for your core business classes such as Accounting, Economics, Marketing, Finance and Business Statistics by doing the following: exposing you to real business files that meet professional standards; providing a useful reference to be used in your business classes; instructing how to use the software as a tool to accomplish business goals; coverage of the core Office skills that you will need in your business courses. In Business includes tools that will benefit any style of learning. Whether you need to reference specific skills for another course or understand how to utilize Microsoft Office to complete your business objectives, In Business will allow you to apply these skills directly to your own education and career aspirations.
On the Challenges of Correctly Using Metamodels in Software Engineering
Authors: Brian Henderson-Sellers
Venue: Proceeding of the 2007 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the sixth SoMeT_07 (2007)

Metamodels are increasingly being used in software engineering, particularly in standards from both the OMG and ISO. It is therefore critical that these metamodels be used “correctly”. In this paper, we investigate some of the pitfalls observed in the use of metamodelling ideas in software engineering and, from these observations, deduce some rules of thumb to help increase the quality of usage of metamodels in software engineering in the future.
How To Use Grid Technology for Building the Next Generation Learning Environments
Authors: Nicola Capuano, Angelo Gaeta, Giuseppe Laria, Francesco Orciuoli, Pierluigi Ritrovato
Venue: Proceeding of the 2005 conference on Towards the Learning Grid: Advances in Human Learning Services (2005)

Grid technologies promise to improve the way we think about e-learning allowing wide-scale learning resources sharing in heterogeneous and geographically distributed environments, allowing, in this way, the implementation of distributed learning spaces where different organizations and individuals are able to cooperate in pursuing similar and complementary learning and training objectives. But is the e-learning ready for this evolution? In this paper we try, starting from an existing e-learning platform named IWT, to sketch a possible migration path toward a Grid based environment. IWT was selected because it presents a flexible, service-oriented, layered architecture suitable for migration in an OGSA compliant environment. The new approach will provide more flexibility, in fact, it could leverage on the resources distributed across the Grid in order to build the learning experience that best fit student requirements. A use case scenario is also provided in order to emphasize differences between the two approaches.
Multidimensional mutation evolutionary algorithm
Authors: Corina Rotar
Venue: Proceedings of the 10th WSEAS international conference on evolutionary computing (2009)

The behavior of standard evolutionary algorithm in the case of multi-modal optimization problems meets a major difficulty. It generally converges towards a single optimum point failing to maintain in the population the multiple optima of the problem under consideration. Various methods enrich the standard algorithm to obtain efficient techniques for solving multi-modal problems. These methods mainly consist of increasing the population diversity and of maintaining the promising areas in the search space in order to finally achieve convergence of the population towards the multiple optima. The present paper introduces mmEA, an evolutionary algorithm for multimodal optimization based on multidimensional exploration of the search space. This technique doesn't require any user defined parameter except those specific to standard evolutionary algorithm. Experiments and comparisons with similar techniques from literature, for static and dynamic environment, prove that mmEA technique is promising.
Complex dynamic behavior during transition in a solid combustion model
Authors: Jun Yu, Laura K. Gross, Christopher M. Danforth
Venue: Complexity (2009)

Through examples in a free-boundary model of solid combustion, this study concerns nonlinear transition behavior of small disturbances of front propagation and temperature as they evolve in time. This includes complex dynamics of period doubling, and quadrupling, and it eventually leads to chaotic oscillations. Within this complex dynamic domain we also observe a period six-folding. Both asymptotic and numerical solutions are studied.We show that for special parameters our asymptotic method with some dominant modes captures the formation of coherent structures. Finally,we discuss possible methods to improve our prediction of the solutions in the chaotic case. &copy; 2009 Wiley Periodicals, Inc. Complexity, 2009 This article was submitted as an invited paper at the Understanding Complex Systems conference held at the University of Illinois at Urbana, Champaign, May 2007.
Relating Machine Estimates of Students' Learning Goals to Learning Outcomes: A DBN Approach
Authors: Carole R. Beal, Lei Qu
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

Students' actions while working with a tuoring system were used to generate estimates of learning goals, specifically, the goal of learning by using multimedia help resources, and the goal of learning through independent problem solving. A Dynamic Bayesian Network (DBN) model was trained with interface action and inter-action interval latency data from 115 high school students, and then tested with action data from an independent sample of 135 students. Estimates of learning goals generated by the model predicted student performance on a post-test of math achievement, whereas pre-test performance did not.
Distance-Based Non-Deterministic Semantics
Authors: Ofer Arieli, Anna Zamansky
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

Representing uncertainty and reasoning with dynamically evolving systems are two related issues that are in the heart of many information systems. In this paper we show that these tasks can be successfully dealt with by incorporating distance semantics and non-deterministic matrices. The outcome is a general framework for capturing the principle of minimal change and providing a non-deterministic view of the domain of discourse. We investigate some properties of the entailment relations that are induced by this framework and demonstrate their usability in some test-cases.
Interleaving belief updating and reasoning in abductive logic programming
Authors: Fariba Sadri, Francesca Toni
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Most existing work on knowledge representation and reasoning assumes that the updating of beliefs is performed off-line, and that reasoning from the beliefs is performed either before or after the beliefs are changed. This imposes that, if an update occurs while reasoning is performed, reasoning has to be stopped and re-started anew so that the update is taken into account, with an obvious wastage of reasoning effort. In this paper, we tackle the problem of performing belief updating on-line, while reasoning is taking place by means of an abductive proof procedure.
Empirical investigation of refactoring effect on software quality
Authors: Mohammad Alshayeb
Venue: Information and Software Technology (2009)

Developers and designers always strive for quality software. Quality software tends to be robust, reliable and easy to maintain, and thus reduces the cost of software development and maintenance. Several methods have been applied to improve software quality. Refactoring is one of those methods. The goal of this paper is to validate/invalidate the claims that refactoring improves software quality. We focused this study on different external quality attributes, which are adaptability, maintainability, understandability, reusability, and testability. We found that refactoring does not necessarily improve these quality attributes.
POP2.0: A search engine for public information services in local government
Authors: Antonio Manuel López Arjona, Miquel Montaner Rigall, Josep Lluís de la Rosa i Esteva, Maria Mercè Rovira i Regàs
Venue: Proceeding of the 2007 conference on Artificial Intelligence Research and Development (2007)

Tools such as web search engines are currently focused on the exhaustive recovery of information. These tools, although very useful in certain contexts, do not respond to the needs of public information services, which aim to be precise, dealing with requests from the public without overloading them with irrelevant information. Just as when a member of the public telephones his city's helpline he wants a single response to his question, a web tool which tries to emulate this service also needs to be precise, ideally providing only one response. To achieve this objective, in this paper we present a search engine which offers precise information to the public, allowing them to ask questions in the language with which they are most comfortable, without this affecting the quality of the service provided.
RaDON -- Repair and Diagnosis in Ontology Networks
Authors: Qiu Ji, Peter Haase, Guilin Qi, Pascal Hitzler, Steffen Stadtmüller
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

One of the major challenges in managing networked and dynamic ontologies is to handle inconsistencies in single ontologies, and inconsistencies introduced by integrating multiple distributed ontologies. Our RaDON system provides functionalities to repair and diagnose ontology networks by extending the capabilities of existing reasoners. The system integrates several new debugging and repairing algorithms, such as a relevance-directed algorithm to meet the various needs of the users.
Inverse Consistencies for Non-binary Constraints
Authors: Kostas Stergiou, Toby Walsh
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

We present a detailed study of two inverse consistencies for non-binary constraints: relational path inverse consistency (rel PIC) and pairwise inverse consistency (PWIC). These are stronger than generalized arc consistency (GAC), even though they also only prune domain values. We propose algorithms to achieve rel PIC and PWIC, that have a time complexity better than the previous generic algorithm for inverse consistencies. One of our algorithms for PWIC has a complexity comparable to that for GAC despite doing more pruning. Our experiments demonstrate that inverse consistencies can be more efficient than GAC on a range of non-binary problems.
Simulation of suction process of gasohol fuelled S. I. engine using computer program
Authors: Mahendrakumar Maisuria, Dipakkumar Gohil, Salim Channiwala
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

This paper pertains to the modeling of the suction stroke in the engine of the Fiat car. The modeling of the suction stroke is done and its simulation is carried out using computer program. Subsequently the values of pressure, volume, temperature and mass fraction are found out for each increment in crank angle (θ) using the same model by simulation.
Concept Lattices in L-Rough Sets
Authors: Xueyou Chen
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

In this paper, two L-rough approximation operators are defined by an arbitrary L-relation, some of their properties and their relation to Galois connection in Formal Concept Analysis are investigated. The generalizations of the property oriented concept lattice and the object oriented concept lattice are obtained in L-rough sets.
Optical grooming with grooming ratio eight
Authors: Charles J. Colbourn, Gennian Ge, Alan C. H. Ling
Venue: Discrete Applied Mathematics (2009)

Grooming uniform all-to-all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The minimum possible drop cost is determined for grooming ratio 8, and this cost is shown to be realized with six exceptions, and 37 possible exceptions, the largest being 105.
Detection and Localization Sensor Assignment with Exact and Fuzzy Locations
Authors: Hosam Rowaihy, Matthew P. Johnson, Diego Pizzocaro, Amotz Bar-Noy, Lance Kaplan, Thomas Porta, Alun Preece
Venue: Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems (2009)

Sensor networks introduce new resource allocation problems in which sensors need to be assigned to the tasks they best help. Such problems have been previously studied in simplified models in which utility from multiple sensors is assumed to combine additively. In this paper we study more complex utility models, focusing on two particular applications: event detection and target localization. We develop distributed algorithms to assign directional sensors of different types to multiple simultaneous tasks using exact location information. We extend our algorithms by introducing the concept of fuzzy location which may be desirable to reduce computational overhead and/or to preserve location privacy. We show that our schemes perform well using both exact or fuzzy location information.
Exploitation-Exploration Tensions and Organizational Ambidexterity: Managing Paradoxes of Innovation
Authors: Constantine Andriopoulos, Marianne W. Lewis
Venue: Organization Science (2009)

Achieving exploitation and exploration enables success, even survival, but raises challenging tensions. Ambidextrous organizations excel at exploiting existing products to enable incremental innovation and at exploring new opportunities to foster more radical innovation, yet related research is limited. Largely conceptual, anecdotal, or single case studies offer architectural or contextual approaches. Architectural ambidexterity proposes dual structures and strategies to differentiate efforts, focusing actors on one or the other form of innovation. In contrast, contextual approaches use behavioral and social means to integrate exploitation and exploration. To develop a more comprehensive model, we sought to learn from five, ambidextrous firms that lead the product design industry. Results offer an alternative framework for examining exploitation-exploration tensions and their management. More specifically, we present nested paradoxes of innovation: strategic intent (profit-breakthroughs), customer orientation (tight-loose coupling), and personal drivers (discipline-passion). Building from innovation and paradox literature, we theorize how integration and differentiation tactics help manage these interwoven paradoxes and fuel virtuous cycles of ambidexterity. Further, managing paradoxes becomes a shared responsibility, not only of top management, but across organizational levels.