ppxscal/embedding_network huggingface dataset:
Pseudorandom-Function Property of the Step-Reduced Compression Functions of SHA-256 and SHA-512
Authors: Hidenori Kuwakado, Shoichi Hirose
Venue: Information Security Applications: 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers (2009)

Applications of an iterated hash function such as HMAC require that the compression function of the hash function is a pseudorandom function. However, the pseudorandom-function property of the compression function was not analyzed up to now. This paper shows that it is easy to distinguish between the 22 step-reduced SHA-512 compression function with the key-via-IV strategy and a random function. This is the first result on the pseudorandom-function property of the SHA-512 compression function with the key-via-IV strategy. A similar distinguishing attack is applicable to the SHA-256 compression function with the key-via-IV strategy.
The Five Points Pose Problem: A New and Accurate Solution Adapted to Any Geometric Configuration
Authors: Mahzad Kalantari, Franck Jung, Jean-Pierre Guedon, Nicolas Paparoditis
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

The goal of this paper is to estimate directly the rotation and translation between two stereoscopic images with the help of five homologous points. The methodology presented does not mix the rotation and translation parameters, which is comparably an important advantage over the methods using the well-known essential matrix. This results in correct behavior and accuracy for situations otherwise known as quite unfavorable, such as planar scenes, or panoramic sets of images (with a null base length), while providing quite comparable results for more "standard" cases. The resolution of the algebraic polynomials resulting from the modeling of the coplanarity constraint is made with the help of powerful algebraic solver tools (the Gröbner bases and the Rational Univariate Representation).
Training and Educating Undergraduate Students in the Discipline of HCI
Authors: Cynthia Y. Lester
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

An incoming freshman student stops by your office because he/she has read that your research area is HCI and desires to work with you. As teachers and academic advisers, how should we assist our students in choosing courses that will be beneficial to their study of HCI, but that will also provide the breadth that undergraduate studies provide? How should we as researchers assist our students in developing skills that will be beneficial to conducting research in HCI? How should we as teacher-researchers ensure that our student graduate from our universities adequately prepared? The aim of this paper is to present the HCI curriculum, to present the rationale for students to gain training in certain HCI-related areas that also provide for the breadth required in an undergraduate degree program, and to also suggest ideas for future work.
Recursive Estimation Algorithm Based on Covariances for Uncertainly Observed Signals Correlated with Noise
Authors: Seiichi Nakamori, Raquel Caballero-ÁGuila, Aurora Hermoso-Carazo, José D. JimÉNez-LÓPez, Josefa Linares-PÉRez
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The least-squares linear filtering and fixed-point smoothing problems of uncertainly observed signals are considered when the signal and the observation additive noise are correlated at any sampling time. Recursive algorithms, based on an innovation approach, are proposed without requiring the knowledge of the state-space model generating the signal, but only the autocovariance and crosscovariance functions of the signal and the observation white noise, as well as the probability that the signal exists in the observations.
Composing new abstractions from object fragments
Authors: Adrian Kuhn, Oscar Nierstrasz
Venue: Proceedings of the 2nd Workshop on Virtual Machines and Intermediate Languages for emerging modularization mechanisms (2008)

As object-oriented languages are extended with novel modularization mechanisms, better underlying models are required to implement these high-level features. This paper describes Cell, a language model that builds on delegation-based chains of object fragments. Composition of groups of cells is used: 1) to represent objects, 2) to realize various forms of method lookup, and 3) to keep track of method references. A running prototype of Cell is provided and used to realize the basic kernel of a Smalltalk system. The paper shows, using several examples, how higher-level features such as traits can be supported by the lower-level model.
Model-Driven Prototyping for Corporate Software Specification
Authors: Thomas Memmel, Carsten Bock, Harald Reiterer
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

Corporate software development faces very demanding challenges, especially concerning the design of user interfaces. Collaborative design with stakeholders demands modeling methods that everybody can understand and apply. But when using traditional, paper-based methods to gather and document requirements, an IT organization often experiences frustrating communication issues between the business and development teams. We present ways of implementing model-driven prototyping for corporate software development. Without harming agile principles and practice, detailed prototypes can be employed for collaborative design. Model-driven prototyping beats a new path towards visual specifications and the substitution of paper-based artifacts.
A family of syntactic logical relations for the semantics of Haskell-like languages
Authors: Patricia Johann, Janis Voigtländer
Venue: Information and Computation (2009)

Logical relations are a fundamental and powerful tool for reasoning about programs in languages with parametric polymorphism. Logical relations suitable for reasoning about observational behavior in polymorphic calculi supporting various programming language features have been introduced in recent years. Unfortunately, the calculi studied are typically idealized, and the results obtained for them offer only partial insight into the impact of such features on observational behavior in implemented languages. In this paper we show how to bring reasoning via logical relations closer to bear on real languages by deriving results that are more pertinent to an intermediate language for the (mostly) lazy functional language Haskell like GHC Core. To provide a more fine-grained analysis of program behavior than is possible by reasoning about program equivalence alone, we work with an abstract notion of relating observational behavior of computations which has among its specializations both observational equivalence and observational approximation. We take selective strictness into account, and we consider the impact of different kinds of computational failure, e.g., divergence versus failed pattern matching, because such distinctions are significant in practice. Once distinguished, the relative definedness of different failure causes needs to be considered, because different orders here induce different observational relations on programs (including the choice between equivalence and approximation). Our main contribution is the construction of an entire family of logical relations, parameterized over a definedness order on failure causes, each member of which characterizes the corresponding observational relation. Although we deal with properties very much tied to types, we base our results on a type-erasing semantics since this is more faithful to actual implementations.
Region growing based segmentation algorithm for typewritten and handwritten text recognition
Authors: Khalid Saeed, Majida Albakoor
Venue: Applied Soft Computing (2009)

This paper presents a new technique of high accuracy to recognize both typewritten and handwritten English and Arabic texts without thinning. After segmenting the text into lines (horizontal segmentation) and the lines into words, it separates the word into its letters. Separating a text line (row) into words and a word into letters is performed by using the region growing technique (implicit segmentation) on the basis of three essential lines in a text row. This saves time as there is no need to skeletonize or to physically isolate letters from the tested word whilst the input data involves only the basic information-the scanned text. The baseline is detected, the word contour is defined and the word is implicitly segmented into its letters according to a novel algorithm described in the paper. The extracted letter with its dots is used as one unit in the system of recognition. It is resized into a 9x9 matrix following bilinear interpolation after applying a lowpass filter to reduce aliasing. Then the elements are scaled to the interval [0,1]. The resulting array is considered as the input to the designed neural network. For typewritten texts, three types of Arabic letter fonts are used-Arial, Arabic Transparent and Simplified Arabic. The results showed an average recognition success rate of 93% for Arabic typewriting. This segmentation approach has also found its application in handwritten text where words are classified with a relatively high recognition rate for both Arabic and English languages. The experiments were performed in MATLAB and have shown promising results that can be a good base for further analysis and considerations of Arabic and other cursive language text recognition as well as English handwritten texts. For English handwritten classification, a success rate of about 80% in average was achieved while for Arabic handwritten text, the algorithm performance was successful in about 90%. The recent results have shown increasing success for both Arabic and English texts.
Lighttpd
Authors: Andre Bogus
Venue:  (2008)

This is your fast guide to getting started and getting inside the Lighttpd web server. Written from a developer's perspective, this book helps you understand Lighttpd, and get it set up as securely and quickly as possible. This book is for System Administrators or Web Developers seeking a lean deployment platform for web applications or who want to switch to a "lighter" web server than Apache.
Demand forecast of semiconductor products based on technology diffusion
Authors: Chen-Fu Chien, Yun-Ju Chen, Jin-Tang Peng
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Demand forecast plays a critical role to determine capital investment for capacity planning. Given the involved uncertainties and long lead-time for capacity expansion, semiconductor companies have to predict future demands as a basis for related manufacturing strategic decisions. As semiconductor products in a consumer era become more diversified with shortening life cycle, demand forecast also becomes more complex and difficult. This study aims to develop a demand forecast model based on product life cycle and technology diffusion. While little research has been done to employ diffusion models to forecast the demands of semiconductor products. The proposed model modifies a multi-generation diffusion model incorporating marketing variables into the model for semiconductor product and uses nonlinear least square method to estimate the parameters. An empirical study is conducted to validate the proposed model with real data of semiconductor products. This research concludes with discussion on future research directions.
A local time Fukunage-Koontz transformation for speech emotional recognition
Authors: Zhao Yan, Wang Hai-xian, Zhao Li
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Dimension reduction is widely used in the domains of speech emotional recognition. Considering the underlying time structure of speech signals, we propose a local time Fukunage-koontz transformation (LTFKT) to contain more discriminative information during emotional recognition. The goal of LTFKT is to maximize/ minimize the eigenvalues of covariance in different classes simultaneously. It can be seen that FKT is a special case of LTFKT from analysis. The results show that the method in this paper can improve recognition rate effectively.
The Design of Digital Frequency Transmission System Based on SOPC Technique
Authors: Lihua Su, Keping Zhao, Fan Yang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

This paper discusses a design method of digital frequency transmission system based on SOPC design thought and DSP Builder tool, simulates the waveform with Simulink, converts2FSK model to VHDL files, and uses embedded logic analyzer in Quartus II to implement compiling, adapting and downloading of modulation and demodulation system. The design is verified to be valid and available.
Interconnect Power Analysis for a Coarse-Grained Reconfigurable Array Processor
Authors: Mladen Berekovic, Frank Bouwens, Tom Aa, Diederik Verkest
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

Coarse-grained reconfigurable array processors (CGRAs) offer a promising path to high performance and power efficient processing. Increasing power dissipation at interconnect wires that comes with advanced process technologies may become a major problem for heavily interconnected CGRA processors. In our study we show that for a typical 90 nm process technology power in wire interconnects is still a fractional part of total power.
Scrutinising usability evaluation: does thinking aloud affect behaviour and mental workload?
Authors: Morten Hertzum, Kristin D. Hansen, Hans H. K. Andersen
Venue: Behaviour & Information Technology (2009)

Thinking aloud is widely used for usability evaluation. The validity of the method is, however, debatable because it is generally used in a relaxed way that conflicts with the prescriptions of the classic model for obtaining valid verbalisations of thought processes. This study investigates whether participants that think aloud in the classic or relaxed way behave differently compared to performing in silence. Results indicate that whereas classic thinking aloud has little or no effect on behaviour apart from prolonging tasks, relaxed thinking aloud affects behaviour in multiple ways. During relaxed thinking aloud participants took longer to solve tasks, spent a larger part of tasks on general distributed visual behaviour, issued more commands to navigate both within and between the pages of the websites used in the experiment, and experienced higher mental workload. Implications for usability evaluation are discussed.
Analysis and design of multi-slab dielectric cover for patch antennas directivity enhancement
Authors: Ahmed Ali, Herve Aubert
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

Using symmetrical multi-slab dielectric cover, a patch antenna having directivity of 30 dB is developed. The design and optimization of the multi-slab structure is achieved using a doubly recursive algorithm. A novel interpretation for the antenna radiation pattern is presented based on the calculated transmission coefficient of the cover. The antenna including the cover structure is simulated using the moment method-based software tool IE3D.
Estimating scale economies of the wireless telecommunications industry using EVA data
Authors: Changi Nam, Youngsun Kwon, Seongcheol Kim, Hyeongjik Lee
Venue: Telecommunications Policy (2009)

This paper proposes a new estimation method of total cost and average cost curves and applies it to the telecommunications industry. The method is more flexible and entails less hassle for data collection than traditional methods. The results show that the long-run average cost (LRAC) curve is downward sloping, revealing the presence of economies of scale in production. The two largest Korean mobile network operators are realizing full economies of scale, while the smallest operator is not. Finally, the paper recommends three policy alternatives that the Ministry of Information and Communication of Korea can draw on to increase efficiency in the Korean mobile telecommunications market.
Plenary lecture III: when did mitochondrial eve live? - computer simulations can help to answer the question
Authors: Krzysztof A. Cyran
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

One of the crucial issues in contemporary evolutionary genetics is the problem of dating the common ancestors of different species. It is a well-known fact that the results of analysis of genetic variation are affected by history of given population. Applicability of several existing approaches based on coalescence theory is limited to deterministic population histories, known to be unrealistic in the case of our own species. In the lecture the computer simulation-based approach will be presented, which is capable of dealing with arbitrary population history scenarios, including populations evolving stochastically and/or with environmental changes. This approach arises from the comparison of O'Connell model of branching processes genealogy and Wright-Fisher model of genetic drift. The latter assumes multinomial sampling between generations and thus asymptotically Poisson distribution of the number of progeny for any individual. Since the assumptions of this model are not always fulfilled in reality, there exists a problem of the influence of the departure from WF model on the distribution of the coalescence time and further analysis of genetic variation. The lecture will show an attempt to solve the problem using time-forward computer simulations of branching processes and numerically approximated distribution of coalescence time for a pair of alleles. There have been performed simulations of over 105 human population histories evolving for 104 generations. Assuming the human generation length to be approximately 20 years, each simulation history corresponds to 200,000 years. Simulations of so many trajectories modeling such long periods in an unbiased way excluded the use of built-in pseudo-random number generator. The reason for that is either too short range of generator aperiodicity or failing some statistical tests. Therefore there was implemented an advanced random number generator being the composition of two other generators. This advanced generator had the desirable aperiodicity length of 2144, furthermore, it satisfied known statistical tests. These methods were applied to estimate the age of our most recent female common ancestor, often called Mitochondrial Eve. The estimates are based on the genetic material taken from hyper variable region I (HVRI) and hyper variable region II (HVRII) of mitochondrial DNA belonging to contemporary humans and Neanderthal fossils. Obtained results indicate that after changing the outgroup from chimpanzee to Neanderthals, the stochastic genetic models with different assumptions tend to give similar predictions, and therefore these predictions are much more reliable than they were before. Moreover, these estimates are very similar to those obtained lately by other researchers with the use of phylogenetic trees, which increases reliability of both estimates obtained by conceptually different methods.
König Deletion Sets and Vertex Covers above the Matching Size
Authors: Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

A graph is K&ouml;nig-Egerv&aacute;ry if the size of a minimum vertex cover equals the size of a maximum matching in the graph. We show that the problem of deleting at most k vertices to make a given graph K&ouml;nig-Egerv&aacute;ry is fixed-parameter tractable with respect to k. This is proved using interesting structural theorems on matchings and vertex covers which could be useful in other contexts. We also show an interesting parameter-preserving reduction from the vertex-deletion version of red/blue-split graphs [4,9] to a version of Vertex Cover and as a by-product obtain 1 the best-known exact algorithm for the optimization version of Odd Cycle Transversal [15]; 1 fixed-parameter algorithms for several vertex-deletion problems including the following: deleting k vertices to make a given graph (a) bipartite [17], (b) split [5], and (c) red/blue-split [7].
Can We Connect Existing Production Grids into a World Wide Grid?
Authors: Peter Kacsuk, Attila Kertesz, Tamas Kiss
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

The World Wide Web has become a phenomenon that now influences our everyday life in any possible areas and disciplines. This paper investigates how a grid equivalent of the WWW, the World Wide Grid can be created. We define requirements towards a workflow-oriented computational World Wide Grid and propose a solution how current production Grids can be connected in order to form the technical basis of this infrastructure. A meta-broker concept and its utilization to achieve the highest level of parallelism by the created architecture in a user transparent way are explained.
Rethinking computing
Authors: Craig Mundie
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

Computing is undergoing a major paradigm shift. Radical new approaches to hardware and software will transform our online and offline lives, seamlessly combining the power of the internet with a world of devices. Craig Mundie, Microsoft's chief research and strategy officer, will discuss the possibilities and show how close we are to realizing them.
Temperature aware task sequencing and voltage scaling
Authors: Ramkumar Jayaseelan, Tulika Mitra
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

On-chip power density and temperature are rising exponentially with decreasing feature sizes. This alarming trend calls for temperature management at every level of system design. In this paper, we propose task sequencing as a powerful and complimentary mechanism to voltage scaling in improving the thermal profile of an embedded system executing a set of periodic heterogenous tasks under timing constraints. We first derive the peak temperature of a repeating task sequence analytically and develop a heuristic to construct the task sequence that minimizes the peak temperature. Experimental evaluation shows that our task sequencing heuristic achieves peak temperature within 0.5&deg;C of the optimal solution and 7.47&deg;C lower, on an average, compared to the worst sequence for a large range of embedded task sets. We also propose an iterative algorithm that combines task sequencing with voltage scaling to further lower the peak temperature while satisfying the timing constraints. For embedded task sets, our combined task sequencing and voltage scaling approach achieves, on an average, 2.1&deg;C -- 6.94&deg;C reduction in peak temperature compared to voltage scaling alone.