ppxscal/embedding_network huggingface dataset:
Dialogue seminars as a tool in post graduate education
Authors: Adrian Ratki&#x0107;
Venue: AI Society (2008)

This paper describes and discusses a new postgraduate course based on the dialogue-seminar method. The course and the method have been developed within the research area of skill and technology, based at the Royal Institute of Technology in Stockholm. The main features of the course were dialogue and reflection on practice of research inspired by reading of the source texts from the history of science and philosophy written by: Descartes, Leibniz, Diderot, D&#x2019;Alembert, Gadamer, Galileo and Darwin. The concept of liberal education was of importance in the design of the course. Doctoral students were all adults interested in applying of research in order to improve practices at their own work places.
Surveying sandy deserts and desertified lands in north-western China by remote sensing
Authors: C. Z. Yan, T. Wang, Z. W. Han, Y. F. Qie
Venue: International Journal of Remote Sensing (2007)

Sandy deserts and desertified lands (SDDL) cover most of north-western China, and desertification is a severe environmental issue in this region. In this study, we classify SDDL into mobile, semi-mobile, semi-anchored, and anchored classes, and divide the corresponding severity of desertification into four levels: extremely severe, severe, moderate, and slight. Using SDDL databases derived from Landsat TM and ETM images in 1986 and 2000, we discuss the evolution of SDDL and the processes and causes of desertification. The desertified area increased by 16 101 km2 between 1986 and 2000, and most of the desertified land was classified as severely or extremely severely desertified. However, 3437 km2 of SDDL were also rehabilitated during this period. The area of SDDL increased in the Qinghai and Xinjiang regions, and in the western part of Inner Mongolia, but decreased in the Shaanxi, Gansu, and Ningxia regions. The causes of desertification differed among regions, and different measures to control desertification are proposed for the different regions.
Software Reuse through Resource Registries
Authors: Marc Wilhelm Küster, Christoph Ludwig
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Software engineering has always had software reuseas one of its key tenets. In both Service-Oriented and Resource-Oriented Architectures visibility is a prerequisite for fulfillingtheir respective promises, namely easier reuse of services andresources. Resource registries are a way to achieve such visibility.We argue that resource registries must separate technical,semantic and organizational aspects and leverage popular existingstandards. This way they are able to adapt to domainspecific requirements and a multitude of categorizations of andassociations between resources. These arguments are backed up by examples primarily from the nascent pan-European eGovernment Resource Network.
Estimating ice breakup dates on Eurasian lakes using water temperature trends and threshold surface temperatures derived from MODIS data
Authors: T. Nonaka, T. Matsunaga, A. Hoyano
Venue: International Journal of Remote Sensing (2007)

Ice breakup dates on lakes have a confirmed relationship with the local climates and are useful as a quantitative indicator of climate change, especially in the middle-high latitudes. Many lakes on the Eurasian continent freeze over in winter, but data on their ice breakup dates are incomplete. In this study, we attempt to infer ice breakup dates for 18 lakes on the Eurasian continent using the proposed method based on long-term surface temperature (water temperature trend) and threshold surface temperature. The threshold surface temperature was estimated using reflectance data from the near infrared band together with surface temperature data derived from MODIS. After obtaining the estimated ice breakup dates, we compared them with observed results in order to evaluate our proposed method for ice breakup date estimation. According to this comparison, the estimation error of the ice breakup dates was less than three days. In the last stage of this study, we estimated the ice breakup dates at the centres of 18 Eurasian lakes from 2001 to 2003. The mean ice breakup dates on these lakes in 2002 were two weeks earlier than in 2003 and one week earlier than in 2001.
Training Data Compression Algorithms and Reliability in Large Wireless Sensor Networks
Authors: Vasanth Iyer, Garimella Rammurthy, M. B. Srinivas
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

With the availability of low-cost sensor nodes there have been many standards developed to integrate and network these nodes to form a reliable network allowing many different types of hardware vendors to coexist. Most of these solutions however have aimed at industry-specific interoperability but not the size of the sensor network and the large amount of data which is collected in course of its lifetime. In this paper we use well studied data compression algorithms which optimize on bringing down the data redundancy which is related to correlated sensor readings and using a probability model to efficiently compress data at the cluster heads. As in the case of sensor networks the data reliability goes down as the network resource depletes and these types of networks lacks any central synchronization making it even more a global problem to compare different reading at the central coordinator. The complexity of calibrating each sensor and using an adaptable measured threshold to correct the reading from sensors is a severe drain in terms of network resources and energy consumption. In this paper we separate the task of comparative global analysis to a central coordinator and use a reference PMax which is a normalized probability of individual source which reflects the current lifetime reliability of the sensors calculated at the cluster heads which then is compared with the current global reliability index based on all the PMax of cluster heads. As this implementation does not need any synchronization at the local nodes it uses compress once and stamp locally without any threshold such as application specific calibration values (0-42°F) and the summarization can be application independent making it more a sensor network reliability index and using it independent of the actual measured values.
Bootstrapping approach to feature-weight selection in fuzzy c-means algorithms with an application in color image segmentation
Authors: Wen-Liang Hung, Miin-Shen Yang, De-Hua Chen
Venue: Pattern Recognition Letters (2008)

The fuzzy c-means (FCM) algorithm is a popular fuzzy clustering method. It is known that an appropriate assignment to feature weights can improve the performance of FCM. In this paper, we use the bootstrap method proposed by Efron [Efron, B., 1979. Bootstrap methods: Another look at the jackknife. Ann. Statist. 7, 1-26] to select feature weights based on statistical variations in the data. It is simple to compute and interpret for feature-weights selection. Compared with the feature weights proposed by Wang et al. [Wang, X.Z., Wang, Y.D., Wang, L.J., 2004. Improving fuzzy c-means clustering based on feature-weight learning. Pattern Recognition Lett. 25, 1123-1132], Modha and Spangler [Modha, D.S., Spangler, W.S., 2003. Feature weighting in k-means clustering. Machine Learn. 52, 217-237], Pal et al. [Pal, S.K., De, R.K., Basak, J., 2000. Unsupervised feature evaluation: A neuro-fuzzy approach. IEEE Trans. Neural Networks 11, 366-376] and Basak et al. [Basak, J., De, R.K., Pal, S.K., 1998. Unsupervised feature selection using a neuro-fuzzy approach. Pattern Recognition Lett. 19, 997-1006] we find that the proposed method provides a better clustering performance for Iris data and several simulated datasets based on error rate criterion and also performs well in color image segmentation according to Liu and Yang's [Liu, J., Yang, Y.H., 1994. Multiresolution color image segmentation technique. IEEE Trans. Pattern Anal. Machine Intell. 16, 689-700] evaluation function.
Providing expressive gaze to virtual animated characters in interactive applications
Authors: Rossana B. Queiroz, Leandro M. Barros, Soraia R. Musse
Venue: Computers in Entertainment (CIE) (2008)

Eyes play an important role in communication among people. Motions of the eye express emotions and regulate the flow of conversation. Hence we consider fundamental that virtual humans or other characters present convincing and expressive gaze in applications such as Embodied Conversational Agents (ECAs), games and movies. However, we perceive that in many applications that require automatic generation of facial movements, such as ECA, character's eye motion does not carry meaning related to its expressiveness. This work proposes a model for the automatic generation of expressive gaze by examining eye behavior in different affective states. To collect data related to gaze and expressiveness, we looked at Computer Graphics movies. This data was used as a basis to describe gaze expressions in the proposed model. We also implemented a prototype and performed some tests with users in order to observe the impact of eye behavior during some expressions of emotion. The results show that the model is capable of generating eye motions that are coherent with the affective states of the virtual character.
Simulation of the Humanoid Running Robot Based on ADAMS
Authors: Hangxin Wei, Wei Wu, Mingzhi Liu
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

The virtual model of the humanoid running robot is built by using the software ADAMS. With this model, one can research the problem how to realize the running of a humanoid robot without the physical model of the robot. In addition, a method of realizing running for the robot based on virtual leg is proposed. The robot can run stably by planning the trajectory of the center of mass (COM) and the trajectory of two feet of the robot. The trajectory of the COM of the robot is mainly planned by the dynamic equation of the virtual leg of the robot. After this method is used in the virtual model of the robot, the robot can run at a speed of 2.9m/s. The simulation results show the validity of this method.
Construction of uniquely H-colorable graphs
Authors: Xuding Zhu
Venue: Journal of Graph Theory (1999)

We shall prove that for any graph H that is a core, if &chi;(G) is large enough, then H &times; G is uniquely H-colorable. We also give a new construction of triangle free graphs, which are uniquely n-colorable. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 30: 16, 1999
Proceedings of the 2008 international workshop on Models in software engineering
Venue: International Conference on Software Engineering (2008)

We welcome you to the Workshop on Models in Software Engineering -- MiSE'08. This year's workshop continues the ideas and aims of MiSE'07 -- to promote the use of models in software engineering and to provide a forum for exchange and collaboration between the communities of the MoDELS and ICSE international conferences. The underlying goals of the software-modeling community are to improve the productivity of software developers and to improve the quality of the resulting software products. Models are useful in all phases and activities surrounding software development and deployment. Thus, workshop topics range from requirements modeling, to run-time models, to models for assessing software quality, to the pragmatics of how to manage large collections of models. This year, we received 30 submissions. Out of these, the program committee accepted 13 papers, for an acceptance rate of 43%. These papers form the basis of workshop sessions, each of which will start with short presentations of 2-3 papers, followed by discussions of issues and research opportunities raised by the papers and by the session topic in general. In addition, there will be a panel on Obstacles to MDE Adoption. New this year: the final session will be a joint session between MiSE and the ICSE workshop on the Role of Abstraction. This session will allow attendees of both workshops to explore together the role of abstraction in effective modelling.
Antialiasing Procedural Shaders with Reduction Maps
Authors: R. Brooks Van Horn III, Greg Turk
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Both image textures and procedural textures suffer from minification aliasing, however, unlike image textures, there is no good automatic method to anti-alias procedural textures. Given a procedural texture on a surface, we present a method that automatically creates an anti-aliased version of the procedural texture. The new procedural texture maintains the original texture's details, but reduces minification aliasing artifacts. This new algorithm creates a pyramid similar to MIP-Maps to represent the texture. Instead of storing per-texel color, our texture hierarchy stores weighted sums of reflectance functions, allowing a wider range of effects to be anti-aliased. The stored reflectance functions are automatically selected based on an analysis of the different reflectances found over the surface. When the texture is viewed at close range, the original texture is used, but as the texture footprint grows, the algorithm gradually replaces the texture's result with an anti-aliased one.
Schnyder woods for higher genus triangulated surfaces
Authors: Luca Castelli Aleardi, Eric Fusy, Thomas Lewiner
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

Schnyder woods are a well known combinatorial structure for planar graphs, which yields a decomposition into 3 vertex-spanning trees. Our goal is to extend definitions and algorithms for Schnyder woods designed for planar graphs (corresponding to combinatorial surfaces with the topology of the sphere, i.e., of genus 0) to the more general case of graphs embedded on surfaces of arbitrary genus. First, we define a new traversal order of the vertices of a triangulated surface of genus g together with an orientation and coloration of the edges that extends the one proposed by Schnyder for the planar case. As a by-product we show how some recent schemes for compression and compact encoding of graphs can be extended to higher genus. All the algorithms presented here have linear time complexity.
Examining the critical success factors in the adoption of enterprise resource planning
Authors: E. W. T. Ngai, C. C. H. Law, F. K. T. Wat
Venue: Computers in Industry (2008)

This paper presents a literature review of the critical success factors (CSFs) in the implementation of enterprise resource planning (ERP) across 10 different countries/regions. The review covers journals, conference proceedings, doctoral dissertation, and textbooks from these 10 different countries/regions. Through a review of the literature, 18 CSFs were identified, with more than 80 sub-factors, for the successful implementation of ERP. The findings of our study reveal that 'appropriate business and IT legacy systems', 'business plan/vision/goals/justification', 'business process reengineering', 'change management culture and programme', 'communication', 'ERP teamwork and composition', 'monitoring and evaluation of performance', 'project champion', 'project management', 'software/system development, testing and troubleshooting', 'top management support', 'data management', 'ERP strategy and implementation methodology', 'ERP vendor', 'organizational characteristics', 'fit between ERP and business/process', 'national culture' and 'country-related functional requirement' were the commonly extracted factors across these 10 countries/regions. In these 18 CSFs, 'top management support' and 'training and education' were the most frequently cited as the critical factors to the successful implementation of ERP systems.
Cylindrical bending of piezoelectric laminates with a higher order shear and normal deformation theory
Authors: Tarun Kant, S. M. Shiyekar
Venue: Computers and Structures (2008)

An analytical solution, based on a higher order shear and normal deformation theory, is presented for the cylindrical flexure of piezoelectric plates. The primary displacement terms are expanded in thickness coordinate and an exact nature of electric potential is obtained in actuator and sensing layers. The electric potential function is evaluated by solving a second order ordinary differential equation satisfying electric boundary conditions along thickness direction of piezoelectric layer. A unidirectional composite plate attached with distributed actuator and sensor layers is analyzed under electrical and mechanical loading conditions and comparison of results with exact solution is presented. Results for non-piezoelectric plates are also compared with elasticity and other solutions of cylindrical bending.
On graphs with linear Ramsey numbers
Authors: R. L. Graham, V. Rödl, A. Ruciński
Venue: Journal of Graph Theory (2000)

For a fixed graph H, the Ramsey number r(H) is defined to be the least integer N such that in any 2-coloring of the edges of the complete graph KN, some monochromatic copy of H is always formed. Let 퓗(n, &Delta;) denote the class of graphs H having n vertices and maximum degree at most &Delta;. It was shown by Chvat&aacute;l, R&ouml;dl, Szemer&eacute;di, and Trotter that for each &rdquo; there exists c(&Delta;) such that r(H) < c(&Delta;)n for all H &epsilon; 퓗(n, &Delta;). That is, the Ramsey numbers grow linearly with the size of H. However, their proof relied on the well-known regularity lemma of Szemer&eacute;di and only gave an upper bound for c(&Delta;) which grew like an exponential tower of 22 s of height &rdquo;. This was remedied substantially in a recent paper of Eaton, who showed that one could take c(&Delta;) < 22c&Delta; for some fixed c. Eaton, however, also used a variant of the regularity lemma in her proof. In this paper, we avoid the use of the regularity lemma altogether, and show that one can in fact take, for some fixed c, c(&Delta;) < 2c&Delta;(log &Delta;)2 in the general case, and even c(&Delta;) < 2c&Delta; log &Delta; if H is bipartite. In particular, we improve an old upper bound on the Ramsey number of the n-cube due to Beck. We also show that for a fixed c2 > 0, and for all n and &Delta;, there are graphs H2 &epsilon;퓗 (n, &Delta;) with r(H2) > 2c2&Delta;n, which is not so far from our upper bound. In addition, we indicate how the upper bound result can be extended to the larger class of so-called p-arrangeable graphs, introduced by Chen and Schelp. &copy; 2000 John Wiley Sons, Inc. J Graph Theory 35: 176192, 2000
Single-pass GPU solid voxelization for real-time applications
Authors: Elmar Eisemann, Xavier Décoret
Venue: Proceedings of graphics interface 2008 (2008)

In this paper, we present a single-pass technique to voxelize the interior of watertight 3D models with high resolution grids in real-time during a single rendering pass. Further, we develop a filtering algorithm to build a density estimate that allows the deduction of normals from the voxelized model. This is achieved via a dense packing of information using bitwise arithmetic. We demonstrate the versatility of the method by presenting several applications like translucency effects, CSG operations, interaction for particle simulations, and morphological operations. The speed of our method opens up the road for previously impossible approaches in real-time: 300,000 polygons are voxelized into a grid of one billion voxels at > 90Hz with a recent graphics card.
Collaborative Computing Using the Atom Publishing Protocol
Authors: Firat Kart, L. E. Moser, P. M. Melliar-Smith
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In this paper we present a Collaborative Computing Infrastructure that enables applications that are distributed across a network of computers to collaborate using the Atom Publishing Protocol. The Collaborative Computing Infrastructure couples together, and facilitates interactions between, application programs using the pull-based, event-based distributed computing paradigm. The Atom Server allows publishers to publish events as Atom feed entries for consumers to read. The current specification of the Atom Publishing Protocol, which we have implemented, requires feed entries to be retrieved one by one. To provide better performance, we have also implemented a modification of the Atom Publishing Protocol that supports retrieval of all of the feed entries in a collection at once. This modification results in shorter retrieval times for feed entries, fewer connections to the Atom Server for each consumer, and larger numbers of concurrent consumers.
Enhancing energy efficiency of processor-based embedded systems through post-fabrication ISA extension
Authors: Hamid Noori, Farhad Mehdipour, Koji Inoue, Kazuaki Murakami
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Application-specific instruction set extension is an effective technique for reducing accesses to components such as on- and off-chip memories, register file and enhancing the energy efficiency. However, the addition of custom functional units to the base processor is required for supporting custom instructions, which due to the increase of manufacturing and design costs in new nanometer-scale technologies and shorter time-to-market, is becoming an issue. To address above issues, in our proposed approach, an optimized reconfigurable functional unit is used instead, and instruction set customization is done after chip-fabrication. Therefore, while maintaining the flexibility of a conventional microprocessor, the low-energy feature of customization is applicable. Experimental results show that the maximum and average energy savings are 67% and 22%, respectively for our proposed architecture framework.
Authentication Using Fuzzy Vault Based on Iris Textures
Authors: Edara Srinivasa Reddy, Inampudi Ramesh Babu
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Abstract Crypto-biometrics is an emerging architecture where cryptography and biometrics are merged to achieve high level security systems. This paper explores the realization of cryptographic construction called fuzzy vault to store digital signature based on iris pseudo textures. Iris pseudo textures such as nodes and end points does not change through out the life period of user and can be used to extract minutiae to lock and unlock the fuzzy vault. The proposed algorithm aims to create a fuzzy vault to store secret key, based on iris pseudo textures. The algorithm has two phases: The first is to extract binary key (digital signature) from iris textures, and the second to generate fuzzy vault by using Lagrange interpolating polynomial projections, further which is projected by using data units extracted from iris minutiae
A new shaft position control for switched reluctance motor in harsh environment
Authors: E. Afjei, M. M. Nezamabadi, A. Saati
Venue: Proceedings of the 9th International Conference on Circuits (2005)

This paper describes a new method for direct sensing of the rotor position in switched reluctance motor that can be utilized in a very harsh environment such as a furnace. In this method, a new sensorless technique applied to a mechanical sensing unit made up of a rotor and a stator laminations used in that motor. This detection method uses a sine wave signal applied to every other stator pole windings of the sensing unit and from the resulting induced signals obtained from the opposite coils, the position of the rotor is accurately determined. This sensing unit is immune from motor switching noises. An advancement technique for the dwell angle from zero degree at standstill to 10 degrees at an arbitrary pre set speed of 100 rpm is also utilized in the control circuit for achieving higher performance from the motor. Finally the experimental results are presented which demonstrate the robust functionality of the method.