ppxscal/embedding_network huggingface dataset:
Embedded Parallel Systems Based on Dynamic Look-Ahead Reconfiguration in Redundant Communication Resources
Authors: Eryk Laskowski, Marek Tudruj
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

A special parallel system architecture based on the look-ahead dynamic reconfiguration of inter-processor connections for execution of dedicated programs is discussed in the paper. The architecture assumes connection reconfiguration in multiple crossbar switches. Programs are structured into sections that use temporarily fixed inter-processor connections for communication. While some inter-processor connections in crossbar switches are used for execution of current sections, the connections necessary for execution of further sections are in advance configured some spare connection switches. Automatic program structuring for the assumed system architecture is proposed based on the analysis of parallel program graphs. The structuring algorithm finds the partition into sections that minimizes the execution time of a program executed with the look-ahead created connections. The program execution time is evaluated by simulated program graph execution with reconfiguration control modeled as an extension of the program graph.
Analysis of the Market Competitive Structure on Mobile Multimedia Services: Wibro, HSDPA, S-DMB, T-DMB
Authors: Hyori Jeon, Yonghee Shin, Munkee Choi
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

This paper studied on the future market competitive structure among mobile multimedia services that offer a variety of multimedia services and contents through wireless networks. In the past, forecasting methods based on market data would be used popularly in telecommunications industry. Now, methods are changed from market data based studies to customer preferences based ones. In this reason, paper use to forecast the market competitive structure and offer firm strategies and policies using a customer choice probability model.
Noisy input/output system identification using integrated polyspectrum
Authors: Y. Ye, J. K. Tugnait
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Two new parametric, frequency domain approaches are proposed for estimation of the parameters of linear errors-in-variables models, i.e., linear systems where measurements of both input and output of the system are noise contaminated. Existing approaches based upon second-order statistics will yield biased estimates if noise statistics are unknown. The proposed approaches exploit an integrated bispectrum and cross-bispectrum of the input-output data where the integrated bispectrum of a signal is defined as a cross-spectrum between the signal and its square. The parameter estimators are shown to be statistically consistent and numerically globally convergent. One of the approaches is linear and the other is nonlinear. Computer simulation results are presented.
Turning Clusters into Patterns: Rectangle-Based Discriminative Data Description
Authors: Byron J. Gao, Martin Ester
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

The ultimate goal of data mining is to extract knowledge from massive data. Knowledge is ideally represented as human-comprehensible patterns from which end-users can gain intuitions and insights. Yet not all data mining methods produce such readily understandable knowledge, e.g., most clustering algorithms output sets of points as clusters. In this paper, we perform a systematic study of cluster description that generates interpretable patterns from clusters. We introduce and analyze novel description formats leading to more expressive power, motivate and define novel description problems specifying different trade-offs between interpretability and accuracy. We also present effective heuristic algorithms together with their empirical evaluations.
Resolving Semantic Inconsistencies of Graded Perceptions and Creating Private Empirical Knowledge Base
Authors: Wojciech Lorkiewicz, Agnieszka Pieczynska
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The model of integration of distributed knowledge resources in monitoring system is proposed. It is assumed that agent's knowledge about the states of objects is represented by the graded profiles. The procedure of data integration is given and the algorithm for semantic knowledge integration is introduced including solving conflicts of inconsistent data.
Depth-image based full 3D modeling using trilinear interpolation and distance transform
Authors: Seung-man Kim, Jeung-chul Park, Kwan H. Lee
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

This paper presents a new modeling method that generates a full 3D mesh based on a view with a single depth image. The front of the object is modeled using the depth image and the backside is approximated by trilinear interpolation and distance transform based on the 2.5D silhouette contour that is extracted from the depth image. Then the front and the back are merged and smoothened to generate a smooth 3D mesh.
A framework for password-based authenticated key exchange1
Authors: Rosario Gennaro, Yehuda Lindell
Venue: ACM Transactions on Information and System Security (TISSEC) (2006)

In this paper, we present a general framework for password-based authenticated key exchange protocols, in the common reference string model. Our protocol is actually an abstraction of the key exchange protocol of Katz et al. and is based on the recently introduced notion of smooth projective hashing by Cramer and Shoup. We gain a number of benefits from this abstraction. First, we obtain a modular protocol that can be described using just three high-level cryptographic tools. This allows a simple and intuitive understanding of its security. Second, our proof of security is significantly simpler and more modular. Third, we are able to derive analogs to the Katz et al. protocol under additional cryptographic assumptions. Specifically, in addition to the DDH assumption used by Katz et al., we obtain protocols under both the quadratic and N-residuosity assumptions. In order to achieve this, we construct new smooth projective hash functions.
AWELS: Adaptive Web-Based Education and Learning Styles
Authors: Alexandra Cristea, Natalia Stash
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Can learning styles (LS) be applied in current webbased systems? What are the main issues when applying LS in web-based systems? Can LS be authored in current web-based systems? What are the main issues when authoring LS in web-based systems? Can LS applications improve the efficiency of learning in web-based systems? Can LS applications be tested in web-based systems? These are important questions that are starting to be asked both in adaptive hypermedia (AH), as well as in web-based learning communities. This paper's aim is to raise the awareness of the timeliness of asking these questions now. Moreover, the paper sketches some preliminary answers, intended for starting a cross-disciplinary debate on these issues.
Aspect-Ratio Voronoi Diagram with Applications
Authors: Tetsuo Asano, Hideyuki Sakai, Kokichi Sugihara
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

This paper considers a problem of finding an optimal point within a polygon P in the sense that when we connect the point to every vertex of P by straight line then the worst aspect ratio among all resulting triangles is optimized. This problem has an important application to triangular mesh improvement. We propose three different approaches toward this problem. The first one is based on some new Voronoi diagram defined by an aspect ratio, which is interesting in itself. The second approach is essentially a binary search defined by geometric intersection. The third one is grid-based heuristic, which might be practically best but has no theoretical guarantee on its performance.
Simulating users to support the design of activity management systems
Authors: Julie S. Weber, Martha E. Pollack
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We describe a simulation system that models the user of a calendar-management tool. The tool is intended to learn the user's scheduling preferences, and we employ the simulator to evaluate learning strategies. The simulated user is instantiated with a set of preferences over local and global features of a schedule such as the level of importance of a particular meeting and the amount of preparation time available before it is to begin. The system then processes a set of simulated meeting requests, and over time and through user feedback, it learns the user's preferences, affording it the ability to thereafter manage the user's schedule more autonomously.
Study of N-Detectability in QCA Designs
Authors: Biplab K. Sikdar
Venue: Proceedings of the 15th Asian Test Symposium (2006)

QCA (quantum dot cellular automata) are projected as the replacement of state-of-the-art CMOS designs. The wide acceptance of QCA based design of logic circuits demands analysis and estimation of defect coverage in such circuits. Conventional single stuckat fault model has been commonly employed to identify the majority of defects at the logic level. However, stuck-at fault model may not fully capture the defects in QCA based designs but approximates the defects in such designs. This work evaluates the effectiveness of such state-of-the-art VLSI test mechanisms, and investigates the possibility of more defect coverage through N-detectability in QCA designs. An experimental set up has been created to study the test quality of such designs subject to a PRPG (Pseudo-random-pattern generator). The results shown in the paper point to the fact that the conventional test technique for CMOS designs is also effective in QCA based designs.
What agents can achieve under incomplete information
Authors: Wojciech Jamroga, Thomas Ågotnes
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We propose a non-standard semantics for Alternating-time Temporal Logic (ATL) with incomplete information, for which no commonly accepted semantics has been proposed yet. In our semantics, formulae are still interpreted with respect to ATL structures, but are interpreted in sets of states rather than in single states. We also propose a new epistemic operator for "constructive" knowledge, and we show that the new language is strictly more expressive than existing solutions, while retaining the same model checking complexity.
A Solution for Web Services Transaction
Authors: Wenya Yang, Shaohua Tang
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

Web Services should provide related solutions to the transaction requirements of business application field. The following issues are concentrated in this paper: Firstly, Web Services application scenarios are partitioned to clarify what kinds of scenarios require the transaction support. Secondly, the characteristics of Web Services transaction are proposed by integrating the analysis of related traditional transaction processing models with the abstraction of Web Services' specific features. Thirdly, a Web Services transaction named WST and the corresponding object model named WS-TM are defined. Finally, a processing framework for WST named WSTPF is designed, and its whole architecture, roles involved, SOAP message extension and the message flow procedure are described in detail. All mentioned above provides a comparatively complete solution for Web Services transaction.
A high-order accurate hybrid scheme using a central flux scheme and a WENO scheme for compressible flowfield analysis
Authors: Dehee Kim, Jang Hyuk Kwon
Venue: Journal of Computational Physics (2005)

A high-order accurate hybrid central-WENO scheme is proposed. The fifth order WENO scheme [G.S. Jiang, C.W. Shu, Efficient implementation of weighted ENO schemes, J. Comput. Phys. 126 (1996) 202-228] is divided into two parts, a central flux part and a numerical dissipation part, and is coupled with a central flux scheme. Two sub-schemes, the WENO scheme and the central flux scheme, are hybridized by means of a weighting function that indicates the local smoothness of the flowfields. The derived hybrid central-WENO scheme is written as a combination of the central flux scheme and the numerical dissipation of the fifth order WENO scheme, which is controlled adaptively by a weighting function. The structure of the proposed hybrid central-WENO scheme is similar to that of the YSD-type filter scheme [H.C. Yee, N.D. Sandham, M.J. Djomehri, Low-dissipative high-order shock-capturing methods using characteristic-based filters, J. Comput. Phys. 150 (1999) 199-238]. Therefore, the proposed hybrid scheme has also certain merits that the YSD-type filter scheme has. The accuracy and efficiency of the developed hybrid central-WENO scheme are investigated through numerical experiments on inviscid and viscous problems. Numerical results show that the proposed hybrid central-WENO scheme can resolve flow features extremely well.
Near- and Far- Infrared Imaging for Vein Pattern Biometrics
Authors: Lingyu Wang, Graham Leedham
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

This paper investigates two infrared imaging technologies, far-infrared thermography and near-infrared imaging, to acquire hand vein pattern images for biometric purposes. The imaging principles for both technologies are studied in depth. Experiments involving data acquisition from various parts of hand, including the back of the hand, palm, and wrist are described using a population of 150 participants using both near and far infrared imaging techniques. Comparison and analysis of the data collected show that far-infrared thermography has difficulties in capturing vein images in the palm, and wrist. However, while it is more suitable for capturing the large veins in the back of the hand, it is sensitive to ambient conditions and human body condition and does not provide a stable image quality. On the other hand, near-infrared imaging produces good quality images when capturing vein patterns in the back of the hand, palm, and wrist. It is more tolerant to changes in environmental and body condition, but it also faces the problem of disruption due to skin features such as hairs and line patterns. An initial vein pattern biometric system is implemented. The results show that all the test subjects can be correctly identified.
A Robust Authentication Protocol with Non-Repudiation Service for Integrating WLAN and 3G Network
Authors: Chou-Chen Yang, Ya-Wen Yang, Wei-Ting Liu
Venue: Wireless Personal Communications: An International Journal (2006)

The third-generation cellular systems provide great coverage, complete subscriber management and nearly universal roaming. Nevertheless, 3G systems suffer the high installation cost and low bandwidth. Though WLAN provides hot spot coverage with high data rates, it lacks roaming and mobility support. From users' points of views, the integration of WLAN and 3G systems is an attractive way that will provide them a convenient access to network. When integrating WLAN and 3G, there are still some problems should be concerned in terms of authentication and security, such as authentication efficiency and repudiation problem. In this paper, we review the authentication scheme for WLAN and 3G/UMTS interworking which is specified by 3GPP and propose a robust localized fast authentication protocol with non-repudiation service for integrating WLAN and 3G network. The localized re-authentication protocol can shorten the authentication time delay. On the other hand, with the non-repudiation service, the assumption, that subscriber has to fully trust 3G home operator, can be deleted and the trust management between the independent WLAN operator, 3G visited operator and 3G home operator can be eliminated. In other words, our proposed protocol provides legal evidences to prevent the 3G home operator from overcharge toward the subscriber and also prevent the WLAN operator and 3G visited operator from overcharge toward the 3G home operator. The authentication protocol employs HMAC, hash-chaining techniques, and public-key digital signature to achieve localized fast re-authentication and non-repudiation service.
Shape from Dynamic Texture for Planes
Authors: Yaser Sheikh, Niels Haering, Mubarak Shah
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We propose a method for recovering the affine geometry of a dynamically textured plane from a video sequence taken by an uncalibrated, fixed, perspective camera. Some instances of approximately planar surfaces that are coated with a dynamic texture include large water bodies, (such as lakes and oceans), heavy traffic, dense crowds, escalators, and foliage in the wind. Under the assumption of translational dynamic textures, we propose a direct algorithm for the estimation of the inter-frame elation that does not require explicit identification of texels or movetons. In addition, we develop a general algorithm for recovering the affine geometry of homogeneous dynamic textures by identifying a constraint on the expected values of motion magnitudes. We report experimental results on several real videos of dynamic texture found in the world.
A Forward-Looking User Interface for CBIR and CFIR Systems
Authors: Liam M. Mayron, Oge Marques, Gustavo B. Borba, Humberto R. Gamba, Vladimir Nedovic
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

This demonstration highlights the benefits that image retrieval systems can enjoy by use of a thoughtful interface. We present a live demonstration of PRISM, a new Web-based application that, through a simple set of natural actions, allows the user the ability to elicit sophisticated responses from easily-formed queries. Additionally, the system was designed with not only content-based, but also content-free image retrieval and semantic annotation in mind. The demonstration system uses an attention-based method for extracting and determining the relevance of salient regions of interest in an unsupervised way, but can be adapted to a variety of implementations.
Application of Procrustes Distance to Shape Analysis of Delaunay Simplexes
Authors: A. V. Anikeenko, N. N. Medvedev, M. L. Gavrilova
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

The concept of Procrustes distance is applied to the shape analysis of the Delaunay simplexes. Procrustes distance provides a measure of coincidence of two point sets {xi} and {yi}, i=1..N. For this purpose the variance of point deviations is calculated at the optimal superposition of the sets. It allows to characterize the shape proximity of a given simplex to shape of a reference one, e.g. to the shape of the regular tetrahedron. This approach differs from the method used in physics, where the variations of edge lengths are calculated in order to characterize the simplex shape. We compare both methods on an example of structure analysis of dense packings of hard spheres. The method of Procrustes distance reproduces known structural results; however, it allows to distinguish more details because it deals with simplex vertices, which define the simplex uniquely, in contrast to simplex edges.
Timed approximate petri nets
Authors: Zbigniew Suraj, Barbara Fryc
Venue: Fundamenta Informaticae (2006)

Time is one of the most important considerations in designing practical systems. The notion of time plays a vital role in performance evaluation of real-time systems. A new class of timed approximate Petri nets (TAP-nets) is proposed in the paper. This net model combines high-level Petri nets with time and uncertain information. The approach presented in the paper for modelling of uncertainty, imprecision and vagueness is based on rough set theory and fuzzy Petri nets. The TAP-nets can be used for modelling and evaluating of approximate reasoning used to build expert systems, control systems, communication systems, etc. The main advantage of modelling practical systems using the TAP-nets is that the resulting models are simple, intuitive and allow the system analyst to evaluate the performance of such system models.
An Efficient Reconfigurable Montgomery Multiplier Architecture for GF(n)
Authors: R. V. Kamala, M. Sudhakar, M. B. Srinivas
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

In this paper, the authors propose an efficient reconfigurable Montgomery multiplier for Galois prime field GF(n) that employs carry-save addition. The multiplier can operate for any operand length 'k' where 1\lek\leqslantN. The value of N determines the maximum operand length that the multiplier can support, which is application dependent. The value 'k' can be changed and hence can be configured and programmed. The final result can be obtained in 'k+1' clock cycles of operation after reset. The advantages of the proposed design are high order of flexibility, which allows easy reconfigurability for any operand length and low hardware complexity. The minimal area overhead to achieve reconfigurability is another major advantage. The critical path delay of the design is 6TXOR + TAND + T4:1MUX + T2:1MUX, where TXOR, TAND, T4:1MUX, and T2:1MUX are delays of 2-input XOR, 2-input AND, 4:1 multiplexer and 2:1 multiplexer respectively. To the best of our knowledge this appears to be the only reconfigurable architecture for Montgomery multiplication over Galois prime field. Further, clock and signal gating techniques have been employed for low-power consumption of the multiplier.
Improved FFSBM algorithm and its VLSI architecture for AVS video standard
Authors: Li Zhang, Don Xie, Di Wu
Venue: Journal of Computer Science and Technology (2006)

The Video part of AVS (Audio Video Coding Standard) has been finalized recently. It has adopted variable block size motion compensation to improve its coding efficiency. This has brought heavy computation burden when it is applied to compress the HDTV (high definition television) content. Based on the original FFSBM (fast full search blocking matching), this paper proposes an improved FFSBM algorithm to adaptively reduce the complexity of motion estimation according to the actual motion intensity. The main idea of the proposed algorithm is to use the statistical distribution of MVD (motion vector difference). A VLSI (very large scale integration) architecture is also proposed to implement the improved motion estimation algorithm. Experimental results show that this algorithm-hardware co-design gives better tradeoff of gate-count and throughput than the existing ones and is a proper solution for the variable block size motion estimation in AVS.