ppxscal/embedding_network huggingface dataset:
Bloom's taxonomy revisited: specifying assessable learning objectives in computer science
Authors: Christopher W. Starr, Bill Manaris, RoxAnn H. Stalvey
Venue: ACM SIGCSE Bulletin (2008)

Traditionally, Bloom's Taxonomy has been used for creating exams and other student assessment instruments. In this paper, we advocate its use for specifying learning outcomes in computer science prior to assessment. We have found, over a period of three years, that this facilitates programmatic assessment and related accreditation activities; it benefits instructors selecting pedagogical tools and assignments; and it enhances communication among faculty engaged in curricular development. We describe Bloom's Taxonomy, illustrate a simple process for applying it in computer science (and other disciplines), and present a case study of how it may be applied in a CS1 course. We believe this process has considerably strengthened our department's assessment program and its ability to maintain its ABET accreditation.
A domain-independent middleware framework for context-aware applications
Authors: Rossano P. Pinto, Eleri Cardozo, Paulo R. S. L. Coelho, Eliane G. Guimarães
Venue: Proceedings of the 6th international workshop on Adaptive and reflective middleware: held at the ACM/IFIP/USENIX International Middleware Conference (2007)

This paper presents a middleware framework for context-aware applications. Instead of trying to incorporate into the middleware a set of domain-dependent adaptive policies, our approach allows the application itself to define such policies according to a chosen adaptive behavior. The middleware defines a domain-independent metamodel for context-aware applications. For applications specified according to the metamodel, the framework is able to generate code from the applications' design. We demonstrate the use of the middleware with a context-aware application in the field of mobile robotics.
Synthesis of gallium oxide nanowires and their electrical properties
Authors: Zijiong Li, Bin Zhao, Ping Liu, Yafei Zhang
Venue: Microelectronic Engineering (2008)

Gallium oxide (Ga"2O"3) nanowires have been synthesized using a novel method by high-frequency inductive heating in a room temperature environment. Nanowires with high-yield were grown on silicon substrates in less than 3min, using Ga"2O"3/graphite as the source powder. Scanning electron microscopy showed nanowire diameters of 20-40nm and lengths up to several tens of microns, and high-resolution transmission electron microscopy verified the single-crystalline lattice of the nanowires. Electrical properties were investigated by connecting a single Ga"2O"3 nanowire in the field-effect transistor configuration. This demonstration further illustrates the feasibility of an easy and large-scale synthesis of nanomaterials by using high-frequency inductive heating.
Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities
Authors: Jean-Charles Faugère, Guillaume Moroz, Fabrice Rouillier, Mohab Safey El Din
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

Classifying the Perspective-Three-Point problem (abbreviated by P3P in the sequel) consists in determining the number of possible positions of a camera with respect to the apparent position of three points. In the case where the three points form an isosceles triangle, we give a full classification of the P3P. This leads to consider a polynomial system of polynomial equations and inequalities with 4 parameters which is generically zero-dimensional. In the present situation, the parameters represent the apparent position of the three points so that solving the problem means determining all the possible numbers of real solutions with respect to the parameters' values and give a sample point for each of these possible numbers. One way for solving such systems consists first in computing a discriminant variety. Then, one has to compute at least one point in each connected component of its real complementary in the parameter's space. The last step consists in specializing the parameters appearing in the initial system by these sample points. Many computational tools may be used for implementing such a general method, starting with the well known Cylindrical Algebraic Decomposition (CAD in short), which provides more information than required. In a first stage, we propose a full algorithm based on the straightforward use of some sophisticated software such as FGb (Grobner bases computations) RS (real roots of zero-dimensional systems), DV (Discriminant varieties) and RAGlib (Critical point methods for semi-algebraic systems). We then improve the global algorithm by refining the required computable mathematical objects and related algorithms and finally provide the classification. Three full days of computation were necessary to get this classification which is obtained from more than 40000 points in the parameter's space.
Microsoft Windows PowerShell: TFM, First edition
Authors: Don Jones, Jeffery Hicks
Venue:  (2007)

"POWERSHELL" is Microsoft's first recognition of the value of administrative scripting and automation, providing Windows administrators with a consistent, powerful way to automate Windows and other Microsoft server products (such as Exchange Server). In this groundbreaking book, scripting gurus Don Jones and Jeffery Hicks teach you PowerShell from the ground up: You'll learn about its underlying technologies, its flexible scripting language, all the built-in "cmdlets" included with the new shell, and you'll learn enough of the .NET Framework to be effecive in PowerShell scripting. This is your opportunity to stay on the leading edge of Microsoft Windows administrative scripting, from the world's most recognized and popular scripting authors.
Tight approximation algorithm for connectivity augmentation problems
Authors: Guy Kortsarz, Zeev Nutov
Venue: Journal of Computer and System Sciences (2008)

The S-connectivity@l"G^S(u,v) of (u,v) in a graph G is the maximum number of uv-paths that no two of them have an edge or a node in S-{u,v} in common. The corresponding Connectivity Augmentation (CA) problem is: given a graph G"0=(V,E"0), S@?V, and requirements r(u,v) on VxV, find a minimum size set F of new edges (any edge is allowed) so that @l"G"""0"+"F^S(u,v)>=r(u,v) for all u,v@?V. Extensively studied particular choices of S are the edge-CA (when S=@A) and the node-CA (when S=V). A. Frank gave a polynomial algorithm for undirected edge-CA and observed that the directed case even with rooted{0,1}-requirements is at least as hard as the Set-Cover problem (in rooted requirements there is s@?V-S so that if r(u,v)>0 then: u=s for directed graphs, and u=s or v=s for undirected graphs). Both directed and undirected node-CA have approximation threshold @W(2^l^o^g^^^1^^^-^^^@e^n). The only polylogarithmic approximation ratio known for CA was for rooted requirements-O(logn@?logr"m"a"x)=O(log^2n), where r"m"a"x=max"u","v"@?"Vr(u,v). No nontrivial approximation algorithms were known for directed CA even for r(u,v)@?{0,1}, nor for undirected CA with S arbitrary. We give an approximation algorithm for the general case that matches the known approximation thresholds. For both directed and undirected CA with arbitrary requirements our approximation ratio is: O(logn) for S
TOWARDS THE CONSTRUCTION OF DECISIONAL DNA: A SET OF EXPERIENCE KNOWLEDGE STRUCTURE JAVA CLASS WITHIN AN ONTOLOGY SYSTEM
Authors: Cesar Sanin, Edward Szczerbicki
Venue: Cybernetics and Systems (2007)

In this article, we present a Java class and an ontology system implementation for the exploitation of embedded experiential knowledge that can be used in several domains. We support this approach on three concepts: Set of Experience Knowledge Structure (SOEKS), a tool able to collect and manage explicit decisional knowledge; Decisional DNA, a structure for decisional knowledge akin to human DNA; and a group of ontologies for ubiquitous applications called SOUPA (Standard Ontology for Ubiquitous and Pervasive Applications). The SOUPA is extended with the Set of Experience Knowledge Structure (SOEKS), enhancing the decisional experience used to assemble Decisional DNA with ontology characteristics for ubiquitous and pervasive applications. Additionally, we propose a SOEKS Java class created for the support and easy implementation of applications using the extended SOUPA which will allows the construction of a Decisional DNA repository useful within many different intelligent systems and platforms.
Automated ab initio synthesis of complete designs of four patented optical lens systems by means of genetic programming
Authors: John r. Koza, Sameer h. Al-sakran, Lee w. Jones
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2008)

This paper describes how genetic programming has been used as an invention machine to automatically synthesize complete designs for four optical lens systems that duplicated the functionality of previously patented lens systems. The automatic synthesis of the complete design is done ab initio, that is, without starting from a preexisting good design and without prespecifying the number of lenses, the topological arrangement of the lenses, or the numerical or nonnumerical parameters associated with any lens. One of the genetically evolved lens systems infringed a previously issued patent, whereas the others were noninfringing novel designs that duplicated (or improved upon) the performance specifications contained in the patents. One of the patents was issued in the 21st century. The designs were created in a substantially similar and routine way, suggesting that the approach described in the paper can be readily applied to other similar problems in the field of optical design. The genetically evolved designs are instances of human-competitive results produced by genetic programming in the field of optical design.
The residual based extended least squares identification method for dual-rate systems
Authors: Jie Ding, Feng Ding
Venue: Computers Mathematics with Applications (2008)

In this paper, we focus on a class of dual-rate sampled-data systems in which all the inputs u(t) are available at each instant while only scarce outputs y(qt) can be measured (q being an integer more than unity). To estimate the parameters of such dual-rate systems, we derive a mathematical model by using the polynomial transformation technique, and apply the extended least squares algorithm to identify the dual-rate systems directly from the available input-output data {u(t),y(qt)}. Then, we study the convergence properties of the algorithm in details. Finally, we give an example to test and illustrate the algorithm involved.
Proactive Fuzzy Control and Adaptation Methods for Smart Homes
Authors: Antti-Matti Vainio, Miika Valtonen, Jukka Vanhala
Venue: IEEE Intelligent Systems (2008)

A proactive and ubiquitous computing system in a home environment must operate unobtrusively. This article presents the steps for developing an autonomous home-control system. The system's method uses fuzzy, continuous-time control, online adaptation, and a context-aware intelligent environment. The control and learning methods allow the home to adapt to user routines unobtrusively and smoothly. The adaptation is based on recognizing patterns of human practices, which can change over time. The authors applied these methods to a fuzzy-controlled lighting system in a smart-home laboratory environment. The authors obtained results from both functional and long-term practical tests.
Efficiency estimate for distributed computation of Gröbner bases and involutive bases
Authors: D. A. Yanovich
Venue: Programming and Computing Software (2008)

Several years ago, we presented a program complex for parallel computation of Gröbner bases that works on computers with shared-memory architecture. Unfortunately, the number of the processors that we can use is small (from 2 to 16) because of hardware constraints. This paper presents a program for distributed computation of bases that relies on the same principles but works in a network consisting of heterogeneous machines. The effectiveness of such an approach is estimated from the standpoint of the processor capacity usage and the required network bandwidth, and methods optimizing usage of these resources are specified.
An EFSM-based test generation for validation of SDL specifications
Authors: W. Eric Wong, Andy Restrepo, Yu Qi, Byoungju Choi
Venue: Proceedings of the 3rd international workshop on Automation of software test (2008)

Existing techniques for testing an SDL specification mainly allow for either black box simulation or conformance testing to verify that the behavior of an implementation matches its corresponding model. However, this relies on the potentially hazardous assumption that the model is completely correct. We propose a test generation framework that can accomplish conformance verification as well as coverage criteria-driven white box testing of the specification itself. This approach builds on earlier work which established how to translate SDL processes into standard EFSMs and identify "hot spots" - nodes or edges in the EFSM which should be prioritized during testing to effectively increase coverage. Our technique generates test sequences intended to cover selected hot spots; we address the possible infeasibility of such a test sequence by allowing for its rejection decided by a constraint solver and re-generation of an alternate test sequence to the hot spot. In this paper, we present our EFSM translation and test generation tool and provide a case study demonstrating the effectiveness of our coverage-based test sequence selection.
Analysis of formation control and networking pattern in multi-robot systems: a hexagonal formation example
Authors: Chou-Yuan Mai, Feng-Li Lian
Venue: International Journal of Systems, Control and Communications (2008)

This paper analyses the characteristics and property of generating a formation by a team of homogenous robots. Graphic networking patterns are used to model the physical relationship and information exchanging topology among robots. The high-level controller based on artificial potential field is designed for the formation generation. Five scenarios of formation control with considering the effect of different networking topologies are discussed and simulated in detail. Factors such as robustness, convergence speed, power consumption and system efficiency are compared for different information sharing topologies. Simulation results show that motion interaction of robots in formation control can be more efficient and robust with properly chosen networking patterns.
Effect of scenario on perceptual sensitivity to errors in animation
Authors: Paul S. A. Reitsma, Carol O'Sullivan
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

A deeper understanding of what makes animation perceptually plausible would benefit a number of applications, such as approximate collision detection and goal-directed animation. In a series of psychophysical experiments, we examine how measurements of perceptual sensitivity in realistic physical simulations compare to similar measurements done in more abstract settings. We find that participant tolerance for certain types of errors is significantly higher in a realistic snooker scenario than in the abstract test settings previously used to examine those errors. By contrast, we find there is no difference in tolerance vs. the abstract setting when those errors are displayed in a realistic but more neutral environment. Additionally, we examine the interaction of auditory and visual cues in determining participant sensitivity to spatiotemporal errors in rigid body collisions. We find that participants are predominantly affected by visual cues. Finally, we find that tolerance for spatial gaps during collision events is constant for a wide range of viewing angles if the effect of foreshortening and occlusion caused by the viewing angle is taken into account.
A computational approach to negative priming
Authors: H. Schrobsdorff, M. Ihrke, B. Kabisch, J. Behrendt, M. Hasselhorn, J. Michael Herrmann
Venue: Connection Science (2007)

Priming is characterized by a sensitivity of reaction times to the sequence of stimuli in psychophysical experiments. The reduction of the reaction time observed in positive priming is well-known and experimentally understood (Scarborough et al., J. Exp. Psycholol: Hum. Percept. Perform., 3, pp. 1-17, 1977). Negative priming-the opposite effect-is experimentally less tangible (Fox, Psychonom. Bull. Rev., 2, pp. 145-173, 1995). The dependence on subtle parameter changes (such as response-stimulus interval) usually varies. The sensitivity of the negative priming effect bears great potential for applications in research in fields such as memory, selective attention, and ageing effects. We develop and analyse a computational realization, CISAM, of a recent psychological model for action decision making, the ISAM (Kabisch, PhD thesis, Friedrich-Schiller-Universität, 2003), which is sensitive to priming conditions. With the dynamical systems approach of the CISAM, we show that a single adaptive threshold mechanism is sufficient to explain both positive and negative priming effects. This is achieved by comparing results obtained by the computational modelling with experimental data from our laboratory. The implementation provides a rich base from which testable predictions can be derived, e.g. with respect to hitherto untested stimulus combinations (e.g. single-object trials).
Configuration-parametric query optimization for physical design tuning
Authors: Nicolas Bruno, Rimma V. Nehme
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Automated physical design tuning for database systems has recently become an active area of research and development. Existing tuning tools explore the space of feasible solutions by repeatedly optimizing queries in the input workload for several candidate configurations. This general approach, while scalable, often results in tuning sessions waiting for results from the query optimizer over 90% of the time. In this paper we introduce a novel approach, called Configuration-Parametric Query Optimization, that drastically improves the performance of current tuning tools. By issuing a single optimization call per query, we are able to generate a compact representation of the optimization space that can then produce very efficiently execution plans for the input query under arbitrary configurations. Our experiments show that our technique speeds-up query optimization by 30x to over 450x with virtually no loss in quality, and effectively eliminates the optimization bottleneck in existing tuning tools. Our techniques open the door for new, more sophisticated optimization strategies by eliminating the main bottleneck of current tuning tools.
Lower bounds on Hilbert's Nullstellensatz and propositional proofs
Authors: P. Beame
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

The weak form of the Hilbert's Nullstellensatz says that a system of algebraic equations over a field, Q/sub i/(x~)=0, does not have a solution in the algebraic closure iff 1 is in the ideal generated by the polynomials Q/sub i/(x~). We shall prove a lower bound on the degrees of polynomials P/sub i/(x~) such that /spl Sigma//sub i/ P/sub i/(x~)Q/sub i/(x~)=1. This result has the following application. The modular counting principle states that no finite set whose cardinality is not divisible by q can be partitioned into q-element classes. For each fixed cardinality N, this principle can be expressed as a propositional formula Count/sub q//sup N/. Ajtai (1988) proved recently that, whenever p, q are two different primes, the propositional formulas Count/sub q//sup qn+1/ do not have polynomial size, constant-depth Frege proofs from instances of Count/sub p//sup m/, m/spl ne/0 (mod p). We give a new proof of this theorem based on the lower bound for the Hilbert's Nullstellensatz. Furthermore our technique enables us to extend the independence results for counting principles to composite numbers p and q. This results in an exact characterization of when Count/sub q/ can be proven efficiently from Count/sub p/, for all p and q.
Convergence Analysis of Jacobi Iterative Method Using Logarithmic Number System
Authors: Peng Huang, Daniel H. -Y. Teng, Khan Wahid, Seok-Bum Ko
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

This paper presents convergence analysis of Jacobi iterative method using logarithmic number system (LNS) for solving linear systems, where multiplications and divisions are replaced with additions and subtractions, respectively. Two major factors are identified and considered in our convergence analysis. First, in any hardware architecture for Jacobi iterative method, only a set of unknowns can be processed in parallel due to the constraint of hardware resources. Secondly, the conversions of ogarithm-to-floating point and floating-to-logarithm introduce additional error. The convergence analysis demonstrates to what extent the hardware resource constraints and additional conversion error affect the convergence of Jacobi iterative method.
Image Quality Assessments and Restoration for Face Detection and Recognition System Images
Authors: Ahmad Nazri Zamani, Mat Kamil Awang, Nazaruddin Omar, Shahrin Azuan Nazeer
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

In recent years face recognition has received substantial attentions from both research communities and the commercial, but remain challenging in real applications. One of the problems faced by face recognition system in real-time applications is the face image with poor quality conditions affecting the performance of the system especially in the face detection and face identification/verification phases. Quality problems observed such as shadows, hotspots, video artifacts, blurring, salt & pepper noise and movement blurring are common noises that affect the face recognition that uses webcam as the image capturing device. This paper proposes a solution of how the image quality for the face recognition can be improved. Image quality assessment is introduced to measure the quality of signal during the image acquisition and image restoration is proposed to restore degraded image by certain noise.
Coercions in a polymorphic type system
Authors: Zhaohui Luo
Venue: Mathematical Structures in Computer Science (2008)

We incorporate the idea of coercive subtyping, a theory of abbreviation for dependent type theories, into the polymorphic type system in functional programming languages. The traditional type system with let-polymorphism is extended with argument coercions and function coercions, and a corresponding type inference algorithm is presented and proved to be sound and complete.
Lineal spline approximation algorithms for solution of the coefficient inverse problem for nonlinear system of ordinary differential equations and applications in neuroscience
Authors: A. Grebennikov, J. F. Leyva
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

A nonlinear system of two ordinary differential equation of the first order is considered. It describes two applied neuroscience problems: 1) a neuronal activation (simplified Hodgkin - Huxley system); 2) a stationary process of the of the cerebral cortex activation. Two types of approximations of the non lineal member of this system are used and compared: traditional rational expression with functions of the exponential type; a new type of approximation as a lineal spline. For the considered applied problems the numerical algorithms are constructed and carried out as computing programs in the MatLab system. The quality of algorithms is demonstrated in comparing with traditional schemes on the numerical experiments for synthetic examples.