ppxscal/embedding_network huggingface dataset:
The future of software architectures for large-scalebusiness solutions: modularity, scalability, andseparation of concerns
Authors: Paul R. Daugherty
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

Modern software projects are of large scale, often involving years of development, tens of thousands of days of work effort, and millions of lines of code. This complexity is aggravated by the fact that development is often distributed over several geographic locations, as dictated by cost considerations, the availability of domain specialists, legal requirements, and other factors. Despite advances in development tools and techniques, software initiatives have lagged behind in utilizing novel software engineering methods and techniques effectively to reduce the complexity of large-scale software. The results can be seen in Corporate and Government IT budgets - based on Accenture and Industry research, IT cost overruns are still commonplace, and the cost to "keep the lights on" for fragile legacy applications typically consumes up to 60% IT budgets. Increased adoption of advanced software engineering techniques holds great promise for solving these key business challenges. For example, modularization holds a promise in reducing complexity of software design by hiding low-level implementations in well-defined units of deployment. Specifically, vendors build platforms that allow architects to design large-scale systems that can be composed out of services on the fly. For example, JBoss built a platform that allows architects to seamlessly integrate Service-Oriented Architecture (SOA) with application and business-process management (BPM) in enterprise distributions. According to research with Accenture's CIO Council, at least 58% of global organizations are implementing or piloting SOA. Proper separation of concerns is a key to effective modularization. While separation of concerns is more of art than science in the work of software architects, novel technologies that enable effective separation of concerns are gaining traction. Most recently Accenture used AOP on a government project to do audit tracking. It was very successful and the techniques are currently being incorporated in Accenture Delivery Architecture (ADA), which is a standards-based architecture used for very large scale software development. A large focus of our efforts is in making advanced software engineering techniques more "consumable" by across our network of developers - this is done through standardized architectures, reference applications, and training. The talk will focus on progress that has been made, and challenges ahead in driving further business value through use of these types of techniques. In addition to the areas mentioned, we will focus on related issues such as: requirements traceability, automated software quality assurance, role of DSLs andMDA, and Agile techniques.
A New Approach for Radio and Video Broadcasting over the Internet
Authors: Borko Furht, Raymond Westwater, Jeffrey Ice
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper presents a new technique for radio and video broadcasting over the Internet, referred to as IP Simulcast. IP Simulcast reduces the transmitter's bandwidth by distributing the network load to each client - receiver. The IP Simulcast approach is based on the hierarchical binary structure of receivers, which at the same time become data senders or repeaters. IP Simulcast is superior technique compared with IP Unicast and IP Multicast providing lower cost, higher quality, and better flexibility. We also present a mathematical analysis of the IP Simulcast algorithm to determine the size of the buffers in the receivers.
Programming Microsoft Dynamics CRM 4.0
Authors: Mike Snyder, Jim Steger, Brad Bosak, Corey O'Brien, Phil Richardson
Venue:  (2008)

Announcing a fully revised second edition of this popular SELF-PACED TRAINING KIT designed to help maximize your performance on 70-536, a core exam for the MCTS and MCPD certifications. This 2-in-1 kit includes the official Microsoft study guide, plus practice tests on CD to help you assess your skills. It comes packed with the tools and features exam candidates want most including in-depth, self-paced training based on final exam content; rigorous, objective-by-objective review; exam tips from expert, exam-certified authors; and customizable testing options. It also provides real-world scenarios, case study examples, and troubleshooting labs for the skills and expertise you can apply to the job. Focusing on the fundamentals of .NET application development, this official study guide covers using system types, collections, and generics to help manage data; validating input, reformatting text, and extracting data with regular expressions; developing services, application domains, and multithreaded applications; enhancing your applications by adding graphics and images; implementing code access security, role-based security, and data encryption; working with serialization and reflection techniques; instrumenting your applications with logging and tracing; and interacting with legacy code using COM Interop and PInvoke. Work at your own pace through the lessons and lab exercises. Then assess yourself using 300+ practice and review questions on the CD, featuring multiple, customizable testing options to meet your specific needs. Choose timed or untimed testing mode, generate random tests, or focus on discrete objectives. You get detailed explanations for right and wrong answers including pointers back to the book for further study. You also get an evaluation version of Microsoft Visual Studio 2008 software and an exam discount voucher making this kit an exceptional value and a great career investment. Key Book Benefits Comprehensive exam prep study guide In-depth coverage of exam objectives and sub-objectives plus instructive case studies and troubleshooting scenarios to enhance your performance on the job 300+ practice and review questions Test engine that enables customized testing, pre-assessment and post-assessment, and automated scoring and feedback Microsoft Visual Basic and Visual C# code samples on CD Handy exam-mapping grid Evaluation version of Visual Studio 2008 software 15 percent exam-discount voucher from Microsoft (limited time offer) Entire study guide in searchable eBook format
Artificial life as a path from computing to philosophy
Authors: Drue Coles
Venue: Journal of Computing Sciences in Colleges (2009)

A typical undergraduate program in computer science might make contact with the field of philosophy at several points in courses on artificial intelligence and the theory of computation. This article discusses another potential point of contact: artificial life, an area of computer science devoted to the study of living systems through the use of computers to simulate biological phenomena. Philosophers have started to discuss the prospect of genuine life emerging from artificial systems, an idea that captivates students in our experimental course on artificial life. Here we examine an especially compelling illustration of this idea, one that has given our students an unusual perspective on computer science and a genuine appreciation for its interdisciplinary nature.
An optimal probabilistic forwarding protocolin delay tolerant networks
Authors: Cong Liu, Jie Wu
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Due to uncertainty in nodal mobility, DTN routing usually employs multi-copy forwarding schemes. To avoid the cost associated with flooding, much effort has been focused on probabilistic forwarding, which aims to reduce the cost of forwarding while retaining a high performance rate by forwarding messages only to nodes that have high delivery probabilities. This paper aims to provide an optimal forwarding protocol which maximizes the expected delivery rate while satisfying a certain constant on the number of forwardings per message. In our proposed optimal probabilistic forwarding (OPF) protocol, we use an optimal probabilistic forwarding metric derived by modeling each forwarding as an optimal stopping rule problem. We also present several extensions to allow OPF to use only partial routing information and work with other probabilistic forwarding schemes such as ticket-based forwarding. We implement OPF and several other protocols and perform trace-driven simulations. Simulation results show that the delivery rate of OPF is only 5% lower than epidemic, and 20% greater than the state-of-the-art delegation forwarding while generating 5% more copies and 5% longer delay.
Some Symmetry Based Classifiers
Authors: Sriparna Saha, Sanghamitra Bandyopadhyay
Venue: Fundamenta Informaticae (2009)

In this paper, a novel point symmetry based pattern classifier (PSC) is proposed. A recently developed point symmetry based distance is utilized to determine the amount of point symmetry of a particular test pattern with respect to a class prototype. Kd-tree based nearest neighbor search is used for reducing the complexity of point symmetry distance computation. The proposed point symmetry based classifier is well-suited for classifying data sets having point symmetric classes, irrespective of any convexity, overlap or size. In order to classify data sets having line symmetry property, a line symmetry based classifier (LSC) along the lines of PSC is thereafter proposed in this paper. To measure the total amount of line symmetry of a particular point in a class, a new definition of line symmetry based distance is also provided. Proposed LSC preserves the advantages of PSC. The performance of PSC and LSC are demonstrated in classifying fourteen artificial and real-life data sets of varying complexities. For the purpose of comparison, k-NN classifier and the well-known support vector machine (SVM) based classifiers are executed on the data sets used here for the experiments. Statistical analysis, ANOVA, is also performed to compare the performance of these classification techniques.
Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
Authors: Palash Sarkar
Venue: Discrete Applied Mathematics (2009)

We study the problem of securely extending the domain of a collision resistant compression function. A new construction based on directed acyclic graphs is described. This generalizes the usual iterated hashing constructions. Our main contribution is to introduce a new technique for hashing arbitrary length strings. Combined with DAG-based hashing, this technique yields a new hashing algorithm. The amount of padding and the number of invocations of the compression function required by the new algorithm is smaller than the general Merkle-Damgard algorithm.
Run your own virtual reality with OpenSim
Authors: Bill Childers
Venue: Linux Journal (2009)

Make your own reality, virtually.
A Novel Approach for Fast and Accurate Commercial Detection in H.264/AVC Bit Streams Based on Logo Identification
Authors: Klaus Schöffmann, Mathias Lux, Laszlo Böszörmenyi
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

Commercial blocks provide no extra value for video indexing, retrieval, archiving, or summarization of TV broadcasts. Therefore, automatic detection of commercial blocks is an important topic in the domain of multimedia information systems. We present a commercial detection approach which is based on logo detection performed in the compressed domain. The novelty of our approach is that by taking advantage of advanced features of the H.264/AVC coding, it is both significantly faster and more exact than existing approaches working directly on compressed data. Our approach enables removal of commercials in a fraction of real-time while achieving an average recall of 97.33% with an average precision of 99.31%. Moreover, due to its run-time performance, our approach can also be employed on low performance devices, for instance DVB recorders.
Embedding a Seal into a Picture under Orthogonal Wavelet Transform
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Junji Ohnishi and Kineo MatsuiIn this paper, we propose how to embed a signature seal to a picture under orthogonal wavelet transform. Three parts of multi-resolution representation are expressed in a vector and are related to each other. The maximum and minimum values among the entries in the vector are obtained and the absolute value of the difference of them is used for controlling to embed the seal. When the seal is needed, we can extract it from the picture. It is clear from the experimental results that the seal does not prevent us from seeing the picture comfortably. Therefore it seems that this method could be used for signing our name in multi-media. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Measurement-Based Admission Control Algorithm for Wireless IP Network
Authors: Yi Na, Shen Jun, Cheng Yuxin, Jin Ye
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

In this paper, we proposed a measurement-based admission control (MBAC) algorithm for adaptive real-time applications in wireless IP network. In our algorithm, admission test is performed over successive time scale based on the maximal link busy time (MBT), which provides an upper bound for admission test. Analysis and simulation results show that the proposed algorithm possesses consistency and robustness for various traffic models, and achieves high bandwidth utilization by adopting statistical multiplexing gain.
High Performance Grid Computing and Security through Load Balancing
Authors: V. Sugavanan, V. Prasanna Venkatesh
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

It has always been a great deal to balance both security and performance. But here we have presented a scenario in which a local scheduler of a networked system can schedule its jobs on and across other systems in the network securely. There by creating an environment in which no system is idle when even two systems are communicating. This clubs both distributed computing and load sharing. Thus high performance is assured.When we look onto the other side of the coin of such networked systems, security concerns arise. These issues are handled by employing new level of managerial systems called Authenticated Distribution Managers (ADMs) for managing the co-operating systems. ADM does the work of job division and integration based on the security implications of its Authenticator. Any system can select any other system as an ADM and transfer its security policies to it. Thus the security is not compromised even if there is load distribution across various systems. Thus we have presented an overview of a high performance network without security being compromised.
Risk aversion min-period retiming under process variations
Authors: Jia Wang, Hai Zhou
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variables. It remains a challenge problem to apply such results in order to address the variability in circuit optimizations. In this paper, we study the statistical retiming problem, where retiming is a powerful sequential transformation that relocates flip-flops in a circuit without changing its functionality. We formulate the risk aversion min-period retiming problem under process variations based on conventional two-stage stochastic program with fixed recourse and a risk aversion objective of the clock period. We prove that the proposed problem is an integer convex program, show that the subgradient of the objective function can be derived from the combinational paths with the maximum path delay, and present a heuristic incremental algorithm to solve the proposed problem. Our approach can handle arbitrary gate delay model under process variations through sampling from a black-box and the effectiveness is confirmed by the experimental results. Further more, we point out how the current state-of-the-art SSTA techniques could be improved for future optimization algorithms when analytical models are available.
An earlier time for inserting and/or accelerating tasks
Authors: Qian Guangming
Venue: Real-Time Systems (2009)

In a periodic real-time system scheduled by the EDF (Earliest Deadline First) algorithm (Liu and Layland, J. ACM 20(1), 40---61, 1973; Barauh, Proc. of the 27th IEEE International Real-Time Systems Symposium, 379---387, 2006; Buttazzo, J. Real-Time Syst. 29(1), 5---26, 2005), when new tasks have to be inserted into the system at run-time and/or current tasks request to increase their rates in response to internal or external events, the new sum of the utilizations after the insertion and/or acceleration should be limited, otherwise, one or more current tasks should usually be compressed (their periods being prolonged) in order to avoid overload. Buttazzo offered a time from which on this kind of adjustment can be done without causing any deadline miss in the system (Buttazzo et al., IEEE Trans. Comput. 51(3), 289---302, 2002). It is, however, not early enough. In this paper, an earlier time is given and formally proved.
A flexible framework for communication evaluation in SoC design
Authors: Praveen Kalla, X. Sharon Hu, Jörg Henkel
Venue: International Journal of Parallel Programming (2008)

Multi-core System-on-Chips (SoCs) with on-chip networks are becoming a reality after almost a decade of research. One challenge in developing such SoCs is the need of efficient and accurate simulators for design space exploration. This paper addresses this need by presenting SoCExplore, a framework for last communication-centric design space exploration of complex SoCs with network-based interconnects. Efficiency is achieved through abstraction of computation as a high-level trace, while accuracy is maintained through cycle-accurate interconnect simulation. The flexibility offered allows for fast partition/mapping and interconnect design space exploration. In a case study, a speed-up of 94% over architectural simulation is obtained for the MPEG application. A critical evaluation of the capabilities of our (or any trace based) framework is also provided.
Software quality
Authors: Kurt F. Fischer
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The FAA's computerized Enroute System for controlling in-flight commercial aircraft crashes during a peak holiday period due to overloading. The DoD Early Warning System, a computerized air defense system, mistakes the rising moon for a barrage of incoming enemy missiles and shock waves travel all the way to the White House. A single erroneous statement in a small computer on-board a French weather satellite causes 71 of 142 weather balloons to self-destruct. These experiences would not have happened if there had been better software quality.
Syntactic pattern model classification with total fuzzy grammars
Authors: Ralf Fabian, Daniel Hunyadi, Emil M. Popa
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The paper aims at representing structural information in image patterns by fuzzy structural rules. Several methods of pattern classifications, mainly based on numerical similarity measures are intensively studied and successfully applied in real world applications [17]. In these work we address structural pattern recognition trough a syntactic method, based on formal language theory. Structural pattern recognition mainly concerns on how a pattern can be described and interpreted as a composition of simple sub-patterns (pattern primitives). Lee and Zadeh (1969) early introduced fuzzy grammars which deal with membership degrees associated to production rules. Since pattern classification assumes finding the right generative grammar for each pattern class, we introduce an extension operator and fuzzy facilities for nonterminal symbols of a grammar. Assessing and updating of membership information for each new (learned) pattern increases the recognition power.
The state of the art in tag ontologies: a semantic model for tagging and folksonomies
Authors: Hak Lae Kim, Simon Scerri, John G. Breslin, Stefan Decker, Hong Gee Kim
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

There is a growing interest into how we represent and share tagging data in collaborative tagging systems. Conventional tags, meaning freely created tags that are not associated with a structured ontology, are not naturally suited for collaborative processes, due to linguistic and grammatical variations, as well as human typing errors. Additionally, tags reflect personal views of the world by individual users, and are not normalised for synonymy, morphology or any other mapping. Our view is that the conventional approach provides very limited semantic value for collaboration. Moreover, in cases where there is some semantic value, automatically sharing semantics via computer manipulations is extremely problematic. This paper explores these problems by discussing approaches for collaborative tagging activities at a semantic level, and presenting conceptual models for collaborative tagging activities and folksonomies. We present criteria for the comparison of existing tag ontologies and discuss their strengths and weaknesses in relation to these criteria.
On the size of (generalized) OBDDs for threshold functions
Authors: Beate Bollig
Venue: Information Processing Letters (2009)

Ordered binary decision diagrams (OBDDs) are one of the most common dynamic data structures for Boolean functions. Among the many areas of application are hardware verification, model checking, and symbolic graph algorithms. Threshold functions are the basic functions for discrete neural networks and are used as building blocks in the design of some symbolic graph algorithms. In this paper the first exponential lower bound on the size of a more general model than OBDDs and the first nontrivial asymptotically optimal bound on the OBDD size for a threshold function are presented.
Deformation Planning for Robotic Soft Tissue Manipulation
Authors: Jerzy Smolen, Alexandru Patriciu
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

This paper presents a model based approach to the soft tissue deformation planning. The deformable object is manipulated through boundary displacements induced by robot manipulators controlled in position. The manipulated boundaries are maneuvered such that the control points defined on the deformable object converge to the desired locations. The proposed control is based on a Jacobian transformation between the set of manipulated point displacements and the control point displacements computed using a meshless model (Reproducing Kernel Particle Method - RKPM) of the deformable object. RKPM is employed for this study as it has been proven to accurately handle large deformations and requires no re-meshing algorithms. Simulations show that a model with a coarse particle grid can produce Jacobian transforms that accurately control a more physically real and refined model. The next step is to perform a physical study on a tissue phantom interacting with a dual arm manipulator.