Danny Soroker

Bio: Danny Soroker is an academic researcher from IBM. The author has contributed to research in topics: Mobile device & Debugger. The author has an hindex of 20, co-authored 60 publications receiving 1245 citations.

Pervasive symbiotic advertising system and methods therefor

Abstract: An advertising system and methods, including an ad service that one of generates, presents and receives information pertaining to an ad presentation, an ad presentation output device that outputs the ad presentation at a presentation location, a user response receiver at the ad service that receives a user response transmitted from a mobile device based on the ad presentation at the presentation location, an ad service transmitter that transmits an executable object to a target device specified in the user response, wherein the target device includes a memory and a processor for executing the executable object to provide a service to the user on the target device, wherein the service is modified based on information one of accessed and determined by the executable object on the target device.

Tool and method for mapping and viewing an event

Abstract: A tool for mapping an event includes a map generator for generating an event map, a view generator for generating a zoomable and pannable view of the event map, and a display device for displaying the zoomable and pannable view of the event map, and in another aspect, a tool for annotating an event map includes a map generator for generating an event map, an annotating unit for annotating the event map based on a user input, a view generator for generating a zoomable and pannable view of the annotated event map, and a display device for displaying the zoomable and pannable view of the annotated event map.

System and method for identifying form type in a handwriting recognition based form completion system

Abstract: The system of the present invention includes a form design component, a form description repository, and a forms processing component Each form used with the system has a layout including a form identifier field with a common location space for each given form of the plurality of different types of forms. The forms processing component is coupled to the form description repository and receives data from an electronic clipboard, through an interface port, which permits recognition of a unique form identifier, communication with the form description repository, receipt of a form definition corresponding to the unique form identifier, and correct processing of the data on the given form (based on the identifier) The method includes generating a form identifier field having a common location space for each different type of form, prompting a user of the system to enter a unique form identifier into the field, via input of at least one handwritten stroke, recording electronic stroke data indicative of the at least one handwritten stroke, storing the stroke data together with electronic entry field data indicative of contents of other fields of the given form, and then invoking a handwriting recognition engine on the stroke data so as to obtain correct identity of each given form, thereby permitting proper processing of the electronic entry field data.

Tolerating faults in hypercubes using subcube partitioning

Abstract: The authors examine the issue of running algorithms on a hypercube which has both node and edge faults, and they assume a worst-case distribution of the faults. It is proven that for any constant c, an n-dimensional hypercube (n-cube) with n/sup c/ faulty components contains a fault-tree subgraph that can implement a large class of hypercube algorithms with only a constant factor slowdown. In addition, the approach yields practical implementations for small numbers of faults. For example, it is shown that any regular algorithm can be implemented on an n-cube that has at most n-1 faults with slowdowns of at most two for computation and at most four for communication. This is the first result showing that an n-cube can tolerate more than O(n) arbitrarily placed faults with a constant factor slowdown. >

Using XForms to simplify Web programming

Abstract: The difficulty of developing and deploying commercial web applications increases as the number of technologies they use increases and as the interactions between these technologies become more complex. This paper describes a way to avoid this increasing complexity by re-examining the basic requirements of web applications. Our approach is to first separate client concerns from server concerns, and then to reduce the interaction between client and server to its most elemental: parameter passing. We define a simplified programming model for form-based web applications and we use XForms and a subset of J2EE as enabling technologies. We describe our implementation of an MVC-based application builder for this model, which automatically generates the code needed to marshal input and output data between clients and servers. This marshalling uses type checking and other forms of validation on both clients and servers. We also show how our programming model and application builder support the customization of web applications for different execution targets, including, for example, different client devices.

Digraphs Theory Algorithms And Applications

Abstract: The theory of directed graphs has developed enormously over recent decades, yet this book (first published in 2000) remains the only book to cover more than a small fraction of the results. New research in the field has made a second edition a necessity. Substantially revised, reorganised and updated, the book now comprises eighteen chapters, carefully arranged in a straightforward and logical manner, with many new results and open problems. As well as covering the theoretical aspects of the subject, with detailed proofs of many important results, the authors present a number of algorithms, and whole chapters are devoted to topics such as branchings, feedback arc and vertex sets, connectivity augmentations, sparse subdigraphs with prescribed connectivity, and also packing, covering and decompositions of digraphs. Throughout the book, there is a strong focus on applications which include quantum mechanics, bioinformatics, embedded computing, and the travelling salesman problem. Detailed indices and topic-oriented chapters ease navigation, and more than 650 exercises, 170 figures and 150 open problems are included to help immerse the reader in all aspects of the subject. Digraphs is an essential, comprehensive reference for undergraduate and graduate students, and researchers in mathematics, operations research and computer science. It will also prove invaluable to specialists in related areas, such as meteorology, physics and computational biology.

When and how to develop domain-specific languages

Abstract: Domain-specific languages (DSLs) are languages tailored to a specific application domain. They offer substantial gains in expressiveness and ease of use compared with general-purpose programming languages in their domain of application. DSL development is hard, requiring both domain knowledge and language development expertise. Few people have both. Not surprisingly, the decision to develop a DSL is often postponed indefinitely, if considered at all, and most DSLs never get beyond the application library stage.Although many articles have been written on the development of particular DSLs, there is very limited literature on DSL development methodologies and many questions remain regarding when and how to develop a DSL. To aid the DSL developer, we identify patterns in the decision, analysis, design, and implementation phases of DSL development. Our patterns improve and extend earlier work on DSL design patterns. We also discuss domain analysis tools and language development systems that may help to speed up DSL development. Finally, we present a number of open problems.

Mobile terminal and method for controlling the same

Abstract: A mobile terminal including a body; a touchscreen provided to a front and extending to side of the body and configured to display content; and a controller configured to detect one side of the body comes into contact with one side of an external terminal, display a first area on the touchscreen corresponding to a contact area of the body and the external terminal and a second area including the content, receive an input of moving the content displayed in the second area to the first area, display the content in the first area, and share the content in the first area with the external terminal.

Limits to Parallel Computation: P-Completeness Theory

Abstract: This volume provides an ideal introduction to key topics in parallel computing. With its cogent overview of the essentials of the subject as well as lists of P -complete- and open problems, extensive remarks corresponding to each problem, a thorough index, and extensive references, the book will prove invaluable to programmers stuck on problems that are particularly difficult to parallelize. In providing an up-to-date survey of parallel computing research from 1994, Topics in Parallel Computing will prove invaluable to researchers and professionals with an interest in the super computers of the future.