ppxscal/embedding_network huggingface dataset:
Agile User-Centered Design Applied to a Mobile Multimedia Streaming Application
Authors: Zahid Hussain, Martin Lechner, Harald Milchrahm, Sara Shahzad, Wolfgang Slany, Martin Umgeher, Peter Wolkerstorfer
Venue: Proceedings of the 4th Symposium of the Workgroup Human-Computer Interaction and Usability Engineering of the Austrian Computer Society on HCI and Usability for Education and Work (2008)

Mobile computing is leading a revolution. Multimedia consumption on mobile devices is increasing day by day. The most important factor for the success of such applications is user acceptance. Additionally, the success of a software development project is associated not only with tools and technologies but also depends on how much the development process is both user-centered and developer-oriented. We are working on a project to develop a multimedia streaming application for mobile phones. The paper describes our adopted development process: the integration of Extreme Programming (XP) --- one of the popular agile methods --- with User-Centered Design (UCD) and shows how the integrated process facilitates user-orientation and at the same time preserves the social values of the development team. The paper also presents a summary of a recently carried out usability study.
Boosting Schema Matchers
Authors: Anan Marie, Avigdor Gal
Venue: Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems: (2008)

Schema matching is recognized to be one of the basic operations required by the process of data and schema integration, and thus has a great impact on its outcome. We propose a new approach to combining matchers into ensembles, called Schema Matcher Boosting (SMB). This approach is based on a well-known machine learning technique, called boosting. We present a boosting algorithm for schema matching with a unique ensembler feature, namely the ability to choose the matchers that participate in an ensemble. SMB introduces a new promise for schema matcher designers. Instead of trying to design a perfect schema matcher that is accurate for all schema pairs, a designer can focus on finding better than random schema matchers. We provide a thorough comparative empirical results where we show that SMB outperforms, on average, any individual matcher. In our experiments we have compared SMB with more than 30 other matchers over a real world data of 230 schemata and several ensembling approaches, including the Meta-Learner of LSD. Our empirical analysis shows that SMB improves, on average, over the performance of individual matchers. Moreover, SMB is shown to be consistently dominant, far beyond any other individual matcher. Finally, we observe that SMB performs better than the Meta-Learner in terms of precision, recall and F-Measure.
Configurable LDPC Decoder Architectures for Regular and Irregular Codes
Authors: Marjan Karkooti, Predrag Radosavljevic, Joseph R. Cavallaro
Venue: Journal of Signal Processing Systems (2008)

Low Density Parity Check (LDPC) codes are one of the best error correcting codes that enable the future generations of wireless devices to achieve higher data rates with excellent quality of service. This paper presents two novel flexible decoder architectures. The first one supports (3,6) regular codes of rate 1/2 that can be used for different block lengths. The second decoder is more general and supports both regular and irregular LDPC codes with twelve combinations of code lengths ¿¿648,1296,1944-bits and code rates-1/2,2/3,3/4,5/6- based on the IEEE 802.11n standard. All codes correspond to a block-structured parity check matrix, in which the sub-blocks are either a shifted identity matrix or a zero matrix. Prototype architectures for both LDPC decoders have been implemented and tested on a Xilinx field programmable gate array.
Comparative genome sequence analysis by efficient pattern matching technique
Authors: Muneer Ahmad, Hassan Mathkour
Venue: WSEAS Transactions on Information Science and Applications (2008)

Genetic Sequences of different species contain precious biological information. This information is hidden in the order of appearing nucleotide base characters (A-Adenine, T-Thymine, G-Guanine and C-Cytosine), this order is definitely variant in different organisms but one can conclude some of the similarities and differences in nature, habits and living of species by comparing the biological information contained in sequence. In this paper, we are presenting an algorithm that provides approximate comparative match between any input strands. It will overcome the draw backs and short comings in prevailing techniques. It becomes most difficult to find approximate match when Genome Adoptive Points (GAPS) are present in the input sequences, this algorithms tries to handle the complex situations and finds the number of approximate matches for optimal results.
Reflection on reflection in action: a case study of growers conception of irrigation strategies in pot plant production
Authors: Beatrix W. Alsanius, Klara L&#x00f6;fkvist, G&#x00f6;ran Kritz, Adrian Ratkic
Venue: AI Society (2008)

A case study of growers conception of irrigation strategies indicates that pot plant growers in Scandinavia base their management approaches on experientially based art. The study also indicates that there is a gap between experientially based art and available greenhouse technology. In order to standardize production and produce quality, both the grower&#x2019;s experience and available technology should be taken into account. In order to achieve this, the present study proposes to arrange reflection on reflection in action with a group of growers by means of the dialogue seminar method. The concept of reflection on reflection in action is novel to horticultural practice. Therefore, we suggest future inter- and multidisciplinary research within this domain.
Systolic Algorithms and Architectures for High-Throughput Processing Applications
Authors: Kung Yao, Flavio Lorenzelli
Venue: Journal of Signal Processing Systems (2008)

In this paper we survey a number of linear algebra algorithms that are used in many modern real-time high-throughput applications. We focus in particular on algorithms that are used in applications as diverse as adaptive filtering/beamforming, communications, signal/array processing, control, etc. We first consider least-squares estimation, QR decomposition, singular value decomposition, recursive least-squares estimation, and Kalman filtering algorithms. In particular, the QR decomposition which is used in least-squares solutions of linear system of equations, also forms one component of more complex algorithms such as Kalman filtering and the singular value decomposition. Systolic arrays, due to their modularity and regularity, are perfect matches for all the algorithms considered in this paper. All these problems are defined and described alongside the systolic algorithms and the architectures that implement them.
Execution context optimization for disk energy
Authors: Jerry Hom, Ulrich Kremer
Venue: Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems (2008)

Power, energy, and thermal concerns have constrained embedded systems designs. Computing capability and storage density have increased dramatically, enabling the emergence of handheld devices from special to general purpose computing. In many mobile systems, the disk is among the top energy consumers. Many previous optimizations for disk energy have assumed uniprogramming environments. However, many optimizations degrade in multiprogramming because programs are unaware of other programs (execution context). We introduce a framework to make programs aware of and adapt to their runtime execution context. We evaluated real workloads by collecting user activity traces and characterizing the execution contexts. The study confirms that many users run a limited number of programs concurrently. We applied execution context optimizations to eight programs and tested ten combinations. The programs ran concurrently while the disk's power was measured. Our measurement infrastructure allows interactive sessions to be scripted, recorded, and replayed to compare the optimizations' effects against the baseline. Our experiments covered two write cache policies. For write-through, energy savings was in the range 3-63% with an average of 21%. For write-back, energy savings was in the range -33-61% with an average of 8%. In all cases, our optimizations incurred less than 1% performance penalty.
Cognitive Processes Causing the Relationship between Aesthetics and Usability
Authors: Waltraud Ilmberger, Martin Schrepp, Theo Held
Venue: Proceedings of the 4th Symposium of the Workgroup Human-Computer Interaction and Usability Engineering of the Austrian Computer Society on HCI and Usability for Education and Work (2008)

We conducted an experiment to find out which cognitive processes underlie the high correlations between aesthetic impression and perceived usability of a user interface reported in several studies. Four online shops differing in colour scheme and usability level were created and tested before and after an interaction period to gain support for two differing models of explanation. One stems from Norman who hypothesizes that mood is a mediator between design and perceived usability whereas the other is based on the well known "What is beautiful is good" phenomenon from social psychology and market research. The data provide support for the approach of Norman whereas the high correlations couldn't be replicated. Another interesting finding was that our results militate rather for a "What is usable is beautiful"- relation than the other way round as hypothesized.
Finding groups in data: Cluster analysis with ants
Authors: Urszula Boryczka
Venue: Applied Soft Computing (2009)

We present in this paper a modification of Lumer and Faieta's algorithm for data clustering. This approach mimics the clustering behavior observed in real ant colonies. This algorithm discovers automatically clusters in numerical data without prior knowledge of possible number of clusters. In this paper we focus on ant-based clustering algorithms, a particular kind of a swarm intelligent system, and on the effects on the final clustering by using during the classification different metrics of dissimilarity: Euclidean, Cosine, and Gower measures. Clustering with swarm-based algorithms is emerging as an alternative to more conventional clustering methods, such as e.g. k-means, etc. Among the many bio-inspired techniques, ant clustering algorithms have received special attention, especially because they still require much investigation to improve performance, stability and other key features that would make such algorithms mature tools for data mining. As a case study, this paper focus on the behavior of clustering procedures in those new approaches. The proposed algorithm and its modifications are evaluated in a number of well-known benchmark datasets. Empirical results clearly show that ant-based clustering algorithms performs well when compared to another techniques.
An analytical algorithm with a wave age factor for altimeter wind speed retrieval
Authors: Yongcun Cheng, Qing Xu, Yuguang Liu, Hui Lin, Peng Xiu, Xiaobin Yin, Haibo Zong, Zengrui Rong
Venue: International Journal of Remote Sensing (2008)

Based on the specular reflection theory of electromagnetic waves at rough sea surface and the wind wave spectrum model with a wave age factor, the sea surface wind speeds are retrieved from the normalized radar backscatter cross-section (NRCS) measured by TOPEX/Poseidon (T/P) Ku-band altimeter using the mean square slope (MSS) calculated from the spectrum models of the wind waves and the gravity-capillary waves. A relationship between wave age and non-dimensional wave height is applied to compute the wave age factor using the significant wave height (SWH) and wind speeds obtained from buoy or altimeter simultaneously. The study indicates that the wave age factor has a significant impact on the retrieval of altimeter wind speed. Compared with the operational algorithm for retrieving altimeter wind speed, the wind speed retrieved from the new analytical algorithm based on the wind wave spectrum model with the wave age factor, proposed in this study, can match the buoy measurements better. The effects of the wave age factor on altimeter wind speed retrieval are also shown quantitatively through a series of experiments and measurements. The comparison with the operational algorithm indicates that both the bias and root mean square error (RMSE) between wind speeds retrieved by the proposed analytical algorithm and those observed by the buoy decrease significantly. In the Gulf of Mexico, with the new analytical algorithm, more accurate altimeter wind speeds are retrieved.
A new approach for fuzzy risk analysis based on similarity measures of generalized fuzzy numbers
Authors: Shih-Hua Wei, Shyi-Ming Chen
Venue: Expert Systems with Applications: An International Journal (2009)

In this paper, we present a new method for fuzzy risk analysis based on similarity measures between generalized fuzzy numbers. First, we present a new similarity measure between generalized fuzzy numbers. It combines the concepts of geometric distance, the perimeter and the height of generalized fuzzy numbers for calculating the degree of similarity between generalized fuzzy numbers. We also prove some properties of the proposed similarity measure. We make an experiment to use 15 sets of generalized fuzzy numbers to compare the experimental results of the proposed method with the existing similarity measures. The proposed method can overcome the drawbacks of the existing similarity measures. Based on the proposed similarity measure between generalized fuzzy numbers, we present a new fuzzy risk analysis algorithm for dealing with fuzzy risk analysis problems, where the values of the evaluating items are represented by generalized fuzzy numbers. The proposed method provides a useful way to deal with fuzzy risk analysis problems.
A Query Language for MOF Repository Systems
Authors: Ilia Petrov, Gabor Nemes
Venue: Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems: (2008)

Metadata repository systems manage metadata typically represented as models or meta-models. In order to facilitate repository application development a dedicated query language, addressing the specific capabilities of such systems is required. This paper introduces a declarative query language for querying OMG MOF-based metadata repository systems called mSQL (meta-SQL). Some of the key features of mSQL are: support for higher order queries and model independent querying, unified handling of repository data and metadata, quantification over repository model elements, SQL-alignment. Some of the areas where mSQL may be applied are: querying schematically disparate models in MOF repositories; metadata application development; generic browsing of complex meta-data data collections; and ultimately Model-Driven Development.
Parallell interacting MCMC for learning of topologies of graphical models
Authors: Jukka Corander, Magnus Ekdahl, Timo Koski
Venue: Data Mining and Knowledge Discovery (2008)

Automated statistical learning of graphical models from data has attained a considerable degree of interest in the machine learning and related literature. Many authors have discussed and/or demonstrated the need for consistent stochastic search methods that would not be as prone to yield locally optimal model structures as simple greedy methods. However, at the same time most of the stochastic search methods are based on a standard Metropolis---Hastings theory that necessitates the use of relatively simple random proposals and prevents the utilization of intelligent and efficient search operators. Here we derive an algorithm for learning topologies of graphical models from samples of a finite set of discrete variables by utilizing and further enhancing a recently introduced theory for non-reversible parallel interacting Markov chain Monte Carlo-style computation. In particular, we illustrate how the non-reversible approach allows for novel type of creativity in the design of search operators. Also, the parallel aspect of our method illustrates well the advantages of the adaptive nature of search operators to avoid trapping states in the vicinity of locally optimal network topologies.
Maximum entropy based significance of itemsets
Authors: Nikolaj Tatti
Venue: Knowledge and Information Systems (2008)

We consider the problem of defining the significance of an itemset. We say that the itemset is significant if we are surprised by its frequency when compared to the frequencies of its sub-itemsets. In other words, we estimate the frequency of the itemset from the frequencies of its sub-itemsets and compute the deviation between the real value and the estimate. For the estimation we use Maximum Entropy and for measuring the deviation we use Kullback&#x2013;Leibler divergence. A major advantage compared to the previous methods is that we are able to use richer models whereas the previous approaches only measure the deviation from the independence model. We show that our measure of significance goes to zero for derivable itemsets and that we can use the rank as a statistical test. Our empirical results demonstrate that for our real datasets the independence assumption is too strong but applying more flexible models leads to good results.
Designing context-aware multimodal virtual environments
Authors: Lode Vanacken, Joan De Boeck, Chris Raymaekers, Karin Coninx
Venue: Proceedings of the 10th international conference on Multimodal interfaces (2008)

Despite of decades of research, creating intuitive and easy to learn interfaces for 3D virtual environments (VE) is still not obvious, requiring VE specialists to define, implement and evaluate solutions in an iterative way, often using low-level programming code. Moreover, quite frequently the interaction with the virtual environment may also vary dependent on the context in which it is applied, such as the available hardware setup, user experience, or the pose of the user (e.g. sitting or standing). Lacking other tools, the context-awareness of an application is usually implemented in an ad-hoc manner, using low-level programming, as well. This may result in code that is difficult and expensive to maintain. One possible approach to facilitate the process of creating these highly interactive user interfaces is by adopting a model-based user interface design. This lifts the creation of a user interface to a higher level allowing the designer to reason more in terms of high-level concepts, rather than writing programming code. In this paper, we adopt a model-based user interface design (MBUID) process for the creation of VEs, and explain how a context system using an Event-Condition-Action paradigm is added. We illustrate our approach by means of a case study.
Interpretation of the relationship between skin temperature and vegetation fraction: Effect of subpixel soil temperature variability
Authors: Georgy V. Mostovoy, Valentine Anantharaj, Roger L. King, Marina G. Filippova
Venue: International Journal of Remote Sensing (2008)

Both land surface/skin temperature and vegetation indices data provided routinely and globally by NASA MODIS sensors at 1-km grid resolution represent an important piece of information assimilated into various environmental applications/models. Previous studies based on these and similar remotely data sets and on two-component pixel representation (accounting for pixel-aggregated vegetation and bare soil temperatures only) have shown a rather strong linear relationship between the pixel's skin temperature and the vegetation index/fraction. Deviations (Δ0) from this relationship are frequently used for soil moisture content estimates at a pixel scale. As the two-component pixel model does not account for subpixel heterogeneity (associated, for example, with bare soil temperature variability within the pixel), its role in controlling a magnitude of Δ0 has been examined. A simple tri-component pixel model describing vegetation and wet and dry bare soil temperatures was suggested to analyse an impact of this heterogeneity on Δ0 estimates. This model was considered to provide a 'true' estimate of Δ0 as compared with Δ0 evaluated from the two-component pixel model. A comparison between the models shows that a substantial underestimation of Δ0 was likely to occur at a level of individual pixels when the two-component approach was applied for interpretation of the observed relationship between the skin temperature and the vegetation index. Depending on the fraction of pixel occupied by the dry soil, this underestimation might be as much as 100%.
OLSR vs DSR: A comparative analysis of proactive and reactive mechanisms from an energetic point of view in wireless ad hoc networks
Authors: Floriano De Rango, Juan-Carlos Cano, Marco Fotino, Carlos Calafate, Pietro Manzoni, Salvatore Marano
Venue: Computer Communications (2008)

Untethered nodes in mobile ad hoc networks strongly depend on the efficient use of their batteries. Despite the fact that devices are getting smaller and more powerful, advances in battery technology have not yet reached the stage where devices can autonomously operate for days. At the network layer, routing protocols may balance power consumption at nodes according to their routing decisions. In this paper, an in-depth performance comparison of the DSR (Dynamic Source Routing) and the OLSR (Optimized Link State Routing) is presented in terms of energy consumption. Using the ns-2 simulator an evaluation is made of how the different approaches affect the energy use of mobile devices. It was found that a reactive protocol takes advantage of its routing policy when the traffic load is low. However, at higher traffic rates, a proactive routing protocol can perform better with an appropriate refresh parameter. Also, it is demonstrated that independently of the routing protocol selected, the overhearing activity can seriously affect performance. To the best of our knowledge, this is the first simulation study addressing the power saving issue to extensively compare the DSR and OLSR protocols under a wide variety of networking scenarios.