ppxscal/embedding_network huggingface dataset:
Combining variants of iterative flattening search
Authors: Angelo Oddi, Amedeo Cesta, Nicola Policella, Stephen F. Smith
Venue: Engineering Applications of Artificial Intelligence (2008)

Iterative flattening search (ifs) is an iterative improvement heuristic schema for makespan minimization in scheduling problems. Given an initial solution, ifsiteratively interleaves a relaxation-step, which randomly retracts some search decisions, and an incremental solving step (or flattening-step) to recompute a new solution. The process continues until a stop condition is met and the best solution found is returned. In recent work we have created a uniform software framework to analyze component techniques that have been proposed in ifsapproaches. In this paper we combine basic components to obtain hybrid variants and perform a detailed experimental evaluation of their performance. Specifically, we examine the utility of: (1) operating with different relaxation strategies and (2) using different searching strategies to built a new solution. We present a two-step experimental evaluation: (a) an extensive explorative evaluation with a spectrum of parameter combination; (b) a time-intensive evaluation of the best ifscombinations emerged from the previous. The experimental results shed light on weaknesses and strengths of the different variants improving the current understanding of this family of meta-heuristics.
Improvement of DSG method
Authors: M. Jahanshahi, M. Gholipour, M. Kordafshari, M. Dehghan
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

Different orphan detection methods prefer different tradeoffs between performance, storage overhead, and simplicity of recovery. There exist some methods for orphan detection. One of them called DSG method that has been presented in [1]. In this paper initially we introduce DSG method and then we present its advantages. Finally we improve this method in either process overhead and communication/traffic overhead.
A New Operational Framework for Benchmarking the SAN Products
Authors: Prabu D., Devi Prasad B., Lakshminarayana Prasad K., Kishor Arumilli
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

The novel framework presented in this paper provides a comprehensive methodology and statistical approach for benchmarking two Storage Area Network (SAN) products. This framework has the ability to assess the complexity of the SAN products benchmarking characteristics. This approach enables us to explore the complex interactions and relationships between the SAN products in the same environment. There are many evaluation techniques available for testing, but their results and evaluations may lack maturity and are not statistically sound. This novel unified framework provides a cost effective way that quantifies the benchmarking and interaction level of two SAN products by using single Design of Experiments (DOE) analysis. This novel approach provides good SAN product comparative analysis to customer's with high degree of accuracy with good predictabilities in product improvement, product marketing and product selection.
Security association in mobile ad hoc networks through self-organized public key certification
Authors: D. S. Thenmozhi, R. Murugan
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

Mobile ad hoc networks (MANET) usually do not provide on-line access to trusted authorities or to centralized servers and they exhibit frequent partitioning due to link and node failures and to node mobility. For these reasons, traditional security solutions that require on-line trusted authorities or certificate repositories are not well suited for securing ad hoc networks. In this paper, we propose a fully self-organized public-key management system that allows users to generate their public-private key pairs, to issue certificates, and to perform authentication regardless of the network partitions and without any centralized services. Furthermore, our approach does not require any trusted authority, not even in the system initialization phase.
Imagery Pattern Recognition and Pub/Sub Information Management
Authors: Scott Spetka, Scot Tucker, George Ramseyer, Richard Linderman
Venue: Proceedings of the 36th Applied Imagery Pattern Recognition Workshop (2007)

Imagery pattern recognition (IPR) is becoming more challenging as image resolutions continue to improve and algorithms become more complex. Systems for analysis are being developed on increasingly diverse and heterogeneous platforms, from hardware support using field programmable gate arrays, graphics processing units, and Cell processors to high performance computers, featuring multi-core processors and shared memory communications. Given the complexity of modern IPR systems, neither analytical nor adaptive methods are sufficient to understand the shortfalls of an approach to IPR for any particular architecture. Our test harness implements an adaptive, experimental approach that can be used to quickly estimate performance and perform validation. A case study is implemented that implements the test harness for a publish/subscribe architecture, and in which several approaches for brokering are compared in a pub/sub implementation.
The emotion expression robot through the affective interaction: KOBIE
Authors: Cheonshu Park, Joungwoo Ryu, Sangseung Kang, Jaehong Kim, Joochan Sohn, Hyunkyu Cho
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

In this paper, we propose the method for expressing emotion for the emotional robot through the affective stimuli such as 'hit,' 'stoke,' 'tickle,' 'poke,' 'embrace,' etc. We developed the experiment platform, KOBIE, for experiment the emotion expression system. The KOBIE is the emotional robot which is made for an interaction between a human being and a robot through the affective interaction. Our system can be used in developing the cyber character (Avatar) having an emotion or developing the apparatus having an emotion in the ubiquitous environment.
Dynamic MAP Selection Mechanism for HMIPv6
Authors: Ying-Hong Wang, Kuo-Feng Huang, Chien-Shan Kuo, Wei-Jia Huang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Hierarchical Mobile IPv6 management (HMIPv6) which is drawn up by the IETF(Internet Engineering Task Force) utilizes the Mobile Anchor Point (MAP) to reduce the considerable number of binding update messages among the mobile node, correspondent node, and the mobile node’s home agent. According to the HMIPv6 mechanism, the MAP of higher layer can efficiently reduce the frequency of binding update messages; it will have higher loading of service and become the bottleneck of the whole network. Because the MAP’s bandwidth of services is finite and if MAP serves as the gateway at the same time, the whole network will be crashed due to overloading. This research proposes a MAP selection mechanism that takes the mobile node’s particular characteristics which include the mobility velocity and quantity of communication services into consideration, the research can manage MAPs efficiently. Besides, the research also designs the MAP Load Balance mechanism to avoid the network crash due to the overloaded MAP.
Bounded Approximation: A New Criterion for Dimensionality Reduction Approximation in Similarity Search
Authors: Khanh Vu, Kien A. Hua, Hao Cheng, Sheau-Dong Lang
Venue: IEEE Transactions on Knowledge and Data Engineering (2008)

We examine the problem of efficient distance-based similarity search over high-dimensional data. A promising approach to this problem is to reduce dimensions and allow fast approximation. Conventional reduction approaches, however, entail a significant shortcoming: the approximation volume extends across the dataspace, which causes over-estimation of retrieval sets and impairs performance. This paper focuses on a new criterion for dimensionality reduction methods: bounded approximation. We show that this requirement can be accomplished by a novel non-linear transformation scheme that extracts two important parameters from the data. We devise two approximation formulations, rectangular and spherical range search, each corresponding to a closed volume around the original search sphere. We discuss in detail how to derive tight bounds for the parameters and to prove further results, as well as highlighting insights into the problems and our proposed solutions. To demonstrate the benefits of the new criterion, we study the effects of (un)boundedness on approximation performance, including selectivity, error toleration, and efficiency. Extensive experiments confirm the superiority of this technique over recent state-of-the-art schemes.
On the elimination of some higher type quantifiers
Authors: Yasuwo Ikeda, Kohji Tomita, Chiharu Hosono
Venue: Mathematical Structures in Computer Science (2001)

This paper concerns the elimination of higher type quantifiers and gives two theorems. The first theorem shows that quantifiers in formulae of a specific form can be eliminated. The second theorem shows that quantifiers in formulae of a similar form cannot be eliminated, that is, such formulae do not have an equivalent first-order formula. The proof is based on the Ehrenfeucht game. These theorems are important for design of an interpreter of a &nu; act, which is a representation of mathematical action. Moreover, even if the universe is assumed to be finite, these theorems hold.
Jackson-type theorems in homogeneous approximation
Authors: András Kroó, József Szabados
Venue: Journal of Approximation Theory (2008)

The classical Weierstrass theorem states that any function continuous on a compact set K@?R^d(d>=1) can be uniformly approximated by algebraic polynomials. In this paper we study the possible extensions of this celebrated result for approximation by homogeneous algebraic polynomials on star-like and convex surfaces in R^d such that K=-K. A previous conjecture states that functions continuous on a convex surface can be approximated by a pair of homogeneous polynomials. We verify this conjecture under the mild condition of Dini-Lipschitz smoothness of the convex surface considered. It is also shown that the density fails on surfaces with outer cusps. In addition, we give Jackson-type estimates for the rate of best approximation by homogeneous polynomials on convex surfaces. A new phenomenon here consists of the fact that this rate depends not only on the moduli of continuity of the functions considered, but also on the smoothness properties of convex surfaces.
Several error inequalities for a quadrature formula with a parameter and applications
Authors: Wenjun Liu
Venue: Computers Mathematics with Applications (2008)

In this paper, we will derive several error inequalities for a quadrature formula with a parameter, which will not only provide some generalizations of the known results, but also give some other interesting quadrature formulae as special cases. Furthermore, sharp upper and lower error bounds for the double error inequalities are obtained. Applications in numerical integration are also given.
Visualizing flow data using assorted glyphs
Authors: Amit Prakash Sawant, Christopher G. Healey
Venue: Crossroads (2007)

This project visualizes a scientific dataset containing two-dimensional flow data from a simulated supernova collapse provided by astrophysics researchers. We started our project by designing visualizations using multiple hand drawings representing the flow data without taking into consideration the implementation constraints of our designs. We implemented a few of our hand drawn designs. We used an assortment of simple geometric graphical objects, called glyphs, such as, dots, lines, arrows, and triangles to represent the flow at each sample point. We also incorporated transparency in our visualizations. We identified two important goals for our project: (1) design different types of graphical glyphs to support flexibility in their placement and in their ability to represent multidimensional data elements, and (2) build an effective visualization technique that uses glyphs to represent the two-dimensional flow field.
Nanostructured substrates for high density protein arrays
Authors: Frank A. Zoller, Celestino Padeste, Yasin Ekinci, Harun H. Solak, Andreas Engel
Venue: Microelectronic Engineering (2008)

Nearly defect-free arrays of several 10^4 gold dots of 12+/-3nm in diameter inside 10nm deep cavities were fabricated for immobilization of proteins. Extreme ultraviolet interference lithography (EUV-IL) at the XIL-beamline of the Swiss Light Source was used to produce 140nm period arrays of 50nm holes in a 40nm thick PMMA layer on oxidized silicon wafers. The size of the openings was reduced by glancing angle deposition (GLAD) of metals such as chromium and silver. Reactive ion etching of the underlying substrate, followed by deposition of a few nanometers of gold, lift-off and thermal annealing resulted in perfectly ordered arrays of small gold nanoparticles with well-defined size distribution. The combination of passivation of the silica surface with polyethylene glycol (PEG) derivatives and functionalization of gold with thiols enables the preparation of large area arrays of well separated functional protein molecules.
Ubiquitous sensor-based human behaviour recognition using the spatio-temporal representation of user states
Authors: Yoshinori Isoda, Shoji Kurakake, Kazuo Imai
Venue: International Journal of Wireless and Mobile Computing (2008)

There has been much research on location-based context-aware applications. However, any description of a person's activities must include a temporal aspect as well as a location aspect. Therefore, it is important when creating enhanced user activity support systems to consider the user's context in terms of spatio-temporal constraints. In this paper, we propose a user activity support system that employs a state sequence description scheme to describe the user's context. In this scheme, each state is described as a spatio-temporal relationship between the user and objects. Typical sequences of states are stored as models of activities performed by a user. Each segment of user activities measured by the sensors and the Radio Frequency Identification tags (RFID tags) is classified into a state by using a decision tree constructed by the machine learning algorithm called C4.5. The user's context is then obtained by matching the detected state series to a stored task model. To validate this system, we have developed an experimental house containing various embedded sensors and RFID-tagged objects. Having evaluated the performance of the proposed system, we conclude that our system is an effective way of acquiring the user's spatio-temporal context.
Query based intelligent web interaction with real world knowledge
Authors: Ong Sing Goh, Chun Che Fung, Kok Wai Wong
Venue: New Generation Computing (2008)

This paper describes an integrated system based on open-domain and domain-specific knowledge for the purpose of providing query-based intelligent web interaction. It is understood that general purpose conversational agents are not able to answer questions on specific domain subject. On the other hand, domain specific systems lack the flexibility to handle common sense questions. To overcome the above limitations, this paper proposed an integrated system comprises of an artificial intelligent conversation software robot or chatterbot, called Artificial Intelligence Natural-language Identity (hereafter, AINI), and an Automated Knowledge Extraction Agent (AKEA) for the acquisition of real world knowledge from the Internet. The objective of AKEA is to retrieve real world knowledge or information from trustworthy websites. AINI is the mechanism used to manage the knowledge and to provide appropriate answer to the user. In this paper, we compare the performance of the proposed system against two popular search engines, two question answering systems and two other conversational systems.
Error correcting arithmetic coding for JPEG 2000: memory and performance analysis
Authors: S. Zezza, M. Grangetto, M. Martina, F. Vacca, G. Masera
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

Entropy coding, and specifically arithmetic codes are particularly sensitive to bit errors. Indeed, due to the memory inherent to the arithmetic coding a single flipped bit may cause desynchronization of the decoder, hence all the remaining symbols can be erroneous. In this paper a detailed study of complexity, for a known in literature correction algorithm, is presented. In particular the amount of memory required to implement the algorithm has been evaluated, proposing two possible approaches: previous state and repeat current pass. Experimental results show that the second method requires a lower amount of memory than the first. Furthermore the performance achieved by the error correction algorithm, in terms of decoded frames per second, have been analyzed. To this purpose the MQ decoder rate has been evaluated.
An Integrated Approach to Recognition of Lane Marking and Road Boundary
Authors: Weina Lu, Yucai Zheng, YuQuan Ma, Tao Liu
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

An integrated vision method was proposed for intelligent vehicles to synchronously recognize the lane marking and road boundary in direct or curve road environment. Firstly, with region connectivity analyzing, the method extracted the brightness features of lane markings on input images by self-adaptive threshold segmenting. Not only the gradient magnitude but also the gradient direction features of the road boundary were extracted by the Sobel operator method. Secondly, the 2-D models of road shape were acquired and the features above were matched to them by least-squares fit. With the circular calling of detecting and tracking program block, the whole process showed a fast and exact capability. The experiments have been conducted with the videos captured from real road scenes, and the results proved that it is a real time and robust method to recognize the road for the vision-based navigation of intelligent vehicles.
Computational framework for remotely operable laboratories
Authors: Prakash Kripakaran, Abhinav Gupta, Vernon C. Matzen
Venue: Engineering with Computers (2008)

Decision-makers envision a significant role for remotely operable laboratories in advancing research in structural engineering, as seen from the tremendous support for the network for earthquake engineering simulation (NEES) framework. This paper proposes a computational framework that uses LabVIEW and web technologies to enable observation and control of laboratory experiments via the internet. The framework, which is illustrated for a shaketable experiment, consists of two key hardware components: (1) a local network that has an NI-PXI with hardware for measurement acquisition and shaketable control along with a Windows-based PC that acquires images from a high-speed camera for video, and (2) a proxy server that controls access to the local network. The software for shaketable control and data/video acquisition are developed in the form of virtual instruments (VI) using LabVIEW development system. The proxy server employs a user-based authentication protocol to provide security to the experiment. The user can run perl-based CGI scripts on the proxy server for scheduling to control or observe the experiment in a future timeslot as well as gain access to control or observe the experiment during that timeslot. The proxy server implements single-controller multiple-observer architecture so that many users can simultaneously observe and download measurements as a single controller decides the waveform input into the shaketable. A provision is also created for users to simultaneously view the real-time video of the experiment. Two different methods to communicate the video are studied. It is concluded that a JPEG compression of the images acquired from the camera offers the best performance over a wide range of networks. The framework is accessible by a remote user with a computer that has access to a high-speed internet connection and has the LabVIEW runtime engine that is available at no cost to the user. Care is taken to ensure that the implementation of the LabVIEW applications and the perl scripts have little dependency for ease of portability to other experiments.
A Time-Domain Method for Pseudo-Spectral Characterization
Authors: Apurva Mishra, Mani Soma
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

We present a generic method for determining transfer function of a DUT using simple time-domain computations in place of conventional computationally intensive frequency domain methods. Our method uses a chirp stimulus and an average of absolute value to extract energy in different frequency bins. For an N0-size spectrum, this enables a reduction of computational complexity from N0*ln(N0) multiply-accumulates (using an FFT) to N0 accumulates. This makes it an attractive strategy for BIST. We present the theoretical basis, test case simulations, and a comparison with the FFT method.
A New Remote Camera Work System for Teleconference Using a Combination of Omni-Directional and Network Controlled Cameras
Authors: Yousuke Sato, Koji Hashimoto, Yoshitaka Shibata
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

As advent of communication network and multimedia processing technologies, various video conference systems to smoothly communicate each other between remote sites using with high quality audio and video have been developed. However, since those video conference systems usually use conventional cameras which only capture the objective images in one direction with narrow area, wide area such as 360 degree of surround direction cannot be captured. In this paper, we introduce a new teleconference system so called Telegnosis in which omni-directional camera and PTZ (Pan/Tilt/Zoom) are combined. While the omni-directional camera capture 360 degree of surrounding images, the PTZ camera captures more detail images specified by the users in omni-directional panorama images by pan, tilt and zoom operations. Using multiple Telegnosis systems, more flexible and dynamic video conference system can be realized for new application fields.
Three level DC-to-AC power inverter for power grid operation
Authors: K. H. Edelmoser
Venue: Proceedings of the 9th International Conference on Circuits (2005)

In case of medium voltage (several tens up to hundred volts on DC-side) solar inverter applications a DC to-DC converter for voltage level adaptation is required in front of the DC-to-AC inverter. This leads to a two-stage concept with accumulation of the losses. In our case a concept was chosen, where the efficiency in each stage is maximized by usage of the best-fit topology. Conventional power inverters used in mains connected applications fight with the disadvantage of the hard switched PWM power stage operating at high voltages [1,2]. Also soft switching topologies [6,7] do not give full benefits at all. In this paper the conjunction of simple boost- and buck converter stages gives the facility to realize an optimal design for power grid coupled inverters. The reduced voltage stress of each stage can lead to a significant improvement of the system losses. Furthermore it is shown, that a revised method of energy storage in the 'weak' DC-link can be used for smoothing the input current. Sharing of the energy flow in each power stage can also lead to reduced losses. The topology presented here shows a remarkable improvement of the switching losses and significantly reduced electromagnetic compatibility (EMC).