Miracle-dz/UniFAR-FTUs huggingface dataset:
Flow characteristics of ethanol-methanol mixture through a parallel micro-channels

The present work investigates is to study the flow characteristics of ethanol and methanol mixture flow in rectangular micro-channels using test specimens 1 and 2 (TS1, TS2). The TS1 and TS2 used were of 47 and 50 micro-channels in rectangular cross-section of equivalent diameters of 387 and 327 m respectively. The channel length of 192 mm were fabricated on a 304 stainless steel substrate (230 mm x 160 mm x 1.6 mm) by photo chemical etching process. Covering the top with another plate of 0.5 mm thickness formed the channels by vacuum brazing. The friction factor is estimated from the measured pressure drop along the whole channel of TS1 and TS2. Analysis of friction factor vs Reynolds number relation indicates that friction factor for mixture flow is same as that of normal channels in the laminar region. Transition region lies in Re > 500 and transition set off at lower Re ~ 500 in comparison to normal channel. Further it may be possible to identify transition as the deviation of NDPD values from laminar region.
The competitive Internet service provider : network architecture, interconnection, traffic engineering and network design

Foreword. List of Figures. List of Tables. List of Abbreviations. Part I Introduction and Basics. 1 Introduction. 1.1 Motivation. 1.2 Efficiency and Quality of Service. 1.3 Action Space and Approach. 1.4 Overview. 2 Internet Service Providers. 2.1 A Classification Model for ISPs. 2.2 Classification of Selected Providers. 2.3 Summary and Conclusions. 3 Performance Analysis Basics. 3.1 Queueing Theory. 3.2 Network Calculus. 3.3 Optimisation Techniques. 3.4 Summary and Conclusions. 4 Internet Protocols. 4.1 The Internet Protocol Stack. 4.2 Summary and Conclusions. 5 Applications. 5.1 World Wide Web. 5.2 Peer-to-Peer Applications. 5.3 Online Games. 5.4 Voice over IP. 5.5 Traffic Classification. 5.6 Summary and Conclusions. Part II Network Architecture. 6 Network Architecture Overview. 6.1 Introduction. 6.2 Quality of Service Architectures. 6.3 Data Forwarding Architecture. 6.4 Signalling Architecture. 6.5 Security Architecture. 6.6 Admission Control. 6.7 Summary and Conclusions. 7 Analytical Comparison of Quality of Service Systems. 7.1 On the Benefit of Admission Control. 7.2 On the Benefit of Service Differentiation. 8 Experimental Comparison of Quality of Service Systems. 8.1 QoS Systems. 8.2 Experiment Setup. 8.3 Per-flow versus Per-class Scheduling. 8.4 Central versus Decentral Admission Control. 8.5 Direct Comparison. 8.6 Summary and Conclusions. Part III Interconnections. 9 Interconnections Overview. 9.1 A Macroscopic View on Interconnections. 9.2 A Microscopic View on Interconnections. 9.3 Interconnection Method. 9.4 Interconnection Mix. 9.5 Summary and Conclusions. 10 Optimising the Interconnection Mix. 10.1 Costs. 10.2 Reliability. 10.3 Quality of Service. 10.4 Environment Changes. 10.5 Summary and Conclusions. Part IV Traffic and Network Engineering. 11 Traffic and Network Engineering Overview. 11.1 Network Design and Network Engineering. 11.2 Traffic Engineering. 11.3 Traffic Matrix Estimation. 11.4 Summary and Conclusions. 12 Evaluation of Traffic Engineering. 12.1 Traffic Engineering Performance Metrics. 12.2 Traffic Engineering Strategies. 12.3 Experiment Setup. 12.4 Explicit Routing versus Path Selection. 12.5 Performance Evaluation. 12.6 Singlepath versus Multipath. 12.7 Influence of the Set of Paths. 12.8 Summary and Conclusions. 13 Network Engineering. 13.1 Quality of Service Systems and Network Engineering. 13.2 Capacity Expansion. 13.3 On the Influence of Elastic Traffic. 13.4 Summary and Conclusions. Part V Appendices. A Topologies Used in the Experiments. B Experimental Comparison of Quality-of-service Systems. C Analytical Comparison of Interconnection Methods. C.1 Internet Exchange Point Cost Models. C.2 Cost Efficiency of an Internet Exchange Point. C.3 LAN versus MAN IXP Structure. D Elasticity of Traffic Matrices - Network Models. D.1 Basic Model. D.2 Discrete Service Times. D.3 Self-similar Traffic. D.4 Related Work. References. Index.
STUDY ON DIGITAL ARCHIVES STANDARD FOR LIBRARY AUTOMATION SYSTEM

With the development of internet and the trend of information system technology, the object of digital library research has extended to the application of digital archives. Basically, digital libraries storage huge amounts of data, including text, image, map audio, video and illustration via electronic formats. Further more, digital libraries could be conveniently accessed through the Internet. As the research intention of network information systems, the critical technology in digital library research could be how to let users effectively harvest correct information from the digital library. Digital library users could discover, present, and organize knowledge among these data of digital libraries. The traditional library automation system, related applying technologies and protocols, such as MARC, Z39.50 and ISO 2709, could not totally match the requirement of digital archives. The purpose of this research is to find out how to effectively manage and apply the related technology of digital archive to handle the existing operation processes in library and the management requirement of digital archives. This paper discusses an evolution model of the related technology of library automation systems.
Una aproximación a un modelo concurrente de ciclo de vida software con calidad total

The modeling of the Software Process is a guideline for the organization of the activities which involve all the development stages for the resolution of the problems that the software development presents and generates as it evolves. The modeling of the product life cycle becomes more and more complex as the technological and methodological development and the organization of the work becomes more complex.
Multimodal Code Search

Today’s software is large and complex, consisting of millions of lines of code. New developers of a software project always face significant challenges in finding code related to their development or maintenance tasks (e.g., implementing features, fixing bugs and adding new features). In fact, research has shown that developers typically spend more time on locating and understanding code than modifying it. Thus, we can significantly reduce the cost of software development and maintenance by reducing the time to search and understand code relevant to a software development or maintenance task. In order to reduce the time of searching and understanding relevant code, many code search techniques are proposed. For different circumstances, the best form of inputs (i.e., queries) users can provide to search for a piece of code of interest may differ. During development, developers usually like to search a piece of code implementing certain functionality for reuse by expressing their queries in free-form texts (i.e., natural language). After deployment, users might report bugs to an issue tracking system. For these bug reports, developers would benefit from an automated tool that can identify buggy code from the descriptions of the symptoms of the bugs. During maintenance, developers may notice that some pieces of code with a particular structure are potentially buggy. A code search technique that allows users to specify the code structure using a query language may be the best choice. In another scenario, developers may have found some buggy code examples and they would like to locate other similar code snippets containing the same problem across the entire system. In this case, a code search technique that takes as input known buggy code examples is the best choice. During testing, suppose developers have execution traces of a suite of test cases, they might want to use these execution traces as input to search the buggy code. Developers may also like to provide feedback to the code search engine to improve results. From the above examples, we could see that there is a need for multimodal code search which allows users to express their needs in multiple input forms and processes different inputs with different strategies. This will make their search more convenient and effective. In this dissertation, we propose a multimodal code search engine, which employs novel techniques that allow developers to effectively find code elements of interest by processing developers’ inputs in various input forms including free-form texts, an SQL-like domain-specific language, code examples, execution traces, and user feedback. In the multimodal code search engine, we utilize program analysis, data mining, and machine learning techniques to improve the code search accuracy. Our evaluations show that our approaches improve over state-of-the-art approaches significantly.
Towards a Computational Theory of Grounding in Natural Language Conversation

Abstract : Theories of speech acts view utterances as actions which attempt to change the mental states of agents participating in a conversation. Recent work in computer science has tried to formalize speech acts in terms of the logic of action in AI planning systems. However most of these planning systems make simplifying assumptions about the world which are too strong to capture many features of conversation. One of these assumptions has been that the intent of an utterance is mutually understood by participants in a conversation, merely in virtue of its having been uttered in their presence. Clark and Marshall, 1981 have assumptions of attention, rationality, and understandability to accomplish this. Perrault, 1990 uses an assumption of observability. While these assumptions may be acceptable for processing written discourse without time constraints, they are not able to handle a large class of natural language utterances, including acknowledgements, and repairs. These phenomena have been studied in a descriptive fashion by sociologists and psychologists. I present ideas leading to a computational processing model of how agents come to reach a state of mutual understanding about intentions behind utterances. This involves a richer, hierarchical notion of speech acts, and models for tracking the state of knowledge in the conversation.
Explaining the Computational Mind

In this book, Marcin Milkowski argues that the mind can be explained computationally because it is itself computational -- whether it engages in mental arithmetic, parses natural language, or processes the auditory signals that allow us to experience music. Defending the computational explanation against objections to it -- from John Searle and Hilary Putnam in particular -- Milkowski writes that computationalism is here to stay but is not what many have taken it to be. It does not, for example, rely on a Cartesian gulf between software and hardware, or mind and brain. Milkowski's mechanistic construal of computation allows him to show that no purely computational explanation of a physical process will ever be complete. Computationalism is only plausible, he argues, if you also accept explanatory pluralism. Milkowski sketches a mechanistic theory of implementation of computation against a background of extant conceptions, describing four dissimilar computational models of cognition. He reviews other philosophical accounts of implementation and computational explanation and defends a notion of representation that is compatible with his mechanistic account and adequate vis a vis the four models discussed earlier. Instead of arguing that there is no computation without representation, he inverts the slogan and shows that there is no representation without computation -- but explains that representation goes beyond purely computational considerations. Milkowski's arguments succeed in vindicating computational explanation in a novel way by relying on mechanistic theory of science and interventionist theory of causation.
Computational Design and Fabrication of Deformable Objects

Deformable objects have a plethora of applications: they can be used for entertainment, advertisement, engineering or even medical purposes to cite but a few examples. However it is precisely because they deform that such objects are difficult to design. Their creator must foresee and invert effects of external forces on the behavior of the figure in order to take the proper design decisions. In this thesis, we investigate approaches based on physics-based simulation and inverse optimization techniques which alleviate these difficulties and we propose a complete framework to design custom deformable objects by automating some of the most tedious aspects of the design process. This framework is tailored to various applications in which optimization of diverse variables comprising rest shape, materials and actuation system is alternately considered. Validation of our method is performed by fabricating representative sets of physical prototypes designed with our method and compared to the results predicted by simulation. We start by introducing the basic concepts of physics-based simulation and optimization on which our inverse modeling component, central to our approach, is built. We show how the optimization of the system’s degrees of freedom can be cast as a constrained minimization problem combining strict enforcement of physical consistency with target shape approximation. A method to automatically design and easily fabricate rubber balloons of desired inflated shapes is presented in the following part of the thesis. In that section we precisely describe the different stages of the pipeline including material modeling and fitting, rest shape optimization and physical fabrication. We then extend our framework to address the problem of creating physical replicas of twoand three-dimensional animated digital characters which can be actuated using pins, strings or posed by hand. Our approach automatically computes a sparse set of actuators as well as their locations on the surface and optimizes the internal material distribution such that the resulting character exhibits the desired deformation behavior. Fully automatic systems are not always desirable. Aesthetics considerations, for
Simulation and Optimization of the Power Distribution Network in VLSI Circuits

In this paper, we present simulation techniques to estimate the worst-case voltage variation using a RC model for the power distribution network. Pattern independent maximum envelope currents are used as a periodic input for performing the frequency-domain steady-state simulation of the linear RC circuit to evaluate the worst-case instantaneous voltage drop for the RC power distribution networks. The proposed technique unlike existing techniques, is guaranteed to give the maximum voltage drop at nodes in the RC power distribution network. We present experimental results to compare the frequency-domain and time-domain simulation techniques for estimating the maximum instantaneous voltage drop. We also present frequency-domain sensitivity-analysis based decoupling capacitance placement for reducing the voltage variation in the power distribution network. Experimental results on circuits extracted from layout are presented to validate the simulation and optimization techniques.
Measuring the Mediating Role of Dining Experience Attributes on Customer Satisfaction and Its Impact on Behavioral Intentions of Casual Dining Restaurant in Jakarta

The purpose of this study was to investigate the role of dining experience attributes on customer satisfaction on behavioral intentions in casual dining restaurant in Jakarta. Based on a sample of 213 customers, which analyze with multiple regression approach, this study revealed that: (1) dining experience attributes (food quality, service quality and physical environment) positively influences on customer satisfaction, (2) service quality was found as the most important factor in dining experience attributes that affecting customer satisfaction, and (3) customer satisfaction positively influences on behavioral intentions.
Analysis of relationships between near-shore hydrodynamics and sediment movement on Osmussaar Island, western Estonia

Based on field studies, hydro-meteorological data and wave hindcasts, coastal developments and their hydrodynamic forcing conditions are studied on the limestone relict island of Osmussaar. Areal growth of Osmussaar Island, which emerged from the Baltic Sea 2000–3000 years ago and has grown ever since, has practically stopped as the current global sea level rise nearly balances out the local isostatic post-glacial uplift; yet it continues on the southern shores of the island as a result of gradual accumulation of the matter eroded by waves from the north-westerly exposed Osmussaar cliff and the submarine limestone bench in front of it. Based on analysis of old maps, photographical material, and levelling surveys from coastal study sites on Osmussaar, the island as a whole is slowly migrating to the south-east. Compared to the 1960s and 1970s, the rate of coastal changes has increased from 0.2 m2 y-1 to 1.2 m2 y-1 per shoreline meter. A painted sediment experiment conducted in 2011 revealed the nearshore feeding zones for beach ridges. Storminess and high sea level events have increased on the windward, westerly exposed coast. Wave climate has undergone some cyclical changes with the last high phase in the 1990s and a new cycle probably started again 2010.
A Mathematical Theory of Organization. Part 1. Centralized Organization.

Abstract : Results are reported of the first phase of a mathematical theory which is intended to explain, and aid in the review of, organizations of men and machines in general and of command and control systems in particular. Starting from relatively broad assumptions regarding the abilities and limitations of organization members, the theory develops a method by which the optimal structure and doctrine of the organization can in principle be synthesized. The results of the synthesis are in good agreement with experience in practice.
Punctured Parallel and Serial Concatenated Convolutional Codes for BPSK/QPSK Channels

As available bandwidth for communication applications becomes scarce, bandwidth-efficient modulation and coding schemes become ever important. Since their discovery in 1993, turbo codes (parallel concatenated convolutional codes) have been the center of the attention in the coding community because of their bit error rate performance near the Shannon limit. Serial concatenated convolutional codes have also been shown to be as powerful as turbo codes. In this dissertation, we introduce algorithms for designing bandwidth-efficient rate r = k/(k + 1),k = 2, 3,. , 16, parallel and rate 3/4, 7/8, and 15/16 serial concatenated convolutional codes via puncturing for BPSK/QPSK (Binary Phase Shift Keying/Quadrature Phase Shift Keying) channels. Both parallel and serial concatenated convolutional codes have initially, steep bit error rate versus signal-to-noise ratio slope (called the -"cliff region"). However, this steep slope changes to a moderate slope with increasing signal-to-noise ratio, where the slope is characterized by the weight spectrum of the code. The region after the cliff region is called the "error rate floor" which dominates the behavior of these codes in moderate to high signal-to-noise ratios. Our goal is to design high rate parallel and serial concatenated convolutional codes while minimizing the error rate floor effect. The design algorithm includes an interleaver enhancement procedure and finds the polynomial sets (only for parallel concatenated convolutional codes) and the puncturing schemes that achieve the lowest bit error rate performance around the floor for the code rates of interest.
Intelligent Interactive Volume Classification

This paper defines an intelligent and interactive framework to classify multiple regions of interest from the original data on demand, without requiring any preprocessing or previous segmentation. The proposed intelligent and interactive approach is divided in three stages: visualize, training and testing. First, users visualize and label some samples directly on slices of the volume. Training and testing are based on a framework of Error Correcting Output Codes and Adaboost classifiers that learn to classify each region the user has painted. Later, at the testing stage, each classifier is directly applied on the rest of samples and combined to perform multi-class labeling, being used in the final rendering. We also parallelized the training stage using a GPU-based implementation for obtaining a rapid interaction and classification.
Proceedings of the 2nd Challenge on Context-Aware Movie Recommendation

The challenge brought together a group of researchers both from academia and industry working on context-aware movie recommendations. The event took place during the last day of the 2011 ACM Recommender Systems conference on October 27th 2011. There were nine presentations and a keynote by Alexander Tuzhilin, Professor of Information Systems at Stern School of Business, NYU. The topic was "Context-Aware Recommender Systems: The Next Frontier". The winner of the CAMRa2011 challenge, Identifying Users From Their Rating Patterns by Jose Bento, Nadia Fawaz, Andrea Montanari and Stratis Ioannidis was announced during the workshop. The award was motivated by a sound and interesting approach solving track 1 in order to solve track 2, a clear presentation of the approach as well as the performance of the algorithm.
Parsing of X.509 certificates in a WAP environment

This master thesis consists of three parts. The first part contains a summary of what is needed to understand a X.509 parser that I have created, a discussion concerning the technical problems I encountered during the programming of this parser and a discussion concerning the final version of the parser. The second part concerns a comparison I made between the X.509 parser I created and a X.509 parser created"automatically"by a compiler. I tested static memory, allocation of memory during runtime and utilization of the CPU for both my parser (MP) and the parser that had a basic structure constructed by a compiler (OAP). I discuss changes in the parsers involved to make the comparison fair to OAP, the results from the tests and when circumstances such as time and non-standard content in the project make one way of constructing a X.509 parser better than the other way. The last part concerns a WTLS parser (a simpler kind of X.509 parser), which I created.
POETRY IN ACTION: VERSE AND NARRATION IN EVERYDAY COMMUNICATION

This paper considers the rich vein of less formal, mostly unofficial poetry, re- ferred to as folk poetry and poetry in action, composed by bards and rhymesters in Wales, c. 1870-2005, and inspired particularly by everyday events and incidents within their own communities. In discussing the nature of this folk poetry, seven factors are mentioned. i. It is a social activity. ii. It is an activity which belongs to all people. iii. It may relate to all aspects of life. iv. Its forms are very numerous and non-static. v. It is, in essence, an oral activity. vi. It communicates messages in a direct and colourful manner, with the emphasis on narration and communication. vii. Folk poetry is functional, applied poetry. The paper concludes by offering brief answers to two questions: i. What is the value of folk poetry activity to members of the community? ii. What is the value to the ethnologist of studying folk poetry?
Nonlinear Microwave and RF Circuits

Preface. Introduction, Fundamental Concepts, and Definitions. Solid-State Device Modeling. Harmonic-Balance analysis. Volterra-Series and Power-Series Analysis. Balanced Circuits. Diode Mixers. Diode Frequency Multipliers. Small-Signal Amplifiers. Power Amplifiers. Active Frequency Multipliers. Active Mixers. Oscillators. Index.
Comparative Genome Mapping of the Rosaceae

i ACKNOWLEDGEMENTS . ii TABLE OF CONTENTS . iii LIST OF FIGURES . viii LIST OF TABLES . xv LIST OF ABBREVIATIONS . xix LIST OF COMMONLY REFERRED TO ROSACEAE SPECIES . xxi CHAPTER ONE . 1