ppxscal/embedding_network huggingface dataset:
A Joint-Diffused Inpainting Model for Underexposure Image Preserving the Linear Geometric Structure
Authors: Jiying Wu Qiuqi Ruan Gaoyun An
Venue: Informatica (2009)

To restore the underexposure image, an illumination compensation inpainting model which employs the joint-diffused partial differential equations (PDEs) is proposed. Firstly, the novel model compensates the illumination effect in multi-scaled underexposure images respectively. Secondly, the information in the fused compensated image is restored by PDEs which diffuse the geometric property and gray information into the target region simultaneously. Experimental results demonstrate that the novel model can properly restore scratches while compensating the illumination effect in underexposure image, and the joint-diffused PDEs which are employed in it lead to a better performance than the conventional PDE inpainting models.
The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
Authors: Ángel Felipe, M. Teresa Ortuño, Gregorio Tirado
Venue: Computers and Operations Research (2009)

The double traveling salesman problem with multiple stacks (DTSPMS) is a vehicle routing problem that consists on finding the minimum total length tours in two separated networks, one for pickups and one for deliveries. A set of orders is given, each one consisting of a pickup location and a delivery location, and it is required to send an item from the former location to the latter one. Repacking is not allowed, but collected items can be packed in several rows in such a way that each row must obey the LIFO principle. In this paper, a variable neighborhood search approach using four new neighborhood structures is presented to solve the problem.
Face-to-Face Tabletop Remote Collaboration in Mixed Reality
Authors: Shinya Minatani, Itaru Kitahara, Yoshinari Kameda, Yuichi Ohta
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

This paper proposes a novel remote face-to-face Mixed Reality (MR) system that enables two people in distant places to share MR space. Challenging issues to realize such an MR system include capturing, sending, and rendering each user's appearance in real time. We developed a method to represent user's upper body and hands on the table as a single deformed-billboard. An MR Othello game is implemented as a test bed of the remote face-to-face MR system. Users can play the tabletop game as if their opponent were sitting across from the table, despite being physically separated. By detecting and sending the status of each real game board to the other site, both users feel that they are sharing tabletop objects.
Convergence of terrestrial and satellite mobile communication systems: an operator's perspective
Authors: Asad Ahmad Khan, Mo Adda, Carl Adams
Venue: International Journal of Mobile Communications (2009)

The rapid growth of innovation, development and convergence in the mobile communications industry has led to immense complexities in proposing business models for the future. The terrestrial mobile communications industry has seen rapid development in new air interface standards in contrast to the Mobile Satellite Systems (MSS) industry. From a terrestrial operator's perspective, this rapid development of new standards poses a threat to the currently deployed mobile network infrastructure. From an MSS operator's point of view, this rapid growth and subsequent deployment poses a threat to one of its core areas of competences: villages and underdeveloped areas. We present an industry level business model for the convergence of terrestrial and satellite mobile communication industry suitable for both terrestrial and MSS operators' perspective. Based upon the business convergence model, we identify the gaps in convergence, using 'stakeholder analysis' and identify potential opportunities in addition to filling in the gaps.
Absolute factoring of bidegree bivariate polynomials
Authors: G. Chèze, M. Elkadi, A. Galligo, M. Weimann
Venue: ACM Communications in Computer Algebra (2009)

We describe an efficient algorithm and an implementation for computing an absolute factorization of a bivariate polynomial with a given bidegree. Results of experimentation and an illustrative example are provided. This algorithm is a generalization of the previous one by Rupprecht-Galligo-Chèze which works after a generic change of coordinates. It relies on a general algorithmic approach based on a study of the curve defined by the polynomial to factorize in a toric surface.
Construction of invariant ellipsoids in the stabilization problem for a wheeled robot following a curvilinear path
Authors: A. V. Pesterev, L. B. Rapoport
Venue: Automation and Remote Control (2009)

The synthesis control problem for the plane motion of a wheeled robot is studied. The goal of the control is to bring the robot to an assigned curvilinear trajectory and to stabilize its motion along it in the presence of phase and control constraints. For a synthesized control law, invariant ellipsoids--quadratic approximations of the attraction domains of the target trajectory--are constructed, which allow one to check in the course of the robot motion whether the control law can stabilize motion along the current trajectory segment. To take into account constraints on the control, methods of absolute stability theory are applied. The construction of the invariant ellipsoids reduces to solving a system of linear matrix inequalities.
ISOLATOR: dynamically ensuring isolation in comcurrent programs
Authors: Sriram Rajamani, G. Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani
Venue: ACM SIGPLAN Notices (2009)

In this paper, we focus on concurrent programs that use locks to achieve isolation of data accessed by critical sections of code. We present ISOLATOR, an algorithm that guarantees isolation for well-behaved threads of a program that obey a locking discipline even in the presence of ill-behaved threads that disobey the locking discipline. ISOLATOR uses code instrumentation, data replication, and virtual memory protection to detect isolation violations and delays ill-behaved threads to ensure isolation. Our instrumentation scheme requires access only to the code of well-behaved threads. We have evaluated ISOLATOR on several benchmark programs and found that ISOLATOR can ensure isolation with reasonable runtime overheads. In addition, we present three general desiderata - safety, isolation, and permissiveness - for any scheme that attempts to ensure isolation, and formally prove that ISOLATOR satisfies all of these desiderata.
A network aware privacy model for online requests in trajectory data
Authors: Aris Gkoulalas-Divanis, Vassilios S. Verykios, Panayiotis Bozanis
Venue: Data Knowledge Engineering (2009)

In this work, we propose a privacy model for online user requests on trajectory data in location based services by utilizing an underlying network of user movement. The privacy model has been implemented as a framework that (i) reconstructs the user movement from a series of independent location updates, (ii) identifies routes where user privacy is at risk, and (iii) transforms user requests into anonymous equivalents. The framework is implemented on top of a spatial database engine that offers a significant portion of the necessary functionality, while provides for its effective deployment.
G-hash: towards fast kernel-based similarity search in large graph databases
Authors: Xiaohong Wang, Aaron Smalter, Jun Huan, Gerald H. Lushington
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and similarity search. With the fast accumulation of graph databases, similarity search in graph databases has emerged as an important research topic. Graph similarity search has applications in a wide range of domains including cheminformatics, bioinformatics, sensor network management, social network management, and XML documents, among others. Most of the current graph indexing methods focus on subgraph query processing, i.e. determining the set of database graphs that contains the query graph and hence do not directly support similarity search. In data mining and machine learning, various graph kernel functions have been designed to capture the intrinsic similarity of graphs. Though successful in constructing accurate predictive and classification models for supervised learning, graph kernel functions have (i) high computational complexity and (ii) non-trivial difficulty to be indexed in a graph database. Our objective is to bridge graph kernel function and similarity search in graph databases by proposing (i) a novel kernel-based similarity measurement and (ii) an efficient indexing structure for graph data management. Our method of similarity measurement builds upon local features extracted from each node and their neighboring nodes in graphs. A hash table is utilized to support efficient storage and fast search of the extracted local features. Using the hash table, a graph kernel function is defined to capture the intrinsic similarity of graphs and for fast similarity query processing. We have implemented our method, which we have named G-hash, and have demonstrated its utility on large chemical graph databases. Our results show that the G-hash method achieves state-of-the-art performance for k-nearest neighbor (k-NN) classification. Most importantly, the new similarity measurement and the index structure is scalable to large database with smaller indexing size, faster indexing construction time, and faster query processing time as compared to state-of-the-art indexing methods such as C-tree, gIndex, and GraphGrep.
Searching for critical angles in a convex cone
Authors: Alfredo Iusem, Alberto Seeger
Venue: Mathematical Programming: Series A and B (2009)

The concept of antipodality relative to a closed convex cone has been explored in detail in a recent work of ours. The antipodality problem consists of finding a pair of unit vectors in K achieving the maximal angle of the cone. Our attention now is focused not just in the maximal angle, but in the angular spectrum of the cone. By definition, the angular spectrum of a cone is the set of angles satisfying the stationarity (or criticality) condition associated to the maximization problem involved in the determination of the maximal angle. In the case of a polyhedral cone, the angular spectrum turns out to be a finite set. Among other results, we obtain an upper bound for the cardinality of this set. We also discuss the link between the critical angles of a cone K and the critical angles of its dual cone.
Fast communication: Statistical image modeling in the contourlet domain using contextual hidden Markov models
Authors: Zhiling Long, Nicolas H. Younan
Venue: Signal Processing (2009)

In this paper, a contourlet contextual hidden Markov model (C-CHMM) is established for modeling contourlet images by adapting a previous CHMM for wavelet images (W-CHMM). A mutual information based context design procedure is presented, through which a new context has been constructed. The C-CHMM is tested in a denoising application with promising results, which verifies its effectiveness. This new model is demonstrated to be a better model for contourlet images than the state of the art contourlet hidden Markov tree model. As a general image model, it also shows more potential than the baseline W-CHMM.
Die Another Day
Authors: Rudolf Fleischer
Venue: Theory of Computing Systems (2009)

The Hydra was a many-headed monster from Greek mythology that would immediately replace a head that was cut off by one or two new heads. It was the second task of Hercules to kill this monster. In an abstract sense, a Hydra can be modeled as a tree where the leaves are the heads, and when a head is cut off some subtrees get duplicated. Different Hydra species differ by which subtress can be duplicated in which multiplicity. Using some deep mathematics, it had been shown that two classes of Hydra species must always die, independent of the order in which heads are cut off. In this paper we identify three properties for a Hydra that are necessary and sufficient to make it immortal or force it to die. We also give a simple combinatorial proof for this classification. Now, if Hercules had known this&#x2026;
Concept unification of terms in different languages via web mining for Information Retrieval
Authors: Qing Li, Yuanzhu Peter Chen, Sung-Hyon Myaeng, Yun Jin, Bo-Yeong Kang
Venue: Information Processing and Management: an International Journal (2009)

For historical and cultural reasons, English phases, especially proper nouns and new words, frequently appear in Web pages written primarily in East Asian languages such as Chinese, Korean, and Japanese. Although such English terms and their equivalences in these East Asian languages refer to the same concept, they are often erroneously treated as independent index units in traditional Information Retrieval (IR). This paper describes the degree to which the problem arises in IR and proposes a novel technique to solve it. Our method first extracts English terms from native Web documents in an East Asian language, and then unifies the extracted terms and their equivalences in the native language as one index unit. For Cross-Language Information Retrieval (CLIR), one of the major hindrances to achieving retrieval performance at the level of Mono-Lingual Information Retrieval (MLIR) is the translation of terms in search queries which can not be found in a bilingual dictionary. The Web mining approach proposed in this paper for concept unification of terms in different languages can also be applied to solve this well-known challenge in CLIR. Experimental results based on NTCIR and KT-Set test collections show that the high translation precision of our approach greatly improves performance of both Mono-Lingual and Cross-Language Information Retrieval.
Learning outdoor mobile robot behaviors by example
Authors: Richard Roberts, Charles Pippin, Tucker Balch
Venue: Journal of Field Robotics (2009)

We present an implementation and analysis of a real-time, online, supervised learning system for nonparametrically learning behaviors from a human trainer on a mobile robot in outdoor environments. This approach enables a human operator to train and tune robot behaviors simply by driving the robot with a remote control. Hand-designed behaviors for outdoor environments often require many parameters, and complicated behaviors can be difficult or impossible to specify with a manageable number of parameters. Furthermore, their design requires knowledge of the robot's internal models and knowledge of the environment in which the behaviors will be used. In real-world scenarios, we can design new behaviors using our learning system much more quickly than we can write hand-crafted behaviors. We present the results of training the robot to execute several specialized and general-purpose behaviors, including traversing a slalom, staying near &ldquo;cover,&rdquo; navigating on paths, navigating in an obstacle field, and general-purpose navigation. Our system learns and executes most of these behaviors well after 1&ndash;4 h of operator training time. In quantitative tests, the learned behavior is not as robust as a hand-crafted behavior but often completes obstacle courses more quickly. Additionally, we identify the factors that influence the effectiveness of this approach and investigate the properties of the training data provided by the human trainer. On the basis of our analyses, we suggest future work to ensure sufficient training, handle conflicting training examples, model robot dynamics, and further investigate dimensionality reduction of perception features. &copy; 2009 Wiley Periodicals, Inc.
Propagation Effects in WiMAX Systems
Authors: Sharmini Enoch, Ifiok Otung
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

WiMAX is a promising technology for providing broadband wireless access. The WiMAX links are significantly affected by propagation impairments. In the high frequency range of 2-66 GHz links these impairments can lead to signal outage. Using the ITU-R and other existing models we evaluate the effects of individual environmental factors on the signal and thereby calculate the overall degradation caused. From the losses obtained at various frequencies and distances we find the availability of the signal at various BER. These results show that there are improvements needed to overcome the signal outages.
CAI system to identify the weak part of each student on the basis of enhanced-overlay-model
Authors: Kazuhiro Uenosono, Shinya Kaneko, Tomohiro Tachibana, Akinori Sato, Marie Hashidate, Seiichi Komiya
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

Recently, it is required to develop a Web-Based-CAI system to be able to learn efficiently due to the spread of Internet. However, since the order of giving a chain of decision frame does not change, without relation to whether a student of the CAI system can solve a given problem or not, he/she has also to learn the parts in his/her element. Therefore, he/she can not learn efficiently. Therefore, the authors propose a new instruction program and a new student model which improved the existent overlay model. The new model is easy to create the teaching materials, and it is able to grasp where the student's weak parts in detail are. This paper clarifies by concrete examples how this system grasps where are the student's weak parts by using what kind of student model and what kind of instruction program. The authors show the proposed student model and the proposed instruction program are effective through an experiment.
Fiber grating-based fabry-perot filters and applications
Authors: Xinyong Dong, Hwa-Yaw Tam, P. Shum
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In this paper, a distributed Fabry-Perot (F-P) interferometer filter has been formed in a fiber core by UV laser inscribing of two overlapped chirped-fiber Bragg gratings. Tuning of wavelength spacing has been realized by using a beam-bending chirp rate tuning method for the gratings. The achieved filter has been used for fiber lasers with different gain media of a Raman fiber amplifier or a semiconductor optical amplifier. Multiwavelength fiber laser operation with tunable wavelength spacing of 0.3-0.6 nm has been achieved.
Enabling cognitive load-aware AR with rateless coding on a wearable network
Authors: R. Razavi, M. Fleury, M. Ghanbari
Venue: Advances in Multimedia (2008)

Augmented reality (AR) on a head-mounted display is conveniently supported by a wearable wireless network. If, in addition, the AR display is moderated to take account of the cognitive load of the wearer, then additional biosensors form part of the network. In this paper, the impact of these additional traffic sources is assessed. Rateless coding is proposed to not only protect the fragile encoded video stream from wireless noise and interference but also to reduce coding overhead. The paper proposes a block-based form of rateless channel coding in which the unit of coding is a block within a packet. The contribution of this paper is that it minimizes energy consumption by reducing the overhead from forward error correction (FEC), while error correction properties are conserved. Compared to simple packet-based rateless coding, with this form of block-based coding, data loss is reduced and energy efficiency is improved. Cross-layer organization of piggy-backed response blocks must take place in response to feedback, as detailed in the paper. Compared also to variants of its default FEC scheme, results from a Bluetooth (IEEE 802.15.1) wireless network show a consistent improvement in energy consumption, packet arrival latency, and video quality at the AR display.
An Efficient Graphical Shot Verifier Incorporating Visual Rhythm
Authors: Hyeokman Kim, Jinho Lee, S. Moon-Ho Song
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Recent publications regarding video shot change detection algorithms show that abrupt shot changes are detected fairly well. However, gradual shot changes including wipes and dissolves are often missed or falsely detected. A robust shot change detection system, therefore, must include a shot verification step to further enhance the overall system performance. In this paper, we introduce the concept of the visual rhythm, an abstraction of the video. The visual rhythm is a single image, a sub-sampled version of a full video in which the sampling is performed in a pre-determined and in a systematic fashion. It is basically a representation of the video, which includes the overall content of the video. But most importantly, the visual rhythm contains patterns or visual features that allow the viewer/operator to distinguish and classify many different types of video effects (edits and otherwise): cuts, wipes, dissolves, fades, camera motions, object motions, flashlights, zooms, etc. The different video effects manifest themselves as different patterns on the visual rhythm. Using the visual rhythm, it becomes possible, without sequentially playing the entire video, to find false positive shots as well as undetected shots. Thus, inclusion of the visual rhythm in the shot verification process will aid the operator to verify detected shots as well as to find undetected shots fast and efficiently. For this purpose we have developed a new tool, a shot verifier including the visual rhythm. The usefulness of the visual rhythm during the shot verification process will be presented.
Bicluster Algorithm and Used in Market Analysis
Authors: Shuyong Liu, Yan Chen, Ming Yang, Rui Ding
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The premise of the enterprise that implements the product family architecture is the analysis to the sailed products history data, carrying on accuracy demarcation of the customer sets and products sets. But, the traditional cluster methods consist in simultaneous one partitioning of the set of products or the set of customers. In this paper we review the most widely used and successful biclustering techniques and use bicluster consist in simultaneous partitioning of the set of products and the set of customers. The bicluster algorithm is discussed. The results of the improved bicluster algorithm used in the product family architecture analysis show that, compared with traditional cluster methods, the quality of clustering results is enhanced obviously, the mining expression models are better, and the data possess a strong consistency with fluctuation on the condition.
A context switching streaming memory architecture to accelerate a neocortex model
Authors: Christopher N. Vutsinas, Tarek M. Taha, Kenneth L. Rice
Venue: Microprocessors Microsystems (2009)

A novel architecture to accelerate a neocortex inspired cognitive model is presented. The architecture utilizes a collection of context switchable processing elements (PEs). This enables time multiplexing of nodes in the model onto available PEs. A streaming memory system is designed to enable high-throughput computation and efficient use of memory resources. Several scheduling algorithms were examined to efficiently assign network nodes to the PEs. Multiple parallel FPGA-accelerated implementations were evaluated on a Cray XD1. Networks of varying complexity were tested and indicate that hardware acceleration can provide an average throughput gain of 184 times over equivalent parallel software implementations.