ppxscal/embedding_network huggingface dataset:
Improving Image Retrieval Performance by Using Both Color and Texture Features
Authors: Dengsheng Zhang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Most content-based image retrievals (CBIR) use color as image features. However, image retrieval using color features often gives disappointing results because in many cases, images with similar colors do not have similar content. Color methods incorporating spatial information have been proposed to solve this problem, however, these methods often result in very high dimensions of features which drastically slow down the retrieval speed. In this paper, a method combining both color and texture features of image is proposed to improve the retrieval performance. Given a query, images in the database are firstly ranked using color features. Then the top ranked images are re-ranked according to their texture features. Results show the second process improves retrieval performance significantly.
Managing the Optical Networking Solution: Is Increased Bandwidth Enough to Reduce Delays?
Authors: Samir Chatterjee, Samuel C. Yang
Venue: IT Professional (2005)

Optical technology uses wavelength-division multiplexing, which provides greater bandwidth. But to reap the technologyýs full benefit, network managers must understand its limits.
A robust real-coded evolutionary algorithm with toroidal search space conversion
Authors: H. Someya, M. Yamamura
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2005)

This paper presents a robust Real-coded evolutionary algorithm. Real-coded evolutionary algorithms (RCEAs), such as real-coded genetic algorithms and evolution strategies, are known as effective methods for function optimization. However, they often fail to find the optimum in case the objective function is multimodal, discrete or high-dimensional. It is also reported that most crossover (or recombination) operators for RCEAs has sampling bias that prevents to find the optimum near the boundary of search space. They like to search the center of search space much more than the other. Therefore, they will not work on functions that have their optima near the boundary of search space. In this paper, we apply two methods, genetic algorithm with search area adaptation (GSA) and toroidal search space conversion (TSC), to the function optimization for improving the robustness of RCEAs. The former method searches adaptively and the latter one removes the sampling bias. Through several experiments, we have confirmed that GSA works adaptively and it shows higher performance, and RCEAs with TSC show effectiveness to find the optima near the boundary of search space.
Dynamic coalescing for 16-bit instructions
Authors: Arvind Krishnaswamy, Rajiv Gupta
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2005)

In the embedded domain, memory usage and energy consumption are critical constraints.Embedded processors such as the ARM and MIPS provide a 16-bit instruction set, (called Thumb in the case of the ARM family of processors), in addition to the 32-bit instruction set to address these concerns. Using 16-bit instructions one can achieve code size reduction and instruction cache energy savings at the cost of performance. This paper presents a novel approach that enhances the performance of 16-bit Thumb code. We have observed that throughout Thumb code there exist Thumb instruction pairs that are equivalent to a single ARM instruction. We have developed enhancements to the processor microarchitecture and the Thumb instruction set to exploit this property. We enhance the Thumb instruction set by incorporating Augmenting eXtensions (AX). A Thumb instruction pair that can be combined into a single ARM instruction is replaced by an AXThumb instruction pair by the compiler. The AX instruction is coalesced with the immediately following Thumb instruction to generate a single ARM instruction at decode time. The enhanced microarchitecture ensures that coalescing does not introduce pipeline delays or increase cycle time thereby resulting in reduction of both instruction counts and cycle counts. Using AX instructions and coalescing hardware we are also able to support efficient predicated execution in 16-bit mode.
Granular differentiated queueing services for QoS: structure and cost model
Authors: Shengming Jiang
Venue: ACM SIGCOMM Computer Communication Review (2005)

One weakness of DiffServ is the lack of granularity for QoS guaranteed services, which makes it difficult to cost-effectively support end-to-end (e2e) QoS according to the e2e situation (e.g., path lengths) of applications. With the conventional packet-level QoS mechanisms for the regulated traffic, i.e., buffer admission control plus output schedulers in general, increasing service granularity may inevitably complicate implementation and/or impact scalability since sophisticated output schedulers seem necessary in this case. In this paper, a new structure, Differentiated Queueing Services (DQS), is discussed to handle the above issue. DQS tries to provide granular and scalable QoS guaranteed services to be selected by users according to their QoS requirements and e2e situation. Its basic idea is to convert packet delay guarantee into packet loss ratio guarantee with either dropping or marking the packets whose e2e delays are perceived unable to be guaranteed. Packets are queued according to their e2e delay requirements so that various delay bounds can be guaranteed without using sophisticated output schedulers while different packet loss ratios are mainly controlled by call admission control (CAC). To this end, the e2e QoS requirement is carried by each packet to avoid storing such information in network units for scalability. On the other hand, differentiated services should also be accomplished with a differentiated cost model for pricing, not only for the profits of both the service provider and the user, but also to prevent good services from being abused. So, a cost model for differentiated QoS services provided by DQS is also discussed with a possible CAC based on the exponentially bounded burstiness traffic.
MATLAB/Simulink Based Hardware/Software Co-Simulation for Designing Using FPGA Configured Soft Processors
Authors: Jingzhao Ou, Viktor K. Prasanna
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

FPGA configured soft processors are an attractive choice for implementing many embedded systems. For application development using these soft processors, the users can execute portions of the applications as software programs and the other portions as customized hardware implementations. Being able to rapidly simulate various partitions of the applications on hardware and software is crucial to efficiently execute them on soft processors because (a) there are many possible configurations of soft processors, and (b) low-level simulation techniques are too time consuming for evaluating these different partitioning and configuration possibilities. While state-of-the-art design tools rely on low-level simulation and are unable to deliver such a fast simulation speed, we propose a high-level cycle-accurate hardware/software cosimulation environment based on MATLAB/Simulink for application development using soft processors. By utilizing the high-level cycle-accurate abstractions of the low-level hardware implementations and the arithmetic simulation capability provided by MATLAB/Simulink, our tool considerably accelerates the time for cycle-accurate functional simulation of both hardware and software portions of a given application running on soft processors. To illustrate our approach, we develop a CORDIC division application and a matrix multiplication application on a commercial soft processor. Up to 19.4x improvement in simulation time is achieved using our co-simulation environment compared with that of low-level simulation for various partitions of these applications and for various configurations of the soft processor.
Change of reaction time according to the presentation of cues about the direction of saccade in a delayed saccade task
Authors: Yoshiaki Tsunoda, Kiyohiko Nakamura
Venue: Systems and Computers in Japan (2004)

The preparation of saccade is examined on the basis of the reaction time in a delayed saccade task. The position of the visual stimulus presentation as the target of saccade is varied stochastically and then the signal indicating the start of the saccade is presented with a delay. In other words, a task is considered in which the direction of saccade is indicated before indicating the start of the saccade. We investigate how the preparation of the saccade progresses in the delay period following the indication of the direction. The following results were obtained in our experiments. (1) The reaction time decreases with increasing delay period. (2) The reaction time does not decrease but remains almost constant when the delay exceeds a certain value. (3) Even if the direction of saccade is known, the reaction time is decreased when the target is presented. As a conclusion, it is suggested that the saccade is prepared in the delay period based on the information concerning the saccade direction, since the reaction time decreases with increasing delay. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(8): 66&ndash;71, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10512
The oct-touched tile: a new architecture for shape-based routing
Authors: Ning Fu, Shigetoshi Nakatake, Yasuhiro Takashima, Yoji Kajitani
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

The shape-based routing needs a routing architecture with a geometrical computation framework on it. This paper introduces a novel routing architecture, Oct-Touched Tile (OTT), with a geometrical computation method along the horizontal- and vertical-constraints. The architecture is represented by the tiles spreading over the 2-D plane. Each tile is flexible to satisfy the constraints imposed for non-overlapping and sizing request. In this framework, any practically useful path finding and shape-based sizing technique are executed on the same architecture. Our system ex-perimentally demonstrates the performance comparable to a commercial tool.
Mobile IPv6 regional mobility management
Authors: Steve Mtika, Fambirai Takawira
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

Internet Mobile users require special support to maintain connectivity as they change point-of attachment. The mobility management used should keep providing good performance to mobile users and keep network load as low as possible as the network grows and the number of mobile nodes increases. To reduce this load, Mobile IP regional registration is used. In this paper, a dynamic regional mobility management architecture is presented. We aim to minimize signaling and packet delivery cost while keeping an optimal number of access routers (AR) in the region. We iteratively find the optimal value, given the average registration and packet delivery cost. Analytical results are obtained to show the performance of this scheme.
Routing demands with time-varying bandwidth profiles on a MPLS network
Authors: Fabio Ricciato, Ugo Monaco
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2005)

In this work we consider the problem of routing bandwidth-guaranteed flows with time-variable bandwidth profiles on a MPLS network. We assume that each demand is routed in an explicitly routed LSP, and the amount of bandwidth that must be reserved along the LSP varies during the day according to a piece-wise mask, which is known in advance. The time-of-day bandwidth profiles can be explicitly declared by the VPN customers in the SLA, or alternatively predicted by the ISP based on past measurements.In this framework, we propose a simple on-line algorithm for optimal selection of LSP paths. We also provide an ILP formulation for the associated off-line problem, and adopt it as a reference performance bound for the on-line algorithm.Additionally, we compare the performances of fixed and variable routing in presence of time-variable bandwidth profiles. The results presented here suggest that the a priori knowledge of the per-demand traffic profiles can be exploited to achieve a fixed routing configuration, which can be marginally improved by variable reconfigurations. We relate our findings with a couple of previous works that in different application contexts achieved similar results.
USABILITY ANALYSIS WITH ARTIFACTS ON PANELS
Authors: Rumi Hiraga, Yeong-Chang Lien
Venue: ACM SIGCHI Bulletin (1991)

A practical user interface analysis method is proposed, to provide a rationale for user interface design. The approach has three aspects:1. To express a rationale by obtaining quantitative metrics from designers' artifacts2. To visualize the metrics3. To analyze designs interactively.
Some conclusions on a top-down functional specifications definition experiment
Authors: Anthony A. Lekkos
Venue: ACM SIGDA Newsletter (1979)

Functional Specifications are considered the foundation to the software development process. Fewer problems in software development are caused by design and implementation phase, and more by the specifications definition phase.This paper reports the results of an experiment undertaken by a small group of individuals to define the Functional Specifications in a top-down manner.
Towards automatic sign translation
Authors: Jie Yang, Jiang Gao, Ying Zhang, Alex Waibel
Venue: Proceedings of the first international conference on Human language technology research (2001)

Signs are everywhere in our lives. They make our lives easier when we are familiar with them. But sometimes they also pose problems. For example, a tourist might not be able to understand signs in a foreign country. In this paper, we present our efforts towards automatic sign translation. We discuss methods for automatic sign detection. We describe sign translation using example based machine translation technology. We use a user-centered approach in developing an automatic sign translation system. The approach takes advantage of human intelligence in selecting an area of interest and domain for translation if needed. A user can determine which sign is to be translated if multiple signs have been detected within the image. The selected part of the image is then processed, recognized, and translated. We have developed a prototype system that can recognize Chinese signs input from a video camera which is a common gadget for a tourist, and translate them into English text or voice stream.
A complex systems approach to researching behavioral trends
Authors: Jesse Wrenn
Venue: Journal of Computing Sciences in Colleges (2005)

The goal of my research is to use a complex adaptive system (CAS) to study the evolution of aggressive and friendly behavioral patterns of simulated human agents. The agents will interact on both personal and tribal levels as they obtain scarce resources from one another by sharing with or attacking others. The agents' behaviors will evolve to favor more successful strategies, as the most fit agents' strategies will be the most likely to be passed on to later generations.
Energy-security tradeoff in a secure cache architecture against buffer overflow attacks
Authors: Koji Inoue
Venue: ACM SIGARCH Computer Architecture News (2005)

In this paper, we propose a cache architecture, called SCache, to detect buffer-overflow attacks at run time. Furthermore, the energy-security efficiency of SCache is discussed. SCache generates replica cache lines on each return-address store, and compares the original value loaded from the memory stack to the replica one on the corresponding return-address load. The number and the placement policy of the replica line strongly affect both energy and vulnerability. In our evaluation, it is observed that SCache can protect more than 99.3% of return-address loads from buffer-overflow attacks, while it increases total cache energy consumption by about 23%, compared to a well-known low-power cache.
Final Results from the Tuning of the NMS_6b Weather Code
Authors: Daniel Pressel
Venue: Proceedings of the 2004 Users Group Conference (2004)

The Nonhydrostatic Model Simulation (NMS) _6b weather code is commonly used by weather forecasters at television stations across the country. It is also of interest to the US Army due to its superior ability to predict weather in mountainous terrain. It was developed by Dr. Greg Tripoli of the University of Wisconsin. Currently this code exists only as a shared memory application parallelized using OpenMP. Attempts to parallelize it for distributed memory systems using MPI proved to be beyond the scope of the project that the author was involved in. This paper discusses efforts to improve the performance of the code at both the processor level and at the level of parallel performance.
Packing a trunk: now with a twist!
Authors: Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer, Joachim Reichel, Elmar Schömer
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

In an industry project with a German car manufacturer we are faced with the challenge of placing a maximum number of uniform rigid rectangular boxes in the interior of a car trunk. The problem is of practical importance due to a European industry norm which requires car manufacturers to state the trunk volume according to this measure.No really satisfactory automated solution for this problem has been known in the past. In spite of its NP hardness, combinatorial optimization techniques, which consider only grid-aligned placements, produce solutions which are very close to the one achievable by a human expert in several hours of tedious work. The remaining gap is mostly due to the constraints imposed by the chosen grid.In this paper we present a new approach which combines the grid-based combinatorial method with Simulated Annealing on a continuous model. This allows us to explore arbitrary orientations and placements of boxes, hence closing the gap even further, and - in some cases - even surpass the manual expert solution.The implemented software system allows our industrial partner to incorporate the trunk volume in a very early stage of the car design process without relying on a repeated and cumbersome manual evaluation of the volume.
On cubic s-arc transitive Cayley graphs of finite simple groups
Authors: Shang Jin Xu, Xin Gui Fang, Jie Wang, Ming Yao Xu
Venue: European Journal of Combinatorics (2005)

For a positive integer s, a graph Γ is called s-arc transitive if its full automorphism group AutΓ acts transitively on the set of s-arcs of Γ. Given a group G and a subset S of G with S = S-1 and 1 ∉ S, let Γ = Cay(G, S) be the Cayley graph of G with respect to S and GR the set of right translations of G on G. Then GR forms a regular subgroup of AutΓ. A Cayley graph Γ = Cay(G, S) is called normal if GR is normal in AutΓ. In this paper we investigate connected cubic s-arc transitive Cayley graphs Γ of finite non-Abelian simple groups. Based on Li's work (Ph.D. Thesis (1996)), we prove that either Γ is normal with s ≤ 2 or G = A47 with s = 5 and AutΓ ≃ A48. Further, a connected 5-arc transitive cubic Cayley graph of A47 is constructed.
Optimizing Finite Element Programs on the Cray X1 Using Coloring Schemes
Authors: Fred T. Tracy
Venue: Proceedings of the 2004 Users Group Conference (2004)

Using the Environmental Quality Modeling program FEMWATER as a test-bed code, 27 percent of the time needed to run a given groundwater flow application on the ERDC Cray X1 using four multistream processors (MSPs) was spent assembling the global stiffness matrix.This poor performance is because the above code cannot multistream without help. The technique of "coloring" the elements makes it possible to multistream this section of the code, thus taking advantage of the hardware capability of the machine. Coloring for assembling the global stiffness matrix involves dividing the elements into different groups such that no node point touches any elements with the same color. This paper will present a simple coloring algorithm in FORTRAN and show how it was implemented into FEMWATER to achieve multistreaming on the ERDC Cray X1. It will then give a detailed description on how the program was modified, what compiler options were used, and what compiler directives worked best. Finally, timing results will be given. Some programs that have good MPI (or equivalent) communication are better suited for running in the single-streamed processor (SSP) mode. In the SSP mode, coloring of the elements is not needed for assembling the global stiffness matrix. Timings for running in the SSP mode will be shown, too.
Reducing the time complexity of testing for local threshold testability
Authors: A. N. Trahtman
Venue: Theoretical Computer Science (2004)

A locally threshold testable language L is a language with the property that for some non-negative integers k and l and for some word u from L, a word v belongs to L iff: (1) the prefixes [suffixes] of length k - 1 of words u and v coincide, (2) the number of occurrences of every factor of length k in both words u and v are either the same or greater than l - 1.A deterministic finite automaton is called locally threshold testable if the automaton accepts a locally threshold testable language for some l and k.New necessary and sufficient conditions for a deterministic finite automaton to be locally threshold testable are found. On the basis of these conditions, we modify the algorithm to verify local threshold testability of the automaton, and to reduce the time complexity of the algorithm. The algorithm is implemented as a part of the C/C++ package TESTAS. http://www.cs.biu.ac.il/ ~trakht/Testas.html.
Identifying the quality of e-commerce reference models
Authors: Werner Esswein, Dipl.-Kffr. Sabine Zumpe, Nicole Sunke
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

The development of information and communication systems, in particular e-commerce systems, is a complex and time intensive task. The development process can be simplified by using reference models. Many reference models for the electronic commerce, such as the model for electronic markets by SCHMID & LINDEMANN (1997) and the OBJECT MANAGEMENT GROUP reference model are known. However, they tend to concentrate on specific aspects of the problem and give insufficient attention to all aspects of good model quality. A number of requirements are important in constructing a reference model as the quality of the construction invariably impacts the quality of the construction invariably impacts the quality of the final model. To determine the quality of a reference model and its construction process an analysis scheme was designed and tested in a case study with a German standardization institution. The practical application of the analysis scheme reveals deficiencies and strengths in some reference modelling processes.
Outlook 2003 Personal Trainer
Venue:  (2005)

Fully illustrated and jargon-free, the Outlook 2003 Personal Trainer book presents a clear view of the latest personal information program from Microsoft Office. With this handy reference by your side, you ll be able to better manage and organize email messages, schedules, tasks, notes, contacts, and other information. Includes a companion CD tutorial to guide you through each lesson interactively.