ppxscal/embedding_network huggingface dataset:
Object-Based Regions of Interest for Image Compression
Authors: Sunhyoung Han, Nuno Vasconcelos
Venue: Proceedings of the Data Compression Conference (2008)

A fully automated architecture for object-based region of interest (ROI) detection is proposed. ROI's are defined as regions containing user defined objects of interest, and an efficient algorithm is developed for the detection of such regions. The algorithm is based on the principle of discriminant saliency, which defines as salient the image regions of strongest response to a set of features that optimally discriminate the object class of interest from all the others. It consists of two stages, saliency detection and saliency validation. The first detects salient points, the second verifies the consistency of their geometric configuration with that of training examples. Both the saliency detector and the configuration model can be learned from cluttered images downloaded from the web. Learning and ROI detection are optimal in the minimum probability of error (MPE) sense, and computationally efficient. This enables interactive user training of ROI-based image coders, with minimal amounts of manual supervision. Experimental results are presented for images of complex scenes, containing both objects and background clutter, and demonstrate good object-based ROI image compression performance.
Dual watermark for image tamper detection and recovery
Authors: Tien-You Lee, Shinfeng D. Lin
Venue: Pattern Recognition (2008)

An effective dual watermark scheme for image tamper detection and recovery is proposed in this paper. In our algorithm, each block in the image contains watermark of other two blocks. That is to say, there are two copies of watermark for each non-overlapping block in the image. Therefore, we maintain two copies of watermark of the whole image and provide second chance for block recovery in case one copy is destroyed. A secret key, which is transmitted along with the watermarked image, and a public chaotic mixing algorithm are used to extract the watermark for tamper recovery. By using our algorithm, a 90% tampered image can be recovered to a dim yet still recognizable condition (PSNR ~20dB). Experimental results demonstrate that our algorithm is superior to the compared techniques, especially when the tampered area is large.
ST2B-tree: a self-tunable spatio-temporal b+-tree index for moving objects
Authors: Su Chen, Beng Chin Ooi, Kian-Lee Tan, Mario A. Nascimento
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

In a moving objects database (MOD) the dataset and the workload change frequently. As the locations of objects change in space and time, the data distribution also changes and the answer for a same query over the same region may vary widely over time. As a result, traditional static indexes are not able to perform well and it is critical to develop self-tuning indexes that can be reconfigured automatically based on the state of the system. Towards this goal we propose the ST2B-tree, a Self-Tunable Spatio-Temporal B+-Tree index for MODs, which is amenable to tuning. Frequent updates to its subtrees allows rebuilding (tuning) a subtree using a different set of reference points and different grid size without significant overhead. We also present an online tuning framework for the ST2B-tree, where the tuning is conducted online and automatically without human intervention, also not interfering with regular functions of the MOD. Our extensive experiments show that the self-tuning process minimizes the effectiveness degradation of the index caused by workload changes at the cost of virtually no overhead.
Secure Wireless Sensor Networks
Authors: Xun Yi, Mike Faulkner, Eiji Okamoto
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Confidentiality and authentication are crucial to wireless sensor networks when sensors are deployed in hostile environments, e.g., battle fields and antiterrorist operations. In this paper, we come up with (1) a group key distribution protocol for a base station to distribute a group key to sensors and (2) a broadcast authentication protocol for sensors to authenticate messages broadcasted by a base station. Security and performance analysis show that both protocols are secure and efficient. In addition, our group key distribution protocol supports dynamic wireless sensor network which allows new sensors to be added in and compromised sensors to be forced to leave.
Transient stability improvement of SMIB with unified power flow controller
Authors: Ved Parkash, Charan Preet Singh Gill, Ratna Dahiya
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

The focus of this paper is on a FACTS device known as the Unified Power Flow Controller (UPFC), which can provide simultaneous control of basic power system parameters like voltage, impedance and phase angle. In this research work, two simulation models of single machine infinite bus (SMIB) system, i.e. with & without UPFC, have been developed. These simulation models have been incorporated into MATLAB based Power System Toolbox (PST) for their transient stability analysis. These models were analysed for three phase fault at different locations, i.e. at the middle and receiving end of the transmission line keeping the location of UPFC fixed at the receiving end of the line. Transient stability was studied with the help of curves of fault current, active & reactive power at receiving end, shunt injected voltage & its angle, series injected voltage & its angle and excitation voltage. With the addition of UPFC, the magnitude of fault current reduces and oscillations of excitation voltage also reduce. Series and Shunt parts of UPFC provide series and shunt injected voltage at certain different angles. Therefore, it can be concluded that transient stability of SMIB is improved with the addition of Unified Power Flow Controller.
Evolved transforms for improved image compression and reconstruction under quantization
Authors: Frank W. Moore, Brendan J. Babb
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

Previously reported research efforts demonstrated that a genetic algorithm can evolve coefficients describing transforms that outperform standard wavelets, by reducing the mean squared error (MSE) apparent in reconstructed signals under conditions subject to quantization. This paper describes new results that substantially improve the state-of-the-art in evolved transform performance. Matched forward and inverse transform pairs trained against selected images consistently reduce MSE by more than 22% (1.126 dB) when applied to an arbitrary population of similarly quantized test images, yet still achieve the same amount of compression.
Computer science and information technology associate-level curricular guidelines
Authors: Elizabeth K. Hawthorne, Karl J. Klee, Robert D. Campbell, Anita M. Wright
Venue: ACM SIGCSE Bulletin (2008)

This poster presentation will feature draft curriculum guidelines recently developed by the Two-Year College Education Committee (TYCEC), a standing committee of the ACM Education Board. The TYCEC is charged with developing and updating computing curricula guidelines for associate-degree granting institutions worldwide. To this end, the TYCEC is in the process of substantial revisions of the associate-level curriculum guidelines for transfer Computer Science degree programs and career Information Technology degree programs.
A new wavelet multigrid method
Authors: Doreen De Leon
Venue: Journal of Computational and Applied Mathematics (2008)

The standard multigrid procedure performs poorly or may break down when used to solve certain problems, such as elliptic problems with discontinuous or highly oscillatory coefficients. The method discussed in this paper solves this problem by using a wavelet transform and Schur complements to obtain the necessary coarse grid, interpolation, and restriction operators. A factorized sparse approximate inverse is used to improve the efficiency of the resulting method. Numerical examples are presented to demonstrate the versatility of the method.
Biological Network Simulation Using Holonic Multiagent Systems
Authors: Sima Shafaei, Nasser Ghasem Aghaee
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Uncovering the dynamic behavior of biochemical networks is one of the systems' biology's tasks. These systems are very complicated systems, containing many interacting components. Recently, researchers have tested computational tools to model these systems in order to elucidate the organizational principles. In this paper we recommend using Holonic Multiagent systems for biological networks simulation. Holonical systems guarantee to provide a recursive and hierarchical modeling for complex systems with dynamic and runtime reorganization. They are adopted for simulation where systems have a hierarchical structure and can be decomposed into individual cooperating entities.
Choose topics for MACS seminars
Authors: Hongbiao Zeng
Venue: Journal of Computing Sciences in Colleges (2008)

What are appropriate topics for seminars that involve both mathematics and computer science undergraduates? Programs, architectures, or algorithms may bore the math majors while pure mathematical proofs are likely to be of no interest to the CS majors. A middle ground solution - solving interesting math problems via computer programs - has proven to be attractive to undergraduates of both majors.
Integrated contextual representation for objects' identities and their locations
Authors: Nurit Gronau, Maital Neta, Moshe Bar
Venue: Journal of Cognitive Neuroscience (2008)

Visual context plays a prominent role in everyday perception. Contextual information can facilitate recognition of objects within scenes by providing predictions about objects that are most likely to appear in a specific setting, along with the locations that are most likely to contain objects in the scene. Is such identity-related (semantic) and location-related (spatial) contextual knowledge represented separately or jointly as a bound representation? We conducted a functional magnetic resonance imaging (fMRI) priming experiment whereby semantic and spatial contextual relations between prime and target object pictures were independently manipulated. This method allowed us to determine whether the two contextual factors affect object recognition with or without interacting, supporting a unified versus independent representations, respectively. Results revealed a Semantic Spatial interaction in reaction times for target object recognition. Namely, significant semantic priming was obtained when targets were positioned in expected (congruent), but not in unexpected (incongruent), locations. fMRI results showed corresponding interactive effects in brain regions associated with semantic processing (inferior prefrontal cortex), visual contextual processing (parahippocampal cortex), and object-related processing (lateral occipital complex). In addition, activation in fronto-parietal areas suggests that attention and memory-related processes might also contribute to the contextual effects observed. These findings indicate that object recognition benefits from associative representations that integrate information about objects' identities and their locations, and directly modulate activation in object-processing cortical regions. Such context frames are useful in maintaining a coherent and meaningful representation of the visual world, and in providing a platform from which predictions can be generated to facilitate perception and action.
Mobile P2P Networks for Highly Dynamic Environments
Authors: Kei Takeshita, Masahiro Sasabe, Hirotaka Nakano
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

With the wide spread of mobile devices, information discovery methods over mobile ad hoc networks (MANETs) are required. Recent studies have revealed that integrating a distributed hash table (DHT) substrate and network-layer routing can increase search efficiency. Furthermore, some researchers have proposed a clustering method which groups the overlay nodes according to their physical distance. However, it has also been pointed out that the search efficiency deteriorates in highly dynamic environments. In this paper, we propose a method sharing pointers among nodes in a cluster. Through simulation experiments, we show that the proposed method improves the success ratio of object search up to 40 % compared with existing method.
Opinion mining of customer feedback data on the web
Authors: Dongjoo Lee, Ok-Ran Jeong, Sang-goo Lee
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

As people leave on the Web their opinions on products and services they have used, it has become important to develop methods of (semi-)automatically classifying and gauging them. The task of analyzing such data, collectively called customer feedback data, is known as opinion mining. Opinion mining consists of several steps, and multiple techniques have been proposed for each step. In this paper, we survey and analyze various techniques that have been developed for the key tasks of opinion mining. On the basis of our survey and analysis of the techniques, we provide an overall picture of what is involved in developing a software system for opinion mining.
A reconfigurable routing algorithm for a fault-tolerant 2D-Mesh Network-on-Chip
Authors: Zhen Zhang, Alain Greiner, Sami Taktak
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In this paper we present a reconfigurable routing algorithm for a 2D-Mesh Network-on-Chip (NoC) dedicated to fault-tolerant, Massively Parallel Multi-Processors Systems on Chip (MP2-SoC). The routing algorithm can be dynamically reconfigured, to adapt to the modification of the micro-network topology caused by a faulty router. This algorithm has been implemented in a reconfigurable version of the DSPIN micro-network, and evaluated from the point of view of performance (penalty on the network saturation threshold), and cost (extra silicon area occupied by the reconfigurable version of the router).
Evaluating the model accuracy in automated design space exploration
Authors: Kalle Holma, Mikko Setälä, Erno Salminen, Marko Hännikäinen, Timo D. Hämäläinen
Venue: Microprocessors Microsystems (2008)

Design space exploration is used to shorten the design time of system-on-chips (SoCs). Exploration uses abstracted system models that need to be both accurate and fast to simulate. This paper introduces a multi-level communication cost to improve the accuracy of the abstracted models. During the simulation, one of three different communication costs is applied for each inter-task communication event based on the mapping of the communicating tasks. The accuracy of three system abstraction models using the presented communication cost is evaluated with a Motion-JPEG application in a multi-processor SoC with 9 mappings having 1-4 processors. The application is described in Unified Modeling Language (UML) and simulated using transaction generator (TG) simulation engine. According to the results, the average error in frames per second is 4.3% for the modulo model, 5.0% for the trace model, and 12.8% for the probabilistic model compared to FPGA execution. The simulation speed-up is more than 230x compared to low-level cycle-accurate simulation. The results show that with the multi-level communication cost the accuracy is increased significantly without sacrificing the simulation speed.
A solution for online entering and editing mathematical formulas (abstract only)
Authors: Wei Su, Chuan Cai, Paul S. Wang, Lian Li
Venue: ACM Communications in Computer Algebra (2008)

The ability for users online creating and editing mathematical expressions is very important for Science Computing Systems, Science Communication Systems, and Web-based Mathematics Education Systems. Lanzhou university/China and Kent University/USA are jointly developing a mathematical expression editor. The editor MathEdit, implemented in JavaScript and MathML, is a web-based visual interactive editor for mathematical expressions. Figure 1 shows the end-user view of the MathEdit architecture. In MathEdit the MathML Content code is the core code of being edited mathematical expression. User actions, inserting, deleting and editing sub-expressions by mouse clicks and keyboard input, are treated as commands. The commands will invoke JavaScript functions in the command processing module to modify the MathML content code by revising DOM tree of expression. The MathML Content will synchronously convert to MathML Presentation code and Math Infix code. The user will intuitively see the changed math expression displayed by MathML Presentation.
GOST-28147 Encryption Implementation on Graphics Processing Units
Authors: Victor Korobitsin, Sergey Ilyin
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The GOST-21147 encryption implementation on graphics processing units is suggested. The approach for organizing the computation process on the GPU is described. Some realizations of basic operations for ciphering algorithm aresuggested for Direct3D and OpenGL graphics API. The results of computational experiments on different GPU and CPU are given.
Fast algorithms for matrix normal forms
Authors: M. Giesbrecht
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

A Las Vegas type probabilistic algorithm is presented for computing the Frobenius normal form of an n*n matrix T over any field K. The algorithm requires O/sup approximately /(MM(n))=MM(n)/sup ./(log n)/sup O(1)/ operations in K, where O(MM(n)) operations in K are sufficient to multiply two n*n matrices over K. This nearly matches the lower bound of Omega (MM(n)) operations in K for this problem, and improves on the O(n/sup 4/) operations in K required by the previously best known algorithm. The author applies the algorithm to evaluate a polynominal g in K(x) at T with /sup approximately /(MM(n)) operations in K when deg g
Technical Section: A decompression pipeline for accelerating out-of-core volume rendering of time-varying data
Authors: Daisuke Nagayasu, Fumihiko Ino, Kenichi Hagihara
Venue: Computers and Graphics (2008)

This paper presents a decompression pipeline capable of accelerating out-of-core volume rendering of time-varying scalar data. Our pipeline is based on a two-stage compression method that cooperatively uses the CPU and the graphics processing unit (GPU) to transfer compressed data entirely from the storage device to the video memory. This method combines two different compression algorithms, namely packed volume texture compression (PVTC) and Lempel-Ziv-Oberhumer (LZO) compression, allowing us to exploit both temporal and spatial coherence in time-varying data. Furthermore, it achieves fast decompression by taking architectural advantages of each processing unit: a hardware component on the GPU and a large cache on the CPU, each suited to decompress PVTC and LZO encoded data, respectively. We also integrate the method with a thread-based pipeline mechanism to increase the data throughput by overlapping data loading, data decompression, and rendering stages. Our pipelined renderer runs on a quad-core PC and achieves a video rate of 41 frames per second (fps) in average for 258x258x208 voxel data with 150 time steps. It also demonstrates an almost interactive rate of 8fps for 512x512x295 voxel data with 411 time steps.
RDP Technique: Take a Different Look at XP for Adoption
Authors: Mehdi Mirakhorli, Abdorrahman Khanipour Rad, Fereidoon Shams Aliee, Abbas Mirakhorli, Maryam Pazoki
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Although software projects can benefit from XP practices, all projects can’t directly adopt it. Characteristics of some projects make it difficult to use XP directly, therefore, we need to tailor XP to the local conditions, contexts and the size of these projects. In this article we will describe why defining XP by its practices has problems and with the belief that XP's values make it agile, XP's practices do not define XP and XP is defined by its rules, we introduce a practical technique for tailoring XP. Proposed technique benefits from RDP (Rule-Description-Practice) cards for identifying a set of suitable practices for a specific project: organizing “YourXP” software development process.
Design of a hyperspectral nitrogen sensing system for orange leaves
Authors: Min Min, Won Suk Lee, Thomas F. Burks, Jonathan D. Jordan, Arnold W. Schumann, John K. Schueller, Huikai Xie
Venue: Computers and Electronics in Agriculture (2008)

The orange (Citrus sinensis) is one of the most important agricultural crops in Florida. Heavy reliance on agricultural chemicals and low fertilizer use efficiencies in citrus production have raised environmental and economic concerns. In this study, a nitrogen sensor was developed to predict nitrogen concentrations in orange leaves. Four design criteria were chosen to maximize the sensing efficiency and reliability. They were: (1) coverage of the spectral N sensing range, (2) no moving parts, (3) single leaf detection, and (4) diffuse reflectance measurement. Based on chlorophyll and protein spectral absorption bands, the sensor's wavelength ranges were chosen to be 620-950nm and 1400-2500nm. A reflectance housing was designed to block environmental noise and to ensure single leaf measurement. A halogen light source, two detector arrays, two linear variable filters, and data acquisition cards with 16-bit analog-to-digital converters were used to collect data. The designed N sensor had a spectral resolution less than 30nm. Test results showed that the nitrogen sensor had good linearity (r>0.99) and stability. With averaged signal-to-noise ratio (SNR) of 299, the system was able to predict N content with a root mean square difference (RMSD) of l.69gkg^-^1 for the validation data set. Using the N sensor, unknown leaf samples could be classified into low, medium and high N levels with 70% accuracy.
Investigation of atomic vapour deposited TiN/HfO2/SiO2 gate stacks for MOSFET devices
Authors: Ch. Wenger, M. Lukosius, I. Costina, R. Sorge, J. Dabrowski, H. -J. Müssig, S. Pasko, Ch. Lohe
Venue: Microelectronic Engineering (2008)

HfO"2 films were grown by atomic vapour deposition (AVD) on SiO"2/Si (100) substrates. The positive shift of the flat band voltage of the HfO"2 based metal-oxide-silicon (MOS) devices indicates the presence of negative fixed charges with a density of 5x10^1^2cm^-^2. The interface trap charge density of HfO"2/SiO"2 stacks can be reduced to 3x10^1^1eV^-^1cm^-^2 near mid gap, by forming gas annealing. The extracted work function of 4.7eV preferred the use of TiN as metal gate for PMOS transistors. TiN/HfO"2/SiO"2 gate stacks were integrated into gate-last-formed MOSFET structures. The extracted maximum effective mobility of HfO"2 based PMOS transistors is 56cm^2/Vs.