ppxscal/embedding_network huggingface dataset:
Auctions for Share-Averse Bidders
Authors: Mahyar Salek, David Kempe
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We introduce and study share-averse auctions, a class of auctions with allocation externalities, in which items can be allocated to arbitrarily many bidders, but the valuation of each individual bidder decreases as the items get allocated to more other bidders. For single-item auctions where players have incomplete information about each others' valuation, we characterize the truthful mechanism that maximizes the auctioneer's revenue, and analyze it for some interesting cases.We then move beyond single-item auctions, and analyze single-minded combinatorial auctions. We derive sufficient conditions for a truthful allocation in this setting. We also obtain a $\sqrt{m}$-approximation algorithm for maximizing social welfare, which is essentially tight unless P=NP.
Predicting of fan speed for energy saving in HVAC system based on adaptive network based fuzzy inference system
Authors: Servet Soyguder, Hasan Alli
Venue: Expert Systems with Applications: An International Journal (2009)

In this paper, a HVAC (heating, ventilating and air-conditioning) system has two different zones was designed and fan motor speed to minimize energy consumption of the HVAC system was controlled by a conventional (proportional-integral-derivative) PID controller. The desired temperatures were realized by variable flow-rate by considering the ambient temperature for each zone. The control algorithm was transformed for a programmable logic controller (PLC). The realized system has been controlled by PLC used PID control algorithm. The input-output data set of the HVAC system were first stored and than these data sets were used to predict the fan motor speed based on adaptive network based fuzzy inference system (ANFIS). In simulations, root-mean-square (RMS) and the coefficient of multiple determinations (R^2) as two performance measures were obtained to compare the predicted and actual values for model validation. All simulations have shown that the proposed method is more effective and controls the systems quite well.
Design of an Internet Accessible Visual Human Brain Database System
Authors: Jesper Fredriksson
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

We present here the ECHBD system as a new approach to the neuroscientific discipline of brainmapping. The complexity of the brain and the potentially vast amount of brain measurement data collected, shared, and analyzed by many different research groups make experimental brain research a key area for use of multimedia database systems in the role of environments for experimental science. The neuroscientific research community has created a demand for such a system capable of supporting analysis of 3D images of the brain, where ease of use and visual navigation are key issues. The focus of this paper is on how to handle large raster data sets in object-oriented databases, visual interaction and Internet accessible research environments.
A High-Speed Design of Montgomery Multiplier
Authors: Yibo Fan, Takeshi Ikenaga, Satoshi Goto
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

With the increase of key length used in public cryptographic algorithms such as RSA and ECC, the speed of Montgomery multiplication becomes a bottleneck. This paper proposes a high speed design of Montgomery multiplier. Firstly, a modified scalable high-radix Montgomery algorithm is proposed to reduce critical path. Secondly, a high-radix clock-saving dataflow is proposed to support high-radix operation and one clock cycle delay in dataflow. Finally, a hardware-reused architecture is proposed to reduce the hardware cost and a parallel radix-16 design of data path is proposed to accelerate the speed. By using HHNEC 0.25 μm standard cell library, the implementation results show that the total cost of Montgomery multiplier is 130 KGates, the clock frequency is 180 MHz and the throughput of 1024-bit RSA encryption is 352 kbps. This design is suitable to be used in high speed RSA or ECC encryption/decryption. As a scalable design, it supports any key-length encryption/decryption up to the size of on-chip memory.
Multicast routing with dynamic packet fragmentation
Authors: Young Hoon Kang, Jeff Sondeen, Jeff Draper
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Networks-on-Chip (NoCs) become a critical design factor as chip multiprocessors (CMPs) and systems on a chip (SoCs) scale up with technology. With fundamental benefits of high bandwidth and scalability in on-chip networks, a newly added multicast capability can further enhance the performance by reducing the network load and facilitate coherence protocols of many-core CMPs [10]. This paper proposes a novel multicast router with dynamic packet fragmentation in on-chip networks. Packet fragmentation is performed to avoid deadlock in blocking situations, releasing the hold of an output virtual channel (VC) and allowing another packet to use the freed VC. From circuit simulation of the design implemented with IBM 90nm technology, the proposed router reduces latency by 38.6% and consumes 9% less energy than a unicast baseline router at the baseline saturation.
Algorithms and Software for Nanomanipulation with Atomic Force Microscopes
Authors: A.A.G. Requicha, D.J. Arbuckle, B. Mokaberi, J. Yun
Venue: International Journal of Robotics Research (2009)

Interactive manipulation of nanoparticles by mechanically pushing them with the tip of an Atomic Force Microscope (AFM) is now performed routinely at many laboratories around the world. However, a human in the loop introduces significant inaccuracies and results in a very slow process, mostly because of the need to locate the particles before and after the manipulation operations in the presence of large spatial uncertainties, which are often comparable to the size of the particles. In this paper we describe the nanomanipulation systems developed at USC's Laboratory for Molecular Robotics during the last decade, culminating in a fully automatic system that is capable of accurately positioning small nanoparticles, with diameters of around 10 nm. This system uses software compensators for the non-linearities inherent in the piezoelectric actuators used in most AFMs. The planner and execution systems are described, as well as the software architecture of the systems. Experimental results are presented that validate the approach and show that nanoparticle patterns that would take hours to build interactively can now be built in minutes. Automatic operation makes it possible to use manipulation to construct much more complex nanostructures than those built in the past.
Coinductive big-step operational semantics
Authors: Xavier Leroy, Hervé Grall
Venue: Information and Computation (2009)

Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to describe diverging evaluations in addition to terminating evaluations. We formalize the connections between the coinductive big-step semantics and the standard small-step semantics, proving that both semantics are equivalent. We then study the use of coinductive big-step semantics in proofs of type soundness and proofs of semantic preservation for compilers. A methodological originality of this paper is that all results have been proved using the Coq proof assistant. We explain the proof-theoretic presentation of coinductive definitions and proofs offered by Coq, and show that it facilitates the discovery and the presentation of the results.
Cryptanalysis of a Hash Function Based on Norm Form Equations
Authors: Jean-Philippe Aumasson
Venue: Cryptologia (2009)

The cryptographic hash function Codefish is an outcome of a research project led by the company KRIPTO Research and the University of Debrecen in Hungary and sponsored by the European Union and the Hungarian Government. It is commercialised by KRIPTO Research for use in security protocols like digital signature, authentication, or message checksum. Codefish benefits from strong mathematical foundations, since it grounds its security on the difficulty of solving norm form equations. This paper demonstrates that it is insecure for cryptographic applications by presenting practical attacks for solving the problems Second Preimage and Collision.
Formal Reasoning about Fault Tolerance and Parallelism in Communicating Systems
Authors: Linas Laibinis, Elena Troubitsyna, Sari Leppänen
Venue: Methods, Models and Tools for Fault Tolerance (2009)

Telecommunication systems should have a high degree of availability, i.e., high probability of correct provision of requested services. To achieve this, correctness of software for such systems and system fault tolerance should be ensured. In our previous work we proposed an approach to formalisation and extension of Lyra --- a top-down service-oriented method for development of communicating systems. Lyra is based on transformation and decomposition of models expressed in UML2. We formalised Lyra in the B Method by proposing a set of formal specification and refinement patterns reflecting the essential Lyra models and transformations. At the same time, we also focused on integration of fault tolerance mechanisms into the entire Lyra development flow. In this paper, we extend our Lyra formalisation to model parallel execution of services. This significantly increases both complexity and flexibility of the presented models.
Research on the dynamic model of two head faces elastic spiale in relative rotation
Authors: Zunyi Wang, Ligang Lu, Kun Wang
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

A nonlinear differential equation of an elastic spiale with two head faces in relative rotation is built in this paper. Applying quantitative method to analyze autonomous system (two head faces equal moment system), It is proved that the harmonic solution exists under certain condition in the dynamic equation. And applying numerical method, double period bifurcation of system is also analyzed.
Seven New Block Cipher Structures with Provable Security against Differential Cryptanalysis
Authors: Jongsung Kim, Changhoon Lee, Jaechul Sung, Seokhie Hong, Sangjin Lee, Jongin Lim
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The design and analysis of block ciphers is an established field of study which has seen significant progress since the early 1990s. Nevertheless, what remains on an interesting direction to explore in this area is to design block ciphers with provable security against powerful known attacks such as differential and linear cryptanalysis. In this paper we introduce seven new block cipher structures, named Feistel-variant A, B, CLEFIA and MISTY-FO-variant A, B, C, D structures, and show that these structures are provably resistant against differential cryptanalysis. The main results of this paper are that the average differential probabilities over at least 2 rounds of Feistel-variant A structure and 1 round of Feistel-variant B structure are both upperbounded by p2, while the average differential probabilities over at least 5 rounds of CLEFIA, MISTY-FO-variant A, B, C and D structures are upperbounded by p4 + 2p5, p4, p4, 2p4 and 2p4, respectively, if the maximum differential probability of a round F function is p. We also give provable security for the Feistel-variant A, B and CLEFIA structures against linear cryptanalysis. Our results are attained under the assumption that all of components in our proposed structures are bijective. We expect that our results are useful to design block ciphers with provable security against differential and linear cryptanalysis.
How to Balance the Load on Heterogeneous Clusters
Authors: Marta Beltrán, Antonio Guzmán
Venue: International Journal of High Performance Computing Applications (2009)

The problem of computing a large set of different tasks on a set of heterogeneous resources connected by a network is very common nowadays in very different environments and load balancing is indispensable for achieving high performance and high throughput in systems such as clusters. Cluster heterogeneity increases the difficulty of balancing the load across the system nodes and, although the relationship between heterogeneity and load balancing is difficult to describe analytically, in this paper different models and performance metrics are proposed to describe heterogeneous cluster behavior and to perform an exhaustive analysis of the effects of heterogeneity on load balancing algorithm performance. This analysis allows us to propose efficient solutions capable of dealing with heterogeneity for all the load balancing algorithm stages. Furthermore, a load balancing algorithm has been implemented following these solutions to demonstrate, with experimental results, its efficiency on real heterogeneous clusters.
An Accurate and Robust Method for Detecting Video Shot Boundaries
Authors: Yihong Gong
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Many shot boundary detection methods have been proposed in recent years. Comparison studies have revealed that, among the existing methods, the local histogram-based method gives the highest precision rate if the highest shot boundary detection rate is not the first priority. In this paper, we present a new shot boundary detection method that surpasses the local histogram-based method in both the boundary detection rate and the precision rate. We propose a novel method of extracting color distributions from video frames to effectively suppress both the intra-frame and the inter-frame color variations caused by noise, minor illumination changes, as well as camera and object motions. We also provide a systematic approach to combine the color and the spatial features of video frames for more accurate shot boundary detection. The experimental evaluation confirms the superior performance of our proposed method.
Teaching and learning in information retrieval
Authors: Juan M. Fernández-Luna, Juan F. Huete, Andrew Macfarlane, Efthimis N. Efthimiadis
Venue: Information Retrieval (2009)

A literature review of pedagogical methods for teaching and learning information retrieval is presented. From the analysis of the literature a taxonomy was built and it is used to structure the paper. Information Retrieval (IR) is presented from different points of view: technical levels, educational goals, teaching and learning methods, assessment and curricula. The review is organized around two levels of abstraction which form a taxonomy that deals with the different aspects of pedagogy as applied to information retrieval. The first level looks at the technical level of delivering information retrieval concepts, and at the educational goals as articulated by the two main subject domains where IR is delivered: computer science (CS) and library and information science (LIS). The second level focuses on pedagogical issues, such as teaching and learning methods, delivery modes (classroom, online or e-learning), use of IR systems for teaching, assessment and feedback, and curricula design. The survey, and its bibliography, provides an overview of the pedagogical research carried out in the field of IR. It also provides a guide for educators on approaches that can be applied to improving the student learning experiences.
Beyond Cinema: The Art of Projection
Authors: Joachim Jager, Christopher Eamon, Anette Husch, Gabriele Knapstein
Venue:  (2007)

Wherever we go, we are surrounded by moving images. In art as in daily life, they have long since developed a life "beyond the cinema," scuttling the conventions of dark auditoriums for images projected onto walls, staged in specially-designed environments, and aggregated in multiples. Beyond Cinema centers around approximately 25 important film and video works, primarily the major installations of the 1990s, including the ravishing projections of Pipilotti Rist, the existentialist image of the body put forward by Bruce Nauman, the psychologically charged filmic spaces of Eija-Liisa Ahtila and the highly conceptual installations of Rodney Graham. Each elaborates on notions of the projected image that were developed in the 1960s, and groundbreaking works from Marcel Broodthaers, Dan Graham and Valie Export are presented to contextualize investigations of identity and body image, film cooperatives, representations of time and other topics.
Saving Electrical Power in a Surveillance Environment
Authors: Souvik Sen, Amit Kumar Das, Shyama Prosad Chowdhury
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

This paper proposes a smart video surveillance system with real-time moving object (primarily human) detection and identification for solving the problem of excessive power consumption in indoor public places. The proposed detection system is able to handle several known constraints such as changing illumination conditions, occlusion, clutter or even irrelevant extraneous motion. It keeps track of the number of humans in the vicinity and takes measures to gradually increase or decrease the luminosity depending on the number of people within its sight.
On the Performance of DS Spread-Spectrum Systems in AWGN Channel
Authors: Cheng Wang, Yuhang Yang, Rendong Ying
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

It is known that spread spectrum serves no help against white noise, but little literature gives explicit demonstration on this problem. In this paper, two receiver structures for direct-sequence spread spectrum (DSSS) systems are described, the error probabilities for the two receivers are obtained, and the equivalence of the two receivers is studied. It is shown that a system using spread spectrum does not achieve an improvement in error probability or signal-to-noise ratio (SNR) as long as the background noise is additive white Gaussian noise (AWGN).
Execution aware implementation of numeric PID controllers
Authors: Daniel Niculae, Claudiu Plaisanu, Daniel Bistriceanu
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

Control applications demand the use of strict timing constraints. The commonly used priority-based preemptive scheduling methods introduce jitter on task executions. This implies that the separation between consecutive starting times of a given control task is not constant. In the same time control theory assumes that sampling periods were constant. These variations on the sampling period of control task implementation can degrade the control system performance and in ultimately can induce instability in the system. In this paper, we present a practical approach to deal with sampling errors created by variations of sampling jitter thru appropriate variations of controller parameters. This are calculated on-line based on ROTS indications regarding the distance between this and the last instance of the control task.
Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking
Authors: Ralf Wimmer, Bettina Braitling, Bernd Becker
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

Since its introduction in 1999, bounded model checking has gained industrial relevance for detecting errors in digital and hybrid systems. One of the main reasons for this is that it always provides a counterexample when an erroneous execution trace is found. Such a counterexample can guide the designer while debugging the system.In this paper we are investigating how bounded model checking can be applied to generate counterexamples for a different kind of model--namely discrete-time Markov chains. Since in this case counterexamples in general do not consist of a single path to a safety-critical state, but of a potentially large set of paths, novel optimization techniques like loop-detection are applied not only to speed-up the counterexample computation, but also to reduce the size of the counterexamples significantly. We report on some experiments which demonstrate the practical applicability of our method.
CIVIL: support geo-collaboration with information visualization
Authors: Anna Wu, Xiaolong Zhang, Gregorio Convertino, John M. Carroll
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

Teams of specialized experts, such as emergency management planning teams, while making decisions need to efficiently pool domain-specific knowledge, synthesize relevant information, and keep track of collaborators activities at a low interaction cost. This requires tools that allow monitoring both low-level information (e.g., individual actions and external events) and higher-order activities (e.g., how members contribute to groupwork). This paper presents design of CIVIL, a system prototype developed to support map-based decision-making. We report our empirical evaluation of the effects of visualizations on the decision process and the final product.
Graph-Based Pairwise Learning to Rank for Video Search
Authors: Yuan Liu, Tao Mei, Jinhui Tang, Xiuqing Wu, Xian-Sheng Hua
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

Learning-based ranking is a promising approach to a variety of search tasks, which is aimed at automatically creating the ranking model based on training samples and machine learning techniques. However, the problem of lacking training samples labeled with relevancy degree or ranking orders is frequently encountered. To address this problem, we propose a novel graph-based learning to rank (GLRank) for video search by leveraging the vast amount of unlabeled samples. A relation graph is constructed by using sample (i.e., video shot) pairs rather than individual samples as vertices. Each vertex in this graph represents the "relevancy relation" between two samples in a pair (i.e., which sample is more relevant to the given query). Such relevancy relation is discovered through a set of pre-trained concept detectors and then propagated among the pairs. When all the pairs, constructed with the samples to be searched, receive the propagated relevancy relation, a round robin criterion is proposed to obtain the final ranking list. We have conducted comprehensive experiments on automatic video search task over TRECVID 2005-2007 benchmarks and shown significant and consistent improvements over the other state-of-the-art ranking approaches.
Video Watermarking by Space-Time Interest Points
Authors: Lei-Da Li, Bao-Long Guo, Jeng-Shyang Pan
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This letter presents a novel robust video watermarking scheme based on space-time interest points. These points correspond to inherent structures of the video so that they can be used as synchronization signals for watermark embedding and extraction. In the proposed scheme, local regions are generated using the space-time interest points, and the watermark is embedded into all the regions by quantization. It is a blind scheme and the watermark can be extracted from any position of the video. Experimental results show that the watermark is invisible and it can robustly survive traditional signal processing attacks and video-oriented attacks.