ppxscal/embedding_network huggingface dataset:
Toward Logic-Based Cognitively Robust Synthetic Characters in Digital Environments
Authors: Selmer Bringsjord, Andrew Shilliday, Joshua Taylor, Dan Werner, Micah Clark, Ed Charpentier, Alexander Bringsjord
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

With respect to genuine cognitive faculties, present synthetic characters inhabiting online virtual worlds are, to say the least, completely impaired. Current methods aimed at the creation of “immersive” virtual worlds only avatars and NPCs the illusion of mentality and, as such, will ultimately fail. Like behaviorism, this doomed approach focuses only on the inputs and outputs of virtual characters and ignores the rich mental structures that are essential for any truly realistic social environment. While this “deceptive” tactic may be suitable so long as a human is in the driver's seat compensating for the mental deficit, truly convincing autonomous synthetic characters must possess genuine mental states, which can only result from a formal theory of mind. We report here on our attempt to invent part of such a theory, one that will enable artificial agents to have and reason about the beliefs of others, resulting in characters that can predict and manipulate the behavior of even human players. Furthermore, we present the “embodiment” of our recent successes: Eddie, a four year old child in Second Life who can reason about his own beliefs to draw conclusions in a manner that matches human children his age.
MapView
Authors: Hua Bao, Hui Guo, Jinwei Wang, Renchao Zhou, Xuemei Lu, Suhua Shi
Venue: Bioinformatics (2009)

Summary: We introduce a new visual analytics tool named MapView to facilitate the representation of large-scale short reads alignment data and genetic variation analysis. MapView can handle hundreds of millions of short reads on a desktop computer with limited memory. It supports a compact alignment view for both single-end and paired end short reads, multiple navigation and zoom modes and multi-thread processing. Moreover, MapView offers automated genetic variation detection. MapView has been used in our lab and by over 10 research labs worldwide. Availability: http://evolution.sysu.edu.cn/mapview/. Contact:baohua100@hotmail.com; lssssh@mail.sysu.edu.cn Supplementary information:Supplementary data are available at http://evolution.sysu.edu.cn/mapview/MVF.pdf
Fleet Telematics: Real-time management and planning of commercial vehicle operations, 1st edition
Authors: Asvin Goel
Venue:  (2007)

In the past 30 years, commercial transport traffic has more than doubled in both Europe and North America. Asian commercial transport traffic over this period of time has likely increased even more. Traffic jams are routine and they can happen in any segment of the highway system at any time. Moreover, manufacturing companies increasingly apply just-in-time practices in order to cut down inventory costs. As any mismatch between supply and demand can result into significant disturbances of manufacturing processes, just-in-time practices necessitate punctual, reliable, and flexible transportation. Emerging technologies in real-time communications systems provide the means for commercial vehicle operators to meet the increasingly complex customer expectations in a highly dynamic environment with unreliable traffic conditions. FLEET TELEMATICS: Real-Time Management and Planning of Commercial Vehicle Operations combines wireless telematics systems with dynamic vehicle routing algorithms and vehicle-positioning systems to produce a telematics-enabled information system that can be employed by commercial fleet operators for real-time monitoring, control, and planning. The book presents a Messaging & Fleet Monitoring System that automatically identifies deviations between the planned and the current state of the transportation system and a Dynamic Planning System (DPS) that provides real-time decision support considering the current state of the transportation system. The DPS uses newly developed dynamic vehicle routing algorithms to find high-quality solutions and adjust schedules and routes immediately. 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
An incremental SMLAOI algorithm for progressive downloading large scale WebVR scenes
Authors: Wei Wang, Jinyuan Jia
Venue: Proceedings of the 14th International Conference on 3D Web Technology (2009)

Interactive downloading huge virtual scenes on Internet is always a challenging task of large scale DVE(Distributed Virtual Environment) systems. Along classical progressive transmission mechanism based on AOI (Area of Interest), this paper proposes a new concept SMLAOI (Scalable Multi-Layer AOI). Then, presents an integer incremental SMLAOI culling algorithm without multiplication, divisions and floating calculations, which allows the WebVR regions nearer to current viewpoint to download with higher delivery priority, and reduces time that a user need to wait for initial scenes. Finally a framework of progressive downloading large scale WebVR scenes based C/S is designed.
Architectures and methods for energy-efficient querying and indexing in wireless sensor networks
Authors: Ramez Elmasri
Venue:  (2008)

Wireless sensor networks have been an active research area for about a decade due to their adaptability to applications involving long-term environmental monitoring. Recent technologies make it possible that a small device equipped with multi-purposed sensors, small CPU and memory, wireless transmitter and receiver, and software can form a network, measure some quantitative phenomena and communicate with each other seamlessly. In wireless sensor networks, one of the basic applications is to monitor events and measure values at places that people cannot reach easily or where a long term sensing task is required. In this case, we need to know the properties of diverse types of sensor network queries and data that are different from traditional ones. Also, we need to solve the intrinsic sensor network problem, energy saving, since users want to gather data for a long term and it is generally not feasible to replace batteries in sensor devices after the sensors are deployed. In order to solve this problem, first, we classify sensor network queries and find a suitable network system that includes different routing and storage types for each type of query. Second, energy efficient indexing and data gathering methods for sensor networks are studied. In energy efficient indexing, we propose a sectioned tree index, which divides the network area into several squares and each square has a local index subtree organized within that square. Local trees are interconnected to form one big tree in the network. Local trees are also built based on any algorithm that is energy consumption aware at each sub-root node in a locally centralized way. In energy efficient data gathering, we create energy-efficient data gathering routing tree when we consider two-way communication for reliable transmission and collision prevention. This makes the problem intractable, and we prove our problem is NP-complete by showing that a known NP-complete problem is a special case of our problem. In order to get an energy-efficient routing tree, we propose several heuristic techniques that backtrack one or two steps (BT1 and BT2). We give various values as parameters in measuring energy equation and simulate our proposed algorithms in diverse conditions.
Interpolation techniques for spatial distributed system identification using wireless sensor networks
Authors: Constantin Volosencu, Daniel-Ioan Curiac
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

Wireless sensor networks (WSNs) being an assembly of hundreds or thousands of sensor nodes, each with sensing (temperature, humidity, sound level, light intensity, magnetism, etc.) and wireless communication capabilities, provide vast opportunities for monitoring and mathematical modeling the spatial information about a region of interest. Starting from the measurements collected by sensor nodes inside an investigated spatial distributed system, this paper offers a view upon the use of two interpolation techniques in system identification.
Floating-point divider design for FPGAs
Authors: K. Scott Hemmert, Keith D. Underwood
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Growth in floating-point applications for field-programmable gate arrays (FPGAs) has made it critical to optimize floating-point units for FPGA technology. The divider is of particular interest because the design space is large and divider usage in applications varies widely. Obtaining the right balance between clock speed, latency, throughput, and area in FPGAs can be challenging. The designs presented here cover a range of performance, throughput, and area constraints. On a Xilinx Virtex4-11 FPGA, the range includes 250-MHz IEEE compliant double precision divides that are fully pipelined to 187-MHz iterative cores. Similarly, area requirements range from 4100 slices down to a mere 334 slices.
Analysis of Alzheimer's disease progression in structural magnetic resonance images
Authors: B. S. Mahanand, M. Aswatha Kumar
Venue: WSEAS Transactions on Computers (2009)

Structural magnetic resonance imaging (MRI) of the brain is an increasingly useful tool in the study of neurodegenerative diseases. MRI is currently the fastest developing medical imaging modality which is applied to an increasingly number of different medical diagnostic situations. Serial acquisition structural images of a subject's brain are acquired over time offers opportunities to monitor the progression of tissue volume changes in fine detail at all anatomical locations. As a result, the analysis of structural MRI data has been an active area of image analysis research for many years especially in early diagnosis, tracking of disease progression, which makes it possible to investigate how, for instance, a patient responds to treatment. The aim of the paper is to investigate and analyze brain tissue changes in Alzheimer's disease using non-rigid medical image registration and statistical analysis techniques. In our proposed approach, first the source and the target images are affinely registered to correct global differences between the images and then non-rigid registration based on free-form deformation using B-spline approximation is performed on the images. The resulting displacement values from the non-rigid registration are further investigated for deformation in the entire brain to detect typical deformation patterns. Finally, statistical method namely t-test is performed for analysis of the results. The initial results indicate that the tissue volume change in the brain occurs predominantly in the hippocampus of the brain.
An Intelligent Fault Diagnosis Method Based on Multiscale Entropy and SVMs
Authors: Long Zhang, Guoliang Xiong, Hesheng Liu, Huijun Zou, Weizhong Guo
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

Sample entropy (SampEn) has been applied in many literatures as a statistical feature to describe the regularity of a time series. However, as components of mechanical system usually interact and couple with each other, SampEn may cause inaccurate or incomplete description of a mechanical vibration signal due to the fact that SampEn is calculated at only one single scale. In this paper, a new method, named multiscale entropy (MSE), taking into account multiple time scales, was introduced for feature extraction from fault vibration signal. MSE in tandem with support vector machines (SVMs) constitutes the proposed intelligent fault diagnosis method. Details on the parameter selection of SVMs were discussed. In addition, performances between SVMs and artificial neural networks (ANNs) were compared. Experiment results verified the proposed model.
Fair anonymous rewarding based on electronic cash
Authors: Chun-I Fan, Shi-Yuan Huang, Pei-Hsiu Ho, Chin-Laung Lei
Venue: Journal of Systems and Software (2009)

This manuscript presents an anonymous rewarding protocol based on electronic cash. In the protocol, a reward provider publishes a problem to solicit a satisfactory solution of the problem. The provider offers a reward to the first person that can supply her/him a satisfactory solution of the problem. A reward claimant possesses a possible solution of the problem and sends her/his solution to the provider to claim the reward. Among all the claimants, the first qualified claimant is selected to obtain the reward. Not only is the privacy of the honest claimants, including the selected claimant, protected against the provider, but also the provider cannot decline the selected claimant her/his entitled reward without being detected after acquiring the solution from the claimant. Especially, if the provider can convince the message forwarding servers in the protocol that some malicious claimant has offered a forged solution to interfere with the rewarding process, these servers will help the provider to trace the dishonest claimant.
Writing a Good Grant Proposal
Authors: C. Ghidini
Venue: Proceeding of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium (2006)

Writing a good research grant proposal is not easy. In this talk I will try to collect together a number of information and suggestions on how to deal with this difficult task and an overview of the sources of founding available. The talk is based on guidelines issued by different founding agencies as well as on my experience and personal view on the subject.
A heuristic feedback control theory based interactive expert system - RSCD
Authors: Shieh-Shing Lin, Shih-Cheng Horng, Ch'i-Hsin Lin
Venue: Expert Systems with Applications: An International Journal (2009)

In this paper, we focus on the difficulties of resource recycling problems relating to the used Iron and/or Aluminum cans. Based on the feedback control theory and combining with micro-chip processor, sensors, phonic chip, oil-compressor and mechanism technology, we design an interactive resource recycling Expert System -''Recycling Squeezed Cans Device'' (RSCD) and the proposed interactive RSCD is an automaton device and achieves the following attractive functions: (1) Automatic guiding and detecting system, (2) Security protection system, (3) Automatic classification system, (4) Automatic squeezing system, (5) Automatic distributed collection system, (6) Automatic refund system. We design a heuristic feedback control algorithm imbedded in processor chip and the proposed interactive RSCD has the following special features: the Automatic guiding and detecting system using phonic chip associated with sensors and panel light indicator can easily lead users to operate the RSCD, the Security protection system using sensors associated with electromagnetic switches and safety mechanism designs can protect users harmless and the RSCD as well, the Automatic classification system using sensors associated with mechanic device and the design relating to rotating stepping motor can precisely discriminate whether the recycling used cans material belongs to metal or nonmetal type, and moreover, classify Iron or Aluminum type, the Automatic squeezing system using oil-compressor associated with sensors, and the design as to the compressing device can rapidly squeeze the recycling used cans into under about 1/5 of its original volume, the Automatic distributed collection system using sensors associated with stepping motor, micro-switches, and the design concerning the collection device can precisely distributed collect the recycling compressed cans into two different cans collection tanks, and the Automatic refund system using micro-switches associated with counter, and the design as to the rotating withdrawing device quickly give back the desired refunds. We install the proposed interactive RSCD in several different areas in public and make numerous simulations, the test results show that the proposed interactive RSCD is efficient for handling the resource recycling problems as to the recycling used Iron and/or Aluminum cans.
Promotion and cyclic sieving via webs
Authors: T. Kyle Petersen, Pavlo Pylyavskyy, Brendon Rhoades
Venue: Journal of Algebraic Combinatorics: An International Journal (2009)

We show that Schützenberger's promotion on two and three row rectangular Young tableaux can be realized as cyclic rotation of certain planar graphs introduced by Kuperberg. Moreover, following work of the third author, we show that this action admits the cyclic sieving phenomenon.
Group Key Exchange Enabling On-Demand Derivation of Peer-to-Peer Keys
Authors: Mark Manulis
Venue: Proceedings of the 7th International Conference on Applied Cryptography and Network Security (2009)

We enrich the classical notion of group key exchange (GKE) protocols by a new property that allows each pair of users to derive an independent peer-to-peer (p2p) key on-demand and without any subsequent communication; this, in addition to the classical group key shared amongst all the users. We show that GKE protocols enriched in this way impose new security challenges concerning the secrecy and independence of both key types. The special attention should be paid to possible collusion attacks aiming to break the secrecy of p2p keys possibly established between any two non-colluding users.In our constructions we utilize the well-known parallel Diffie-Hellman key exchange (PDHKE) technique in which each party uses the same exponent for the computation of p2p keys with its peers. First, we consider PDHKE in GKE protocols where parties securely transport their secrets for the establishment of the group key. For this we use an efficient multi-recipient ElGamal encryption scheme. Further, based on PDHKE we design a generic compiler for GKE protocols that extend the classical Diffie-Hellman method. Finally, we investigate possible optimizations of these protocols allowing parties to re-use their exponents to compute both group and p2p keys, and show that not all such GKE protocols can be optimized.
iPod & iTunes For Dummies: For Dummies Computer/Tech, 5th edition
Authors: Tony Bove, Cheryl Rhodes
Venue:  (2007)

Whether its the iPod Nano, iPod Shuffle, video iPod, or some other variation, iTunes and iPods go together like treble and bass. Its so easy to purchase the latest music and videos, download podcasts, and even keep track of your calendar on your iPodso why wouldnt you? But if its so easy, why do you need iPod & iTunes For Dummies? iPods now come in everything from 1GB to 80GB models and play movies, store photos, function as a spare hard drive, and even wake you up in the morning. If this is your first one, youll find no better place to get acquainted with it than in this bestselling book. If youve just purchased a brand-new iPod, youll find this Fifth Edition packed with valuable tidbits about the latest and greatest features. Youll discover how to: Set up an iTunes account Build a playlist of streaming radio stations Synchronize your iPod with other devices Record memos and appointments Play movies from your iPod on a TV Connect your iPod to your car stereo or portable speakers Add and edit iTunes song information Organize music and media into iTunes playlists Fine-tune sound playback with either the iPod or iTunes equalizer Transfer music to your iPod from old tapes and phonograph records Find out how to use every feature of your favorite iPod model and get the scoop on making the most of iTunes with iPod & iTunes For Dummies, 5th Edition!
Cognitive Maps-Based Student Model
Authors: Alejandro Peòa, Humberto Sossa, Agustín Gutiérrez
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

The main contribution of this PhD thesis is: A proposal for Student Modeling based upon Cognitive Maps (CM's). Its purpose is to anticipate the effects that a teaching-learning experience will produce on a student before its delivery. Thus, this dissertation focuses on the Student Modeling from the causal-effect perspective. Also, our approach aims at predict outcomes stemmed from teaching-learning sessions delivered by Web-based Education Systems (WBES's). Wherefore in WBES's, whose lessons have several sequence strategies and options of content, our Student Model (SM) offers a proactive and adaptive support for a student-centered education.
Wrapping Software Agents into Web Services
Authors: Manish Chhabra, Hongen Lu
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

The World Wide Web is evolving from a sea of information to a service oriented marketplace. Web Service (WS) is one of the fastest growing areas of information technology in recent years. To meet the increasing demand of vast range of Web Services, an engineering approach is much needed. In this paper we propose a methodology to wrap software agents with Web Services. This method takes advantage of widely accepted agent development tools in order to speed up the development of WS, and it also broadens the accessibility of agents. Our case study shows significant improvement of the nature of information provided by the WSs by making them more dynamic with the use of autonomous goal directed behavior of software agents.
Evolution Strategies for DS-CDMA Pseudonoise Sequence Design
Authors: Rosa Maria Alsina Pagès, Ester Bernadó Mansilla, Jose Antonio Morán Moreno
Venue: Proceeding of the 2005 conference on Artificial Intelligence Research and Development (2005)

Pseudonoise (PN) sequence sets must fulfill crosscorrelation properties in order to minimize multiuser interference. These properties are satisfied by the mathematical methods used to design these sets. In multiuser spread spectrum signals working with multiresolutive receivers, the pseudonoise sequences need to have more features for the proper performance of the acquisition scheme. In this paper we present an algorithm inspired by Evolution Strategies to design a set of pseudonoise sequences meeting all the constraints that the receiver demands. The new pseudonoise sequence set accomplishes not only the basic pseudorandom waveform properties but also the new crosscorrelation features required by the multiresolutive structure, obtaining better results in terms of crosscorrelation and stability. This way the acquisition is improved in the spread spectrum receiver.