ppxscal/embedding_network huggingface dataset:
Preliminary examination of chromatic flicker light stimulation on EEG and pupil size for observing human activity levels
Authors: Wioletta Nowak, Minoru Nakayama
Venue: Proceedings of the 10th WSEAS international conference on Mathematics and computers in biology and chemistry (2009)

The effectiveness and simplicity of measuring EEGs and pupillometry make them very useful tools for personalized health management. Each of these signals has been tested many times, but an interesting issue seems to be to determine the relationship between them by testing them together. In this study, simultaneously recorded changes of the pupillometry and EEG signals, in response to two-color flicker stimuli was examined and compared to changes in response to single-color flicker stimuli and to a control condition without flicker stimulation. In this experiment we used red and blue colors because they have been found most effective in producing pupil responses to light, when the recently discovered activity mechanism of melanopsin is taken into consideration. The sensitivity of EEG and pupillometry spectra to flicker stimuli parameters was tested. The results which were obtained confirm the sensitivity of EEG and pupillometry to both the color and the frequency of flicker stimuli. Two-color flicker stimuli consistently produced the greatest responses. Stimuli using red-light shows longer activity areas across pupillometry power spectra than using blue-light stimuli. The values and tendency for alpha and beta rhythms for blue and red flicker stimuli are different. On the basis of our preliminary results we can conclude that flicker stimuli with long wavelengths and small frequencies can produce the most sensitivity in tests which simultaneously record pupillometry and EEG responses. The results provide some new insight into the behaviour of the pupil and the brain in respect to flicker stimuli, but further experiments and analysis are needed to conclusively establish the proposed hypothesis.
Botnet spam campaigns can be long lasting: evidence, implications, and analysis
Authors: Abhinav Pathak, Feng Qian, Y. Charlie Hu, Z. Morley Mao, Supranamaya Ranjan
Venue: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems (2009)

Accurately identifying spam campaigns launched by a large number of bots in a botnet allows for accurate spam campaign signature generation and hence is critical to defeating spamming botnets. The straight-forward approach of clustering all spam containing the same label such as an URL into a campaign can be easily defeated by techniques such as simple obfuscations of URLs. In this paper, we perform a comprehensive study of content-agnostic characteristics of spam campaigns, e.g. duration and source-network distribution of spammers, in order to ascertain whether and how they can assist the simple label-based clustering methods in identifying campaigns and generating campaign signatures. In particular, from a five-month trace collected by a relay sinkhole, we manually identified and then analyzed seven URL-based botnet spam campaigns consisting of 52 million spam messages sent over 2.09 million SMTP connections originated from over 150,000 non-proxy spamming hosts and destined to about 200,000 end domains. Our analysis shows that the spam campaigns, when observed from large destination domains, exhibit durations far longer than the five-day period as reported in a recent study. We analyze the implications of this finding on spam campaign signature generation. We further study other characteristics of these long-lasting campaigns. Our analysis reveals several new findings regarding workload distribution, sending patterns, and coordination among the spamming machines.
Designing an interactive OpenGL slide-based presentation of the softbody simulation system for teaching and learning of computer graphics techniques
Authors: Miao Song, Serguei A. Mokhov, Peter Grogono
Venue: Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering (2009)

3D graphics power-point-like slides in OpenGL is a way to present a demo or a teaching item. We focus on how the softbody objects are modeled and rendered with the intent to make a base for teaching, learning, and education of/for computer graphics and integration with the softbody framework. This is work-in-progress on the implementation and publication of this integration and demonstration work.
Tool support for teaching responsibility-driven design
Authors: Yanic Inghelbrecht
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

We present Trace Modeler, a specialized tool that helps students understand and apply responsibility-driven design.
Reaching Agreements for Coalition Formation through Derivation of Agents' Intentions
Authors: Samir Aknine, Onn Shehory
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)

This paper addresses the coalition formation problem in multiagent systems. Although several coalition formation models exist today, coalition formation using these models remains costly. As a consequence, applying these models through several iterations when required becomes time-consuming. This paper proposes a new coalition formation mechanism (CFM) to reduce this execution cost. This mechanism is based on four principles: (1) the use of information on task relationships so as to reduce the computational complexity of the coalition formation; (2) the exploitation of the coalition proposals formulated by certain agents in order to derive their intentions, (this principle makes the search for solutions easier, which in turn may result in earlier consensus and agreements-the intention derivation process is performed on a new graph structure introduced in this paper); (3) the use of several strategies for propagating the proposals of the agents in the coalition formation process; and (4) the dynamic reorganization of previous coalitions.
Aggregation Operators and Ruled Surfaces
Authors: J. Recasens
Venue: Proceeding of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence (2008)

Aggregation operators in two variables that are ruled quadric surfaces are studied. The interest lays in the fact that the most popular aggregation operators are indeed ruled surfaces, either planes or quadric surfaces.
MobiThin management framework: design and evaluation
Authors: Lien Deboosere, Bert Vankeirsbilck, Pieter Simoens, Filip De Turck, Bart Dhoedt, Piet Demeester, Mario Kind, Fritz-Joachim Westphal, Abdeslam Taguengayte, Thomas Plantier
Venue: Proceedings of the 3rd international workshop on Adaptive and dependable mobile ubiquitous systems (2009)

In thin client computing, applications are executed on centralized servers. User input (e.g. keystrokes) is sent to a remote server which processes the event and sends the audiovisual output back to the client. This enables execution of complex applications from thin devices. Adopting virtualization technologies on the thin client server brings several advantages, e.g. dedicated environments for each user and interesting facilities such as migration tools. In this paper, a mobile thin client service offered to a large number of mobile users is designed. Pervasive mobile thin client computing requires an intelligent service management to guarantee a high user experience. Due to the dynamic environment, the service management framework has to monitor the environment and intervene when necessary (e.g. adapt thin client protocol settings, move a session from one server to another). A detailed performance analysis of the implemented prototype is presented. It is shown that the prototype can handle up to 700 requests/s to start the mobile thin client service. The prototype can make a decision for up to 700 monitor reports per second.
Real-time object detection using an evolutionary boosting strategy
Authors: Xavier Baro, Jordi Vitria
Venue: Proceeding of the 2006 conference on Artificial Intelligence Research and Development (2006)

This paper presents a brief introduction to the nowadays most used object detection scheme. From this scheme, we highlight the two critical points of this scheme in terms of training time, and present a variant of this scheme that solves one of these points. Our proposal is to replace the WeakLearner in the Adaboost algorithm by a genetic algorithm. In addition, this approach allows us to work with high dimensional feature spaces which can not be used in the traditional scheme. In this paper we also use the dissociated dipoles, a generalized version of the Haarlike features used on the detection scheme. This type of features is an example of high dimensional feature space, moreover, when we extend it to color spaces.
SBA: A Simple Backoff Algorithm for Wireless Ad Hoc Networks
Authors: Tahiry Razafindralambo, Isabelle Guérin Lassous
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

The performance of ad hoc networks based on IEEE 802.11 DCF degrade when congestion increases. The issues concern efficiency and fairness. Many solutions can be found at the MAC layer in the literature, but very few solutions improve fairness and efficiency at the same time. In this paper, we design a new backoff solution, called SBA. SBA uses only local information and two contention window sizes. By simulations, we compare SBA with IEEE 802.11 and several alternatives to 802.11 in ad hoc networks. We show that SBA achieves a good trade-off between fairness, simplicity and efficiency.
Facilitating web-based student team collaboration with MessageGrid
Authors: David Bowman, Eric Anderson
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

In this poster proposal, we describe a new tool in MessageGrid [1--6] that allows an instructor to create individual grids for student team collaboration. In previous applications of MessageGrid, the instructor of a course had the ability to create a portal to facilitate live in or out-of-class interactivity through a web-based interface available to any student enrolled in the course. All submissions by the instructor and students are available for later viewing through any web browser. Building on the current framework of MessageGrid, team grids allow instructors teaching project-based courses to increase the amount of student team interactivity that is traditionally conducted via e-mail or meetings. By creating a grid for collaboration, the instructor is able to gain a live insight into team dynamics, communication, and work progress. The remainder of this poster proposal is organized as follows. Section 1 introduces the background behind the origin for team grids in MessageGrid and current uses of team grids. Section 2 describes the live demo to be conducted at the poster presentation. Section 3 acknowledges all people and organizations that made MessageGrid team grids possible. Section 4 is a list of all references in this poster proposal.
Particulate suspension blood flow through a narrow catheterized artery
Authors: V. P. Srivastava, Rashmi Srivastava
Venue: Computers Mathematics with Applications (2009)

The problem of blood flow in a narrow catheterized artery has been investigated using a two-phase macroscopic model of blood (i.e., a suspension of red cells in plasma). It is found that the effective viscosity and the frictional resistance increase with hematocrit. Flow characteristics assume lower magnitudes in catheterized artery as compared to uncatheterized artery for any given set of parameters. Numerical results reveal that the effective viscosity and the increased frictional resistance assume their minimal magnitude and consequently the volumetric flow rate assumes its maximal magnitude during the artery catheterization at the catheter size approximately fifty percent of the artery size.
Image Denoising Using TV-Stokes Equation with an Orientation-Matching Minimization
Authors: Xue-Cheng Tai, Sofia Borok, Jooyoung Hahn
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

In this paper, we propose an orientation-matching minimization for denoising digital images with an additive noise. Inspired by the two-step algorithm in the TV-Stokes denoising process [1,2,3], the regularized tangential vector field with the zero divergence condition is used in the first step. The present work suggests a different approach in order to reconstruct a denoised image in the second step. Namely, instead of finding an image that fits the regularized normal direction from the first step, we minimize an orientation between the image gradient and the regularized normal direction. It gives a nonlinear partial differential equation (PDE) for reconstructing denoised images, which has the diffusivity depending on an orientation of a regularized normal vector field and the weighted self-adaptive force term depending on the direction between the gradient of an image and the vector field. This allows to obtain a denoised image which has sharp edges and smooth regions, even though an original image has smoothly changing pixel values near sharp edges. The additive operator splitting scheme is used for discretizing Euler-Lagrange equations. We show improved qualities of results from various numerical experiments.
HipMatch: An object-oriented cross-platform program for accurate determination of cup orientation using 2D-3D registration of single standard X-ray radiograph and a CT volume
Authors: Guoyan Zheng, Xuan Zhang, Simon D. Steppacher, Stephen B. Murphy, Klaus A. Siebenrock, Moritz Tannast
Venue: Computer Methods and Programs in Biomedicine (2009)

The widely used procedure of evaluation of cup orientation following total hip arthroplasty using single standard anteroposterior (AP) radiograph is known inaccurate, largely due to the wide variability in individual pelvic orientation relative to X-ray plate. 2D-3D image registration methods have been introduced for an accurate determination of the post-operative cup alignment with respect to an anatomical reference extracted from the CT data. Although encouraging results have been reported, their extensive usage in clinical routine is still limited. This may be explained by their requirement of a CAD model of the prosthesis, which is often difficult to be organized from the manufacturer due to the proprietary issue, and by their requirement of either multiple radiographs or a radiograph-specific calibration, both of which are not available for most retrospective studies. To address these issues, we developed and validated an object-oriented cross-platform program called ''HipMatch'' where a hybrid 2D-3D registration scheme combining an iterative landmark-to-ray registration with a 2D-3D intensity-based registration was implemented to estimate a rigid transformation between a pre-operative CT volume and the post-operative X-ray radiograph for a precise estimation of cup alignment. No CAD model of the prosthesis is required. Quantitative and qualitative results evaluated on cadaveric and clinical datasets are given, which indicate the robustness and the accuracy of the program. HipMatch is written in object-oriented programming language C++ using cross-platform software Qt (TrollTech, Oslo, Norway), VTK, and Coin3D and is transportable to any platform.
Data Transformation in Modern Petrol Engine Tune-up
Authors: Chi-man Vong, Pak-kin Wong, Yi-ping Li
Venue: Proceeding of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005 (2005)

Data transformation is a kind of data preprocessing [1, 3, 5] and an important procedure for mathematical modelling. Mathematical model estimated based on a training data set results better if the data set has been properly preprocessed before passed to the modelling procedure. In the paper, different preprocessing methods on automotive engine data are examined. The preprocessed data sets using different preprocessing methods are passed to neural networks for models estimation. The generalizations of these estimated models could be verified by applying test sets, which determine the effects of different preprocessing methods. The results of preprocessing methods for automotive engine data are shown in the paper.
Ontological Modeling Approach to Blending Theories for Instructional and Learning Design
Authors: Yusuke Hayashi, Jacqueline Bourdeau, Riichiro Mizoguchi
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

This paper proposes a modeling framework for learning and instructional design from the viewpoint of ontological engineering. One of the characteristics of this framework is a theory/paradigm-independent ontology for modeling learning/instruction. This paper discusses how our modeling framework with the theory/paradigm-independent ontology contributes to modeling learning and instruction from a comprehensive viewpoint of various educational theories.
Tracking and Retexturing Cloth for Real-Time Virtual Clothing Applications
Authors: Anna Hilsmann, Peter Eisert
Venue: Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques (2009)

In this paper, we describe a dynamic texture overlay method from monocular images for real-time visualization of garments in a virtual mirror environment. Similar to looking into a mirror when trying on clothes, we create the same impression but for virtually textured garments. The mirror is replaced by a large display that shows the mirrored image of a camera capturing e.g. the upper body part of a person. By estimating the elastic deformations of the cloth from a single camera in the 2D image plane and recovering the illumination of the textured surface of a shirt in real time, an arbitrary virtual texture can be realistically augmented onto the moving garment such that the person seems to wear the virtual clothing. The result is a combination of the real video and the new augmented model yielding a realistic impression of the virtual piece of cloth.
Ants-Like Agents: A Model and Analysis Based on Natural Ants Behavior
Authors: Mohamed Hamada
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Ants are social insects that work in groups to collectively achieve certain goals that cannot be achieved by a single ant. One of the most interesting ants' behaviors is the highly optimized path that ants follow, in their foraging, between the source of food and the colony's nest. Researchers are inspired by such optimized behavior in several applications. In this paper we introduce an integrated environment for ants-like agents based on such ants' behavior. Our model can simulate and test the behavior of such agents under various conditions and environment changes.
On coordination, autonomy and time
Authors: Lǎcrǎmioara Aştefǎnoaei, Frank S. de Boer, Mehdi Dastani
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Timed coordination is an important issue in the developement of multi-agent systems. However, introducing a formalism for modelling time and achieving coordination while respecting the autonomy of the agents is still a challenge. This paper describes a formalism for a timed coordination mechanism which conciliates the "free thinking" of an agent.
An SIMD programmable vision chip with high-speed focal plane image processing
Authors: Dominique Ginhac, Jérôme Dubois, Michel Paindavoine, Barthélémy Heyrman
Venue: EURASIP Journal on Embedded Systems (2008)

A high-speed analog VLSI image acquisition and low-level image processing system are presented. The architecture of the chip is based on a dynamically reconfigurable SIMD processor array. The chip features a massively parallel architecture enabling the computation of programmable mask-based image processing in each pixel. Extraction of spatial gradients and convolutions such as Sobel operators are implemented on the circuit. Each pixel includes a photodiode, an amplifier, two storage capacitors, and an analog arithmetic unit based on a four-quadrant multiplier architecture. A 64 × 64 pixel proof-of-concept chip was fabricated in a 0.35 µm standard CMOS process, with a pixel size of 35 µm × 35 µm. A dedicated embedded platform including FPGA and ADCs has also been designed to evaluate the vision chip. The chip can capture raw images up to 10000 frames per second and runs low-level image processing at a framerate of 2000 to 5000 frames per second.
Fast Learning in an Actor-Critic Architecture with Reward and Punishment
Authors: Christian Balkenius, Stefan Winberg
Venue: Proceeding of the 2008 conference on Tenth Scandinavian Conference on Artificial Intelligence: SCAI 2008 (2008)

A reinforcement architecture is introduced that consists of three complementary learning systems with different generalization abilities. The ACTOR learns state-action associations, the CRITIC learns a goal-gradient, and the PUNISH system learns what actions to avoid. The architecture is compared to the standard actor-crititc and Q-learning models on a number of maze learning tasks. The novel architecture is shown to be superior on all the test mazes. Moreover, it shows how it is possible to combine several learning systems with different properties in a coherent reinforcement learning framework.
Modeling and Inference with Relational Dynamic Bayesian Networks
Authors: Cristina Manfredotti
Venue: Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence (2009)

The explicit recognition of the relationships between interacting objects can improve the understanding of their dynamic domain. In this work, we investigate the use of Relational Dynamic Bayesian Networks to represent the dependencies between the agents' behaviors in the context of multi-agents tracking. We propose a new formulation of the transition model that accommodates for relations and we extend the Particle Filter algorithm in order to directly track relations between the agents.Many applications can benefit from this work, including terrorist activities recognition, traffic monitoring, strategic analysis and sports. 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
Positive realness of a transfer function neither implies nor is implied by external positivity of its state realizations
Authors: M. De la Sen, J. C. Soto
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

This paper discusses briefly the differences between positive realness and the external positivity of dynamic systems. It is proved that both concepts do not imply mutually.