ppxscal/embedding_network huggingface dataset:
Proceedings of the 13th international conference on Intelligent user interfaces
Venue: International Conference on Intelligent User Interfaces (2008)

We believe that it's time for the next generation of user interfaces. People want to do increasingly interesting and complex things with information technologies, but our interfaces need new ways of interacting with people. We can't get to the next generation of user interfaces simply by adding more menus and icons to our already overcrowded screens. Sooner or later, our interfaces need to understand more about what people are doing with them, become self-reflective, and communicate using natural modalities such as speech and gesture. IUI is where the community of people interested in Human-Computer Interaction (HCI) meets the Artificial Intelligence (AI) community. We're also very interested in contributions from related fields, such as psychology, cognitive science, computer graphics, the arts. Unlike traditional AI, our focus is not so much to make the computer smart all by itself, but to make interaction between computers and people smarter. Unlike traditional HCI, we're more willing to consider solutions that involve large amounts of knowledge, heuristics, and emerging technologies such as natural language understanding or gesture recognition. IUI 2008 focuses on interface innovation. We're interested in truly new ideas about how people and computers could interact. Our program this year highlights 30 Long Papers and 32 Short Papers accepted from a total of 205 paper submissions. These papers cover a wide range of topics, including visualization, recommender systems, speech and natural language interfaces, computer vision, example-based interfaces, multi-agent systems, search, and personal information management. The papers program is complemented by the always popular Posters and Demonstrations session where authors of accepted short papers can showcase their work and where many published authors present live demos of their systems. In addition, this year we count with two outstanding invited speakers: Enrico Motta of the Open University, UK and Theodore Berger from the University of Southern California, USA. Finally, the main conference program is greatly augmented by an excellent offer of one Tutorial and dedicated Workshops as can be seen in the tutorial and workshop overviews in these proceedings. The 2008 International Conference on Intelligent User Interfaces (IUI 2008) is the 12th such meeting since the conference was defined as a yearly event in 1997. This year, our meeting returns to Europe, actually to one of its most comfortable locations throughout the year and especially during the winter season.
Mobile traversal schemes based on triangulation coverage
Authors: Asheq Khan, Chunming Qiao, Satish K. Tripathi
Venue: Mobile Networks and Applications (2007)

In harsh outdoor terrains like disaster areas and urban toxic regions, optimal placements of static sensor nodes might not be possible, leading to possible incomplete coverage of the region. In such situations, mobile sensor nodes (MSNs) might be a better option and a significantly fewer number of nodes are required than their static counterparts. A triangulation-based coverage where, groups of three MSNs position themselves to form equilateral triangles, has several applications in localization, 3D imaging and coordinated search operation. In this paper, we present several mobile traversal algorithms (MTA) based on triangulation coverage that employs N ≥ 3 MSNs such that, up to N - 3 node failures can be tolerated. MTA achieves three objectives: (a) as N increases, the total time to cover the field decreases in the absence of a failure; (b) each MSN travels a minimum distance; (c) upon a failure, the remaining MSNs efficiently complete the coverage of the field. The bounds on the total traveling distance and time are derived and the tightness of the bounds are proven through simulations. Furthermore, we also derive the bounds on the distance traveled by an MSN to complete the coverage process. The bounds on the individual traveling distances are useful in minimizing and bounding the energy consumption of the MSNs.
Capacity Issues in Meshed High Data Rate WPANs
Authors: S. A. Mahmud, S. Khan, Qiang Ni, H. S. Al-Raweshidy
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Some advantages of meshing Wireless Personal Area Networks (WPAN) are to increase the network coverage without high transmission power, self-configuration and self-healing, increased route redundancy and fewer retransmissions. This paper discusses the capacity issues when meshing high data rate WPANs i.e. IEEE 802.15.3, IEEE 802.15.3a and IEEE 802.15.3c. The capacity bottlenecks are discussed which arise in multihop communication with a shared superframe. The paper provides detailed analysis on the superframe capacity using different transmitter data rates and highlights the importance of frame aggregation to achieve higher throughput and low overhead. The paper concludes by discussing possible approaches to improve the capacity of meshed WPANs.
Improved n 1-cover discovery using perimeter coverage information
Authors: James C. Beyer, David H. C. Du, Ewa Kusmierek
Venue: International Journal of Sensor Networks (2008)

Over-deploying sensors into a coverage region allows for coverage guarantees in the face of random deployments. Extending the lifetime of these deployments by only turning on a handful of sensors that cover the entire region is a viable means of conserving energy. In order to maximally extend the life of a sensor network, several problems must be solved. These are: the 1-cover, the k-cover and n 1-covers. The 1-cover and k-cover problems have been solved previously; however, the n 1-cover problem has proven more difficult to address. We present a perimeter-centric approach to the NP-complete n 1-covers problem, which chooses neighbours based on an optimal disk placement theory, but takes practical constraints into consideration. Simulation results have shown that our system outperforms both the critical field selection algorithm and an n 1-cover selection algorithm derived from Zhang and Hou's OGDC algorithm.
Power of fast VLSI models is insensitive to wires' thinness
Authors: G. Itkis, L. A. Levin
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

VLSI f-models which allow the switching time to decrease to f(D) when the length of all wires is restricted by D are called 'fast' if the decrease is slightly superlinear. The fast models are so strong and robust that their computational power cannot be increased by and combination of the following: (1) making zero the width of each wire of length d, except for its log d segment, thus eliminating layout and area considerations; (2) allowing wires to transmit log d bits simultaneously; (3) making the switching time f(d) of each node depend only on the length d of its own input wires, thus enabling small subcircuits to run faster; (4) changing f while preserving Sigma /sub k/ 1/f(k); (5) enabling the nodes to change connections arbitrarily in the run time. The authors construct a kind of operating system link server (linx, for short) that simulates all these powers online. The condition of superlinearity cannot be weakened.
Proceedings of the 7th ACM conference on Designing interactive systems
Venue: Designing Interactive Systems (2008)

You are holding the proceedings of the 7th ACM Conference on Designing Interactive Systems --- DIS 2008. For the first time ever, one of the main SIGCHI conferences is being held on the African continent and we would like to thank those involved for taking a leap of faith and letting DIS take a trip to Africa. Our goal in bringing DIS to South Africa is two-fold. Firstly, there is a small emerging group of researchers within Africa who will benefit greatly from being exposed to the stimulating work produced by the DIS community. Secondly, we wanted to give the DIS community exposure to African Design. It is for this reason that DIS is co-located with the African Design Indaba --- the premier annual event for African designers. We hope that those attending DIS from other continents will be inspired by what they see here.
Practical Load Distribution Models for Web Services Based environments
Authors: Elarbi Badidi, M. Adel Serhani, Larbi Esmahi, Mohamed Elkoutbi
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

Web services QoS management frameworks proposed in the literature deal essentially with issues such as QoS specification, QoS-based discovery and selection, and QoS monitoring of Web services. However, only few works have considered the issue of load distribution in a Web services context. In this paper, we investigate three models that might be used to achieve load distribution in a Web services environment. We focus on load distribution at the operation level by considering the assignment of methods execution to appropriate Web services according to some selection policies. The experiments we have conducted using the broker-oriented model have shown that better results are obtained using the random policy for Web service selection.
A reference-counting garbage collection algorithmfor cyclical functional programming
Authors: Baltasar Trancón y Widemann
Venue: Proceedings of the 7th international symposium on Memory management (2008)

Reference-counting garbage collection is known to have problems with the collection of cyclically connected data. There are two historically significant styles of cycle-aware algorithms: The style of Brownbridge that maintains a subset of marked edges and the invariant that every cycle contains at least one marked edge, and the style of Martinez-Lins-Wachenchauzer (MLW) that involves local mark-and-scan procedures to detect cycles. The former is known to be difficult to design and implement correctly, and the latter to have pathological efficiency for a number of very typical situations. We present a novel algorithm that combines both approaches to obtain reasonably efficient local mark-and-scan phases with a marking invariant that is rather cheap to maintain. We demonstrate that the assumptions of this algorithm about mutator activity patterns make it well-suited, but not limited, to a functional programming technique for cyclic data. We evaluate the approach in comparison with simple and more sophisticated MLW algorithms using a simple benchmark based on that functional paradigm.
Asset Pricing and Productivity Growth: The Role of Consumption Scenarios
Authors: Volker Böhm, Tomoo Kikuchi, George Vachadze
Venue: Computational Economics (2008)

The paper analyzes the performance of asset prices implied by an aggregate macroeconomic growth model under two different consumption hypotheses: overlapping generations of agents with two period lives versus the infinitely lived agent. The production side of the economy is described by a random growth model with a competitive labor market and an exogenously given random dividend payout ratio. For an isoelastic technology with multiplicative production shocks this implies a random dynamical system for the firm's rate of profit with a unique asymptotically stable random fixed point for a large class of productivity growth and dividend payout ratio processes. Based on an extensive numerical study of stationary solutions we show that the two consumption scenarios imply a limited number of diverse effects regarding equity and bond returns and equity premia.
Improved asymptotic bounds on critical transmission radius for greedy forward routing in wireless ad hoc networks
Authors: Lixin Wang, Chih Wei Yi, Frances Yao
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

Consider a random wireless ad hoc network represented by a Poisson point process over a unit-area disk with mean n. Let σn denote its critical transmission radius for greedy forward routing, and βo = 1/ (2/3 -- √3/2π) ≈ 1.62. It was recently proved that for any constant ε > 0, it is asymptotically almost sure that (1 -- ε) √βo in n/πn ≤ σn ≤ (1 + ε) √βo in n/πn. In this paper, we obtain tighter asymptotic bounds on σn. Specifically, we prove that for any constant c, the asymptotic probability of σn ≤ √βo in n + c/πn is at least 1 -- ( 1/1/βo--1/3 -- βo/2) e -c and at most e -βo/2 e -- c. Consequently, for any positive sequence (εn : n ≥ 1) with εn = o(In n) and εn → ∞, it is asymptotically almost sure that √βo in n --εn/πn ≤ σn ≤ √βo in n + εn/πn. We also conjecture that for any constant c, the asymptotic probability of σn ≤ √βo 1n n + c/σn is exactly exp (--(1/1/βo--1/3 -- β;o/2) e --c).
Real-time dynamic fuzzy Q-learning and control of mobile robots
Authors: Chang Deng, Meng Joo Er
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

In this paper, we present a new approach of controlling a mobile robot using the Dynamic Fuzzy Q-Learning method. Self-organizing fuzzy inference is introduced to calculate actions and Q-functions so as to enable us to deal with continuous-valued states and actions. Fuzzy rules can be generated automatically when necessary. Fuzzy inference systems provide a natural mean of incorporating the bias components for rapid reinforcement learning. Eligibility trace method is incorporated into our algorithm, leading to faster learning and also help to alleviate the experimentation-sensitive problem that an arbitrarily bad training policy might result in poor learning. Experimental results demonstrate that the robot is able to learn the right policy with a few of trials.
Utilization of multi-dates LANDSAT_TM data to detect and quantify the environmental damages in the southeastern region of Kuwait from 1990 to 1991
Authors: H. I. El-Gamily
Venue: International Journal of Remote Sensing (2007)

The invasion of Kuwait by Iraqi forces in August 1990, has affected the environment of the Gulf region and of Kuwait in particular. The environmental consequences of military operations and burning of oil wells in 1991 severely affected the air and the marine environment in addition to the terrestrial ecosystems in Kuwait. The air environment received hundreds of thousands of tons of oil soot, carbon oxides and sulphur oxides per day during the crises. The marine and coastal ecosystems were seriously affected by the gushed and drainage of oil onto the Gulf water. The terrestrial ecosystems of Kuwait were severely affected by the drainage of oil that formed networks of oil rivers and lakes. It was also affected by oil soot as well as troops operations. The penetration and solidification of oil with surface sediments led to the formation of new surface layer known as 'Tarcrete'. This paper aims at utilizing multi-dates LANDSAT-TM data to detect and quantify the environmental damages that happened in the terrestrial environment of the southeastern region of Kuwait owing to the Iraqi invasion between 1990 and 1991. The LANDSAT-TM images (165/40) acquired in 1990 and 1991 were selected to carry out this study. The two images were geometrically corrected and enhanced before extracting the subset for the study area, using ERDAS Imagine S/W. The principal components of two dates were also produced and interpreted. Then, the multi-dates enhancement technique of change detection was applied on the resultant principal component images (PC) of the two subsets of December 1990 and November 1991. Finally, the detected environmental damages from the previous step were quantified using the supervised classification technique. The total terrestrial environment of the study area is calculated to be 5240 km2. The environmental changes are calculated to be 67.7%. The severe and high environmental damages represent 18.7%. These damages represent the new layer of 'Tarcrete' and oil rivers and lakes in the form of a black plume, starting from Magwa, Burgan and Ahmadi oil fields and extending in the southeast direction, parallel to the shoreline until the border between Kuwait and Saudi Arabia. The moderate environmental changes, in the form of heavy oil soot, represent 18.8% whereas the minor changes, in the form of low density of oil soot, represent 30.2% of the study area. Thus, the Kuwaiti environment has suffered from severe environmental damages as a result of the second Gulf war disaster.
Modeling interleaved hidden processes
Authors: Niels Landwehr
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Hidden Markov models assume that observations in time series data stem from some hidden process that can be compactly represented as a Markov chain. We generalize this model by assuming that the observed data stems from multiple hidden processes, whose outputs interleave to form the sequence of observations. Exact inference in this model is NP-hard. However, a tractable and effective inference algorithm is obtained by extending structured approximate inference methods used in factorial hidden Markov models. The proposed model is evaluated in an activity recognition domain, where multiple activities interleave and together generate a stream of sensor observations. It is shown to be more accurate than a standard hidden Markov model in this domain.
Internalization, qualitative methods, and evaluation
Authors: Sarah Faisal, Brock Craft, Paul Cairns, Ann Blandford
Venue: Proceedings of the 2008 conference on BEyond time and errors: novel evaLuation methods for Information Visualization (2008)

Information Visualization (InfoVis) is at least in part defined by a process that occurs within the subjective internal experience of the users of visualization tools. Hence, users' interaction with these tools is seen as an 'experience'. Relying on standard quantitative usability measures evaluates the interface. Yet, there is more to users' interaction with InfoVis tools than merely the interface. Qualitative methods targets users' subjective experiences. In this paper we demonstrate the potential benefits of qualitative methods, more specifically Grounded Theory, for generating a theoretical understanding of users' InfoVis experiences through discussing the results of a qualitative study we conducted. The study was conducted in order to evaluate a visualization of the academic literature domain, which we have designed and built using a user-centered design approach. The study resulted in us identifying categories that are essential to the InfoVis experience. This paper argues that these categories can be used as a foundation for building an InfoVis theory of interaction.
QR Recursive Least Squares IP Core Example
Authors: Gaye Lightbody, Roger Woods
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

With transistor counts increasing at a rate of 58% per year and design productivity only growing at 21% per year, there is an important need to develop new design approaches to close this gap. This paper outlines the process by which IP cores are generated and shows how the design methodology can be improved to enhance their usability. The process is demonstrated using a recursive least squares (RLS) adaptive filter example.
Mining for offender group detection and story of a police operation
Authors: Fatih Ozgul, Julian Bondy, Hakan Aksoy
Venue: Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70 (2007)

Since discovery of an underlying organisational structure from crime data leads the investigation to terrorist cells or organised crime groups, detecting covert networks are important to crime investigation. As shown in application of Offender Group Detection Model (OGDM), which is developed and tested on a theft network in Bursa, Turkey, use of effective data mining methods can reveal offender groups. OGDM detected seven ruling members of twenty network members. Based on initial findings of OGDM; thirty-four offenders are considered to be in a single offender group where seven of them were ruling members. After Operation Cash was launched, the police arrested the seven detected ruling members, and confirmed that the real crime network was consisting of 20 members of which 3 whom had never been previously identified or arrested. The police arrested 17 people, recovered worth U.S. $ 200,000 of stolen goods, and cash worth U.S. $ 180,000.
Robust parsing and spoken negotiative dialogue with databases
Authors: Johan Boye, Mats WirÉn
Venue: Natural Language Engineering (2008)

This paper presents a robust parsing algorithm and semantic formalism for the interpretation of utterances in spoken negotiative dialogue with databases. The algorithm works in two passes: a domain-specific pattern-matching phase and a domain-independent semantic analysis phase. Robustness is achieved by limiting the set of representable utterance types to an empirically motivated subclass which is more expressive than propositional slot–value lists, but much less expressive than first-order logic. Our evaluation shows that in actual practice the vast majority of utterances that occur can be handled, and that the parsing algorithm is highly efficient and accurate.
Improved Nystr&ouml;m low-rank approximation and error analysis
Authors: Kai Zhang, Ivor W. Tsang, James T. Kwok
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Low-rank matrix approximation is an effective tool in alleviating the memory and computational burdens of kernel methods and sampling, as the mainstream of such algorithms, has drawn considerable attention in both theory and practice. This paper presents detailed studies on the Nystr&ouml;m sampling scheme and in particular, an error analysis that directly relates the Nystr&ouml;m approximation quality with the encoding powers of the landmark points in summarizing the data. The resultant error bound suggests a simple and efficient sampling scheme, the k-means clustering algorithm, for Nystr&ouml;m low-rank approximation. We compare it with state-of-the-art approaches that range from greedy schemes to probabilistic sampling. Our algorithm achieves significant performance gains in a number of supervised/unsupervised learning tasks including kernel PCA and least squares SVM.
Fuzzy two-stage quadratic programming for planning solid waste management under uncertainty
Authors: Y. P. Li, G. H. Huang
Venue: International Journal of Systems Science (2007)

In this study, a fuzzy two-stage quadratic programming (FTSQP) method is developed for planning waste-management systems under uncertainty. It incorporates approaches of fuzzy quadratic programming and two-stage stochastic programming within a general optimization framework, to better reflect uncertainties expressed as probability-density and fuzzy-membership functions. The FTSQP can be used for analyzing various policy scenarios that are associated with different levels of economic penalties when the promised policy targets are violated. Moreover, using fuzzy quadratic terms rather than linear ones, the proposed method can improve upon the existing fuzzy linear programs through (a) more effectively optimizing the general satisfaction of the objective and constraints, (b) minimizing the variation of satisfaction degrees among the constraints and leading to more robust solutions, and (c) reflecting the trade-off between the system cost and the constraint-violation risk. The developed method is applied to a case study of municipal solid waste management. The results indicate that reasonable solutions have been generated. They will allow in-depth analyses of trade-offs between environmental and economic objectives as well as those between system cost and decision-maker's satisfaction degree.