ppxscal/embedding_network huggingface dataset:
The determination of the bipolar transistor commutation time components by using a virtual circuit
Authors: Floarea Baicu, Nicolae Popoviciu
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

The paper describes a series of theoretical aspects referring to the bipolar transistor commutation mode, the physical parameters having influence over the value of the commutation time and proposes a measuring method for the delay, storage, falling and hoisting times. The commutation time of bipolar transistor components represents the determinant of the memories processing speed. The proposed method is one at the disposal of students who study the semiconductors, allowing the determination of the commutation time components in order to correlate the microscopic physical parameters of the bipolar transistor (e.g.τ) with the macroscopic ones.
ViSOM for Dimensionality Reduction in Face Recognition
Authors: Weilin Huang, Hujun Yin
Venue: Proceedings of the 7th International Workshop on Advances in Self-Organizing Maps (2009)

The self-organizing map (SOM) is a classical neural network method for dimensionality reduction and data visualization. Visualization induced SOM (ViSOM) and growing ViSOM (gViSOM) are two recently proposed variants for a more faithful, metric-based and direct data representation. They learn local quantitative distances of data by regularizing the inter-neuron contraction force while capturing the topology and minimizing the quantization error. In this paper we first review related dimension reduction methods, and then examine their capabilities for face recognition. The experiments were conducted on the ORL face database and the results show that both ViSOM and gViSOM significantly outperform SOM, PCA and related methods in terms of recognition error rate. In the training with five faces, the error rate of gViSOM dimension reduction followed by a soft k-NN classifier reaches as low as 2.1%, making ViSOM an efficient approach for data representation and dimensionality reduction.
Getting Under the Skin of Learners: Tools for Evaluating Emotional Experience
Authors: Madeline Alsmeyer, Rose Luckin, Judith Good
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

This paper reports a study that evaluated a methodology and tool for eliciting the emotional experience of language learning. It has looked at the relative rate of change of different emotions over the course of a lesson and also the differences between self-report and observer reports of changes in emotion. Implications for the design of affectively intelligent systems are discussed.
Hardware Software Co-Design of a Multimedia SOC Platform, 1st edition
Authors: Sao-Jie Chen, Guang-Huei Lin, Pao-Ann Hsiung, Yu-Hen Hu
Venue:  (2009)

Hardware Software Co-Design of a Multimedia SOC Platform is one of the first of its kinds to provide a comprehensive overview of the design and implementation of the hardware and software of an SoC platform for multimedia applications. Topics covered in this book range from system level design methodology, multimedia algorithm implementation, a sub-word parallel, single-instruction-multiple data (SIMD) processor design, and its virtual platform implementation, to the development of an SIMD parallel compiler as well as a real-time operating system (RTOS). Hardware Software Co-Design of a Multimedia SOC Platform is written for practitioner engineers and technical managers who want to gain first hand knowledge about the hardware-software design process of an SoC platform. It offers both tutorial-like details to help readers become familiar with a diverse range of subjects, and in-depth analysis for advanced readers to pursue further.
Interactive Context-Aware Visualization for Mobile Devices
Authors: Mike Eissele, Daniel Weiskopf, Thomas Ertl
Venue: Proceedings of the 10th International Symposium on Smart Graphics (2009)

Utilizing context information--e.g. location, user aspects, or hardware capabilities--enables the presented generic framework to automatically control the selection and configuration of visualization techniques and therewith provide interactive illustrations, displayed on small mobile devices. For context-annotated data, provided by an underlying context-aware world model, the proposed system determines adequate visualization methods out of a database. Based on a novel analysis of a hierarchical data format definition and an evaluation of relevant context attributes, visualization templates are selected, configured, and instanced. This automatic, interactive process enables visualizations that smartly reconfigure according to changed context aspects. In addition to the generic concept, we present real-world applications that make use of this framework.
Justifying Actions by Accruing Arguments
Authors: Trevor J. M. Bench-Capon, Henry Prakken
Venue: Proceeding of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006 (2006)

This paper offers a logical formalisation of an argument-based account of reasoning about action, taking seriously the abductive nature of this form of reasoning. The particular question addressed is what is the best way to achieve a specified goal? Given a set of final goals and a set of rules on the effects of actions, the formation of subgoals for a goal is formalised as the application of an inference rule corresponding to the practical syllogism well-known from practical philosophy. Positive and negative applications of the practical syllogism are then accrued as a way to capture the positive and negative side effects of an action. Positive accruals can be attacked by negative accruals and by arguments for alternative ways to achieve the same goal. Defeat relations between accrued action arguments are determined in terms of the values promoted and demoted by the actions considered in the arguments. Applying preferred semantics to the result then yields the admissible ways to achieve the desired goal.
Deriving epistemic conclusions from agent architecture
Authors: Stephen Chong, Ron van der Meyden
Venue: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (2009)

One of our most resilient intuitions is that causality is a precondition for information flow: where there are no causal connections, we expect there to be no flow of information. In this paper, we study this idea as it arises in the computer science notion of systems architectures, which are high level designs that describe the coarse structure of a system in terms of its high-level components and their permitted causal interactions.
Opponent Modeling in Adversarial Environments through Learning Ingenuity
Authors: Arash Afkanpour, Saeed Bagheri Shouraki
Venue: Proceeding of the 2005 conference on Self-Organization and Autonomic Informatics (I) (2005)

In Multiagent systems there are several agents with cooperative or competitive goals. Here, we are especially interested in zero-sum games which contain exactly two players with fully opposite goals. We describe a method based on Maximum-Expected-Utility [7] principle that learns the ingenuity of the opponent based on the moves of the opponent through a game and exploits this knowledge to play better against that opponent. Then we demonstrate an application of proposed method in the popular board game of Connect-4. The results show that the proposed method is superior compared to previous methods for adversarial environments especially when there is not adequate training for appropriate adaptation against an opponent.
Cohere: Towards Web 2.0 Argumentation
Authors: Simon Buckingham Shum
Venue: Proceeding of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008 (2008)

Students, researchers and professional analysts lack effective tools to make personal and collective sense of problems while working in distributed teams. Central to this work is the process of sharing---and contesting---interpretations via different forms of argument. How does the “Web 2.0” paradigm challenge us to deliver useful, usable tools for online argumentation? This paper reviews the current state of the art in Web Argumentation, describes key features of the Web 2.0 orientation, and identifies some of the tensions that must be negotiated in bringing these worlds together. It then describes how these design principles are interpreted in Cohere, a web tool for social bookmarking, idea-linking, and argument visualization.
Uncertainty management in rule-based information extraction systems
Authors: Eirinaios Michelakis, Rajasekar Krishnamurthy, Peter J. Haas, Shivakumar Vaithyanathan
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Rule-based information extraction is a process by which structured objects are extracted from text based on user-defined rules. The compositional nature of rule-based information extraction also allows rules to be expressed over previously extracted objects. Such extraction is inherently uncertain, due to the varying precision associated with the rules used in a specific extraction task. Quantifying this uncertainty is crucial for querying the extracted objects in probabilistic databases, and for improving the recall of extraction tasks that use compositional rules. In this paper, we provide a probabilistic framework for handling the uncertainty in rule-based information extraction. Specifically, for each extraction task, we build a parametric exponential model of uncertainty that captures the interaction between the different rules, as well as the compositional nature of the rules; the exponential form of our model follows from maximum-entropy considerations. We also give model-decomposition techniques that make the learning algorithms scalable to large numbers of rules and constraints. Experiments over multiple real-world extraction tasks confirm that our approach yields accurate probability estimates with only a small performance overhead. Moreover, our framework supports incremental pay-as-you-go improvements in the accuracy of probability estimates as new rules, data, or constraints are added.
Road Lane Detection with Elimination of High-Curvature Edges
Authors: Krzysztof Ślot, Michał Strzelecki, Agnieszka Krawczyńska, Maciej Polańczyk
Venue: Proceedings of the International Conference on Computer Vision and Graphics: Revised Papers (2008)

The following paper proposes a procedure for an automatic detection of road-lanes, which involves three main steps: two-category scene segmentation, a detection of lane segment candidates and decision making. The main contribution of the paper is an introduction of a new step - high-curvature edge filtering - into a typical road image processing. This step substantially reduces an amount of noise and yields an improved lane detection performance. The remaining two steps of lane detection are dynamic programming-based selection of line segments, and Hough transform-based selection of the most consistent segments. The proposed approach proved to produce good results for a variety of real-traffic conditions, including correct detection in heavily shadowed road images.
Control for Actuator Arrays
Authors: Mark Bedillion, William Messner
Venue: International Journal of Robotics Research (2009)

Actuator arrays are planar arrangements of simple actuators that cooperate to translate and orient objects. This paper derives the equations of motion for manipulating an object in stick/slip contact with the actuators. A controller derived from kinematics considerations is presented and its stability analyzed with the multivariable circle criterion. Stability results are verified through simulation and experimental results on a 20 unit macroscopic actuator array.
An Application of Formal Argumentation: Fusing Bayes Nets in MAS
Authors: Søren Holbech Nielsen, Simon Parsons
Venue: Proceeding of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006 (2006)

We consider agents in a multi-agent system, each equipped with a Bayesian network model (BN) of its environment. We want the agents to reach consensus on one compromise network, which may not be identical to a single one of the BNs initially held by the agents, but rather a combination of aspects from each BN. The task can be characterized as the need for agents to agree on a specific state (a BN) of a variable with an enormous state space (all possible BNs). The grandness of the task is reduced by the fact that BNs are composed of local relationships, and it should therefore be possible to reach the compromise by gradually agreeing on parts of it. In the metaphor of the variable, the agents should be able to agree on successively smaller subsets of the enormous state space. However, these same local relationship can interact, and understanding the extent to which partial agreements affect the possible final compromise is a highly complex task. In this work we suggest using formal argumentation as the reasoning mechanism for agents solving this task, and suggest an open-ended agora approach that ensures agents high quality compromises in an anytime fashion.
On-line robust trajectory generation on approach and landing for reusable launch vehicles
Authors: Zhesheng Jiang, Raúl Ordóñez
Venue: Automatica (Journal of IFAC) (2009)

A major objective of next generation reusable launch vehicle (RLV) programs includes significant improvements in vehicle safety, reliability, and operational costs. In this paper, novel approaches that can deliver an RLV to its landing site safely and reliably are proposed. Trajectory generation on approach/landing (A&L) for RLVs using motion primitives (MPs) and neighboring optimal control (NOC) is first discussed. In this stage, the proposed trajectory generation approach is based on an MP scheme that consists of trims and maneuvers. From an initial point to a given touchdown point, all feasible trajectories that satisfy certain constraints are generated and saved into a trajectory database. An optimal trajectory can then be found off-line by using Dijkstra's algorithm. If a vehicle failure occurs, perturbations are imposed on the initial states of the off-line optimal trajectory, and it is reshaped into a neighboring feasible trajectory on-line by using an NOC approach. If the perturbations are small enough, a neighboring feasible trajectory existence theorem (NFTET) is then investigated and its proof is provided as well. The approach given in the NFTET shows that a vehicle with stuck effectors can be recovered from failures in real time. However, when the perturbations become large, for example, in severe failure scenarios, the NFTET is no longer applicable and often the vehicle cannot be recovered from such failures. A new method is then used to deal with this situation. The NFTET is now extended to the trajectory robustness theorem (TRT). According to the TRT and its proof, a robustifying term is introduced to compensate for the effects of the linear approximation in the NFTET. The upper bounds with respect to input deviation are adaptively adjusted to eliminate their uncertainty. In order to obtain best performance, @s-modification is employed. The simulation results verify the excellent robust performance of this method.
Events and Rules for Java: Using a Seamless and Dynamic Approach
Authors: Sharma Chakravarthy, Rajesh Dasari, Sridhar Varakala, Raman Adaikkalavan
Venue: Proceeding of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh International Baltic Conference DB&IS'2006 (2007)

Proponents of active systems have proposed Event-Condition-Action (ECA) rules, a mechanism where behavior is invoked automatically as a response to events but without user or application intervention. The environment (the programming language and the operating system) in which a system is built influences how the event detector is designed and implemented. Sentinel provided active capability to an object-oriented database environment implemented in C++. However, C++ environment had certain limitations that proved deterrent to implementing some of the features of active capability. This paper discusses the re-designing and implementation of the active subsystem in the Java environment. Main motivations behind our objective of re-designing and implementing the active subsystem in the Java environment include: i) to overcome the limitations of the C++ environment, and ii) to exploit some of the capabilities provided by the Java environment that are critical for an active system. It also provides a novel approach for supporting the creation of rules, and composite and temporal events dynamically at run time, which is inevitable for several classes of monitoring applications. This avoids recompilation and restart of the system which are inappropriate in many environments that require fine-tuning of rules on the fly. It provides a generic set of classes that are designed to handle rules dynamically. This set of generic classes is application-independent making the system a general-purpose tool.
Agents and Clinical Guidelines: Filling the Semantic Gap
Authors: David Isern, David Sánchez, Antonio Moreno
Venue: Proceeding of the 2007 conference on Artificial Intelligence Research and Development (2007)

Medical ontologies are developed to solve problems such as the demand for reusing, sharing and transmitting data. The unambiguous communication of complex and detailed medical concepts is a crucial feature in current medical information systems. In these systems, several agents must interact in order to share their results and, thus, they must use a medical terminology with a clear and non-confusing meaning. The paper presents the inclusion of an especially designed medical ontology in the HECASE2 multi-agent system. HECASE2 has been developed to help doctors in applying clinical guidelines to their patients in a semi-automatic fashion. In addition, it shows how intelligent agents may take profit from the modelled medical knowledge to coordinate their activities in the enactment of clinical guidelines.
Note-taking while learning hypermedia: Cognitive and motivational considerations
Authors: Daniel C. Moos
Venue: Computers in Human Behavior (2009)

The non-linear format of hypermedia requires the use of self-regulated learning (SRL) processes, including making decisions about which representation to access. The design of hypermedia environments can make these decisions difficult, and may result in extraneous cognitive load. Note-taking, a SRL strategy may offload extraneous cognitive load while learning with hypermedia. This study examined factors related to undergraduate students' note-taking while learning with hypermedia. Think-aloud, self-report, pretest, and posttest data were collected from 53 undergraduates while they learned about a challenging science topic for 30min with hypermedia. Results indicated that participants' prior domain knowledge, as measured by the pretest, did not significantly predict the content of their notes. However, motivation, as measured by a self-report questionnaire, had a significant relationship with the content of the participants' notes. Specifically, intrinsic motivation had a significant negative relationship while extrinsic motivation had a significant positive relationship with the content of notes. Additionally, there was a significant interaction between the content of the participants' notes and their use of self-regulatory processes while learning with hypermedia.
MV-pairs and states
Authors: Sylvia Pulmannov&#x00e1;
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

An MV-pair is a BG-pair (B; G) (where B is a Boolean algebra and G is a subgroup of the automorphism group of B) satisfying certain conditions. Recently, it was proved by Jenca that, given an MV-pair (B; G), the quotient , where , is an equivalence relation naturally associated with G, is an MV-algebra, and conversely, to every MV-algebra there corresponds an MV-pair. In this paper, we introduce a new definition of so called MV*-pair, and we show that , is an effect algebra iff the first of the defining properties of the MV*-pair is satisfied, while the second property guarantees the MV-algebra structure of . We also study some relations between states on MV-algebras and the corresponding R-generated Boolean algebras.
Modelling interstate tourism demand in Australia: A cointegration approach
Authors: David Allen, Ghialy Yap, Riaz Shareef
Venue: Mathematics and Computers in Simulation (2009)

Interstate tourism is an important component of the domestic tourism business in Australia. However, empirical analyses of interstate tourism demand have not been previously undertaken. The motivation for this paper is to investigate the short- and long-run causal relationships between economic factors and interstate tourism demand in Australia. Using a cointegration approach, this study discovers two distinct results. First, Australian household income, accommodation prices, prices of recreation and restaurants, and domestic airfares have significant impacts on the demand in the short-run. Second, some of the long-run economic coefficients show incorrect signs, which contradict the theory of consumer demand.
CPATH: distributed expertise - collaborating with other disciplines
Authors: Lillian N. Cassel, Thomas Way, Sridhara Potluri
Venue: ACM SIGCSE Bulletin (2009)

This project tries to provide a clarified and comprehensive understanding of the computing disciplines that allows shared experiences and expertise within and across the community. This collective sharing enables computing faculty to collaborate with other disciplines that use computing to enhance groups, and to create new cross-disciplinary areas of study and research. This involves the integration of computing with other disciplines like engineering, sciences, business, and arts and explores the challenge by bringing together instructors and researchers across the disciplinary boundaries. Distributed Expertise enhances teaching and learning experiences for students of computing and other disciplines in which computational thinking and computing models contribute to a variety of applications. This project is a collaboration by Villanova University, Virginia Technology University, and The College of New Jersey (TCNJ).
Shape Metrics Based on Elastic Deformations
Authors: Matthias Fuchs, Bert Jüttler, Otmar Scherzer, Huaiping Yang
Venue: Journal of Mathematical Imaging and Vision (2009)

Deformations of shapes and distances between shapes are an active research topic in computer vision. We propose an energy of infinitesimal deformations of continuous 1- and 2-dimensional shapes that is based on the elastic energy of deformed objects. This energy defines a shape metric which is inherently invariant with respect to Euclidean transformations and yields very natural deformations which preserve details. We compute shortest paths between planar shapes based on elastic deformations and apply our approach to the modeling of 2-dimensional shapes.