ppxscal/embedding_network huggingface dataset:
Proceedings of the International Conference on Mobile Technology, Applications, and Systems
Venue: International Conference On Mobile Technology, Applications, And Systems (2008)

Following the success of the Mobility Conference first held in Singapore in 2004, Guangzhou, China in Year 2005, Bangkok, Thailand in Year 2006. Singapore again in Year 2007, Yilan, Taiwan will join this continuous effort by taking up the task of hosting the Mobility Conference in Year 2008 from 10-12 September. The conference is seen as an ideal vehicle for bringing together researchers, scientists, engineers, academicians and students all around the world to share the latest updates on new mobile technologies that would shape the next generation of mobile systems and technology platforms. In today's fast expanding and dynamic marketplace, the emergence of mobility technologies has revolutionize our global village. The benefits of mobility are many fold. Mobile technologies made their headway by offering more flexibility to end-users and improve productivity which many businesses have quickly adopted so as to gain and sustain a competitive edge. While mobility technologies and application are clearly becoming an essential integration into part and parcel of our daily life and business strategy, it is utmost important for professionals to stay relevant and equipped with up-to-date technical competencies, in order to meet the competitiveness of the global economy successfully. The concept of this conference is dealing with the new challenges, deployment and strategies on next generation mobile systems, mobile devices and mobile networks in Asia. We aim to promote the understanding and interaction among players, and focus on the key areas in the value-chain necessary for the delivery of total mobile solutions. We also wish to make use of this platform to facilitate discussion and encourage the formulation and adoption of standards to enable rapid development and deployment of mobility solutions.
Object oriented approach in optimization of fuzzy transform
Authors: František Huňka, Viktor Pavliska
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The paper deals with the design, implementation and testing of the object oriented framework for optimization using genetic algorithms. The framework is designed in layers to truly depict both the model domain and the application. The two bottom layers represent the framework and the third top layer represents the user application. The framework is built by gradual specialization of the design classes. The framework can be used for broad collection of genetic algorithms and for similar optimization algorithms, which solutions are based on populations possible solutions too. The designed framework was tested on optimization of the fuzzy transform and the achieved results are attached to the paper. In the design of the framework benefits of object oriented approach are utilized such as encapsulation, hierarchical structuring of the problem domain and inner classes.
2D piecewise algebraic splines for implicit modeling
Authors: Qingde Li, Jie Tian
Venue: ACM Transactions on Graphics (TOG) (2009)

2D splines are a powerful tool for shape modeling, either parametrically or implicitly. However, compared with regular grid-based tensor-product splines, most of the high-dimensional spline techniques based on nonregular 2D polygons, such as box spline and simplex spline, are generally very expensive to evaluate. Though they have many desirable mathematical properties and have been proved theoretically to be powerful in graphics modeling, they are not a convenient graphics modeling technique in terms of practical implementation. In shape modeling practice, we still lack a simple and practical procedure in creating a set of bivariate spline basis functions from an arbitrarily specified 2D polygonal mesh. Solving this problem is of particular importance in using 2D algebraic splines for implicit modeling, as in this situation underlying implicit equations need to be solved quickly and accurately. In this article, a new type of bivariate spline function is introduced. This newly proposed type of bivariate spline function can be created from any given set of 2D polygons that partitions the 2D plane with any required degree of smoothness. In addition, the spline basis functions created with the proposed procedure are piecewise polynomials and can be described explicitly in analytical form. As a result, they can be evaluated efficiently and accurately. Furthermore, they have all the good properties of conventional 2D tensor-product-based B-spline basis functions, such as non-negativity, partition of unit, and convex-hull property. Apart from their obvious use in designing freeform parametric geometric shapes, the proposed 2D splines have been shown a powerful tool for implicit shape modeling.
Music performamatics: interdisciplinary interaction
Authors: Jesse M. Heines, Gena R. Greher, Sarah Kuhn
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

This paper describes how a graphical user interface (GUI) programming course offered by the Dept. of Computer Science (CS) was paired with a general teaching methods course offered by the Dept. of Music in an attempt to revitalize undergraduate CS education and to enrich the experiences of both sets of students. The paper provides details on the joint project done in these classes and the evaluation that assessed its effect on the curriculum, students, and professors.
Characterizing the departure process from a two server Markovian queue: a non-renewal approach
Authors: Guy L. Curry, Natarajan Gautam
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

For large queueing network analysis the general computational approach is to utilize decomposition to facilitate computational tractability. To accomplish this individual analysis the input and output streams must be characterized. This usually is done via two-parameter characterizations: the process mean and a variance measure (most commonly the squared coefficient of variation SCV). In most approaches independent and identically distributed (i.i.d.) approximations are used. For multiple input streams and/or multiple (identical) servers, the assumptions of i.i.d. times between arrivals and, similarly, i.i.d. times between departures are particularly theoretically and computationally inaccurate. In this paper we develop a generator for the background multidimensional continuous time Markov chain associated with the inter-departure times for the associated multi-stream and multi-server Markovian queues (where inter-arrival times and service times are Coxian). This generator allows for the computation of the moments of the departure process and the lag-k correlations between successive k-separated departures.
Temperature-aware test scheduling for multiprocessor systems-on-chip
Authors: David R. Bild, Sanchit Misra, Thidapat Chantemy, Prabhat Kumar, Robert P. Dick, X. Sharon Hu, Li Shang, Alok Choudhary
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Increasing power densities due to process scaling, combined with high switching activity and poor cooling environments during testing, have the potential to result in high integrated circuit (IC) temperatures. This has the potential to damage ICs and cause good ICs to be discarded due to temperature-induced timing faults. We first study the power impact of scan chain testing for the ISCAS89 benchmarks. We find that the scan-chain test power consumption is 1.6x higher for at-speed testing than normal operating power consumption. We conclude that if the testing frequency is less than half of the normal frequency, then the testing power consumption may in fact be lower. However, due to differences in the cooling environments, the peak die temperatures may still be higher. Second, we present an optimal formulation for minimal-duration temperature-constrained test scheduling. Our results improve on the test schedule time of the best existing algorithm by 10.8% on average for a packaged IC thermal environment. We also present an efficient heuristic that generally produces the same results as the optimal algorithm, while requiring little CPU time, even for large problem instances.
Using Food Web as an Evolution Computing Model for Internet-Based Multimedia Agents
Authors: Timothy K. Shih
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The ecosystem is an evolutionary result of natural laws. Food Web (or Food Chain) embeds a set of computation rules of natural balance. Based one the concepts of Food Web, one of the laws that we may learn from the natural besides neural networks and genetic algorithms, we propose a theoretical computation model for mobile agent evolution on the Internet. We define an agent niche overlap graph and agent evolution states. We also propose a set of algorithms, which is used in our multimedia search programs, to simulate agent evolution. Agents are cloned to live on a remote host station based on three different strategies: the brute force strategy, the semi-brute force strategy, and the selective strategy. Evaluations of different strategies are discussed. Guidelines of writing mobile agent programs are proposed. The technique can be used in distributed information retrieval which allows the computation load to be added to servers, but significantly reduces the traffic of network communication.
A ROM-friendly secure code update mechanism for WSNs using a stateful-verifier τ-time signature scheme
Authors: Osman Ugus, Dirk Westhoff, Jens-Matthias Bohli
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

Several mechanisms have been proposed to efficiently authenticate multicast of finite data streams as needed for code image updates in wireless sensor networks (WSNs). They involve either a public-key digital signature or loose time synchronization between the sender and the receivers. What usually does not get any attention is the program memory (ROM) occupied by these mechanisms which do not fulfill the primary task of a sensor network. An optimized implementation of the elliptic curve digital signature scheme occupies up to 25% of the ROM of a TelosB node; the same or even more is needed for time synchronization schemes. Therefore, if sensor networks do not need public-key operations or time synchronization for their primary task, these SCU mechanism are not suitable for coexistence with the application code on the sensor nodes. This work contributes in two directions. Firstly, we propose a stateful-verifier T-time signature scheme based on Merkle's one-time signature. Secondly, we propose a protocol exploiting our signature scheme for securing existing code image update protocols for WSNs minimizing ROM overhead to 1% on TelosB motes.
DOA estimation with uniform linear arrays in the presence of mutual coupling via blind calibration
Authors: Zhangmeng Liu, Zhitao Huang, Fenghua Wang, Yiyu Zhou
Venue: Signal Processing (2009)

Direction-of-arrival (DOA) estimation in the presence of mutual coupling is a widely studied problem in the field of array signal processing. Most of the previous methods tried to estimate the DOAs by compensating the effect of mutual coupling with measured antenna impedances, which is not an effective way because the impedances are often time-variant. A blind calibrating method is proposed in this paper to deal with the problem of DOA estimation with uniform linear arrays in the presence of mutual coupling. This method exploits the complex symmetric Toeplitz form of the mutual coupling matrix (MCM) of unitary linear arrays (ULA), and transforms conventional direction finding methods from testing the orthogonality between the signal and noise subspaces to checking the rank deficiency of a projected matrix, eliminating most of the influence brought in by the effect of mutual coupling. Simulation results are presented to show the satisfying performance of the new method.
Enhancements of two-stage stochastic decomposition
Authors: Suvrajeet Sen, Zhihong Zhou, Kai Huang
Venue: Computers and Operations Research (2009)

This paper presents some enhancements associated with stochastic decomposition (SD). Specifically, we study two issues: (a) Are there any conditions under which the regularized version of SD generates a unique solution? (b) Is there a way to modify the SD algorithm so that a user can trade-off solution times with solution quality? The second issue addresses the scalability of SD for very large scale problems for which computational resources may be limited and the user may be willing to accept solutions that are ''nearly optimal''. We show that by using bootstrapping (re-sampling) the regularized SD algorithm can be accelerated without significant loss of optimality. We report computational results that demonstrate the viability of this approach.
ACCFS --- Operating System Integration of Computational Accelerators Using a VFS Approach
Authors: Andreas Heinig, Jochen Strunk, Wolfgang Rehm, Heiko Schick
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

For a number of applications integrating specialized computational accelerators into a general-purpose computing environment yields more performance per watt and per dollar than a pure multi-core approach. In contrast to fully application-specific hybrid solutions we offer the advantage to maintain traditional programming models and development environments to a certain extent. In this paper we introduce an open generic operating system interface concept what we call Accelerator File System (ACCFS) for integrating application accelerators into Linux based platforms. By describing the proposed concepts and interface we contribute to a broader discussion of this challenging topic.
Objects over the World
Authors: Bingyu Qiu, Keiji Yanai
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

This paper considers the problem of selecting representative photographs for regions in the worldwide dimensions. Selecting and generating such representative photographs for representative regions from large-scale collections would help us understand about local specific objects with a worldwide perspective. We propose a solution to this problem using a large-scale collection of geo-tagged photographs. Our solution firstly extracts the most relevant images by clustering and evaluation on the visual features. Then, based on geographic information of the images, representative regions are automatically detected. Finally, we select and generate a set of representative images for the representative regions by employing the Probabilistic Latent Semantic Analysis (PLSA) modelling. The results show the ability of our approach to generate region-based representative photographs.
Towards social connection for young people with cancer
Authors: Hilary Davis, Frank Vetere, Shawn Ashkanasy, Gavin Dyson, Penelope Schofield, Kate Thompson, Giselle Withers, David Thomas
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

People with cancer have to contend with a variety of physical, emotional and social difficulties. Young people with cancer are often faced with the additional burden of isolation from their peers and social network. This paper outlines early results from a collaborative project seeking to use emerging technologies to develop and evaluate a peer-based social support system to support social connectivity amongst young people with cancer. We introduce an integrated service named MyTrac, which combines online social network applications and mobile broadband telephony. Seven young people (18--25yo) participated in the three month study. The study encompassed in-depth interview data, questionnaire data and an analysis of system audit logs, which documents participants' use and experience of the system. In this paper we highlight specific communications mediated by MyTrac, showing how they are a reflection of both the individual personalities of participants and a reflection of their cancer journey. We illustrate how these individual identities construct a collaborative identity for MyTrac, one which both encompasses and excludes particular types of interaction. We conclude by articulating some design considerations for social connectivity systems which seek to support young people with cancer.
Unified convolutional/turbo decoder design using tile-based timing analysis of VA/MAP kernel
Authors: Fan-Min Li, Cheng-Hung Lin, An-Yeu Wu
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

To satisfy the advanced forward-error-correction (FEC) standards, in which the Convolutional code and Turbo code may co-exit, a prototype design of a unified Convolutional/Turbo decoder is proposed. In this paper, we systematically analyze the timing charts of both the Viterbi algorithm and the MAP algorithm. Then, three techniques, including Distribution, Pointer, and Parallel schemes, are introduced; they can be used as flexible tools in timing-chart analysis to either reduce memory size or to increase throughput rate. Furthermore, we propose a tile-based methodology to analyze the key features of timing charts, such as computing/memory units and hardware utilization. On the basis of the timing analysis, we developed a VA/MAP timing chart that has three modes (VA mode, MAP mode, and concurrent VA/MAP mode) by complementing the idle time of both VA and MAP decoding procedures. The new combined timing analysis helps us for constructing a unified component decoder with near 100% utilization rate of the processing element (PE) in both VA/MAP decoding functions. According to the triple-mode VA/MAP timing chart, we construct a triple-mode FEC kernel that can perform both Convolutional/Turbo decoding functions seamlessly for different communication systems. By integrating the FEC kernel with different size of memory, we can construct four types of FEC decoders for different application scenarios, such as 1) standalone Convolutional decoder (VA mode); 2) standalone Turbo decoder (MAP mode); 3) dual-mode Convolutional/Turbo decoder (VA mode and MAP mode); and 4) triple-mode Convolutional/Turbo decoder (VA mode, MAP mode, and concurrent VA/MAP mode). Finally, a prototyping FEC kernel processor that is compliant to 3GPP standard is verified in TSMC 0.18-µm CMOS process in the type of triple-mode FEC decoder.
Web Service Choreography Configurations for BPMN
Authors: Kerstin Pfitzner, Gero Decker, Oliver Kopp, Frank Leymann
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

The Business Process Modeling Notation (BPMN) and the Business Process Execution Language (BPEL) are the de-facto standards for process modeling and implementation. While BPMN allows to define choreographies, i.e. the interaction behavior of interconnected services, BPEL only allows an endpoint-centric view on services. To achieve applicability of BPEL in the choreography space, we defined BPEL4Chor as choreography extensions for BPEL in previous work. This paper extends on this work and makes a contribution for the model-driven development of service-based systems in inter-organizational settings: It extends BPMN for enabling the generation of fully defined BPEL4Chor choreographies and presents how to carry out this transformation.
Letters: Neighborhood discriminant tensor mapping
Authors: Fei Wang, Xin Wang
Venue: Neurocomputing (2009)

Linear dimensionality reduction (feature extraction) methods have been widely used in computer vision and pattern recognition. Two of the most representative methods are principal component analysis (PCA) and linear discriminant analysis (LDA). However, when dealing with a multidimensional dataset of dimension R^m^"^1@?R^m^"^1@?...@?R^m^"^N (e.g. for images N=2, videos N=3), these methods usually first transform the original data to high dimensional vectors in R^m^"^1^x^m^"^2^x^...^x^m^"^N, and then analyze the data in such a high dimensional space. In this paper, we propose a supervised dimensionality reduction method called neighborhood discriminative tensor mapping (NDTM), which can directly process the multidimensional data as tensors. Moreover, NDTM can make use of the local information of the dataset to achieve a better classification result. Experimental results on face recognition show the superiority of our algorithm to traditional dimensionality reduction methods.
Real-Time Monitoring and Pre-alarm System for Dangerous Mountains in the Railway Line
Authors: Shimei Cao, Hui Ju, Juan Liu, Zhiqiang Wu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

There appear frequently natural phenomena such as collapse, landslide along the railway line, which badly threaten the transport safety of the railway. This system adopts the method of auto-monitoring, and the monitoring content is the earth's surface deformation. At the front, through high-accuracy displacement sensor, the deformation signals of the dangerous mountains can be acquired, then data collection is carried out at the regular intervals, using the GPRS wireless communication technology, and the real-time monitoring and pre-alarm for dangerous mountains can be achieved. This method is simple, convenient and penetrating, with lower-cost and higher -accuracy.
Haptics in Augmented Reality
Authors: James Vallino, Christopher Brown
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

An augmented reality system merges synthetic sensory information into a user's perception of a three-dimensional environment. An important performance goal for an augmented reality system is that the user perceives a single seamless environment. In most augmented reality systems the user views a real world augmented only with visual information and is not provided with a means to interact with the virtual objects. In this paper we describe an augmented reality system that, in addition to visual augmentation, merges synthetic haptic input into the user's perception of the real environment. Our system uses a PHANToM haptic interface device to generate the haptic sensory input in real-time. The system allows user interactions such as moving or lifting a virtual object, and demonstrates interactions between virtual and real objects. Methods to provide proper visual occlusion between real and virtual objects are also described
On Regular Vertices of the Union of Planar Convex Objects
Authors: Esther Ezra, J&#x00e1;nos Pach, Micha Sharir
Venue: Discrete Computational Geometry (2009)

Let $\mathcal{C}$be a collection of n compact convex sets in the plane such that the boundaries of any pair of sets in $\mathcal{C}$intersect in at most s points for some constant s&#x2265;4. We show that the maximum number of regular vertices (intersection points of two boundaries that intersect twice) on the boundary of the union U of $\mathcal{C}$is O *(n 4/3), which improves earlier bounds due to Aronov&#x00a0;et al.&#x00a0;(Discrete Comput. Geom. 25, 203&#x2013;220, 2001). The bound is nearly tight in the worst case. In this paper, a bound of the form O *(f(n)) means that the actual bound is C &#x03b5; f(n)&#x22c5;n &#x03b5; for any &#x03b5;>0, where C &#x03b5; is a constant that depends on &#x03b5; (and generally tends to &#x221e; as &#x03b5; decreases to 0).