ppxscal/embedding_network huggingface dataset:
Automatic identification of digital video based on shot-level sequence matching
Authors: Jian Zhou, Xiao-Ping Zhang
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

To locate a video clip in large collections is very important for retrieval applications, especially for digital rights management. In this paper, we present a novel technique for automatic identification of digital video. This new algorithm is based on dynamic programming that fully uses the temporal dimension to measure the similarity between two video sequences. A normalized chromaticity histogram is used as a feature which is illumination-invariant. Dynamic programming is applied on shot-level to find the optimal nonlinear mapping between video sequences. Two new normalized distance measures are presented for video sequence matching. One measure is based on the normalization of the optimal path found by dynamic programming. The other measure combines both the visual features and the temporal information. Experimental results show that the shot-level approach is robust to frame rate conversion, color correction, and compressions. The proposed distance measures are suitable for variable-length comparisons.
Study on the Configuration Space Based Algorithmic Path Planning of Industrial Robots in an Unstructured Congested Three-Dimensional Space: An Approach Using Visibility Map
Authors: Debanik Roy
Venue: Journal of Intelligent and Robotic Systems (2005)

Obstacle avoidance and subsequently collision-free path planning is a potential field of robotics research, specially in the perspective of today's industrial scenario. In this paper, the celebrated method, namely, Visibility Map is being used to generate feasible collision-free near-optimal safe path(s) for a three- dimensional congested robot workspace using heuristic algorithms. The final path is obtainable in terms of joint configurations, by considering the Configuration Space of the task-space. The developed algorithms have been verified by considering typical 2D workspaces at the onset, cluttered with different obstacles (convex and/or concave) with regular geometries and later on, with the real spatial manifold. The outcome of these algorithms has been found instrumental in programming an industrial robot in order to perform a series of task in the shop-floor. A case-study reveals the effectiveness of the heuristics involved in the developed algorithms, by virtue of the successful application in an unstructured industrial environment to carry out robotized material handling operation in real-time.
Instant turnaround revisited: our wit goes BATty
Authors: Glen D. Kreider, Francis M. Sim
Venue: ACM SIGSOC Bulletin (1973)

In earlier reports (Kreider, <u>et. al</u>., 1970; Williams, <u>et</u>. <u>al</u>., 1970; Sim, <u>et. al</u>., 1971a, Sim, <u>et. al.</u>, 1971b) we have described and discussed the general character and some social science applications of a system of instructional computing developed at the Pennsylvania State University. The service is one of "Speed Batch" processing (Bernitt, 1971) which gives immediate response to "small" jobs. It was originally based on the WATFOR dialect and processor, so we have used the acronym WIT (for <u>W</u>atfor <u>I</u>nstant <u>T</u>urnaround) to refer to the system. In this report we note progress in the further development of the service. In a later report we will discuss applications in social science instruction.
'Build or Buy' Your Next Porsche?: Thinking Clearly About the Component Approach to Development
Authors: Rob Meyer
Venue: Ubiquity (2005)

Rob Meyer, CEO of the Numerical Algorithms Group, wants you to be thinking clearly when you consider the component approach to development.
An Improved Parallel Interference Cancellation Algorithm in DS/CDMA Communication System
Authors: Geng Xin, Hu Hanying, Liu Zhengjun
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

This paper introduces an improved parallel interference cancellation algorithm in a DS/CDMA communication system. Because of the lack of the energy information of interfering signal in the conventional parallel interference cancellation (PIC) algorithm, the detection performance of the weak signals is not improved. The algorithm introduced in this paper takes advantage of the virtue of successive interference cancellation (SIC) algorithm and improves greatly the detection performance of weak signals by reducing the error of multi-access interference estimation through classifying the signals. Bit error rate of this improved algorithm has theoretically been analyzed in detail. Simulation results have been given for a multitude of different situations. Finally, it is concluded that the performance of this new algorithm is more desirable than that of the conventional one.
Language Grid: An Infrastructure for Intercultural Collaboration
Authors: Toru Ishida
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

To increase the accessibility and usability of online language services, this paper proposes the language grid to create composite language services for various communities. The language grid is called "horizontal," when the grid connects the standard languages of nations, or "vertical," when the grid combines the language services generated by communities. Semantic Web service technologies are applied in a human-centered fashion, to create composite language services through the collaboration of users and agents. Three example scenarios are given to illustrate how the language grid will organize standard and community language services for intercultural collaboration activities.
Estimating the Affine Transformation between Textures
Authors: Angeline M. Loh, Andrew Zisserman
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

A method is presented that solves the affine transformation between two images of the same texture. This problem is encountered in many areas of Computer Vision such as object retexturing and it is an essential part of many Shape-from-Texturealgorithms. The new method is based on transforming each image such that the texture is isotropic, then solving the similarity transformation between the isotropic versions. We point out the difficulties in using other methods such as feature point methods. Quantitative results are given for images created with the Brodatz textures, followed by results for real images. This is followed by an application of the method: placing an object on the textured surface.
Laser scanning for the interactive walk-through fogScreen
Authors: Ismo Rakkolainen, Karri Palovuori
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

FogScreen is a free space 2D projection screen, which enables to touch and walk through an immaterial image. FogScreen consists of flowing air with a little visible humidity in the center of flow, and enables high-quality projected images in thin air, and many new applications.The FogScreen can be made interactive. Robust tracking of the user's pointing is a key element of the interactive system. In this short paper we present robust tracking employing laser scanning.
Pricing and Charging for QoS
Authors: Safiullah Faizullah, Ivan Marsic
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

We have introduced and studied a scalable pricing scheme as an effective regulatory tool that provides proper incentives so that users' self-interest will lead them to modify their usage according to their needs. This scheme resulted in better overall network utilization and enhanced users' satisfaction. In this work, we further study the scheme from revenue and performance perspective. Simulation results suggest that revenue and network utilization play a vital role in achieving a better usage behavior as well as for service providers to be reasonable in charging for QoS in Internetworks. The implementation and usage costs of the framework are low.
WI-posets, graph complexes and Z2-equivalences
Authors: Rade T. Živaljević
Venue: Journal of Combinatorial Theory Series A (2005)

An evergreen theme in topological graph theory is the study of graph complexes, (Proof of the Lovász conjecture, arXiv:math.CO/0402395, 2, 2004; J. Combin. Theory Ser. A 25 (1978) 319-324; Using the Borsuk-Ulam Theorem, Lectures on Topological Methods in Combinatorics and Geometry, Springer Universitext, Berlin, 2003; [17]). Many of these complexes are Z2-spaces and the associated Z2-index IndZ2(X) is an invariant of great importance for estimating the chromatic numbers of graphs. We introduce WI-posets (Definition 2) as intermediate objects and emphasize the importance of Bredon's theorem (Theorem 9) which allows us to use standard tools of topological combinatorics for comparison of Z2-homotopy types of Z2-posets. Among the consequences of general results are known and new results about Z2-homotopy types of graph complexes. It turns out that, in spite of great variety of approaches and definitions, all Z2-graph complexes associated to G can be viewed as avatars of the same object, as long as their Z2-homotopy types are concerned. Among the applications are a proof that each finite, free Z2-complex is a graph complex and an evaluation of Z2-homotopy types of complexes Ind(Cn) of independence sets in a cycle Cn.
A New Architecture for fast Arithmetic Coding in H.264 Advanced Video Coder
Authors: Roberto R. Osorio, Javier D. Bruguera
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

In this work, a new architecture for binary arithmetic coding is presented in the context of the new AVC/H.264 standard for video coding. Among the new technologies included in AVC/H.264 a Context Adaptive Binary Arithmetic Coder (CABAC) is used that outperforms the baseline entropy coder in a significant manner. In this work we justify the need for a new architecture that implements the unique characteristics of CABAC that are not found in other implementations of arithmetic coding. We show that a fast architecture is needed that combines short cycle time and application-aware scheduling in order to accomplish with the high computational demands. A number of optimizations are introduced that allow processing several symbols per cycle and reduce data binarization overhead. Implementation results are shown for a Virtex-II FPGA and the main conclusions are presented.
Cost Monitoring and Enforcement in the Real-Time Specification for Java - A Formal Evaluation
Authors: Osmar Marchi dos Santos, Andy Wellings
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

The Real-Time Specification for Java (RTSJ) provides an integrated approach to scheduling periodic threads and monitoring their CPU execution time. It defines a cost enforcement model whereby a periodic thread is suspended when it consumes more CPU time (budget) than it requested. However, the support for this model is optional and it is generally not given by most implementations. Consequently, this aspect of the specification has not been rigorously evaluated. In this paper we define a formal model of the RTSJ cost monitoring and enforcement approach using the extended timed automata formalism provided in the UPPAAL tool. Using the model, properties are explored and it is shown that whilst implementations that conform to the RTSJ specification are free from potential deadlock, the specification allows an implementation, under certain circumstances, to give a periodic thread more than its CPU budget in one period. These circumstances are detailed and a correction to the RTSJ specificationis suggested to remove this anomaly.
Feedback EDF Scheduling of Real-Time Tasks Exploiting Dynamic Voltage Scaling
Authors: Yifan Zhu, Frank Mueller
Venue: Real-Time Systems (2005)

Many embedded systems are constrained by limits on power consumption, which are reflected in the design and implementation for conserving their energy utilization. Dynamic voltage scaling (DVS) has become a promising method for embedded systems to exploit multiple voltage and frequency levels and to prolong their battery life. However, pure DVS techniques do not perform well for systems with dynamic workloads where the job execution times vary significantly. In this paper, we present a novel approach combining feedback control with DVS schemes targeting hard real-time systems with dynamic workloads. Our method relies strictly on operating system support by integrating a DVS scheduler and a feedback controller within the earliest-deadline-first (EDF) scheduling algorithm. Each task is divided into two portions. The objective within the first portion is to exploit frequency scaling for the average execution time. Static and dynamic slack is accumulated for each task with slack-passing and preemption handling schemes. The objective within the second portion is to meet the hard real-time deadline requirements up to the worst-case execution time following a last-chance approach. Feedback control techniques make the system capable of selecting the right frequency and voltage settings for the first portion, as well as guaranteeing hard real-time requirements for the overall task. A feedback control model is given to describe our feedback DVS scheduler, which is used to analyze the system's stability. Simulation experiments demonstrate the ability of our algorithm to save up to 29% more energy than previous work for task sets with different dynamic workload characteristics.
Introducing computers and the Internet to older users: findings from the Care OnLine project
Authors: Zaheer Osman, David Poulson, Colette Nicolle
Venue: Universal Access in the Information Society (2005)

This paper reports the findings from a two-year pilot project called Care OnLine (COL). The COL project has introduced computers and the Internet into the homes of 50 elderly and vulnerable volunteers and provided shared Internet access at five shared schemes housing older people across the Market Harbrorough district of Leicestershire. A specific web portal was designed that was geared towards older and vulnerable people and provided information about the different services available to them, as well as links to a variety of websites. All the volunteers were provided with training in using computers and the Internet, and were interviewed regarding their experiences. Findings related to their attitudes towards, and experiences of, computers and the Internet are reported. The impact of having access to computers and the Internet on the volunteers&#x2019; lives and some lessons learnt from providing such a scheme are also discussed.
Analysis and Testing for Error Tolerant Motion Estimation
Authors: Hyukjune Chung, Antonio Ortega
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

We propose a novel system-level error tolerance approach specifically targeted for multimedia compression algorithms. In particular we focus on the motion estimation process performed by most video encoders. While current manufacturing process classifies fabricated systems into two classes, namely, perfect and imperfect, our proposed scheme employs categories which are based on acceptable/unacceptable performance degradation. By enabling the use of systems that would otherwise have been discarded we seek to increase the overall yield rate in the system fabrication process. To achieve this, we propose testing algorithms that aim at determining if faults in a given chip produce acceptable performance degradation, and we propose a technique which can cancel the effect of those among the acceptable faults that can be compensated.
APS: Agent's LearningWith Imperfect Recall
Authors: Damian Dudek, Michal Kubisz, Aleksander Zgrzywa
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

We present a new method of incremental, statistical learning, which is suitable for knowledge-based systems, especially software agents. The method is based on the imperfect recall assumption, according to which an agent does not store all the past observations. However it does preserve general rules concerning the past, that can be potentially useful for improving agent's action. During its performance an agent stores observations in the history. When system resources are idle and the size of the history is sufficient as for its statistical significance, the stored facts are analysed by means of data mining techniques, and disposed afterwards. The discovered rules are combined with the former rule base, so that the final rule set is approximately the same, as if it was obtained on the whole history.
Development of New Method of Primer Design Based on Genomewide for SNP Typing under Problem Solving Environment on Grid
Authors: Takashige Oroguchi, Tomofumi Inoue, Isao Tomabechi, Yoshio Tago, Toru Makino
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

How primers are specific to target base sequences containing Single Nucleotide Polymorphism (SNP) is considered as the key to SNP analysis. In this study, we have attempted to develop high-accuracy primer design. For that purpose, we have developed problem solving environment (PSE) on grid system and established an environment to execute Basic Local Alignment Search Tool (BLAST) genome-widely. We have applied this primer design system in the PSE to drug-metabolizing enzyme and verified that this new design method generated highly accurate primers compared with the existing methods by means of computation and experiment. We have also developed a workflow system for the PSE on the grid system and achieved remarkable improvement in efficiency of the primer design. The new method have achieved more than 10 times efficiency compared with the existing methods.
Test input generation for red-black trees using abstraction
Authors: Willem Visser, Corina S. Păsăreanu, Radek Pelánek
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

We consider the problem of test input generation for code that manipulates complex data structures. Test inputs are sequences of method calls from the data structure interface. We describe test input generation techniques that rely on state matching to avoid generation of redundant tests. Exhaustive techniques use explicit state model checking to explore all the possible test sequences up to predefined input sizes. Lossy techniques rely on abstraction mappings to compute and store abstract versions of the concrete states; they explore under-approximations of all the possible test sequences. We have implemented the techniques on top of the Java PathFinder model checker and we evaluate them using a Java implementation of red-black trees.
Multimedia streaming congestion control over heterogeneous networks: from distributed computation and end-to-end perspectives
Authors: Hsu-Feng Hsiao
Venue:  (2005)

In a best effort networking environment, efficient and fair congestion control is highly desired for every traffic flow to share the bandwidth appropriately. We look at the multimedia congestion control issues from both distributed computation and end-to-end perspectives. Besides the implementation of multimedia conferencing and streaming applications over the extended contend distribution network, we propose a congestion control algorithm for streaming layered multimedia over wired/wireless channels and perform thorough evaluation in terms of scalability, convergence, fairness, and effectiveness of the proposed distributed computation algorithm, which uses a small portion of packet header to convey control signal along with the reserved packet length information to adapt to the staircase-like bandwidth of streaming layered multimedia. For end-to-end approach, the packet loss information serves as an index of network congestion for effective rate adjustment, wireless packet loss due to impaired wireless environment can mistakenly lead to dramatic performance degradation. For congestion control applied to end-to-end points at application layer, we propose an adaptive congestion control algorithm so that a receiver can acquire an appropriate share of bandwidth that is protected by adaptive Maximum Distance Separable erasure codes according to the estimation of wireless channel condition, packet loss classification, and end-to-end available bandwidth.
A Low-Power FIR Filter Using Combined Residue and Radix-2 Signed-Digit Representation
Authors: Andreas Lindahl, Lars Bengtsson
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

This paper presents a FIR filter combining residue (RNS) and Radix-2 Signed Digit (SD) representation. RNS offers parallelization of the computations and SD carry-free additions. The moduli set {2^n 1 - 2^n 2^n + 1} is used reducing the complexity of the RNS arithmetic units. The evaluated filters have 8, 12 and 16 taps, binary word lengths between 16 and 64 bits, and have been synthesized using a UMC 0.13 m CMOS cell library with 8 metal layers. Power, delay, and area comparisons are made with equivalent 2¿s complement designs. The Area-Delay and Area-Delay-Power products shows that reduction in both power and area at the same filter throughput can be expected.
A High Performance Cluster-Based Flooding Algorithm for Wireless Ad Hoc Networks
Authors: Reza Purtoosi, Hassan Taheri, Abbas Mohammadi, Foroohar Foroozan
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

A cluster-based flooding algorithm for wireless ad hoc networks has been proposed. This mechanism uses a novel gateway usage approach. Dividing the flooding traffic to internal and external from each cluster point of view, gateway selection is just needed for the internal traffic. This simplifies the gateway selection method as well as improving the flooding performance parameters. The stability-based clustering algorithm has been used as the underlying clustering method. The stability advantage of this clustering method has been shown before by comprehensive simulations over different mobile environments. The performance parameters of the proposed flooding algorithm have been observed using simulations conducted over a number of environments and compared with other flooding methods. Results show the improvement of parameters such as flooding coverage as well as the number of rebroadcasts over other flooding algorithms.
Two-Part and k-Sperner Families: New Proofs Using Permutations
Authors: Péter L. Erdos, Zoltán Füredi, Gyula O. H. Katona
Venue: SIAM Journal on Discrete Mathematics (2005)

This is a paper about the beauty of the permutation method. New and shorter proofs are given for the theorem [P. L. Erdos and G. O. H. Katona, J. Combin. Theory. Ser. A, 43 (1986), pp. 58--69; S. Shahriari, Discrete Math., 162 (1996), pp. 229--238] determining all extremal two-part Sperner families and for the uniqueness of k-Sperner families of maximum size [P. Erdos, Bull. Amer. Math. Soc., 51 (1945), pp. 898--902].
A Method of Security Improvement for Privacy Preserving Association Rule Mining over Vertically Partitioned Data
Authors: Yiqun Huang, Zhengding Lu, Heping Hu
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

There have been growing interests in privacy preserving data mining. Secure multiparty computation (SMC) is often used to give a solution. When data is vertically partitioned scalar product is a feasible tool to securely discover frequent itemsets of association rule mining. However, there may be disparity among the securities of different parties. To obtain equal privacy, the security of some parties may be lowered. This paper discusses the disharmony between the securities of two parties. The scalar product of two parties from the point of view of matrix computation is described. We present one algorithm for completely two-party computation of scalar product. Then we give a method of security improvement for both parties.