ppxscal/embedding_network huggingface dataset:
Multiregion Level-Set Partitioning of Synthetic Aperture Radar Images
Authors: Ismail Ben Ayed, Amar Mitiche, Ziad Belhadj
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2005)

The purpose of this study is to investigate Synthetic Aperture Radar (SAR) image segmentation into a given but arbitrary number of gamma homogeneous regions via active contours and level sets. The segmentation of SAR images is a difficult problem due to the presence of speckle which can be modeled as strong, multiplicative noise. The proposed algorithm consists of evolving simple closed planar curves within an explicit correspondence between the interiors of curves and regions of segmentation to minimize a criterion containing a term of conformity of data to a speckle model of noise and a term of regularization. Results are shown on both synthetic and real images.
Using the patent co-citation approach to establish a new patent classification system
Authors: Kuei-Kuei Lai, Shiao-Jun Wu
Venue: Information Processing and Management: an International Journal (2005)

The paper proposes a new approach to create a patent classification system to replace the IPC or UPC system for conducting patent analysis and management. The new approach is based on co-citation analysis of bibliometrics. The traditional approach for management of patents, which is based on either the IPC or UPC, is too general to meet the needs of specific industries. In addition, some patents are placed in incorrect categories, making it difficult for enterprises to carry out R&D planning, technology positioning, patent strategy-making and technology forecasting. Therefore, it is essential to develop a patent classification system that is adaptive to the characteristics of a specific industry. The analysis of this approach is divided into three phases. Phase I selects appropriate databases to conduct patent searches according to the subject and objective of this study and then select basic patents. Phase II uses the co-cited frequency of the basic patent pairs to assess their similarity. Phase III uses factor analysis to establish a classification system and assess the efficiency of the proposed approach. The main contribution of this approach is to develop a patent classification system based on patent similarities to assist patent manager in understanding the basic patents for a specific industry, the relationships among categories of technologies and the evolution of a technology category.
AIS: A Fast, Disk Space Efficient "Adaptable Installation System" Supporting Multitudes of Diverse Software Configurations
Authors: Sergei Mikhailov, Jonathan Stanton
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

Efficiently installing and configuring large sets of computer systems is an important concern for system and cluster administrators. Current solutions usually follow one of the two approaches: an image- based install or a metadata-based custom install. Both approaches limit the opportunities for optimizing the installation time by coupling the system specification with the installation technique and ignoring the relationships between configurations over time (as they evolve with patches and new packages).The Adaptable Installation System (AIS) is a new model and implementation that attempts to address these shortcomings by taking a hybrid approach to client system installation. As in the metadata- based approach, it uses descriptors to express what the final system should look like in terms of composition and configuration. At the same time, it uses imaging for part of the client re-installation to achieve speed. In this paper we present the design and implementation of AIS along with details on the algorithm that builds images and performance results of running the prototype system on a set of RedHat based machines.
Challenges
Authors: Susan Esptein
Venue: Issue 83 (January 1983) (1983)

It is the intent of this article to push beyond the horizon of "current survey and future work," with a set of mildly outrageous long-term challenges. The targeted areas are expert systems, problem solving and learning. Somewhere between AAAI-82 and science fiction, our future research projects lie. If we are not to be mired in the pedestrian, we should reach out beyond the traditional. Not long ago, a proposal to develop heuristics (Lenat, 1982) or follow strategic instructions (Mostow) would have seemed mildly outrageous. This article is intended as a set of equally unreasonable challenges, a focus for the future. Expert systems, problem solving and learning are particularly amenable to such a focus. The categories are neither mutually exclusive nor collectively exhaustive.
On the Communication Complexity of Multilateral Trading: Extended Report
Authors: Ulle Endriss, Nicolas Maudet
Venue: Autonomous Agents and Multi-Agent Systems (2005)

We study the complexity of a multilateral negotiation framework, where autonomous agents agree on a sequence of deals to exchange sets of discrete resources in order to both further their own goals and to achieve a distribution of resources that is socially optimal. When analysing such a framework, we can distinguish different aspects of complexity: How many deals are required to reach an optimal allocation of resources? How many communicative exchanges are required to agree on one such deal? How complex a communication language do we require? And finally, how complex is the reasoning task faced by each agent?
Don't Make Me Think: A Common Sense Approach to the Web (2nd Edition)
Authors: Steve Krug
Venue:  (2005)

Five years and more than 100,000 copies after it was first published, it's hard to imagine anyone working in Web design who hasn't read Steve Krug's "instant classic" on Web usability, but people are still discovering it every day.ï¾ In this second edition, Steve adds three new chapters in the same style as the original: wry and entertaining, yet loaded with insights and practical advice for novice and veteran alike.ï¾ Don't be surprised if it completely changes the way you think about Web design. Three New Chapters! Usability as common courtesy -- Why people really leave Web sites Web Accessibility, CSS, and you -- Making sites usable and accessible Help! My boss wants me to ______. -- Surviving executive design whims "I thought usability was the enemy of design until I read the first edition of this book.ï¾ Don't Make Me Think! showed me how to put myself in the position of the person who uses my site.ï¾ After reading it over a couple of hours and putting its ideas to work for the past five years, I can say it has done more to improve my abilities as a Web designer than any other book. In this second edition, Steve Krug adds essential ammunition for those whose bosses, clients, stakeholders, and marketing managers insist on doing the wrong thing.ï¾ If you design, write, program, own, or manage Web sites, you must read this book."ï¾ -- Jeffrey Zeldman, author of Designing with Web Standards
Jove: java as it happens
Authors: Steven P. Reiss, Manos Renieris
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

Dynamic software visualization is designed to provide programmers with insights as to what the program is doing. Most current dynamic visualizations either use program traces to show information about prior runs, slow the program down substantially, show only minimal information, or force the programmer to indicate when to turn visualizations on or off. We have developed a dynamic Java visualizer that provides a statement-level view of a Java program in action with low enough overhead so that it can be used almost all the time by programmers to understand what their program is doing while it is doing it.
Memory In Processor-Supercomputer On a Chip: Processor Design and Execution Semantics for Massive Single-Chip Performance
Authors: N. Venkateswaran, Arrvindh Shriraman, Niranjan Soundararajan
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 14 - Volume 15 (2005)

The MIP S.C.O.C was designed to overcome the Von-Neumann bottleneck and develop massive on-chip parallelism to achieve Teraflop scale single chip performance. We case study here a specific 2 MB MIP node that has a 128 bit datapath. This paper also specifies the technological reqirements and discusses the implementation strategy to support the feasibility of the project. We develop the ISA format and preview the hardware compiler COS, that will map applications and schedule the instructions on the MIP S.C.O.C. We then discuss the library specifications and COS-HLF unit interface. We develop the scalable pyramid cluster to accomodate massive node performance. We discuss briefly the programming model and an application execution to demonstrate the scalability.
An Effective Machine Learning Algorithm using Momentum Scheduling
Authors: Eun-Mi Kim, Seong-Mi Park, Kwang-Hee Kim, Bae-Ho Lee
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

This paper proposes a new algorithm to improve learning performance in support vector machine by using the Kernel Relaxation and the dynamic momentum. Compared with the static momentum, the dynamic momentum is simultaneously obtained by the learning process of pattern weight and reflected into different momentum by the current state. Therefore, the proposed dynamic momentum algorithm can effectively control the convergence rate and performance. The experiment using SONAR data shows that the proposed algorithm has better convergence rate and performance than the kernel relaxation using static momentum.
A subjective measure of web search quality
Authors: M. M. Sufyan Beg
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

In an Internet search, the user uses a query language to describe the nature of documents, and in response, a search engine locates the documents that "best match" the description. A number of search engines are available to Internet users today and more are likely to appear in the future. These systems differ from one another in the indexing technique they use to construct the repository of documents and the search algorithm they employ to generate the response. As a result, the results for the same query from different search engines vary considerably. In this work, our aim is to outline a procedure for assessing the quality of search results obtained through several popular search engines. This procedure would enable us to compare the performance of the popular search engines like Alta Vista, Direct Hit, Excite, Google, Hot Bot, Lycos and Yahoo, etc.We measure the "satisfaction" a user gets when presented with the search results. We watch the actions of the user on the search results presented before him in response to his query, and infer the feedback of the user therefrom. The implicit ranking thus provided by the user is compared with the original ranking given by the search engine. The correlation coefficient thus obtained is averaged for a set of queries. We show our results pertaining to 7 public search engines and 15 ad hoc queries. Our emphasis is more to demonstrate the procedure of quality measurement than to carry out the actual performance measurement of these search engines.
A full Java post-graduate curriculum
Authors: J.-P. Jacquot
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

This paper reports on our experience with a post-graduate curriculum in informatics for non specialists. This one-year master seeks to provide a sound and comprehensive education in computer science for graduate students from other scientific fields. We reorganized the curriculum in 1999 around Java as the base language for all the courses. Five years later, we analyze the results we have achieved.
On preservation under homomorphisms and unions of conjunctive queries
Authors: Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable by existential positive first-order formulas and are preserved under homomorphisms. A classical result of mathematical logic asserts that existential positive formulas are the only first-order formulas (up to logical equivalence) that are preserved under homomorphisms on all structures, finite and infinite. It is long-standing open problem in finite model theory, however, to determine whether the same homomorphism-preservation result holds in the finite, that is, whether every first-order formula preserved under homomorphisms on finite structures is logically equivalent to an existential positive formula on finite structures. In this paper, we show that the homomorphism-preservation theorem holds for several large classes of finite structures of interest in graph theory and database theory. Specifically, we show that this result holds for all classes of finite structures of bounded degree, all classes of finite structures of bounded treewidth, and, more generally, all classes of finite structures whose cores exclude at least one minor.
Monitoring hacker activity with a Honeynet
Authors: Kevin Curran, Colman Morrissey, Colm Fagan, Colm Murphy, Brian O'Donnell, Gerry Fitzpatrick, Stephen Condit
Venue: International Journal of Network Management (2005)

The Honeynet Project was founded by 30 US based security professionals with the intention of researching the techniques, tools, tactics and motives of hackers and the 'blackhat' community in general. A Honeynet Project is an all volunteer, non-profit organization committed to sharing and learning the motives, tools, and tactics of the hacking community. It is comprised of a number of information security professionals dedicated to honeynet research and information security. This paper outlines the technical configuration of a honeynet, presents some of the key attacks on the honeynet to date and provides recommendations for securing networked systems.
Semantic Link Network Builder and Intelligent Semantic Browser: Research Articles
Authors: H. Zhuge, R. Jia, J. Liu
Venue: Concurrency and Computation: Practice Experience (2004)

Semantic Link Network (SLN) is a semantic Web model using semantic links&mdash;the natural extension of the hyperlink-based Web. The SLN-Builder is a software tool that enables definition, modification and verification of, as well as access to the SLN. The SLN-Builder can convert a SLN definition into XML descriptions for cross-platform information exchange. The Intelligent Semantic Browser is used to visualize the SLN and carry out two types of reasoning in browsing time: small granularity reasoning by chaining semantic links and large granularity reasoning by matching semantic views of SLN. With the help of the reasoning mechanism, the browser can recommend the content that is semantically relevant to the current browsing content, and it enables users to foresee the end-side content of a semantic link chain. This paper presents the design and implementation of the SLN-Builder and the intelligent semantic browser as well as key algorithms. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Object naming analysis for reverse-engineered sequence diagrams
Authors: Atanas Rountev, Beth Harkness Connell
Venue: Proceedings of the 27th international conference on Software engineering (2005)

UML sequence diagrams are commonly used to represent object interactions in software systems. This work considers the problem of extracting UML sequence diagrams from existing code for the purposes of software understanding and testing. A static analysis for such reverse engineering needs to map the interacting objects from the code to sequence diagram objects. We propose an interprocedural dataflow analysis algorithm that determines precisely which objects are the receivers of certain messages, and assigns the appropriate diagram objects to represent them. Our experiments indicate that the majority of message receivers can be determined exactly, resulting in highly-precise object naming for reverse-engineered sequence diagrams.
Quantifying and Improving the Availability of High-Performance Cluster-Based Internet Services
Authors: Kiran Nagaraja, Neeraj Krishnan, Ricardo Bianchini, Richard P. Martin, Thu D. Nguyen
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Cluster-based servers can substantially increase performance when nodes cooperate to globally manage resources. However, in this paper we show that cooperation results in a substantial availability loss, in the absence of high-availability mechanisms. Specifically, we show that a sophisticated cluster-based Web server, which gains a factor of 3 in performance through cooperation, increases service unavailability by a factor of 10 over a non-cooperative version. We then show how to augment this Web server with software components embodying a small set of high-availability techniques to regain the lost availability. Among other interesting observations, we show that the application of multiple high-availability techniques, each implemented independently in its own subsystem, can lead to inconsistent recovery actions. We also show that a novel technique called Fault Model Enforcement can be used to resolve such inconsistencies. Augmenting the server with these techniques led to a final expected availability of close to 99.99%.
Siamese-Twin: A Dynamically Fault-Tolerant Fat-Tree
Authors: F. O. Sem-Jacobsen, T. Skeie, O. Lysne, O. Torudbakken, E. Rongved, B. Johnsen
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Fat-trees are a special case of multistage interconnection networks with quite good static fault tolerance capabilities. They are however straightforwardly unable to provide local dynamic fault tolerance. In this paper we propose a network topology based on the fat-tree using two parallel networks with crossover links between them in an effort to enable dynamic fault tolerance. We evaluate and compare this topology with two other similar fat-tree topologies and show through simulations that the new topology is able to improve slightly upon the ability to tolerate faults statically. More importantly, we show that the new network topology is the only one of the evaluated topologies able to tolerate one fault dynamically, with a superior network performance in the face of dynamically handled faults.
On the performance characteristics of WLANs: revisited
Authors: Sunwoong Choi, Kihong Park, Chong-kwon Kim
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Wide-spread deployment of infrastructure WLANs has made Wi-Fi an integral part of today's Internet access technology. Despite its crucial role in affecting end-to-end performance, past research has focused on MAC protocol enhancement, analysis and simulation-based performance evaluation without sufficient consideration for modeling inaccuracies stemming from inter-layer dependencies, including physical layer diversity, that significantly impact performance. We take a fresh look at IEEE 802.11 WLANs, and using a combination of experiment, simulation, and analysis demonstrate its surprisingly agile performance traits. Our main findings are two-fold. First, contention-based MAC throughput degrades gracefully under congested conditions, enabled by physical layer channel diversity that reduces the effective level of MAC contention. In contrast, fairness and jitter significantly degrade at a critical offered load. This duality obviates the need for link layer flow control for throughput improvement but necessitates traffic control for fairness and QoS. Second, TCP-over-WLAN achieves high throughput commensurate with that of wireline TCP under saturated conditions, challenging the widely held perception that TCP throughput fares poorly over WLANs when subject to heavy contention. We show that TCP-over-WLAN prowess is facilitated by the self-regulating actions of DCF and TCP congestion control that jointly drive the shared physical channel at an effective load of 2--3 wireless stations, even when the number of active stations is very large. Our results highlight subtle inter-layer dependencies including the mitigating influence of TCP-over-WLAN on dynamic rate shifting.
A localizing directory coherence protocol
Authors: Collin McCurdy, Charles Fischer
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

User-controllable coherence revives the idea of cooperation between software and hardware in an attempt to bridge the gap between efficient small-scale shared memory machines and massive distributed memory machines. It proposes a new multiprocessor architecture which has both a global address-space and multiple processor-local address-spaces with new memory instructions and a new coherence protocol to manage the dual address-spaces.The purpose of this paper is twofold. First, we solidify the semantics of instruction set extensions that enable "localization" -- the act of moving data from the global address-space to a processor's local address-space -- thus clearly defining the requirements for a localizing coherence protocol. Second, we demonstrate the feasibility of localizing coherence by describing the workings of a full-scale directory-based protocol that we have implemented and tested using an existing protocol specification tool.
HapticFlow: PDE-based mesh editing with haptics: Research Articles
Authors: Ye Duan, Jing Hua, Hong Qin
Venue: Computer Animation and Virtual Worlds (2004)

This paper presents HapticFlow, a haptics-based direct mesh editing system founded upon the concept of PDE-based geometric surface flow. The proposed flow-based approach for direct geometric manipulation offers a unified design paradigm that can seamlessly integrate implicit, distance-field based shape modeling with dynamic, physics-based shape design. HapticFlow provides an intuitive haptic interface and allows users to directly manipulate 3D polygonal objects with ease. To demonstrate the effectiveness of our new approach, we developed a variety of haptics-based mesh editing operations such as embossing, engraving, sketching as well as force-based shape manipulation operations. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Ternary directed acyclic word graphs
Authors: Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
Venue: Theoretical Computer Science (2004)

Given a set S of strings, a DFA accepting S offers a very time-efficient solution to the pattern matching problem over S. The key is how to implement such a DFA in the trade-off between time and space, and especially the choice of how to implement the transitions of each state is critical. Bentley and Sedgewick proposed an effective tree structure called ternary trees. The idea of ternary trees is to 'implant' the process of binary search for transitions into the structure of the trees themselves. This way the process of binary search becomes visible, and the implementation of the trees becomes quite easy. The directed acyelic word graph (DAWG) of a string w is the smallest DFA that accepts all suffixes of w, and requires only linear space. We apply the scheme of ternary trees to DAWGs, introducing a new data structure named ternary DAWGs (TDAWGs). Furthermore, the scheme of AVL trees is applied to the TDAWGs, yielding a more time-efficient structure AVL TDAWGs. We also perform some experiments that show the efficiency of TDAWGs and AVL TDAWGs, compared to DAWGs in which transitions are implemented by linked lists.