ppxscal/embedding_network huggingface dataset:
Pictures from Mongolia. Extracting the Top Elements from a Partially Ordered Set
Authors: Paolo Boldi, Flavio Chierichetti, Sebastiano Vigna
Venue: Theory of Computing Systems (2009)

You are back from that very long, marvellous journey. You have a thousand pictures, but your friends and relatives will stand just a few dozens. Choosing is a painful process, in particular when you cannot decide between the silent vastness of that desert and the idyllic picture of that tranquil, majestic lake. We are going to help.
Research study on managing web site quality in Croatia
Authors: Mario Spremic, Ivan Strugar
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

The consequences of growing Internet popularity can be found in almost all aspects of economy. Tourist industry represents one of the key components of Croatian economy and international exchange. This paper presents results of study performed to evaluate the quality of Web sites of Croatian high class hotels and their content. The study results show that management of Croatian top hotels is still using Web and Internet technology for presentation purposes solely and there is no conscious that its content needs to be managed well. It is obvious that Internet is still not adequately understand, accepted and integrated within hotel management in Croatia. The absence of the very basic information about the hotel and their offer, email form request for reservation information illustrate this hotel management attitude.
A QoS-aware mesh protocol for future home networks using autonomic architecture
Authors: Kaouthar Sethom, Tara Ali-Yahiya, Nassim Laga, Guy Pujolle
Venue: EURASIP Journal on Wireless Communications and Networking (2008)

Autonomic networking is an emerging approach for the research community to engineer systems and architectures that will increase the quality of service (QoS) and robustness of future network architectures. In this article, we investigate the key concept of adding a knowledge plane to enable the automated control and management of home resources taking into account wireless mesh topology basis. This new supplementary plane helps to make an intelligent decision to select network paths that have sufficient resources to satisfy the QoS requirements of the admitted connections.
Stability analysis of multiple-bottleneck networks
Authors: Lijun Wang, Lin Cai, Xinzhi Liu, Xuemin (Sherman) Shen, Junshan Zhang
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

A TCP/RED (Transmission Control Protocol/Random Early Detection) system with multiple-bottleneck links could be unstable even if its system parameters are set the same as those in a stable single-bottleneck system [D. Bauso, L. Giarre, G. Neglia, Active queue management stability in multiple bottleneck networks, IEEE ICC'04, vol. 4, June 2004, pp. 2267-2271]. In this paper, we study the stability of more general AIMD (Additive Increase and Multiplicative Decrease)/RED system with multiple bottlenecks that may incur non-negligible packet losses. We develop a general mathematical model to analyze network stability for both delay-free and delayed AIMD/RED systems. Sufficient conditions for the asymptotic stability of multiple-bottleneck systems with heterogeneous delays are derived by appealing to Lyapunov stability theory with Lyapunov-Razumikhin conditions, and these conditions can be easily assessed by using LMI (Linear Matrix Inequality) Toolbox. Numerical results with Matlab and simulation results with NS-2 are given to validate the analytical results.
Parallelization of Sphere-Decoding Methods
Authors: Rafael A. Trujillo, Antonio M. Vidal, Víctor M. García, Alberto González
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

Sphere-Decoding (SD) methods are branch-and-bound-like techniques used for optimal detection of digital communications signals over in wireless MIMO (Multiple input Multiple Output) channels. These methods look for the optimal solution in a tree of partial solutions; the size of the tree depends on the parameters of the problem (dimension of the channel matrix, cardinality of the alphabet), and such search can be much more expensive depending on these parameters. This search often has to be carried out in real time. This paper presents parallel versions of the Sphere-Decoding method for different parallel architectures with the goal of reducing the computation time.
Metrics for Phylogenetic Networks I: Generalizations of the Robinson-Foulds Metric
Authors: Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, Gabriel Valiente
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2009)

The assessment of phylogenetic network reconstruction methods requires the ability to compare phylogenetic networks. This is the first in a series of papers devoted to the analysis and comparison of metrics for tree-child time consistent phylogenetic networks on the same set of taxa. In this paper, we study three metrics that have already been introduced in the literature: the Robinson-Foulds distance, the tripartitions distance and the $\mu$-distance. They generalize to networks the classical Robinson-Foulds or partition distance for phylogenetic trees. We analyze the behavior of these metrics by studying their least and largest values and when they achieve them. As a by-product of this study, we obtain tight bounds on the size of a tree-child time consistent phylogenetic network.
A Novel Multi-reference Points Fingerprint Matching Method
Authors: Keming Mao, Guoren Wang, Changyong Yu, Yan Jin
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

Fingerprint matching is a challenging problem due to complex distortion in fingerprint image. In this paper, a multi-reference points matching method is proposed to solve the problem. First, a new feature description Minutiae-Cell, which is constructed by the minutiae and its neighbor ridges, is used to represent the local structure of the fingerprint. The proposed matching method consists of three stages, including the original matching stage ,the purifying stage and the fingal matching stage. In the original matching stage, minutiae pairs that potentially matched are found based on the Minutiae-Cell and the. Then the purifying stage is carried out to obtain the true matched minutiae pairs. Instead of using only one reference pair, the final matching stage deals with the remaining minutiae from template and query fingerprints by comparing their distance to the true matched minutiae pair set. The matching score is composed of the results of purifying stage and final matching stage. The proposed method overcomes the problems of distortion and noises existing in the fingerprint image. Experimental results show that the performance of the proposed algorithm is satisfying.
Behavior transition between biped and quadruped walking by using bifurcation
Authors: Kenji Asa, Kosei Ishimura, Mitsuo Wada
Venue: Robotics and Autonomous Systems (2009)

In this research, we focus our discussion on the discontinuous dynamic behavior transition of a walking robot. For the transition, bifurcation of potential function is utilized. We demonstrate the behavior transition of the walking robot between biped and quadruped locomotion as an adaptation to the environment depending on the gradient of a slope. The behavior transition is carried out by using bifurcation of parameters used for control. We also show the effectiveness of hysteresis in the transition.
On controlling light transport in poor visibility environments
Authors: Mohit Gupta, Srinivasa G. Narasimhan, Yoav Y. Schechner
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

Poor visibility conditions due to murky water, bad weather, dust and smoke severely impede the performance of vision systems. Passive methods have been used to restore scene contrast under moderate visibility by digital postprocessing. However, these methods are ineffective when the quality of acquired images is poor to begin with. In this work, we design active lighting and sensing systems for controlling light transport before image formation, and hence obtain higher quality data. First, we present a technique of polarized light striping based on combining polarization imaging and structured light striping. We show that this technique out-performs different existing illumination and sensing methodologies. Second, we present a numerical approach for computing the optimal relative sensor-source position, which results in the best quality image. Our analysis accounts for the limits imposed by sensor noise.
A method for optimising the nesting of multiple, highly complex shapes using a modified simulated annealing algorithm
Authors: R. La Brooy
Venue: International Journal of Systems Science (2009)

Nesting is a process where shapes are orientated and located optimally on a parent substrate. Effective nesting packs the parts optimally and maximises the remnant on the substrate. This article describes how simulated annealing (SA) was made to operate effectively as the optimisation process. Key issues affecting the use of SA are described. The methods described were integrated into a software package and applied to the aerospace and steel industries. This method operated in real-time and produced quality nesting solutions.
Computing Only Minimal Answers in Disjunctive Deductive Databases
Authors: C. A. Johnson
Venue: Journal of Automated Reasoning (2009)

A method is presented for computing minimal answers of the form $\bigvee {\cal A}$ in disjunctive deductive databases under the disjunctive stable model semantics. Such answers are constructed by repeatedly extending partial answers. Our method is complete (in that every minimal answer can be computed) and does not admit redundancy (in the sense that every partial answer generated can be extended to a minimal answer), thus no non-minimal answer is generated. The method does not (necessarily) require the computation of models of the database in their entirety. A partitioning of the database into extensional and intensional components is employed in order to overcome the problems caused by the possible non-existence of disjunctive stable models, and a form of compilation is presented as a means of simplifying and improving the efficiency of the run-time computation, which then reduces to relatively trivial processing within the extensional database. In addition, the output from this compilation process has the significant advantage of being immune to updates to the extensional database. Other forms of database pre-processing are also considered, and three transformations are presented mapping a database onto an equivalent positive database, non-disjunctive database, and set of conditional facts.
An extension of the conjugate residual method to nonsymmetric linear systems
Authors: T. Sogabe, M. Sugihara, S. -L. Zhang
Venue: Journal of Computational and Applied Mathematics (2009)

The Conjugate Gradient (CG) method and the Conjugate Residual (CR) method are Krylov subspace methods for solving symmetric (positive definite) linear systems. To solve nonsymmetric linear systems, the Bi-Conjugate Gradient (Bi-CG) method has been proposed as an extension of CG. Bi-CG has attractive short-term recurrences, and it is the basis for the successful variants such as Bi-CGSTAB. In this paper, we extend CR to nonsymmetric linear systems with the aim of finding an alternative basic solver. Numerical experiments show that the resulting algorithm with short-term recurrences often gives smoother convergence behavior than Bi-CG. Hence, it may take the place of Bi-CG for the successful variants.
Personal area network using human body properties
Authors: Jaroslav Cechak, Vojtech Hruby
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

The paper deals with the possibility of data transfer, using a human body as a transfer channel. A physically separated transmitter and receiver are located in clothes on various parts of the human body. The individual parts that perform data communication between each other are referred to as Personal Area Network - PAN. This paper includes starting requirements on data communication through the human body and also actual parameters taken on the human body in the function of the transfer channel. The end of the paper describes construction of a vibration alarm device that was assembled and verified. Although this paper concentrates predominantly on military applications, the operation principle of data transfer over the human body that was used here can be directly implemented to purely civil usage.
A wedge product of association schemes
Authors: Mikhail Muzychuk
Venue: European Journal of Combinatorics (2009)

A wedge product of Schur rings was introduced by K.H. Leung and S.H. Man in order to classify Schur rings over a cyclic group. The wedge product presented by Leung and Man was defined in an internal form. The external version of wedge product of Schur rings was described by Evdokimov and Ponomarenko under the name ''generalized wreath product''. The goal of this paper is to generalize this operation to arbitrary association schemes.
Multi-Airport System Simulation and Optimization Research
Authors: Wei Gao, Siying Xu
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

With the development of air traffic transportation industry, present design capacity can not meet future demand. Multi-airport system is the research object of this paper. The main influencing factor of multi-airport system capacity is partial route legs have less capacities. This paper combines the restricted optimization method of Simultaneous Perturbation Stochastic Approximation (SPSA) and hierarchical optimization model based on points’ importance level. Through simulate the real situation, the multi-airport system optimization model and algorithm is get. This paper chooses Pearl River Delta Region (PRDR) as the test case to explain the parameters’ setmodes and the steps of optimization. After simulation, the outcome of flights timetable based on decreasing delays was get, and it certifies the validity of simulation and optimization. The delay cost of multi-airport system is decreasing. The operating efficiency and economic benefit are increasing.
Modeling and Simulation of Wireless Sensor Network (WSN) with SpecC and SystemC
Authors: M. Rafiee, M. B. Ghaznavi-Ghoushchi, S. Kheiri, B. Seyfe
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

As the complexity of systems is rapidly growing, the designers are moving towards use System Level Design Languages (SLDL) such as SystemC and SpecC. In this paper we use SystemC and SpecC languages for modeling and simulation of Wireless Sensor Networks (WSN). First we start on simple ECO model and add modular sections as increases as the complexity. In the next step, we add data encryption using DES algorithm for security reasons. The future steps include modeling the idel/active/work phases for nodes and we add Attenuation-Transmission-power checking model for estimation power dissipation among nodes. We also include IEEE 802.15.4 protocol module and buffer insertion module. We have simulated the proposed framework with simulation of 3, 7 and 11 nodes in 3000 ms. The fidelity of simulations with SpecC and SytemC meet with 9.8% error and RMSD 4%. Our preliminary results from deployment of the functional-proven SystemC models into SystemC synthesizers, urges that it may be directly used in early stages of WSN nodes synthesis.
Implementation of the Newsvendor Model with Clearance Pricing: How to (and How Not to) Estimate a Salvage Value
Authors: Gérard P. Cachon, A. Gürhan Kök
Venue: Manufacturing Service Operations Management (2007)

The newsvendor model is designed to decide how much of a product to order when the product is to be sold over a short selling season with stochastic demand and there are no additional opportunities to replenish inventory. There are many practical situations that reasonably conform to those assumptions, but the traditional newsvendor model also assumes a fixed salvage value: all inventory left over at the end of the season is sold off at a fixed per-unit price. The fixed salvage value assumption is questionable when a clearance price is rationally chosen in response to the events observed during the selling season: a deep discount should be taken if there is plenty of inventory remaining at the end of the season, whereas a shallow discount is appropriate for a product with higher than expected demand. This paper solves for the optimal order quantity in the newsvendor model, assuming rational clearance pricing. We then study the performance of the traditional newsvendor model. The key to effective implementation of the traditional newsvendor model is choosing an appropriate fixed salvage value. (We show that an optimal order quantity cannot be generally achieved by merely enhancing the traditional newsvendor model to include a nonlinear salvage value function.) We demonstrate that several intuitive methods for estimating the salvage value can lead to an excessively large order quantity and a substantial profit loss. Even though the traditional model can result in poor performance, the model seems as if it is working correctly: the order quantity chosen is optimal given the salvage value inputted to the model, and the observed salvage value given the chosen order quantity equals the inputted one. We discuss how to estimate a salvage value that leads the traditional newsvendor model to the optimal or near-optimal order quantity. Our results highlight the importance of understanding how a model can interact with its own inputs: when inputs to a model are influenced by the decisions of the model, care is needed to appreciate how that interaction influences the decisions recommended by the model and how the model's inputs should be estimated.
Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan
Authors: Fawaz S. Al-Anzi, Ali Allahverdi
Venue: Computers and Operations Research (2009)

We consider a two-stage assembly flowshop scheduling problem with the objective of minimizing a weighted sum of makespan and maximum lateness. The problem is known to be NP-hard, and therefore, we propose heuristics to solve the problem. The proposed heuristics are Tabu search (Tabu), particle swarm optimization (PSO), and self-adaptive differential evolution (SDE). An extensive computational experiment is conducted to compare performances of the proposed heuristics. The computational experiment reveals that both PSO and SDE are much superior to Tabu. Moreover, it is statistically shown that PSO performs better than SDE. The computation times of both PSO and SDE are close to each other and they are less than 40 and 45s, respectively, for the largest size problem considered.
A new method for parameter estimation of edge-preserving regularization in image restoration
Authors: Xiaojuan Gu, Li Gao
Venue: Journal of Computational and Applied Mathematics (2009)

In image restoration, the so-called edge-preserving regularization method is used to solve an optimization problem whose objective function has a data fidelity term and a regularization term, the two terms are balanced by a parameter @l. In some aspect, the value of @l determines the quality of images. In this paper, we establish a new model to estimate the parameter and propose an algorithm to solve the problem. In order to improve the quality of images, in our algorithm, an image is divided into some blocks. On each block, a corresponding value of @l has to be determined. Numerical experiments are reported which show efficiency of our method.
Sequential Display of Multimedia Instructions: Effect on Users' Understanding
Authors: Mireille Betrancourt
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

As computerized documents proliferate in every activity areas, the instructional domain has been overwhelmed with multimedia learning tools that make an extensive use of fancy graphics and animations. However, their design is usually based on intuition rather than on empirical evidence, and little, if nothing, is known about their actual effect on users. Our research investigates how dynamic options in multimedia documents affect users' understanding and memorization processes. We focused on a device called "sequential display", where clusters of information in a single document are displayed gradually, in a meaningful sequence. The results of a preliminary experiment showed that the users memorized the organisation used to display the document. Moreover, this organization affects their performance in further problem solving situations. Thus, these findings suggest that dynamic features may be effective instructional devices, providing that their use is based on actual results from the cognitive and educational research. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A framework for flexible summarization of racquet sports video using multiple modalities
Authors: Chunxi Liu, Qingming Huang, Shuqiang Jiang, Liyuan Xing, Qixiang Ye, Wen Gao
Venue: Computer Vision and Image Understanding (2009)

While most existing sports video research focuses on detecting event from soccer and baseball etc., little work has been contributed to flexible content summarization on racquet sports video, e.g. tennis, table tennis etc. By taking advantages of the periodicity of video shot content and audio keywords in the racquet sports video, we propose a novel flexible video content summarization framework. Our approach combines the structure event detection method with the highlight ranking algorithm. Firstly, unsupervised shot clustering and supervised audio classification are performed to obtain the visual and audio mid-level patterns respectively. Then, a temporal voting scheme for structure event detection is proposed by utilizing the correspondence between audio and video content. Finally, by using the affective features extracted from the detected events, a linear highlight model is adopted to rank the detected events in terms of their exciting degrees. Experimental results show that the proposed approach is effective.
A Novel Visual Cryptography Scheme
Authors: Debasish Jena, Sanjay Kumar Jena
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Visual Cryptography is a new cryptographic technique which allows visual information (pictures, text, etc.) to be encrypted in such a way that the decryption can be performed by human, without any decryption algorithm. Here we propose a Data hiding in halftone images using conjugate ordered dithering (DHCOD) algorithm which is a modified version of Data hiding in halftone images using conjugate error diffusion technique (DHCED). We use this DHOCD algorithm for proposing a new three phase visual cryptography scheme. DHCOD technique is used to hide an binary visual pattern in two or more ordered dither halftone images, which can be from the same or different multi-tone images. In proposed scheme we shall generate the shares using basic visual cryptography model and then embed them into a cover image using a DHCOD technique, so that the shares will be more secure and meaningful.