ppxscal/embedding_network huggingface dataset:
Digital Design Mobile Virtual Laboratory Implementation: A Pragmatic Approach
Authors: Vlado Glavinic, Mihael Kukec, Sandi Ljubic
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

The omnipresence of m-devices, and especially those of the cellular phones type, certainly makes the basis for the introduction and use of m-learning systems, but their implementation heavily depends on the area to be covered hence showing a different degree of complexity. This especially holds for the area of digital design, where there is the need for handling logic schemes which includes both displaying and modifying them in addition to the usual imaging of text and graphics. In this paper we discuss essential HCI issues, which are related to the implementation of a Mobile Virtual Laboratory for digital logic design. We make use of a pragmatic approach by blending a number of interaction methods known from other application fields hopefully providing a holistic effect in the process of learning and teaching in the mobile.
A Feature-Based Digital Image Watermarking Algorithm Resisting to Geometrical Attacks
Authors: Tang Wenliang
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

For many kings of watermarking in digital image, geometric attackers are their weakness. In this paper, we present a new digital watermarking algorithm based on special area invariability of image, the experimental result show that the algorithm is transparent, and it not only can well resist such geometrical attacks as translation and rotation, but also has strong robust to the common image processing, such as smoothing, sharpening, addictive noise and JPEG compression etc.
Cryptoanalysis and Improvements of Cross-Realm C2C-PAKE Protocol
Authors: Ding XiaoFei, Ma ChuanGui
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Most existing cross-realm client-to-client password authenticated key exchange (C2C-PAKE) protocols can not resist password-compromise impersonation (PCI) attack. This paper gives a method of resisting this attack and proposes an improved cross-realm C2C-PAKE protocol based on EC2C-PAKA protocol[1]. The novel protocol can hold all security characteristics of the original protocol and resist PCI attack. Then this paper proves that the improved protocol is forward secrecy under the Diffie-Hellman assumption in the random oracle and ideal cipher models. Finally, through evaluating the efficiency and security of the novel protocol, the improved protocol not only has stronger security, but also is more efficient.
A Flexible, Low Noise Reflective PPG Sensor Platform for Ear-Worn Heart Rate Monitoring
Authors: James A. C. Patterson, Douglas C. McIlwraith, Guang-Zhong Yang
Venue: Proceedings of the 2009 Sixth International Workshop on Wearable and Implantable Body Sensor Networks (2009)

This paper presents a novel ear-worn reflective photoplethysmography (PPG) sensor that addresses the mechanical complexities of coupling the sensor to the surface of the skin and a detection circuit that minimises ambient noise artefacts. The flexible optoelectronic transducer structure can adapt to a variety of skin surface contours. Light emitting diode (LED) modulation and a unique integrating photocurrent demodulator reduce susceptibility to wideband noise and allow subtraction of ambient light from the desired PPG signal. Experimental results demonstrate that the sensitivity is robust to sensor location and application pressure variations. Simulations also show that the photodetection method is resilient against high levels of wideband noise.
Measurement Based P2P Streaming Media System Topology Analysis
Authors: Chunxi Li, Juan Li, Qing Ye, Yishuan Chen, Changjia Chen
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Snapshot is usually applied in p2p network topology analysis. In this paper, we develop the topology crawler software to probe the PPLive application. Based on the measured trace, we characterize the PPLive topology with metrics including degree distribution, clustering coefficient, network diameter, characteristic path length, connectivity matrix and reciprocity coefficient. In additional, we also use visualization methods (BOSAM and pajek) to analyzing the network. We compare the characteristics of PPLive with that of Gnutella, UUSee, and ER random network.
Multimedia learning: Cognitive individual differences and display design techniques predict transfer learning with multimedia learning modules
Authors: Katherine A. Austin
Venue: Computers Education (2009)

In the wake of the information explosion and rapidly progressing technology [Mayer, R. E. (2001). Multimedia learning. Cambridge: University Press] formulated a theory that focused on human cognition, rather than technology capacity and features. By measuring the effect of cognitive individual differences and display design manipulations on performance, the current research evaluates the impact of multimedia combinations on college student transfer test performance. Results indicated that multimedia combination accounted for variance in transfer test scores beyond the impact of relevant cognitive individual differences. Findings demonstrated that text positioning and motion distraction accounted for the inferiority of transfer test performance in certain multimedia conditions. Research yields support for the notion that display design can split attention, increase cognitive load, and reduce transfer learning. Key design principles must be evaluated further before prescriptive guidelines for educational multimedia can be solidified.
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution
Authors: Luca Trevisan, Madhur Tulsiani, Salil Vadhan
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

We show that every bounded function g: {0,1}^n -> [0,1] admits an efficiently computable "simulator" function h: {0,1}^n->[0,1] such that every fixed polynomial size circuit has approximately the same correlation with g as with h. If g describes (up to scaling) a high min-entropy distribution D, then h can be used to efficiently sample a distribution D' of the same min-entropy that is indistinguishable from D by circuits of fixed polynomial size. We state and prove our result in a more abstract setting, in which we allow arbitrary finite domains instead of {0,1}^n, and arbitrary families of distinguishers, instead of fixed polynomial size circuits. Our result implies (a) the Weak Szemeredi Regularity Lemma of Frieze and Kannan (b) a constructive version of the Dense Model Theorem of Green, Tao and Ziegler with better quantitative parameters (polynomial rather than exponential in the distinguishing probability), and (c) the Impagliazzo Hardcore Set Lemma. It appears to be the general result underlying the known connections between "regularity" results in graph theory, "decomposition" results in additive combinatorics, and the Hardcore Lemma in complexity theory. We present two proofs of our result, one in the spirit of Nisan's proof of the Hardcore Lemma via duality of linear programming, and one similar to Impagliazzo's "boosting" proof. A third proof by iterative partitioning, which gives the complexity of the sampler to be exponential in the distinguishing probability, is also implicit in the Green-Tao-Ziegler proofs of the Dense Model Theorem.
Stability analysis for stochastic BAM neural networks with Markovian jumping parameters
Authors: Guanjun Wang, Jinde Cao, Ming Xu
Venue: Neurocomputing (2009)

This paper is concerned with the stability analysis issue for stochastic delayed bidirectional associative memory (BAM) neural network with Markovian jumping parameters. Assume that the jumping parameters are generated from continue-time discrete-state homogeneous Markov process and the delays are time-invariant. By employing the Lyapunov stability theory, some inequality techniques and the stochastic analysis, sufficient conditions are derived to achieve the global exponential stability in the mean square of the stochastic BAM neural network. One example is also provided in the end of this paper to illustrate the effectiveness of our results.
HOL Light: An Overview
Authors: John Harrison
Venue: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (2009)

HOL Light is an interactive proof assistant for classical higher-order logic, intended as a clean and simplified version of Mike Gordon's original HOL system. Theorem provers in this family use a version of ML as both the implementation and interaction language; in HOL Light's case this is Objective CAML (OCaml). Thanks to its adherence to the so-called `LCF approach', the system can be extended with new inference rules without compromising soundness. While retaining this reliability and programmability from earlier HOL systems, HOL Light is distinguished by its clean and simple design and extremely small logical kernel. Despite this, it provides powerful proof tools and has been applied to some non-trivial tasks in the formalization of mathematics and industrial formal verification.
A Measure of the Number of True Analogies between Chunks in Japanese
Authors: Yves Lepage, Julien Migeot, Erwan Guillerm
Venue: Human Language Technology. Challenges of the Information Society: Third Language and Technology Conference, LTC 2007, Poznan, Poland, October 5-7, 2007, Revised Selected Papers (2009)

This study relates to the assessment of the argument of the poverty of the stimulus in that we conducted a measure of the number of true proportional analogies between chunks in a language with case markers, Japanese. On a bicorpus of 20,000 sentences, we show that at least 96% of the analogies of form between chunks are also analogies of meaning, thus reporting the presence of at least two million true analogies between chunks in this corpus. As the number of analogies between chunks overwhelmingly surpasses the number of analogies between sentences by three orders of magnitude for this size of corpora, we conclude that proportional analogy is an efficient and undeniable structuring device between Japanese chunks.
A Follow-Up Reflection on Software Process Improvement ROI
Authors: Rini van Solingen
Venue: IEEE Software (2009)

The software engineering discipline's continuing growth urges a shift toward value-based software engineering, to prove its contributions to the bottom line. However, the number of studies containing return-on-investment (ROI) data on software process improvement (SPI) hasn't grown much in the five years following the 2004 IEEE Software article "Measuring the ROI of Software Process Improvement." Because software engineering is so strongly related to the success and failure of business, we must find a way to measure value. The adoption of Six Sigma might just be the catalyst needed for the software engineering discipline. Software companies that embrace Six Sigma to structure their improvements will outclass competitors because of their skill in having their improvement efforts contribute directly to the financial bottom line.
Construction of Text Corpus of Polish Using the Internet
Authors: Sławomir Kulików
Venue: Human Language Technology. Challenges of the Information Society: Third Language and Technology Conference, LTC 2007, Poznan, Poland, October 5-7, 2007, Revised Selected Papers (2009)

This paper describes a system, which is used to construct a corpus of Polish. It works in the same way as Internet search engines. The corpus contains Polish texts downloaded from the Internet, which are supplemented with results of linguistic analysis (morphological, syntactic and semantic). Results of statistical research based on data in the corpus are also presented. The corpus is used to test and improve linguistic analyzer developed at Silesian University of Technology.
The e-Axle and Its Application to a Floating Windmill
Authors: Sanza Kazadi, Chan-Hee Koh, Kevin Kim, Kyle Jung, Brian Kim, Hubert Wang
Venue: Proceedings of the Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008 (2008)

We describe and analyze a magnetic bearing built using a permanent magnet assembly. The magnetic bearing comprises a conical female magnet assembly and a rotationally symmetric identically polarized male piece. The opposition of the two parts produces a force between them which tends to hold them apart and aligned along an axis of symmetry. We describe the bearing and its use in generating an $\epsilon-$axle, or an axle having a friction of some $\epsilon>0$. Finally, we integrate this $\epsilon-$axle into a windmill design in which a single point of contact exists on the main axle.
LDPC Coded Modulations, 1st edition
Authors: Michele Franceschini, Gianluigi Ferrari, Riccardo Raheli
Venue:  (2009)

This book focuses on the analysis and design of low-density parity-check (LDPC)-coded modulations, which are becoming part of several current and future communication systems, such as high-throughput terrestrial and satellite wireless networks. In this book, a two-sided perspective on the design of LDPC-coded systems is proposed, encompassing both code/modulation optimization (transmitter side) and detection algorithm design (receiver side). After introducing key concepts on error control coding, in particular LDPC coding, and detection techniques, the book presents several relevant applications.More precisely, by using advanced performance evaluation techniques, such as extrinsic information transfer charts, the optimization of coded modulation schemes are considered for: memoryless channels; dispersive and partial response channels; and, concatenated systems including differential encoding. This book is designed to be used by graduate students working in the field of communication theory, with particular emphasis on LDPC-coded communication schemes, and industry experts working on related fields.
Machine learning in digital games: a survey
Authors: Leo Galway, Darryl Charles, Michaela Black
Venue: Artificial Intelligence Review (2008)

Artificial intelligence for digital games constitutes the implementation of a set of algorithms and techniques from both traditional and modern artificial intelligence in order to provide solutions to a range of game dependent problems. However, the majority of current approaches lead to predefined, static and predictable game agent responses, with no ability to adjust during game-play to the behaviour or playing style of the player. Machine learning techniques provide a way to improve the behavioural dynamics of computer controlled game agents by facilitating the automated generation and selection of behaviours, thus enhancing the capabilities of digital game artificial intelligence and providing the opportunity to create more engaging and entertaining game-play experiences. This paper provides a survey of the current state of academic machine learning research for digital game environments, with respect to the use of techniques from neural networks, evolutionary computation and reinforcement learning for game agent control.
A morphological analyzer for akkadian verbal forms with a model of phonetic transformations
Authors: François Barthélemy
Venue: Proceedings of the Workshop on Computational Approaches to Semitic Languages (1998)

The paper describes a first attempt to design a morphological analyzer for Akkadian verbal forms. Akkadian is a semitic dead language which was used in the ancient Mesopotamia. The analyzer described has two levels: the first one is a deterministic and unique paradigm that describes the flexion of Akkadian verbs. The second level is a non deterministic rewriting system which describes possible phonetic transformations of the forms. The results obtained so far are encouraging.
Model and Algorithms for Emergency Service Facility Location Problem
Authors: Li Dawei, Li Yanjie, Wang Li
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

In recent years, contingencies occur frequently all over the world. Emergency management of contingencies has become one of the hottest research fields. At first, this paper sets up model for emergency service facility location problem, which is based on the greatest time satisfaction. Then, a hybrid solving strategy according to the model characters, is proposed based on particle swarm optimization. Experiment results of the actual data show that hybrid particle swarm optimization is superior to greedy algorithm.
On multivariate order statistics. Application to ranked set sampling
Authors: Barry C. Arnold, Enrique Castillo, José María Sarabia
Venue: Computational Statistics Data Analysis (2009)

Two new concepts of order statistics for multivariate samples are introduced. In one of the versions it turns out that not every multivariate order statistic is present in every sample. These order statistics have application in multivariate ranked set sampling and can be used to generate broad classes of multivariate densities in the sense of Jones. In this case the likelihood for the sample values and their corresponding ranks can be calculated based on the conditional density of a multivariate order statistics given its sample value, and such that its integral gives the probability for the multivariate order statistics under discussion to be observed. An alternative version of multivariate order statistics is also introduced, for which multivariate order statistics are always well defined and expressions for their marginal densities are derived. Since these multivariate order statistics are tailor made for multivariate ranked set sampling, their densities allow for parameter inference based on ranked set sampling. Some simulations show that both multivariate order statistics densities can be used with advantage with respect to simple random sampling.
An inversion algorithm for a banded matrix
Authors: Rui-Sheng Ran, Ting-Zhu Huang
Venue: Computers Mathematics with Applications (2009)

In this paper, an inversion algorithm for a banded matrix is presented. The n twisted decompositions of a banded matrix are given first; then the inverse of the matrix is obtained, one column at time. The method is about two times faster than the standard method based on the LU decomposition, as is shown with the analysis of computing complexity and the numerical experiments.
Research on Intellectual Prediction for Permeability Index of Blast Furnace
Authors: Liang Dong, Bai Chen-guang, Shi Hong-yan, Dong Jie-ji
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

Permeability index of BF is an important monitoring parameter in operation. Proper trend prediction of the permeability index is vital for a good operator. Support Vector Machines combined with the Wavelet Analysis is adopted to build the forecasting model. Four historic values of permeability index are decomposed by Wavelet via seven levels, based on eight Wavelet decomposition combined with operational parameters, using Least Square Support Vector Machines method (LS-SVM), eight sub-models are buil. Predicting component are reconstructed to gain the forecast. The detail of modeling, validation and results analysis are presented.
Gestures all around us: user differences in social acceptability perceptions of gesture based interfaces
Authors: Julie Rico, Stephen Brewster
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Gesture based interfaces provide a new way for us to interact with mobile devices, but also require us to make new decisions about how we feel about this new technology and which gestures we decide are usable and appropriate. These decisions are based on the social and public settings where these devices are used on a daily basis. Our ideas about which gestures are socially acceptable or not are an important factor in whether or not these gestures will be adopted. The ways in which users evaluate social acceptability is not only highly variable, but with drastically different results amongst different users. These differences are not dependant on factors such as age, gender, occupation, geographic location, or previous technology usage. Future work into the social acceptability perceptions of users will focus on personality traits as a new way of understanding how social acceptability is determined.
Exploring content models for multi-document summarization
Authors: Aria Haghighi, Lucy Vanderwende
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

We present an exploration of generative probabilistic models for multi-document summarization. Beginning with a simple word frequency based model (Nenkova and Vanderwende, 2005), we construct a sequence of models each injecting more structure into the representation of document set content and exhibiting ROUGE gains along the way. Our final model, HierSum, utilizes a hierarchical LDA-style model (Blei et al., 2004) to represent content specificity as a hierarchy of topic vocabulary distributions. At the task of producing generic DUC-style summaries, HierSum yields state-of-the-art ROUGE performance and in pairwise user evaluation strongly outperforms Toutanova et al. (2007)'s state-of-the-art discriminative system. We also explore HierSum's capacity to produce multiple 'topical summaries' in order to facilitate content discovery and navigation.
Probabilistic partial evaluation: exploiting rule structure in probabilistic inference
Authors: David Poole
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Bayesian belief networks have grown to prominence because they provide compact representations of many domains, and there are algorithms to exploit this compactness. The next step is to allow compact representations of the conditional probability tables of a variable given its parents. In this paper we present such a representation in terms of parent contexts and provide an algorithm that exploits this compactness. The representation is in terms of rules that provide conditional probabilities in different contexts. The algorithm is based on eliminating the variables not needed in an answer in turn. The operations for eliminating a variable correspond to a form of partial evaluation, where we are careful to maintain the probabilistic dependencies necessary for correct probabilistic inference. We show how this new method can exploit more structure than previous methods for structured belief network inference.
A Study of Collaboration and Conflicts Using Multi-robots
Authors: Wu-Yuin Hwang, Sheng-Yi Wu, Chien-Ming Chen, Yung-Hsun Hsieh
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

Learning how to collaborate with limited resources was the key point for elementary students' social interaction and emotion development. This study designed a system of Multi-robots, allowing students to control robots to do dice moving by varied methods and discussing the process of collaboration and conflicts. From the study, conflict was not avoidable. Therefore, what we should do was not only to guide students the way to avoid conflicts but also to help them learning to face conflicts and to communicate with other people. Learners had to coordinate and find the way to avoid conflicts, improving efficiency of completing the task of collaboration. It was an important skill during students' socialization.