Finite State Automata

This research aims to explore and find the determinant factors as it is important for the development of group UPPKS management in Kecamatan Sukarami Palembang through a quntitative descriptive approach.The number of respondents was limited for 7 groups that are still active in Kecamatan Sukarami. The result showed that the cooperative effort influence to productivity. The findings of this study indicate that the lack of funds/start-up capital has not gained sufficient leverage; the absence of other sources of funding, in fact, almost all are individual business, so that managed such as savings and credit groups. Growing effort is being supported by additional capital that sought its own members, as well as the selection of profitable business activities. Group leader and members favored form of technical training, certain items are more salable. More individual businesses selling food and beverages are for their money-faster turnaround, rest handicraft products do not sell quickly,...

In a service composition, it is necessary to ensure that the behaviour of a constituent service is consistent with the requirements of the composition. In an adaptive service composition those behavioural requirements may be continually changing. This paper shows how the behavioural requirements in abstract service definitions (roles) can be dynamically and incrementally defined using constraints. These constraints are then used to generate finite state automata, which are used to check the compatibility of candidate services that have their behaviour expressed in static interface descriptions such as OWL-S. In addition to the development of services, Service-Oriented Computing (SOC) application development is a process consisting of service discovery, evaluation and composition. To support the composition of services, a variety of standards such as WSDL and SOAP have helped resolve the heterogeneity in implementation platforms. However, standardisations in the syntactic interface description of services (e.g. WSDL) alone are not sufficient to ensure the correct interoperation of services. Previous work in component-based software engineering suggests that there are four levels of component interface specification: syntactic, behavioural, synchronisation and QoS (Quality of Service) . In Web services, the need for semantically rich descriptions of services has resulted in a number of initiatives such as OWL-S and WSMO. In this paper we focus on behavioural interoperability, in particular the sequence of exchanged messages (protocols) between services. Of the above initiatives OWL-S provides explicit semantics for specifying the behaviour of services in its process model. OWL-S specifies its interaction in terms of definitions for atomic, simple and composite processes. WSMO, on the other hand, specifies the behavioural protocol of a service by using Abstract State Machines as the underlying formalism to represent the service's orchestration and choreography. WSMO also provides the specification of mediators to solve the mismatches at the data, communication protocol, and process levels. In contrast, rather than stipulating the existence of a new type of component in the Web services infrastructure, OWL-S provides to Web services and their clients the information that is needed to find existing mediators that can reconcile their mismatches .

The problem addressed in this dissertation can be stated as follows: given as a query, a business process description within a Web service infrastructure, efficiently find business processes from a large repository that complementarily support the input query. In particular, the input business process enforces that some parts of the business process be mandatory. For example, a buyer organization using RosettaNet PIPs and the corresponding data dictionary might want to find suppliers that use the same RosettaNet standard that fulfill his business process. In this case, for instance, a mandatory cancellation procedure of the processing would be executed after the order had been placed with the supplier. The current Web service standards around Universal Description, Discovery and Integration (UDDI) and related technologies do not address this problem as they offer only service discovery based on attribute/ value queries, that is limited to atomic service discovery. Research has shown...

The considered model is used in manual development of application specifications and is based on the theory of basic protocols and respective symbolic verification tools. Means to limit the behavioral characteristics of the model still matching the source requirements are discussed. If the model is verified successfully, the executable code of the application and the respective test code are generated from the model. The technique of using the developed model is described.Рассматривается модель, используемая при ручной разработке спецификаций приложения, созданная на основе теории базовых протоколов А.А. Летичевского и поддерживающего теорию инструментария символьной верификации. Обсуждаются способы ограничения поведенческих характеристик модели при условии сохранения соответствия исходным требованиям. По успешно верифицированной модели генерируется код приложения и код тестов. Приводится описание методики применения разработанной модели

The area of automatic groups has been one in which signiÿcant advances have been made in recent years. While it is clear that the deÿnition of an automatic group can easily be extended to that of an automatic semigroup, there does not seem to have been a systematic investigation of such structures. It is the purpose of this paper to make such a study. We show that certain results from the group-theoretic situation hold in this wider context, such as the solvability of the word problem in quadratic time, although others do not, such as ÿnite presentability. There are also situations which arise in the general theory of semigroups which do not occur when considering groups; for example, we show that a semigroup S is automatic if and only if S with a zero adjoined is automatic, and also that S is automatic if and only if S with an identity adjoined is automatic. We use this last result to show that any ÿnitely generated subsemigroup of a free semigroup is automatic.

For a system of distributed processes, correctness can be ensured by (statically) checking whether their composition satisfies properties of interest. However, web services are distributed processes that dynamically discover properties of other web services. Since the overall system may not be available statically and since each business process is supposed to be relatively simple, we propose to use (on-line) runtime monitoring of conversations between partners as a means of checking behavioural correctness of the entire web service system. Our framework allows application developers to specify behavioural correctness properties. By transforming these properties to finite-state automata, we enable conformance checking of finite execution traces of web services described in BPEL against the specification. Moreover, when violations are discovered at runtime, we automatically propose and rank recovery plans which users of the system can then select for execution. For some of the violations, such plans essentially involve "going back" -compensating the occurred actions until an alternative behaviour of the application is possible. For other violations, such plans include both "going back" and "re-planning" -guiding the application towards a desired behaviour. We report on the implementation and experience with our monitoring and recovery system, and discuss the implications that the move to "smart internet" [39] may have on our approach.

This paper aims to analyze phubbing behavior in organizational leadership from an Islamic perspective. Researchers use this type of library research, namely research that seeks answers to problems through various library information such as books, encyclopedias, journals and other scientific documents. The nature of this research is descriptive analysis, namely regularly describing the data obtained, understood and described so that readers can understand it better. The data used in this research is secondary data. The reseach results show that phubbing behavior has serious impacts, not only detrimental to health but also psychological and even social. Communication within an organization is very important to achieve common goals. A leader is required to have good communication with his members. If a leader engages in phubbing behavior towards his members, it will have an impact on the quality of their work. Leaders who have good communication tend to be able to motivate their members to achieve goals. On the other hand, if a leader tends to ignore his members with phubbing behavior, his members will also be half-hearted in achieving their goals. In Islam it is also recommended to speak kind words and not hurt other people's feelings.

In this paper, we shall formulate and address a problem of covert actuator attacker synthesis for cyber-physical systems that are modeled by discrete-event systems. We assume the actuator attacker partially observes the execution of the closedloop system and is able to modify each control command issued by the supervisor on a specified attackable subset of controllable events. We provide straightforward but in general exponential-time reductions, due to the use of subset construction procedure, from the covert actuator attacker synthesis problems to the Ramadge-Wonham supervisor synthesis problems. It then follows that it is possible to use the many techniques and tools already developed for solving the supervisor synthesis problem to solve the covert actuator attacker synthesis problem for free. In particular, we show that, if the attacker cannot attack unobservable events to the supervisor, then the reductions can be carried out in polynomial time. We also provide a brief discussion on some other conditions under which the exponential blowup in state size can be avoided. Finally, we show how the reduction based synthesis procedure can be extended for the synthesis of successful covert actuator attackers that also eavesdrop the control commands issued by the supervisor.

Navigation within the scope of a Networked Collaborative Virtual Environment (NCVE) using an articulated body representation is mores complex then just moving the viewpoint based on user input. In such context, navigation englobes problems such as mapping of user's actions on the embodiment and body constraints in addition to the usual ones such as universal support for different devices and global motion constraints. We take a broader look at the problems, clasify them and present a solution for navigation in NCVEs. Basic navigation involves using some input device to control walk-through or fly-through motion. In the context Permission to make digit&hard copies of all or part of this material for personal or classroom use is granted without fee provided that the copies ore not made or distributed for profit or commercial advantage, the copyright notice, the title ofthe publication nnd its dote appear, and notice is given that copyright is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires specific permission and/or fee ACM K%YT '97 Lausanne Switzerland Copyright I997 ACM 0-89791-953-x/97/9.,%3.50

Today, Web services technology is widely accepted as the infrastructure which enables applications interoperability. In this setting, message exchanges form the basics of interactions between applications, wrapped as Web services. The set of messages exchanged between a client application and a service it requires describes a conversation. The study reported in this text aims to reconciliate conversations which fail due

Interactions between Web services are based on interfaces which de- scribe Web services on both structural and behavioral perspectives. It can happen that the interface provided by a service does no longer match (for instance, because of an evolution) the interface required by its partners. In this situation, and until the required interfaces are fixed, interactions cannot succeed. To address this issue, and focusing on the behavioral part of interfaces, we propose an approach based on a mediator which aims to seamlessly resolve incompatibilities during service interactions. We adopted a formal tool as finite-state automata, particularly Labeled Transition Systems to model the behavioral aspects of Web services.

Finite State Automata (FSA) merupakan salah satu metode dalam teori automata yang dapat digunakan untuk memodelkan sistem dengan state dan transisi antar state yang bersifat diskrit. Penelitian ini membahas implementasi FSA dalam mensimulasikan proses pendaftaran mahasiswa baru di sebuah universitas. Tujuannya adalah untuk mengembangkan model FSA yang merepresentasikan dinamika tahapan pendaftaran, termasuk pengajuan aplikasi, verifikasi dokumen, pembayaran, dan konfirmasi pendaftaran akhir. Metode yang digunakan meliputi perancangan state-based automata, pengujian model melalui simulasi, dan analisis kinerja sistem registrasi berdasarkan parameter-parameter seperti waktu pemrosesan dan tingkat kesalahan. Hasil simulasi menunjukkan bahwa pendekatan FSA secara efektif merepresentasikan proses registrasi dan memungkinkan analisis perilaku sistem dalam berbagai skenario. Implementasi ini diharapkan dapat menjadi acuan untuk meningkatkan sistem registrasi di institusi pendidikan.
Kata kunci: Finite State Automata, Sistem Registrasi, Universitas, Simulasi

File carving is one of the most important procedures in Digital Forensic Investigation (DFI). But it is also requires the most computational resources. Parallel processing on Graphics Processing Units have proven to be many times faster than when executed on standard CPU. This paper is inspecting the algorithms and methods to use parallel processing for development of file carving tools that will do their job much faster than the conventional DFI tools.

In this work we consider the behavioral aspects of system modeling. In order to specify the behavior of a system, many different notations can be used. Quite often different terms in these notations are related with to same element in a system implementation. In order to relate these terms and guarantee the consistency between different notations some standard can be used. In this work we show how the Reference Model for Open Distributed Processing (RM-ODP) can be used for the purpose of the mapping of terms from different behavioral notations. In particular, we show the correspondence between terms in UML activity diagrams, UML state diagrams and Finite State Automata by means of relating them with RM-ODP terms. This allows us to consider RM-ODP as a possible meta-model for behavior specifications written in UML, which help to insure the consistency of UML models.

In this work we consider the behavioral aspects of system modeling. In order to specify the behavior of a system, many different notations can be used. Quite often, different terms in these notations are related to the same element in a system implementation. In order to relate these terms and guarantee the consistency between different notations, a standard framework should be used. In this work we show how the Reference Model for Open Distributed Processing (RM-ODP) can be used for the purpose of the mapping of terms from different behavioral notations. RM-ODP behavior models are based on the concept of Time Specific Action. Time Specific Actions represent directly things that happen in the Universe of Discourse with explicit reference to time. However the explicit reference to time leads to a considerable loss of abstractness. To elevate the level of abstraction we have considered Time Abstracted RM-ODP models where concrete time information is omitted. We used Time Abstracted RM-ODP models to show the correspondence between terms in UML Activity Diagrams, UML Statechart Diagrams and CCS process algebra by means of relating them with RM-ODP terms. This allows us to consider RM-ODP as a possible meta-model for behavior specifications written in UML. It can help to insure the consistency of UML models.

Practical tasks of autonomous vehicles are usually described easily with (sub)task level commands including descriptive information on the environment. We instruct a stranger to move in our area in the same manner we wish to (i.e. it is natural to) give commands to an autonomous vehicle. As application oriented sensing, steering and control methods have been developed they can usually be adopted also in other applications with different vehicles and scales. This is a conclusion of work done during the last fifteen years and about dozen industrial applications. The work of an application engineer is supported by the method of keeping vehicle geometry and kinematics separated from path tracking and motion control. A command language called MCLMR does this for autonomous vehicles. It is an interface between sensor and actuator language of the vehicle and high level supervisory control of the autonomous vehicle.

The author and publisher of this book have used their best efforts in preparing this book. These efforts include the development, research, and testing of the theories and programs to determine their effectiveness. The author and publisher make no warranty of any kind, expressed or implied, with regard to these programs or the documentation contained in this book. The author and publisher shall not be liable in any event for incidental or consequential damages in connection with, or arising out of, the furnishing, performance, or use of these programs. UNIX is a registered trademark of AT&T Bell Laboratories. Turing's World, copyright 1986by Jon Barwise and John Etchemendy Apple Macintosh is a registered trademark of Apple Computer Inc.

In Machine Learning the main problem is that of learning a 'description' of a class (possibly an infinite set) from a finite number of positive and negative training examples. For real world problems, however, one must distinguish between the actual instance of the class to be learned and the numeric or symbolic encoding of the instances of the same class. The question here is whether different encodings (or representations) of the instances of a real-world class can actually affect the performance of the learning algorithm. In artificial neural networks (ANNs), for example, it is required that the classes are always encoded as vectors over some field (usually the set of reals). In this paper it is argued that the representation of the class instances plays a very important role in machine learning since it has bearing on two very important issues -the structural completeness of the training set and also the inductive bias of the learning algorithm.

We present the design and implementation of APL Intrinsic Functions for a Finite State Machine (also known as a Finite State Automaton) which recognizes regular languages, and a Parser which recognizes a subset of context free languages, including SLR(1), LALR(1), and LR(1). These are currently being used on a commercial APL mainframe system as part of a large real-time financial trading system, where they are part of a compiler which translates dealer specification statements into APL functions. Use of these Intrinsic Functions more than doubled the performance of the compiler. In addition to making a significant performance improvement for a large production system, we show these functions to have value in effectively solving This paper originally appeared in the APL92 Conference Proceedings. [BO92] many common programming problems, especially those which are inherently or apparently iterative.

Weighted finite-state transducers are used in many applications such as text, speech and image processing. This chapter gives an overview of several recent weighted transducer algorithms, including composition of weighted transducers, determinization of weighted automata, a weight pushing algorithm, and minimization of weighted automata. It briefly describes these algorithms, discusses their running time complexity and conditions of application, and shows examples illustrating their application.

Modeling the behavior of a system under development has proven to be a very effective way to ensure that it will be constructed correctly. However, building up this model is a difficult task that requires a significant time investment in and a high level of expertise. Consequently, incremental approaches that construct a system model from partial behavioral descriptions have been widely adopted. The challenge in such approaches lies in finding both the adequate behavioral formalism that fits the needs of the analyst as well as a formal composition mechanism that facilitates the generation of the expected behavioral model and produces a verifiable model. Within this framework, use case approaches have been also accepted in industry because they make the process of requirement elicitation simpler. Their main shortcoming is their lack of formalization, which makes validation difficult. In this paper, we propose a formal approach for composing system behaviors where partial system behaviors are defined as finite state automata. Each automaton represents a use case that describes a certain system concern, hence the name use case automata (UCA). The composition of different UCAs could be performed with respect to a set of states or transitions specified by the analyst, using certain composition operators. Each of these operators has a precise semantics, which is defined by how the composition is performed. The formalization of use case composition is based on label matching between the UCAs to be composed. Our approach is fully automated and provides the advantage of generating a UCA that meets the intended behavior without unexpected scenarios. Finally, we present the UMACT tool, which implements our composition approach.

This article is descriptive qualitative research. The object of this research is language politeness. Speech, including polite language is very important to be considered by the participants of communication (speakers and partners said) for the smooth communication. However, the reality nowadays, the Indonesian people have been getting a lot of influence from outside (modernization) so that the polite language is getting faded. Thus, the sublime character as an eastern man is increasingly invisible. Therefore, the researcher is interested in studying language politeness as the impact of character education which has two goals. First, describe the values of language politeness in communicating during the learning process in the classroom. Second, the impact of language politeness on character education. Participants in this study include students in grade IX SMPN 4 Batam Island. Data collection methods used observation, interview, and documentation. The results of this study 1. The values of language politeness in communicating during the learning process in the class of SMP Negeri 4 Batam that is Religious Value, Honest Value, Discipline, Tolerance, and Communication. The reason for choosing some of these character values is to remember less time to learn and limited participants' ability. 2. the impact of language modesty on character education that is between the 18 values in character education there are some points that can be associated with language politeness include: appreciate achievement, friendly, caring environment, and social care. Language politeness can be integrated into sub-values in character education.

Revolusi Industri 4.0 dan Society 5.0 menuntut untuk terus mengembangkan bidang teknologi dan sumber daya manusia dalam seluruh ranah kehidupan. Penelitian ini bertujuan untuk memadukan antara teknologi dan upaya peningkatan literasi, dalam hal ini membahas tentang penerapan finite automata pada vending machine untuk mempermudah transaksi pengembalian buku di perpustakaan. Metode penelitian yakni melakukan penggambaran Finite State Automata menggunakan Non-deterministic Finite Automata, perancangan Diagram State mengenai fitur-fitur dan desain tampilan antarmuka saat Vending Machine diimplementasikan. Hasil penelitian menunjukkan bahwa penggunaan Non-deterministic Finite Automata pada desain Vending Machine pengembalian buku di perpustakaan dapat mempermudah transaksi pengembalian buku di perpustakaan.

We show that the absolute worst case time complexity for Hopcroft's minimization algorithm applied to unary languages is reached only for deterministic automata or cover automata following the structure of the de Bruijn words. A previous paper by Berstel and Carton gave the example of de Bruijn words as a language that requires O(n log n) steps in the case of deterministic automata by carefully choosing the splitting sets and processing these sets in a FIFO mode for the list of the splitting sets in the algorithm. We refine the previous result by showing that the Berstel/Carton example is actually the absolute worst case time complexity in the case of unary languages for deterministic automata. We show that the same result is valid also for the case of cover automata and an algorithm based on the Hopcroft's method used for minimization of cover automata. We also show that a LIFO implementation for the splitting list will not achieve the same absolute worst time complexity for the case of unary languages both in the case of regular deterministic finite automata or in the case of the deterministic finite cover automata as defined by S. Yu.

This paper presents the SEVA system (Autonomous Vehicle Parking Simulator). This tool implements a robust control system for autonomous vehicle parking based on a FSA (Finite-State Automata) and also based on FSA ob- tained from trained J-CC ANNs (Jordan Cascade- Correlation Artificial Neural Networks).

This paper presents the SEVA system (Autonomous Vehicle Parking Simulator). This tool implements a robust control system for autonomous vehicle parking based on a FSA (Finite-State Automata) and also based on FSA ob- tained from trained J-CC ANNs (Jordan Cascade- Correlation Artificial Neural Networks).

This paper presents the SEVA system (Autonomous Vehicle Parking Simulator). This tool was used to implement a robust control system for autonomous vehicle parking based on a FSA (Finite State Automata) and also based on an ANN (Artificial Neural Networks). Initially a FSA was developed in order to control the vehicle performing a parallel parking manoeuvre. Therefore, a special model of ANN, called J-CC (Jordan-Cascade Correlation), was designed to learn how to control the vehicle based onto the behavior of the FSA. The Neural Controller (SEVA-N) uses the infrared sensorial information and the present state of the automata to control the speed (car velocity), the angle of the wheels (car orientation) and to determine the next state of the automata. At present, the simulation shows that our system can safely park the vehicle, using both methods: FSA or J-CC Nets. We conclude that the proposed ANN model reach our needs and also can be applied in more complex tasks.

Service composition is becoming the dominant paradigm for developing Web service applications. It is important to ensure that a service composition comply with the requirements for the application. A rigorous compliance checking approach usually needs the requirements being specified in properties specification formalisms like temporal logics, which are difficult for ordinary software practitioners to write. In this paper, we propose a property pattern based specification language PROPOLS and use it to verify BPEL service composition schemas. PROPOLS is easy to understand and use, yet is formally based. It builds on Dwyer et al's property pattern system and extends it with the logical composition of patterns to accommodate the specification of complex requirements. PROPOLS is encoded in OWL to facilitate the sharing and reuse of domain knowledge. A Finite State Automata based implementation for the verification of BPEL schemas against PROPOLS properties is also discussed.

Probabilistic finite-state machines are used today in a variety of areas in pattern recognition, or in fields to which pattern recognition is linked. In part I of this paper, we surveyed these objects and studied their properties. In this part II, we study the relations between probabilistic finite-state automata and other well known devices that generate strings like hidden Markov models and ngrams, and provide theorems, algorithms and properties that represent a current state of the art of these objects.

We present an e cient incremental algorithm for learning regular grammars from labeled examples and membership queries. This algorithm is an extension of Angluin's ID procedure to an incremental framework. The learning algorithm is intermittently provided with labeled examples and has access to a knowledgeable teacher capable of answering membership queries. Based on the observed examples and the teacher's responses to membership queries, the learner constructs a deterministic nite automaton DFA with which ...

In a service composition, it is necessary to ensure that the behaviour of a constituent service is consistent with the requirements of the composition. In an adaptive service composition those behavioural requirements may be continually changing. This paper shows how the behavioural requirements in abstract service definitions (roles) can be dynamically and incrementally defined using constraints. These constraints are then used to generate finite state automata, which are used to check the compatibility of candidate services that have their behaviour expressed in static interface descriptions such as OWLS .

In this paper, we discuss the role of digital actors in Virtual Environments. We describe the integration of motion control techniques with autonomy based on synthetic sensors. In particular, we emphasize the synthetic vision, audition and tactile system. We also discuss how to introduce the sensors of real humans in the Virtual Space in order to have a communication between digital actors and real humans.

Navigation within the scope of a Networked Collaborative Virtual Environment (NCVE) using an articulated body representation is mores complex then just moving the viewpoint based on user input. In such context, navigation englobes problems such as mapping of user's actions on the embodiment and body constraints in addition to the usual ones such as universal support for different devices and global motion constraints. We take a broader look at the problems, clasify them and present a solution for navigation in NCVEs.

Metamorphic malware apply semantics-preserving transformations to their own code in order to foil detection systems based on signature matching. In this paper we consider the problem of automatically extract metamorphic signatures from these malware. We introduce a semantics for self-modifying code, later called phase semantics, and prove its correctness by showing that it is an abstract interpretation of the standard trace semantics. Phase semantics precisely models the metamorphic code behavior by providing a set of traces of programs which correspond to the possible evolutions of the metamorphic code during execution. We show that metamorphic signatures can be automatically extracted by abstract interpretation of the phase semantics, and that regular metamorphism can be modelled as finite state automata abstraction of the phase semantics.

The distinguishability language of a regular language L is the set of words distinguishing between pairs of words under the Myhill-Nerode equivalence induced by L, i.e., between pairs of distinct left quotients of L. The similarity relation induced by a language L is a similarity relation inspired by the Myhill-Nerode equivalence and it was used to obtain compact representation of automata for a finite language L, i.e., deterministic finite cover automata, which are deterministic finite automata accepting all the words of L and possibly some other words that are longer than any word of L. The dissimilarity language of a finite language L is defined as the set of words that separate a pair of words which are not similar w.r.t. to a (finite) language L. In this paper we extend the study of distinguishability operation on regular languages to l-dissimilarity, for l ∈ N, and the dissimilarity operation on finite languages. We examine their properties, the state complexity, and relations...

This paper focuses on symbolic transducers and recurrent neural preference machines to support the task of mining and classifying textual information. These encoding symbolic transducers and learning neural preference machines can be seen as independent agents, each one tackling the same task in a different manner. Systems combining such machines can potentially be more robust as the strengths and weaknesses of the different approaches yield complementary knowledge, wherein each machine models the same information content via different paradigms. An experimental analysis of the performance of these symbolic transducer and neural preference machines is presented. It is demonstrated that each approach can be successfully used for information mining and news classification using the Reuters news corpus. Symbolic transducer machines can be used to manually encode relevant knowledge quickly in a data-driven approach with no training, while trained neural preference machines can give better performance based on additional training.

Fakultas Teknik Jurusan Teknik Elektro Universitas Kristen Satya Wacana (UKSW) Salatiga sedang merancang autonomous vehicle (robot mobil) yang berfungsi untuk menghantarkan beberapa barang antar gedung perkuliahan seperti dokumen. Untuk itulah perlu dirancang sebuah simulasi untuk memberikan gambaran mengenai pergerakan dan karakteristik dari robot tersebut sesuai dengan algoritma yang dirancang. Perancangan dilakukan dengan menggunakan Netbeans IDE 7.1, JDK 1.7 dan dengan menggunakan engine GTGE. Perancangan juga menggunakan algoritma ifthen rules yang dibuat berdasarkan pola pikir manusia (human behaviour based) dalam hal ini adalah operator yang merancang algoritma. Simulasi telah berhasil dirancang dengan tampilan dua dimensi dimana terdapat tiga objek robot, satu objek motor, satu objek mobil, tujuh objek manusia, 17 objek gedung dan dua objek lapangan. Ada juga menu masukan yaitu delapan DIRECTION, Posisi Awal gedung dan Posisi Akhir gedung. Dari hasil pengujian algoritma yang...

Developments of mobile phones are rapidly growing, almost every day a new mobile product is launched. In website X-Phones.com mobile phone users can get a variety of information about mobile phone's specifications from the oldest cell phone to the latest, as well as prices of new and used mobile phones. Therefore, the information that are presented must be renewed every day in order to build the trust of X-Phones.com website visitors. Previously, procedure of the mobile phones specifications and prices data input and update are still done manually. Grabbing techniques that are applied can obtain mobile phones specifications and prices data in accordance with reference website. Mobile phone prices and specifications data retrieval application can facilitate admin to input and update mobile phone prices and specifications data into the database.

The aims of this research are: 1). To explain the influence of Indonesian language learning on students' language politeness. 2) To explain how much Indonesian language learning affects students' language politeness. The population of this study were class XI students of YPKPM Ambon Christian High School. The sample for this research was class XI students consisting of 35 students. The instruments used in this research were an Indonesian language learning questionnaire and a student language politeness questionnaire. Data analysis uses a simple linear regression test which includes a T test using the Statistical Package for the Social Science (SPSS) 18.0 for Windows. From the results of the research and discussion, it can be concluded that 1). The Indonesian language learning included in this research was proven to have a significant influence on the language politeness of class X1 students at Christian High School YPKPM Ambon 2). In this study, it was found that the variation in language politeness explained by Indonesian language learning was 67.9%, while 32.1% was explained by other variables not analyzed in the model.

Keywords: Indonesian language learning, students' language polite

Most qualitative simulation techniques perform simulation at a single level of detail highlighting a fixed set of distinctions. This can lead to intractable branching within the behavioral description. The complexity of the simulation can be reduced by eliminating uninteresting distinctions. Behavior abstraction provides a hierarchy of behavioral descriptions allowing the modeler to select the appropriate level of description highlighting the relevant distinctions. Two abstraction techniques are presented. Behavior aggregation ...

The thesis may be consulted by you, provided you comply with the provisions of the Act and the following conditions of use:  Any use you make of these documents or images must be for research or private study purposes only, and you may not make them available to any other person.  Authors control the copyright of their thesis. You will recognise the author's right to be identified as the author of the thesis, and due acknowledgement will be made to the author where appropriate.  You will obtain the author's permission before publishing any material from the thesis.

A virtual endomorphism of a group G is a homomorphism f : H → G where H is a subgroup of G of finite index m. The triple (G, H, f ) produces a state-closed (or, self-similar) representation ϕ of G on the 1-rooted m-ary tree. This paper is a study of properties of the image G ϕ when G is nilpotent. In particular, it is shown that if G is finitely generated, torsion-free and nilpotent then G ϕ has solvability degree bounded above by the number of prime divisors of m.

Information maximization between stationary input and output activity distributions of neural ensembles has been a guiding principle in the study of neural codes. We have recently extended the approach to the optimization of information measures that capture spatial and temporal signal properties. Unconstrained Markov chains that optimize these measures have been shown to be almost deterministic. In the present work we consider the optimization of stochastic interaction in constrained Markov chains where part of the units are clamped to prescribed processes. Temporal Infomax in that case leads to ÿnite state automata.

This paper describes ongoing work aimed at the construction of formal cost models and analyses to yield verifiable guarantees of resource usage in the context of real-time embedded systems. Our work is conducted in terms of the domain-specific language Hume, a language that combines functional programming for computations with finitestate automata for specifying reactive systems. We outline an approach in which high-level information derived from source-code analysis can be combined with worst-case execution time information obtained from high quality abstract interpretation of low-level binary code.