ppxscal/embedding_network huggingface dataset:
Plasmon resonant Au nanospheres and nanorods in anodic alumina matrix
Authors: V. G. Stoleru, E. Towe
Venue: Microelectronic Engineering (2005)

This paper discusses theoretical studies of optical properties of gold nanospheres and nanorods with various aspect ratios, embedded in porous anodic alumina matrix. We show in this study that when the alumina template is made under certain conditions, nanostructures with diameters in the 15-25nm range can be synthesized. Embedding gold particles of nanometer dimensions into a dielectric matrix provides a simple way to study the optical properties of the particles. Plasmon resonance wavelength for gold nanospheres and nanorods with different aspect ratios embedded in porous anodic alumina matrix are computed and discussed in this study. Recently, the plasmons in porous anodic alumina matrix have been considered for quasi-non-diffractive nano-optics applications. Other potential applications of the noble metal nanoparticles include optical filters and sensors.
Using Model-Checkers for Mutation-Based Test-Case Generation, Coverage Analysis and Specification Analysis
Authors: Gordon Fraser, Franz Wotawa
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Automated software testing is an important measure to improve software quality and the efficiency of the software development process. We present a model-checker based approach to automated test-case generation applying mutation to behavioral models and requirements specifications. Unlike previous related approaches, the requirements specification is at the center of this process. A property coverage criterion is used to show that resulting test-cases sufficiently exercise all aspects of the specification. A test-suite derived from the specification can only be as good as the specification itself. We demonstrate that analysis of the testcase generation process reveals important details about the specification, such as vacuity and how much of the model it covers, without requiring additional costly computations.
Try to see it my way: modelling persuasion in legal discourse
Authors: Trevor J. M. Bench-Capon
Venue: Artificial Intelligence and Law (2003)

In this paper I argue that to explain and resolve some kinds of disagreement we need to go beyond what logic alone can provide. In particular, following Perelman, I argue that we need to consider how arguments are ascribed different strengths by different audiences, according to how accepting these arguments promotes values favoured by the audience to which they are addressed. I show how we can extend the standard framework for modelling argumentation systems to allow different audiences to be represented. I also show how this formalism can explain how some disputes can be resolved while in others the parties can only agree to differ. I illustrate this by consideration of a legal example. Finally, I make some suggestions as to where these values come from, and how they can be used to explain differences across jurisdictions, and changes in views over time.
Document generality: its computation for ranking
Authors: Xin Yan, Xue Li, Dawei Song
Venue: Proceedings of the 17th Australasian Database Conference - Volume 49 (2006)

The increased variety of information makes it critical to retrieve documents which are not only relevant but also broad enough to cover as many different aspects of a certain topic as possible. The increased variety of users also makes it critical to retrieve documents that are jargon free and easy-to-understand rather than the specific technical materials. In this paper, we propose a new concept namely document generality computation. Generality of document is of fundamental importance to information retrieval. Document generality is the state or quality of document being general. We compute document generality based on a domain-ontology method that analyzes scope and semantic cohesion of concepts appeared in the text. For test purposes, our proposed approach is then applied to improving the performance of document ranking in bio-medical information retrieval. The retrieved documents are re-ranked by a combined score of similarity and the closeness of documents' generality to that of a query. The experiments have shown that our method can work on a large scale bio-medical text corpus OHSUMED (Hersh, Buckley, Leone & Hickam 1994), which is a subset of MED-LINE collection containing of 348,566 medical journal references and 101 test queries, with an encouraging performance.
RepLib: a library for derivable type classes
Authors: Stephanie Weirich
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Haskell (2006)

Some type class instances can be automatically derived from the structure of types. As a result, the Haskell language includes the "deriving" mechanism to automatic generates such instances for a small number of built-in type classes. In this paper, we present RepLib, a GHC library that enables a similar mechanism for arbitrary type classes. Users of RepLib can define the relationship between the structure of a datatype and the associated instance declaration by a normal Haskell functions that pattern-matches a representation type. Furthermore, operations defined in this manner are extensible-instances for specific types not defined by type structure may also be incorporated. Finally, this library also supports the definition of operations defined by parameterized types.
Reader collision avoidance mechanism in ubiquitous sensor and RFID networks
Authors: Sungjun Kim, Sangbin Lee, Sunshin An
Venue: Proceedings of the 1st international workshop on Wireless network testbeds, experimental evaluation characterization (2006)

The RFID reader collision problem[4] occurs when a signal from one reader interferes with the signal from other readers. In this paper, we propose a RCF(Reader Collision Free) protocol, a protocol to reduce these reader collisions in the RFID systems. The operation of the RCF protocol is based on RTC/CTS mechanism in IEEE 802.15.4 sensor networks. We verify the proposed RCF protocol using experiment in RFID sensor network.
Quantitative Evaluation of Near Regular Texture Synthesis Algorithms
Authors: Wen-Chieh Lin, James Hays, Chenyu Wu, Yanxi Liu, Vivek Kwatra
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Near regular textures are pervasive in man-made and natural world. Their global regularity and local randomness pose new difficulties to the state of the art texture analysis and synthesis algorithms. We carry out a systematic comparison study on the performance of four texture synthesis algorithms on near-regular textures. Our results confirm that faithful near-regular texture synthesis remains a challenging problem for the state of the art general purpose texture synthesis algorithms. In addition, we provide comparison of human perception with computer evaluations on the quality of the texture synthesis results.
Mechanical constraints as common ground between people and computers
Authors: Hiroshi Ishii
Venue:  (2006)

This thesis presents a new type of human-computer interface based on mechanical constraints that combines some of the tactile feedback and affordances of mechanical systems with the abstract computational power of modern computers. The interface is based on a tabletop interaction surface that can sense and move small objects on top of it. Computation is merged with dynamic physical processes on the tabletop that are exposed to and modified by the user in order to accomplish his or her task. The system places mechanical constraints and mathematical constraints on the same level, allowing users to guide simulations and optimization processes by constraining the motion of physical objects on the interaction surface. The interface provides ample opportunities for improvisation by allowing the user to employ a rich variety of everyday physical objects as interface elements. Subjects in an evaluation were more effective at solving a complex spatial layout problem using this system than with either of two alternative interfaces that did not feature actuation. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Changes in the Human Brain during Rhythm Learning
Authors: N. Ramnani, R. E. Passingham
Venue: Journal of Cognitive Neuroscience (2001)

Subjects were scanned with PET while they learned a complex arbitrary rhythm, paced by visual cues. In the comparison condition, the intervals were varied randomly. The behavioral results showed that the subjects decreased their response time with training, thus becoming more accurate in responding to the pacing cues at the appropriate time. There were learning-related increases in the posterior lateral cerebellum (lobule HVIIa), intraparietal and medial parietal cortex, presupplementary motor area (pre-SMA), and lateral premotor cortex. Learning-related decreases were found in the prestriate and inferior temporal cortex, suggesting that with practice the subjects increasingly came to depend on internal rather than external cues to time their responses. There were no learning-related increases in the basal ganglia. It is suggested that it is the neocortical-cerebellar loop that is involved in the timing and coordination of responses.
Marine corps applicatons of data farming
Authors: Adam J. Forsyth, Gary E. Home, Stephen C. Upton
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Project Albert is a modeling and simulation initiative of the United States Marine Corps that combines the rapid prototyping of agent-based distillations with the exploratory power of data farming to rapidly generate insight into military questions (Fry 2002). Data farming focuses on the complete landscape of possible system responses, rather than attempting to pinpoint an answer. This "big picture" solution landscape is an invaluable aid to the decision maker in light of the complex nature of the modern battle-space. And while there is no such thing as an optimal decision in a system where the enemy has a vote, data farming allows the decision maker to more fully understand the landscape of possibilities and thereby make an informed decision. The goal of data farming is that decision makers will no longer be surprised by surprise. This paper outlines some data farming explorations conducted over the past few years.
SCTP profiling framework for multi-homed environment
Authors: Adrian Gauch, Yoshifumi Nishida
Venue: Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking (2006)

Nowadays, it is not rare that a mobile node equips multiple interfaces such as Ethernet, 802.11b, mobile phones and WiMAX. A node with multiple interfaces has the possibility to utilize the multiple network accesses for robust and effcient communication. However, TCP can handle only a single IP address per connection. Hence, applications that uses TCP can not utilize multiple network access fully. The Stream Control Transmission Protocol(SCTP) is a new transport protocol which is receiving attention as the successor of TCP. One of the advanced features of SCTP is multi-homing, which allows an endpoint to have more than one IP address for switchovers to be transparent to higher layers. In this paper, we focus on issues in SCTP multi-homing and propose a new framework that enhances this feature to realize smooth switchover. By estimating the condition of each networks, such as delay or loss-rate, our framework enables SCTP to use the best address that meets users' requirements. Since our framework will be useful for delay-sensitive or loss-rate sensitive applications in multihomed environments, it will be suitable for applications in mobile environments.
GA-Optimized Wavelet Neural Networks for System Identification
Authors: Jinhua Xu
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In this paper, a genetic algorithm is proposed to design WNNs for nonlinear system identification. The model structure of a high dimensional system is decomposed into some submodels of low dimensions. By introducing a connection switch to each link between a wavelet and an input node, the decomposition is done automatically during the evolutionary process. GA is used to train the wavelet parameters and the connection switches. In this way, both the structure and wavelet parameters of WNNs can be optimized simultaneously. The proposed WNNs can handle nonlinear identification problems in high dimensions.
Orthogonal Decision Trees
Authors: Hillol Kargupta, Byung-Hoon Park, Haimonti Dutta
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

This paper introduces orthogonal decision trees that offer an effective way to construct a redundancy-free, accurate, and meaningful representation of large decision-tree-ensembles often created by popular techniques such as Bagging, Boosting, Random Forests, and many distributed and data stream mining algorithms. Orthogonal decision trees are functionally orthogonal to each other and they correspond to the principal components of the underlying function space. This paper offers a technique to construct such trees based on the Fourier transformation of decision trees and eigen-analysis of the ensemble in the Fourier representation. It offers experimental results to document the performance of orthogonal trees on the grounds of accuracy and model complexity.
WaveSim and Adaptive WaveSim Transform for Subsequence Time-Series Clustering
Authors: R. Pradeep Kumar, P. Nagabhushan, A. Chouakria-Douzal
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

Recent days advancement in sensor and instrumentation technology has seen a large amount of time series data being recorded in our day-to-day life. Knowledge and data mining research has taken up the responsibility of mining the hidden patterns in these huge collection of time series data during the past decade. In this paper we propose methodologies to extract hidden knowledge in a time series data through an unsupervised approach by using the novel WaveSim transform. This recently introduced transform is a novel perspective of wavelet transform and it is defined by keeping pattern analysis and recognition in mind. Time series data mining has been classified broadly into whole series mining and subsequence series mining. We propose a hierarchical tree based approach for subsequence mining in a time series using a modified WaveSim transform called Adaptive WaveSim transform. The technique has been illustrated through a set of experimentation results which is expected to open up a wide arena for future work.
HybridTouch: an intuitive manipulation technique for PDAs using their front and rear surfaces
Authors: Masanori Sugimoto, Keiichi Hiroki
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

This paper describes a new manipulation technique for small-screen mobile devices. The proposed technique, called HybridTouch, uses a touchpad attached to the rear surface of a PDA. A user can manipulate the PDA by simultaneously touching the front surface with a stylus pen held by the dominant hand and the rear surface with a finger of the nondominant hand. User studies were conducted via applications augmented by HybridTouch, and proved that users could perform manipulation tasks intuitively.
Top Ten Questions To Design A Successful Grid Portal
Authors: Xiao Dong Wang, Xiaobo Yang, Rob Allan
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

With the enhancement of Grid application, Grid portal provides a unique interface for end-users to access distributed resources and are used widely in Knowledge Grid, e-Science, e-learning and e-business. A successful Grid portal relies on many factors. This paper focuses primarily on the design aspects of a successful Grid portal implementation. Ten questions of designing Grid portal are discussed in no particular order. The questions detail the key considering areas of Grid portal architecture, Grid portal contents, portal security, reusability, software design, management and programming test.
Lessons from the BOWS contest
Authors: Andreas Westfeld
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

In the first BOWS Contest, a watermarking system was exposed to attacks from all over the world--not to prove that the system is resistant to attacks or to claim that it is unbreakable, rather to learn more about the level of weakness and perhaps new possible attacks. The goal was to wipe the watermark while keeping the best possible quality of the images. This paper highlights some of our tests and results. We analysed the interaction between attack strength and quality measure and described two more successful approaches to remove the watermark: (1) to reduce artefacts that are introduced by the watermarking algorithm, which renders embedded information unreadable and (2) a specialised sensitivity attack.
Efficient Dense Stereo with Occlusions for New View-Synthesis by Four-State Dynamic Programming
Authors: A. Criminisi, A. Blake, C. Rother, J. Shotton, P. H. Torr
Venue: International Journal of Computer Vision (2007)

A new algorithm is proposed for efficient stereo and novel view synthesis. Given the video streams acquired by two synchronized cameras the proposed algorithm synthesises images from a virtual camera in arbitrary position near the physical cameras. The new technique is based on an improved, dynamic-programming, stereo algorithm for efficient novel view generation. The two main contributions of this paper are: (i) a new four state matching graph for dense stereo dynamic programming, that supports accurate occlusion labelling; (ii) a compact geometric derivation for novel view synthesis by direct projection of the minimum cost surface. Furthermore, the paper presents an algorithm for the temporal maintenance of a background model to enhance the rendering of occlusions and reduce temporal artefacts (flicker); and a cost aggregation algorithm that acts directly in the three-dimensional matching cost space.The proposed algorithm has been designed to work with input images with large disparity range, a common practical situation. The enhanced occlusion handling capabilities of the new dynamic programming algorithm are evaluated against those of the most powerful state-of-the-art dynamic programming and graph-cut techniques. Four-state DP is also evaluated against the disparity-based Middlebury error metrics and its performance found to be amongst the best of the efficient algorithms. A number of examples demonstrate the robustness of four-state DP to artefacts in stereo video streams. This includes demonstrations of cyclopean view synthesis in extended conversational sequences, synthesis from a freely translating virtual camera and, finally, basic 3D scene editing.
Approaches to aspect oriented design: a study
Authors: Deepak Dahiya Rajinder K. Sachdeva
Venue: ACM SIGSOFT Software Engineering Notes (2006)

There is a need to study various approaches in the use of object-oriented design patterns and aspect oriented design approach in enterprise systems for architecture and its implementation. The development of aspect oriented requirements gathering approach, design notation and environment for development of enterprise systems needs to be further refined in the context of software applications and industry. Current development in aspects and the path to future work in this direction is highlighted regarding developing a general-purpose design language for aspect oriented software development.
Real Time Business Performance Monitoring and Analysis Using Metric Network
Authors: Pu Huang, Hui Lei, Lipyeow Lim
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Monitoring and analyzing business performance in a continuous manner nowadays is crucial for enterprises to achieve operational excellence, and to better align daily operations with long-term business strategies. To do so, performance measures need to be collected from daily operations and aggregated to construct higher-level Key Performance Indicators (KPIs) in nearly real time. We propose a system called metric network for enterprise-wide business performance monitoring and analysis. A metric network consists of metrics, metric repositories, aggregation agents, and knowledge agents. We describe in details the generic procedure patterns of these metric network entities and their communication pattern. Our loosely coupled design makes it easy to enhance features by adding more metrics and agents. The proposed approach is examined using real metrics on a fictitious scenario.
Mobile Grid Routing Algorithm in Mobile Ad Hoc Networks with Obstacles
Authors: Di Wu, Ning Tong, Keqiu Li
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Mobile grid provides mobile devices with a high reliability, performance and cost-efficiency. Physical limitations of the mobile devices make necessary the adaptation of the services that mobile grid can provide to the mobile devices. In the paper, we proposed a mobile grid routing algorithm in the presence of obstacles called obstacle mobile grid routing algorithm (OMGR). OMGR consists of mobility model, connected dominating set (CDS) election and mobile gird routing algorithm. In obstacle mobility model, we introduce STANDBY nodes as relaying nodes between two nodes that are invisible. The distributed CDS election algorithm extends Wu and Li's algorithm and utilizes STANDBY nodes to connect the existing dominating-nodes belonging to dominating set. In addition, OMGR based on a CDS uses hybrid routing scheme (flooding-based approach and position-based approach) to forward around any obstacles. Eventually, an example is given to show that the proposed approach can form a CDS and successfully construct routes.
Interactive PC Texture-Based Volume Rendering for Large Datasets
Authors: Jie Zheng, Hongbing Ji, Wanhai Yang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

We present a novel technique for rendering largescale volume datasets interactively on general purpose PC hardware. To circumvent the limited texture memory for texture based volume rendering, the dataset is partitioned into the bricks with reasonable size. The bricks are loaded to the graphics hardware dynamically and rendered using 3D texture mapping. During the rendering only one brick resides on the texture memory. Additionally, the sophisticated PC graphics hardware functionality is utilized to estimate the gradient on the fly avoiding the huge memory consumption in previous approaches. Using a prototype implementation of the algorithm, we are able to perform fast data loading and interactive visualization for the large datasets on a single standard PC.
A continuous-time adaptive filter structure
Authors: L. Ortiz-Balbuena, A. Martinez-Gonzalez, H. Perez-Meana, L. Nino de Rivera
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

Adaptive filters have been traditionally developed in a digital environment which involves a large number of computations to derive the coefficients of the desired approximation. Most of the time, these calculations required a machine of great capacity and that is not practical for some applications like channel equalization in cellular systems. This paper proposes a continuous-time adaptive filter which is based on representing the impulse response of an adaptive filter as a linear combination of a set of orthogonal exponentials. An important practical advantage is that if a satisfactory representation can be obtained by exponentials simple filter structures can be synthesized. An analog adaptive filter structure that improve the time convergence of conventional realizations using a continuos time LMS algorithm to reduce the error between the reference system and the adaptive filter is shown.