ppxscal/embedding_network huggingface dataset:
A Library and Platform for FPGA Bitstream Manipulation
Authors: Adam Megacz
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

Since 1998, no commercially available FPGA has been accompanied by public documentation of its native machine code (or bitstream) format. Consequently, research in reconfigurable hardware has been confined to areas which are specifically supported by manufacturer-supplied tools. Recently, detailed documentation of the bitstream format for the Atmel FPSLIC series of FPGAs appeared on the usenet group comp.arch.fpga[11]. This information has been used to create abits, a Java library for direct manipulation of FPSLIC bitstreams and partial reconfiguration. The abits library is accompanied by the slipway reference design, a low-cost USB bus-powered board carrying an FPSLIC. This paper describes the abits library and slipway platform, as well as a few applications which they make possible. Both the abits source code and slipway board layout are publicly available under the terms of the BSD license. It is our hope that these tools will enable further research in reconfigurable hardware which would not otherwise be possible.
Determining the context of text using augmented latent semantic indexing
Authors: Tom Rishel, Louise A. Perkins, Sumanth Yenduri, Farnaz Zand
Venue: Journal of the American Society for Information Science and Technology (2007)

Latent semantic analysis has been used for several years to improve the performance of document library searches. We show that latent semantic analysis, augmented with a Part&ndash;of&ndash;Speech Tagger, may be an effective algorithm for classifying a textual document as well. Using Brille's Part&ndash;of&ndash;Speech Tagger, we truncate the singular value decomposition used in latent semantic analysis to reduce the size of the word&ndash;frequency matrix. This method is then tested on a toy problem, and has shown to increase search accuracy. We then relate these results to natural language processing and show that latent semantic analysis can be combined with context free grammars to infer semantic meaning from natural language. English is the natural language currently being used. &copy; 2007 Wiley Periodicals, Inc.
Efficient on-line index maintenance for dynamic text collections by using dynamic balancing tree
Authors: Ruijie Guo, Xueqi Cheng, Hongbo Xu, Bin Wang
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Previous on-line index maintenance strategies are mainly designed for document insertions without considering document deletions. In a truly dynamic search environment, however, documents may be added to and removed from the collection at any point in time. In this paper, we examine issues of on-line index maintenance with support for instantaneous document deletions and insertions. We present a DBT Merge strategy that can dynamically adjust the sequence of sub-index merge operations during index construction, and offers better query processing performance than previous methods, while providing an equivalent level of index maintenance performance when document insertions and deletions exist in parallel. Using experiments on 426 GB of web data we demonstrate the efficiency of our method in practice, showing that on-line index construction for dynamic text collections can be performed efficiently and almost as fast as for growing text collections.
Managing Offshore Outsourcing of Knowledge-intensive Projects - A People Centric Approach
Authors: Morten Jensen, Shashi Menon, Lars Erik Mangset, Vibeke Dalberg
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

This paper illustrates a multinational company encountering specific challenges with respect to the leveraging offshore outsourcing for knowledge intensive software development tasks. Following a gathering of corporate experiences and vendor interviews, an active management model was implemented with explicit focus on people and their working environment. The impact of this initiative was immediately visible in terms of increased productivity, improved quality of deliverables and a dramatic reduction in vendor employee turnover. Based on these results we believe that knowledge-intensive projects can be offshore outsourced with a people-centric approach.
A Shared-Path-Protection Based Heuristic Algorithm for the Capacity Placement Problem in Mesh Networks
Authors: Wei Xu, Xing-ming Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost. Unlike SCP (Spare Capacity Placement) scheme, JOCP (Jointly Optimized Capacity Placement) scheme could reach more optimal results since it tries to jointly optimize both working and spare capacity. However, the later is more complex and time-consuming according to previous research based on IP solution. This paper presents a heuristic algorithm MSC-JOCP, which is based on shared-path protection, to address this problem. The key idea of the algorithm is to dynamically modulate the metrics of the network's spans, so as to choose primary and backup routes given attention to load balancing as well as maximally share the spare capacity. Simulation results show that the developed scheme effectively reduces the required total capacity and enhances the network resource utilization.
A Real Time Network Game System Based on Retransmission of N-based Game Command History for Revising Packet Errors
Authors: Seong-Hoo Kim, Bong-Joon Choi, Mi-Sook Jung, Kyoo-Seok Park
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

The latency occurring from the load fluctuation in a real-time network games may be overcome by using an initial delay scheme on the client, and then play the game, it means that stability can be maintained, and the shortcomings of packet losses and errors on UDP communications are alleviated. In this paper, we suggest a retransmission algorithm using an N-Based game command history that supports End-to-End protocol, and retransmits data without alteration of existing protocols, and also supports video games based on multi-platform in wired-wireless network environments, and it can possibly work under multi-user games. As demonstrated in the simulations, we confirm that the suggested system is more stable than existing systems.
Characterization of Product Anti-Magic Graphs of Large Order
Authors: Oleg Pikhurko
Venue: Graphs and Combinatorics (2007)

A graph G is product anti-magic if one can bijectively label its edges with integers 1, . . . ,e(G) so that no two vertices have the same product of incident labels. This property was introduced by Figueroa-Centeno, Ichishima, and Muntaner-Batle who in particular conjectured that every connected graph with at least 4 vertices is product anti-magic. Here, we completely describe all product anti-magic graphs of sufficiently large order, confirming the above conjecture in this case. Our proof uses probabilistic methods.
A Formal Approach to Verify Mapping Relation in a Software Product Line
Authors: Tonny Kurniadi Satyananda, Danhyung Lee, Sungwon Kang
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In software product line development, consistency among artifacts is important because commonalities and variabilities increase the complexity of relations among artifacts. For small scale models, the relations among elements can be easily identified and tracked by manually analyzing the descriptions of models. But when the complexity of models is high, a more systematic approach is required for identifying traceability information and verifying consistency between models. In this paper, by utilizing Formal Concept Analysis (FCA) and Prototype Verification System (PVS), we present a formal approach for identifying traceability and verifying consistency between feature model and component and connector view of software architecture.
A study on Offset Time Based Burst Generation Scheme for Optical Burst Switching Networks
Authors: SeoungYoung Lee, In-Yong Hwang, YongSuk Lee, Hong-Shik Park
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Even though the optical burst switching scheme is simple and cuts through data bursts without opto-electro-optic (O/E/O) conversion in core nodes, burst loss due to contention and the fairness problem in the mesh network have become intrinsically serious problems. To solve these problems, we proposed a new burst generation and fairness guaranteeing scheme in edge/core node combined mesh networks in previous researches. We showed that fairness was guaranteed among the same priority by grouping bursts according to offset times and using separate wavelength groups for each priority burst. In this paper, we propose a new scheme to improve the performance of the optical burst switching system by assigning higher priority to long traveled bursts over bursts just generated by previous nodes. We use a mathematical method to compare the proposed and conventional schemes. Our analysis results show that the proposed scheme has less blocking probability than the conventional scheme.
From development in the laboratory to deployment in the home: Trouble and strife with sensor networks.
Authors: E. Harris, R. Krishna, D. Chalmers, G. Fitzpatrick, M. Stringer
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

This paper examines the process of customizing Particle sensors for use in a home energy monitoring project. Our developments affected sensor hardware, sensor software and data capture. The developed sensors have been deployed in two homes in the UK. We examine the issues in using 3rd party toolkits to undertake research and suggest design and process enhancements to better assist with the deployment of sensors in homes.
How to Flowchart for Hardware
Authors: N. Tredennick
Venue: Computer (1981)

The flowchart method is a procedure for designing the processor of a computer. It helps transform the English description into the formal description a circuit designer needs.
Risk management in coalition networks
Authors: Wim Mees
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

In modern military operations, nations participate as members of a coalition. In order to realize a rapid command and control cycle, the armed forces of one nation need to establish communication links between their information system and that of other members of the coalition. These interconnections inevitably introduce risks, and these risks need to be managed. However, because each nation uses its own risk management methodology and tools, integrating the results of the risk assessment performed by a partner in the coalition with whom information is exchanged, into one's own risk management process, remains a periodically performed, manual operation. In this paper we will first discuss risk management approaches in a single organization, and show why it is important to adopt a continuous risk management approach. Next we will present a concept for realizing this continuous risk management in a coalition environment.
Benchmark Tests of Robust Modified Particle Swarm Optimization
Authors: Yuanyuan Liu, Wenbo Liu, Ziyang Zhen, Gong Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

The paper presents a new modified approach to improve the global and local exploration capabilities of particle swarm optimization (PSO). The modified PSO is based on the random strategy that random sequences in stead of some difficultly decided parameters are used in the update equation of the particle velocity, in which the inertia weight is replaced by a random sequence and both of two learning rate parameters are replaced by the sum of two different random sequences. Results of comparison with the basic PSO on the examination of some wellknown benchmark functions show the perfective and robustness of the improved PSO.
Virtual Memory
Authors: R. W. Doran
Venue: Computer (1976)

"Virtual memory" is a computing term which has come into increasing use in recent years. Unfortunately, like other new expressions, its use often causes controversy and misunderstanding, for it is used to mean different things by different people. Not long ago when one major computer vendor announced the introduction of the new technique of 'virtual storage,' other manufacturers complained that they had been doing the same thing for years under a different name (see Figure 1).
Test Scheduling for Memory Cores with Built-In Self-Repair
Authors: Tomokazu Yoneda, Yuusuke Fukuda, Hideo Fujiwara
Venue: Proceedings of the 16th Asian Test Symposium (2007)

This paper presents a stage-based test scheduling for memory cores with BISR scheme under power constraint. We introduce a model to compute the expected test time for a given test schedule for memory cores with BISR scheme based on pass probabilities, and propose a test scheduling algorithm to minimize the expected test time. Experimental results show a significant expected test time reduction compared to the core-based test scheduling method which minimizes the test time.
Trustable Ad Hoc Networks of Agent Societies
Authors: KaiYu Wan, Vasu Alagar, ZongYuan Yang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Ad-hoc agent networks are self-organizing societies of agents. Each society of agents is composed of autonomous agents forming an ad-hoc network having no infrastructure. A network community has an interface agent that serves as the certified access point for that network. Communication between two agents within a society requires the cooperation of other agents in the society who will act as intermediaries. This paper proposes an incentive-based mechanism to promote trusted collaboration among agents within a society. Based on this mechanism and through the certified interface agents an agent in one society can securely interact with one or more agents in another society.
Protection of Mammograms Using Blind Steganography and Watermarking
Authors: Yue Li, Chang-Tsun Li, Chia-Hung Wei
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

As medical image databases are connected together through PACS, those medical images may suffer from security breaches if not protected. If a medical image is illegally obtained or if its content is malevolently changed, the patient's privacy or health care to be provided will certainly be undermined. To solve this problem, this study proposes a steganographic method for mammograms, which hides patients' information in mammograms without changing their important details. In particular, the proposed method can extract the hidden information from stego-mammograms without the aid of the original images. This study also utilizes a watermarking technique, which masks the contents of the mammogram, for providing mammograms protection against illegal access and malevolent modifications. This watermark can be removed to reveal the masked mammogram when authorization for viewing is given.
Adaptive Neural Regularization Assignment for Semi-Blind Biomedical Image Restoration
Authors: E. Binaghi, I. Gallo, A. Guidali, M. Raspanti, G. Salvini
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

The aim of this work was to experimentally investigate the potentialities of an adaptive technique based on the Hopfield neural model for semi-blind restoration of Scanning Electron Microscopy (SEM) images.
The generalized pre-grouping transformation: aggregate-query optimization in the presence of dependencies
Authors: Aris Tsois, Timos Sellis
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

One of the recently proposed techniques for the efficient evaluation of OLAP aggregate queries is the usage of clustering access methods. These methods store the fact table of a data warehouse clustered according to the dimension hierarchies using special attributes called hierarchical surrogate keys. In the presence of these access methods new processing and optimization techniques have been recently proposed. One important such optimization technique, called Hierarchical Pre-Grouping, uses the hierarchical surrogate keys in order to aggregate the fact table tuples as early as possible and to avoid redundant joins. In this paper, we study the Pre-Grouping transformation, attempting to generalize its applicability and identify its relationship to other similar transformations. Our results include a general algebraic definition of the Pre-Grouping transformation along with the formal definition of sufficient conditions for applying the transformation. Using a provided theorem we show that Pre-Grouping can be applied in the presence of functional and inclusion dependencies without the explicit usage of hierarchical surrogate keys. An additional result of our study is the definition of the Surrogate-Join transformation that can modify a join condition using a number of dependencies. To our knowledge, Surrogate-Join does not belong to any of the Semantic Query Transformation types discussed in the past.
Live Distributed Objects: Enabling the Active Web
Authors: Krzysztof Ostrowski, Ken Birman, Danny Dolev
Venue: IEEE Internet Computing (2007)

Distributed computing has lagged behind the productivity revolution that has transformed the desktop in recent years. Programmers still generally treat the Web as a separate technology space and develop network applications using low-level message-passing primitives or unreliable Web services method invocations. Live distributed objects are designed to offer developers a scalable multicast infrastructure that's tightly integrated with a runtime environment.
Analysis and optimization of power-gated ICs with multiple power gating configurations
Authors: Aida Todri, Malgorzata Marek-Sadowska, Shih-Chieh Chang
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Power gating is an efficient technique for reducing leakage power in electronic devices by disconnecting blocks idle for long periods of time from the power supply. Disconnecting gated blocks causes changes in densities of currents flowing through a grid. Even in DC conditions, current densities in some grid branches may increase for some gating configurations to the extent of violating electromigration (EM) constraints. The existing DC methods for grid sizing optimize the grid area under voltage drop (IR) and EM constraints for one configuration of circuit blocks connected to the grid. We show that these methods cannot be directly applied for optimizing power-gated grids. We analyze the effects of EM and IR voltage drop in power grids with multiple power gating configurations. Based on our analyses, we develop a grid sizing algorithm to satisfy all reliability constraints for all feasible gating configurations. Our experimental results indicate that a grid initially sized for all blocks present may be modified to fulfill EM and IR constraints for multiple gating schedules with only a small area increase.
Characterization of a Digital Micromirror Device for Computer Generated Video Holography
Authors: Dapeng Wang, Sui Wei
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

The article studies the holographic coding method using a Digital Micromirror Device (DMD). On the basis of DMD's physical microstructure, three aspects of properties are concerned: two dimensional discrete micromirror pixels, blazed diffraction gratings of rotated mirrors and pulse width modulation working principle. The following factors have been considered, namely, DMD resolution, mirror size, pitch, rotating angle, incidental angles of reference wave and diffracting conditions. The paper puts forward the sampling method on interference plane, phase compensation technique and no-bias binary hologram coding methods, which have been proved to be feasible and effective. Results on holographic code have been deduced and simulated, which are meaningful for the application of DMD in holographic video and realtime 3-D reconstruction.
A Microprocessor-controlled Message Display System
Authors: Paul Stigall, Brian Lenharth
Venue: IEEE Micro (1984)

Microprocessors replace electromechanical components to make this message display system both more efficient and less costly.
An analysis of XQuery benchmarks
Authors: Loredana Afanasiev, Maarten Marx
Venue: Information Systems (2008)

This paper presents a survey and an analysis of the XQuery benchmark publicly available in 2006-XMach-1, XMark, X007, the Michigan benchmark, and XBench-from different perspectives. We address three simple questions about these benchmarks: How are they used? What do they measure? What can one learn from using them? One focus of our analysis is to determine whether the benchmarks can be used for micro-benchmarking. Our conclusions are based on an usage analysis, on an in-depth analysis of the benchmark queries, and on experiments run on four XQuery engines: Galax, SaxonB, Qizx/Open, and MonetDB/XQuery.
Using an Evolutionary Agent-Based System for Classification Tasks
Authors: Diogo F. Oliveira, Anne Canuto
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

The ClassAge system is a multi-agent system for classification tasks. This system was proposed as an attempt to include the idea of intelligent agents in the structure of multi- classifier systems (MCSs). Also, it is aimed to overcome some drawbacks of MCSs and, as a consequence, to improve the performance of such systems. In this paper, an extension of ClassAge is presented. Basically, an optimization technique is used to optimize the functioning of ClassAge. Also, each ClassAge agent is composed of a group of classifiers, instead of one classifier that was used in the original version.
Web Service Security model Using CBD Architecture
Authors: Eun-Ju Park, Haeng-Kon Kim, Roger Y. Lee
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

A Web Services is programmable application logic accessible using standard Internet protocols. Web services combine the best aspects of Component based development and the web. Like components, Web Services represent black-box functionality that can be reused without knowing about how the service is implemented. Unlike current component technologies, Web Services are not accessed via object-model-specific protocol. In this paper, we suggest the architecture development modeling and the web integration architecture to develop web service-security that is embodied in supplier on service oriented architecture(SOA). We also describe the various possibilities with which the components may be integrated well with applications have been explored and well-exposed using web services. This paper focuses on integrating Component based architecture modeling and Web Services to enable the development and usage of Facade and Backside components through the web by dynamically creating web services-security for the functionalities of the components.