ppxscal/embedding_network huggingface dataset:
Exploiting maximal redundancy to optimize SQL queries
Authors: Bin Cao, Antonio Badia
Venue: Knowledge and Information Systems (2009)

Detecting and dealing with redundancy is an ubiquitous problem in query optimization, which manifests itself in many areas of research such as materialized views, multi-query optimization, and query-containment algorithms. In this paper, we focus on the issue of intra-query redundancy, redundancy present within a query. We present a method to detect the maximal redundancy present between a main (outer) query block and a subquery block. We then use the method for query optimization, introducing query plans and a new operator that take full advantage of the redundancy discovered. Our approach can deal with redundancy in a wider spectrum of queries than existing techniques. We show experimental evidence that our approach works under certain conditions, and compares favorably to existing optimization techniques when applicable.
Revisiting the IDEA Philosophy
Authors: Pascal Junod, Marco Macchetti
Venue: Fast Software Encryption: 16th International Workshop, FSE 2009 Leuven, Belgium, February 22-25, 2009 Revised Selected Papers (2009)

Since almost two decades, the block cipher IDEA has resisted an exceptional number of cryptanalysis attempts. At the time of writing, the best published attack works against 6 out of the 8.5 rounds (in the non-related-key attacks model), employs almost the whole codebook, and improves the complexity of an exhaustive key search by a factor of only two. In a parallel way, Lipmaa demonstrated that IDEA can benefit from SIMD (Single Instruction, Multiple Data) instructions on high-end CPUs, resulting in very fast implementations. The aim of this paper is two-fold: first, we describe a parallel, time-constant implementation of eight instances of IDEA able to encrypt in counter mode at a speed of 5.42 cycles/byte on an Intel Core2 processor. This is comparable to the fastest stream ciphers and notably faster than the best known implementations of most block ciphers on the same processor. Second, we propose the design of a new block cipher, named WIDEA, leveraging on IDEA's outstanding security-performance ratio. We furthermore propose a new key-schedule algorithm in replacement of completely linear IDEA's one, and we show that it is possible to build a compression function able to process data at a speed of 5.98 cycles/byte. A significant property of WIDEA is that it closely follows the security rationales defined by Lai and Massey in 1990, hence inheriting all the cryptanalysis done the past 15 years in a very natural way.
Challenges for User Centered Smart Environments
Authors: Fabian Hermann, Roland Blach, Doris Janssen, Thorsten Klein, Andreas Schuller, Dieter Spath
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

Future smart environments integrate information on persons, ambient resources and objects. Many rich visions of smart environments have been developed, and current technological and market developments promise to bring aspects of these visions of into everyday life. The paper delineates the role of mobile and decentralized communities, semantic technologies, and virtual reality. Key challenges for a user centered development of smart environments are discussed, in particular the controllability of personal identity data, reliable user interfaces for autonomous systems, and seamless interaction in integrated virtual and physical environments.
CRF-OPT: an efficient high-quality conditional random field solver
Authors: Minmin Chen, Yixin Chen, Michael R. Brent
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Conditional random field (CRF) is a popular graphical model for sequence labeling. The flexibility of CRF poses significant computational challenges for training. Using existing optimization packages often leads to long training time and unsatisfactory results. In this paper, we develop CRFOPT, a general CRF training package, to improve the efficiency and quality for training CRFs. We propose two improved versions of the forward-backward algorithm that exploit redundancy and reduce the time by several orders of magnitudes. Further, we propose an exponential transformation that enforces sufficient step sizes for quasi-Newton methods. The technique improves the convergence quality, leading to better training results. We evaluate CRF-OPT on a gene prediction task on pathogenic DNA sequences, and show that it is faster and achieves better prediction accuracy than both the HMM models and the original CRF model without exponential transformation.
On Efficiency of Adaptation Algorithms for Mobile Interfaces Navigation
Authors: Vlado Glavinic, Sandi Ljubic, Mihael Kukec
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

Many ubiquitous computing systems and applications, including mobile learning ones, can make use of personalization procedures in order to support and improve universal usability. In our previous work, we have created a GUI menu model for mobile device applications, where personalization capabilities are primarily derived from the use of adaptable and adaptive techniques. In this paper we analyze from a theoretical point of view the efficiency of the two adaptation approaches and related algorithms. A task simulation framework has been developed for comparison of static and automatically adapted menus in the mobile application environment. Algorithm functionality is evaluated according to adaptivity effects provided in various menu configurations and within several classes of randomly generated navigation tasks. Simulation results thus obtained support the usage of adaptivity, which provides a valuable improvement in navigation efficiency within menu-based mobile interfaces.
Source models for speech traffic revisited
Authors: Michael Menth, Andreas Binzenhöfer, Stefan Mühleck
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

In this paper, we analyze packet traces of widely used voice codecs and present analytical source models which describe their output by stochastic processes. Both the G.711 and the G.729.1 codec yield periodic packet streams with a fixed packet size, the G.723.1 as well as the iLBC codec use silence detection leading to an on/off process, and the GSM AMR and the iSAC codec produce periodic packet streams with variable packet sizes. We apply all codecs to a large set of typical speech samples and analyze the output of the codecs statistically. Based on these evaluations we provide quantitative models using standard and modified on/off processes as well as memory Markov chains. Our models are simple and easy to use. They are in good accordance with the original traces as they capture not only the complementary cumulative distribution function (CCDF) of the on/off phase durations and the packet sizes, but also the autocorrelation function (ACF) of consecutive packet sizes as well as the queueing properties of the original traces. In contrast, voice traffic models used in most of today's simulations or analytical studies fail to reproduce the ACF and the queueing properties of original traces. This possibly leads to underestimation of performance measures like the waiting time or loss probabilities. The models proposed in this paper do not suffer from this shortcoming and present an attractive alternative for use in future performance studies.
Joint Source-Channel-Network Decoding and Blind Estimation of Correlated Sensors Using Concatenated Zigzag Codes
Authors: Javier Ser, Mikel Mendicute, Pedro M. Crespo, Sergio Gil-Lopez, Ignacio (Iñaki) Olabarrieta
Venue: Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks (2009)

Focusing on densely deployed wireless sensor networks, this paper presents a novel method for joint source-channel-network coding of distributed correlated sources through multiple access relay channels. In such networks, the role of intermediate sensors as relay nodes permits to achieve enhanced end-to-end error performance and increased spatial diversity in presence of channel fading. This paper addresses this scenario for a two source, single relay architecture by proposing a novel coding approach based on concatenated Zigzag codes, whose low complexity is specially suitable for energy-constrained autonomous systems. Joint decoding and estimation of the parameters defining the correlation between sensors is iteratively performed at the receiver side. Simulation results show that the proposed joint coding scheme attains significant energy gains with respect to traditional routing techniques, specially at high signal to noise ratios.
Iterative methods of order four and five for systems of nonlinear equations
Authors: Alicia Cordero, Eulalia Martínez, Juan R. Torregrosa
Venue: Journal of Computational and Applied Mathematics (2009)

The Adomian decomposition is used in order to obtain a family of methods to solve systems of nonlinear equations. The order of convergence of these methods is proved to be p>=2, under the same conditions as the classical Newton method. Also, numerical examples will confirm the theoretical results.
Safety Design of Median Barriers Impacted on Elevated Road
Authors: Zhong Wu, Fengru Yu, Li Yuan
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Most median barriers on urban elevated road are often adopted concrete blocks. The blocks are laid on the elevated road surface only by deadweight. As they are in defect of sustentation and concatenation, the blocks are probably exculpated, overturned or shifted when vehicle collision accidents occurred. The vehicle out of control may crash the median barriers and enter the opposite lanes, blocking bidirectional lanes. At the same time, the motion state of the vehicle will suddenly change, like whipping, rebounding and obtaining bigger acceleration, which will lead to traffic accident.Such barriers not only lose the function of protect vehicles and lead to traffic crash. Based on LS-DYNA calculating platform, the paper established car-barriers collision model and designed a new type of median barrier model with joints between concrete blocks, which is safer and has effective protection function. The simulating results indicate that the new barriers can still protect the traffic safety under the condition that the mass of car is 2t, the impact velocity is 60 km/h and the impingement angle is 20°, and the traffic safety of urban elevated road is improved.
An Item-based Collaborative Filtering Recommendation Algorithm Using Slope One Scheme Smoothing
Authors: DeJia Zhang
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

Collaborative filtering is one of the most important technologies in electronic commerce. With the development of recommender systems, the magnitudes of users and items grow rapidly, resulted in the extreme sparsity of user rating data set. Traditional similarity measure methods work poor in this situation, make the quality of recommendation system decreased dramatically. Poor quality is one major challenge in collaborative filtering recommender systems. Sparsity of users’ ratings is the major reason causing the poor quality.To address this issue, an item-based collaborative filtering recommendation algorithm using slope one scheme smoothing is presented. This approach predicts item ratings that users have not rated by the employ of slope one scheme, and then uses Pearson correlation similarity measurement to find the target items’ neighbors, lastly produces the recommendations. The experiments are made on a common data set using different recommender algorithms. The results show that the proposed approach can improve the accuracy of the collaborative filtering recommender system.
Municipal wireless broadband: Lessons from San Francisco and Silicon Valley
Authors: Heather E. Hudson
Venue: Telematics and Informatics (2010)

In December 2005, the city of San Francisco issued a request for proposal (RFP) for a community wireless broadband network. This initiative received significant national and even international attention, largely because of San Francisco's visibility in the high tech world, and the involvement of Google in the consortium selected to build and operate the network. However, the project died without any network being built. In the past year, several other US municipal wireless initiatives have floundered or died. This article analyzes municipal broadband through a case study of the San Francisco's project, examines the reasons for its demise, and compares San Francisco's approach with other models for municipal wireless adopted by nearby Silicon Valley communities. It concludes with lessons and unresolved issues from the San Francisco experience and neighboring projects relevant for other municipal broadband initiatives and for broadband community access in general.
Application of Multi-objective Optimized Methods in the Load Allocation of Hydraulic Unit
Authors: Li-ying Wang, Wei-guo Zhao
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Stratified Genetic algorithm was used in the optimized calculation of Wanjiazhai Hydropower Station, a multi-objective optimized model was established , two sub-populations of independent parallel were used to compute, the calculated values of network model and test values were compared, results showed that the two values are matched, the value of optimized load pressure fluctuation deviates from the average in 3mH2O ,the actual power flow is also less ,it is propitious to improve economic efficiency of the Hydropower station.
Cognitive and Emotional Characteristics of Communication in Human-Human/Human-Agent Interaction
Authors: Yugo Hayashi, Kazuhisa Miwa
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

A psychological experiment was conducted to capture the nature of Human-Human and Human-Agent Interactions where humans and computer agents coexist in a collaborative environment. Two factors were manipulated to investigate the influences of the 'schema' about and the 'actual partner' on the characteristics of communication. The first factor, expectation about the partner, was controlled by the experimenter's instruction, manipulating with which partner (human or computer agent) participants believed to be collaborating. The second factor, the actual partner, was controlled by manipulating with which partner (human or computer agent) participants actually collaborated. The results of the experiments suggest that the degree of the refinement of the conversation controlled as the actual partner factor affected the emotional and cognitive characteristics of communication; however the schema about the opponent only affected the emotional characteristics of communication.
Proceedings of the Workshop on Computational Approaches to Arabic Script-based Languages
Venue: ACL Workshops (2004)

Recently, there has been a surge of interest in the study of the languages of the Middle East, especially Arabic, Persian (Farsi), Pashto, Kurdish and Urdu. This sudden and urgent interest is manifested by the availability of funding for rapid development of practical systems for processing large volumes of data in these languages. Computational applications for proper name identification, entity recognition, categorization, information retrieval, summarization, machine translation and other implementations are currently in high demand. This comes at a time when advances in formal and computational linguistics over the last fifty years are being consolidated, while work on machine learning and statistical methods has been showing great promise. There exists a considerable body of work in computational linguistics specifically targeted to these middle eastern languages. Much of the research and development has been the result of initiatives by individual research establishments or industry firms. Furthermore, the usage of the Arabic script gives rise to certain issues that are common to all these languages despite their being of distinct language families. Hence, these languages share properties such as the absence of capitalization, right to left direction, lack of clear word boundaries, complex word structure, a high degree of ambiguity due to non-representation of short vowels in the writing system, and related encoding issues.
A Selection Problem for Management Based on Divide and Conquer Algorithm
Authors: Xiaohui Wang, Yong Zhang, Hongyan Zhao
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Selection problem, which is to find the k th smallest element in a sequence of n numbers in arbitrary order, is a typical problem in algorithm design and analysis. The select problem is solved by divide and conquer algorithm. The general algorithm is given, and the complexity of this algorithm is analyzed and discussed. The Divide and Conquer algorithms are related to backfitting and Markov chain Monte Carlo techniques, which divide the problem in a divide and conquer strategy into smaller pieces. Confidence intervals taking model uncertainty into account are based on the bootstrap in combination with MCMC techniques.
Oracle GeoRaster Image Data Visualization with OCCI
Authors: Wu Baiyan, Wang Wei, Du Daosheng, Li Qing
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Our paper has studied the Oracle spatial GeoRaster feature and the OCCI programming environment with OTT. Using the above knowledges, this paper has implemented the GeoRaster image visualization in VisualC++6.0 based on data blocking and pyramid structure.
Gauss-Green cubature and moment computation over arbitrary geometries
Authors: Alvise Sommariva, Marco Vianello
Venue: Journal of Computational and Applied Mathematics (2009)

We have implemented in Matlab a Gauss-like cubature formula over arbitrary bivariate domains with a piecewise regular boundary, which is tracked by splines of maximum degree p (spline curvilinear polygons). The formula is exact for polynomials of degree at most 2n-1 using N~cmn^2 nodes, 1@?c@?p, m being the total number of points given on the boundary. It does not need any decomposition of the domain, but relies directly on univariate Gauss-Legendre quadrature via Green's integral formula. Several numerical tests are presented, including computation of standard as well as orthogonal moments over a nonstandard planar region.
Discourse-level annotation for investigating information structure
Authors: Ivana Kruijff-Korbayová, Geert-Jan M. Kruijff
Venue: Proceedings of the 2004 ACL Workshop on Discourse Annotation (2004)

We present discourse-level annotation of newspaper texts in German and English, as part of an ongoing project aimed at investigating information structure from a cross-linguistic perspective. Rather than annotating some specific notion of information structure, we propose a theory-neutral annotation of basic features at the levels of syntax, prosody and discourse, using treebank data as a starting point. Our discourse-level annotation scheme covers properties of discourse referents (e.g., semantic sort, delimitation, quantification, familiarity status) and anaphoric links (coreference and bridging). We illustrate what investigations this data serves and discuss some integration issues involved in combining different levels of stand-off annotations, created by using different tools.
Characterisation of a coding/reconstruction algorithm on MRI simulated noisy data
Authors: Giuseppe Placidi, Danilo Franchi, Alfredo Maurizi
Venue: Proceedings of the 2009 IEEE International Workshop on Medical Measurements and Applications (2009)

In Magnetic Resonance Imaging (MRI), the presence of static magnetic field in-homogeneities introduces distortions and artifacts in the images. A coding/reconstruction algorithm for MRI, based on the assignment of different time varying frequencies (accelerations) to different spatial positions, has been tested on simulated noisy data. Results, demonstrating the method is not conditioned neither by the presence of static magnetic field in-homogeneity nor by the presence of noise, are reported. In particular, the results demonstrated that noise was not incremented and the signal was unaffected by blurring or distortions.
Investigation on Relation between Index of Difficulty in Fitts' Law and Device Screen Sizes
Authors: Hidehiko Okada, Takayuki Akiba, Ryosuke Fujioka
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

It is well-known as Fitts' law that the time for a user to point a target on a GUI screen can be modeled as a linear function of "index of difficulty (ID)". The authors investigate whether the ID formulation is appropriate independently of device screen sizes. Result of our experiment revealed that the ID formulation may not consistently capture actual difficulty: users' pointing performances were not consistent among pointing target variations of which index of difficulty are consistent. The term A/W may not be appropriate because the term causes the observed inconsistency.
Online Platform Support for Sustained, Collaborative and Self-directed Engagement of Teachers in a Blended Professional Development Program
Authors: Thomas Osburg, Albena Todorova
Venue: Proceedings of the 8th International Conference on Advances in Web Based Learning (2009)

Professional development of teachers plays a significant role for the success of educational reforms and for student achievement. Programs for developing teachers' skills to integrate digital media in the classroom have received increased attention, due to the role of technology in today's world. Recent research and field experiences have identified elements which contribute to the effectiveness of such programs, among them opportunities for sustained, collaborative and self-directed learning. This paper explores how an online platform of a large scale blended program for professional development, Intel® Teach - Advanced Online, supports the implementation of such opportunities in practice and incorporates them in the structure of the program. The positive outcomes from the program as evidenced by its evaluation indicate that professional development based on the design principles identified as effective by recent research is a viable solution for addressing the limitations of traditional teacher training for technology integration.
Proceedings of the 1st International Conference on Automotive User Interfaces and Interactive Vehicular Applications
Venue: International Conference on Automotive User Interfaces and Interactive Vehicular Applications (2009)

The idea to hold a conference on human-computer interaction issues related to cars emerged some years back. Ubiquitous computing is becoming reality and researchers from computer science and human-computer interaction are moving into new domains. Vehicles and, in particular, cars present an exciting domain that offers many challenging research questions and at the same time new solutions can have a real impact on people's lives. As over the last few years many research projects on vehicle interaction have started and many PhD students work on this topic, we thought it was time to provide a forum for this emerging community. The plans for the conference were well worked out when in late 2008 the economic crisis also impacted the car industry. Despite the risk of running a smaller conference we went ahead and were happy to get many quality submissions and a good number of participants.