A B C D E G H I M O P R S T U V W
All Classes All Packages
All Classes All Packages
All Classes All Packages
R
- readTextFile(String) - Static method in class cli.commands.RunTest
-
This method reads text file path
- removeMoney() - Method in class core.components.StationTest
-
Testing removeMoney method
- removeMoney() - Method in class core.components.UserTest
-
Testing the removeMoney method
- removeMoney() - Method in class core.system.MyVelibSystemTest
- removeMoney(double) - Method in class core.components.Station
-
This methods removes money in the station
- removeMoney(double) - Method in class core.components.User
-
Remove money balance after droping the bicycle
- removeMoney(double) - Method in class core.system.MyVelibSystem
-
This methods is responsible for removing money from the system
- removeTimeCredit() - Method in class core.components.UserTest
-
Testing the removeTimeCredit method
- removeTimeCredit(double) - Method in class core.components.User
-
Remove time balance after the computation of the location cost
- RentalBicycle - Class in core.setup
-
The RentalBicycle class : This class is responsible to implement and test the basic packages that implement the renting system
- RentalBicycle() - Constructor for class core.setup.RentalBicycle
- RentalBicycleTest - Class in core.setup
- RentalBicycleTest() - Constructor for class core.setup.RentalBicycleTest
- rentBicycle() - Method in class core.components.TerminalTest
-
Testing rentBicycle method
- rentBicycle() - Method in class core.system.MyVelibSystemTest
- rentBicycle(int, int) - Method in class core.system.MyVelibSystem
-
This method is responsible to implement a way to rent a bicycle in the system class.
- rentBicycle(Bicycle, User, Station) - Method in class core.components.Terminal
-
The rentBicycle method that implements the renting algorithm for the application
- RentBicycle - Class in cli.commands
-
This is the RentBicycle class that implements the rentBicycle command of the CLI.
- RentBicycle() - Constructor for class cli.commands.RentBicycle
- rentBicyclePlanning() - Method in class core.components.UserTest
-
Testing rentBicyclePlanning method
- rentBicyclePlanning(MyVelibSystem, Point, Point, Bicycle) - Method in class core.components.User
-
Renting a bicycle
- RentBicycleTest - Class in cli.commands
-
Testing RentBicycle Class
- RentBicycleTest() - Constructor for class cli.commands.RentBicycleTest
- RentingApp - Class in core.renting
-
The RentingApp class of renting module : This class contains all algorithms that are needed during the renting process.
- RentingApp() - Constructor for class core.renting.RentingApp
- RentingAppTest - Class in core.renting
-
Testing RentingApp Class
- RentingAppTest() - Constructor for class core.renting.RentingAppTest
- ReturnBicycle - Class in cli.commands
-
This is the ReturnBicycle class that implements the returnBicycle command of the CLI.
- ReturnBicycle() - Constructor for class cli.commands.ReturnBicycle
- ReturnBicycleTest - Class in cli.commands
-
Testing ReturnBicycle Class
- ReturnBicycleTest() - Constructor for class cli.commands.ReturnBicycleTest
- RunCommand - Class in cli
-
The RunCommand class for the CLI application.
- RunCommand() - Constructor for class cli.RunCommand
- RunCommandTest - Class in cli
-
Testing the run command class
- RunCommandTest() - Constructor for class cli.RunCommandTest
- RunTest - Class in cli.commands
-
This is the RunTest class that implements the runTest command of the CLI.
- RunTest() - Constructor for class cli.commands.RunTest
- RunTestTest - Class in cli.commands
-
Testing RunTest Class
- RunTestTest() - Constructor for class cli.commands.RunTestTest
All Classes All Packages


You wish to feast yourself on the tastes of Ireland, listen to live music & entertainment, be assured you'll have a great time. Kids are welcome so bring the whole family! Our goal is to fill our bistro with the tastes, sounds, and experiences of our Irish heritage
Find Out MoreOur goal is to fill our bistro / Bar with the tastes, sounds, and experiences of our Irish heritage.
Irish Food!Our food is so Irish!
Shandy your way down here!
Nothing but Irish here!
Leave your America at home!
Make your reservation today!


Essential Links
Docs
Discussions
Community Discord
Ecosystem
awesome-alpine
Alpine.js Devtools (Chrome & Firefox)
Spruce
- state management
alpine-test-utils
stylenames
- join inline styles
About
alpine-minimal-boilerplate
Maintained by
Hugo
from
Alpine.js Weekly (Newsletter)
Source at
github.com/HugoDF/alpine-minimal-boilerplate
View it live at
example.codewithhugo.com/alpine-minimal-boilerplate/


API Call Categories
Holodeck uses the
following categories to organize the API functions into sections in the Log
Pane.
FILE –
The following functions are used in file management.
|
Function |
Description |
|
Determines whether the file I/O functions are using the ANSI or OEM
character set code page. |
|
|
Determines whether the specified name can be used to create a file
on the FAT file system. |
|
|
Closes an open object handle. |
|
|
Copies an existing file to a new file. |
|
|
Copies an existing file to a new file. |
|
|
An application-defined callback function used with CopyFileEx
and MoveFileWithProgress. |
|
|
Creates or opens a file system object. |
|
|
Establishes an NTFS hard link between an existing file and a new
file. |
|
|
Deletes an existing file. |
|
|
Closes the specified search handle. |
|
|
Searches a directory for a file whose name matches the specified
file name. |
|
|
Searches a directory for a file whose name and attributes match
those specified. |
|
|
Enumerates the first stream in the specified file. |
|
|
Continues a file search. |
|
|
Continues a stream search. |
|
|
Determines whether a file is executable. |
|
|
Retrieves the actual number of bytes of disk storage used to store a
specified file. |
|
|
Retrieves attributes for a specified file or directory. |
|
|
Retrieves attributes for a specified file or directory. |
|
|
Retrieves file information for a specified file. |
|
|
Retrieves the size of a specified file. |
|
|
Retrieves the size of a specified file. |
|
|
Retrieves the date and time that a file was created, last accessed,
and last modified. |
|
|
Retrieves the file type of the specified file. |
|
|
Retrieves the full path and file name of a specified file. |
|
|
Converts the specified path to its long form. |
|
|
Retrieves the short path form of a specified input path. |
|
|
Creates a name for a temporary file. |
|
|
Retrieves the path of the directory designated for temporary files. |
|
|
Moves an existing file or a directory. |
|
|
Moves an existing file or a directory. |
|
|
Moves a file or directory. |
|
|
Reopens the specified file system object with different access
rights, sharing mode, and flags. |
|
|
Replaces one file with another file. |
|
|
Searches for the specified file. |
|
|
Causes the file I/O functions to use the ANSI character set code
page. |
|
|
Causes the file I/O functions to use the OEM character set code
page. |
|
|
Sets a file's attributes. |
|
|
Sets the security of a file or directory object. |
|
|
Sets the short name for the specified file. |
|
|
Sets the date and time that a file was created, last accessed, or
last modified. |
|
|
Sets the valid data length of the specified file. |
The following functions are used with file I/O.
|
Function |
Description |
|
Cancels all pending I/O operations that were issued by the calling
thread for the specified file handle. |
|
|
Associates an I/O completion port with one or more file handles. |
|
|
An application-defined callback function used with ReadFileEx
and WriteFileEx. |
|
|
Clears the buffers for the specified file and causes all buffered
data to be written to the file. |
|
|
Attempts to dequeue an I/O completion packet from a specified I/O
completion port. |
|
|
Locks a region in an open file. |
|
|
Locks a region in an open file for shared or exclusive access. |
|
|
Posts an I/O completion packet to an I/O completion port. |
|
|
Reads data from a file, starting at the specified position. |
|
|
Reads data from a file asynchronously. |
|
|
Reads data from a file and stores the data into a set of buffers. |
|
|
Moves the end-of-file position for the specified file. |
|
|
Moves the file pointer of an open file. |
|
|
Moves the file pointer of an open file. |
|
|
Unlocks a previously locked region in an open file. |
|
|
Unlocks a previously locked region in an open file. |
|
|
Writes data to a file. |
|
|
Writes data to a file asynchronously. |
|
|
Gathers data from a set of buffers and writes the data to a file. |
The following functions are used with file mapping.
|
Function |
Description |
|
Creates or opens a named or unnamed file mapping object for the
specified file. |
|
|
Writes to the disk a byte range within a mapped view of a file. |
|
|
Maps a view of a file into the address space of the calling process. |
|
|
Maps a view of a file into the address space of the calling process. |
|
|
Opens a named file mapping object. |
|
|
Unmaps a mapped view of a file from the calling process's address
space. |
The following functions are used with the encrypted file system.
|
Function |
Description |
|
Adds user keys to a specified encrypted file. |
|
|
Decrypts an encrypted file or directory. |
|
|
Copies the EFS metadata from one file or directory to another. |
|
|
Encrypts a file or directory. |
|
|
Disables or enables encryption of the indicated directory and the
files in it. |
|
|
Retrieves the encryption status of the specified file. |
|
|
Frees a certificate hash list. |
|
|
Retrieves a list of recovery agents for the specified file. |
|
|
Retrieves a list of users for the specified file. |
|
|
Removes specified certificate hashes from a specified file. |
|
|
Sets the user's current key to the specified certificate. |
The following functions are used to decompress files that were compressed
by the compressed by the Lempel-Ziv algorithm.
|
Function |
Description |
|
Retrieves the original name of a compressed file. |
|
|
Closes a file that was opened by using LZOpenFile. |
|
|
Copies a source file to a destination file. |
|
|
Allocates memory for the internal data structures required to
decompress files, and then creates and initializes them. |
|
|
Creates, opens, reopens, or deletes the specified file. |
|
|
Reads (at most) the specified number of bytes from a file and copies
them into a buffer. |
|
|
Moves a file pointer a number of bytes from a starting position. |
LIBRARY –
The following functions are used in dynamic linking.
|
Function |
Description |
|
Disables thread attach and thread detach notifications for the
specified DLL. |
|
|
An optional entry point into a DLL. |
|
|
Decrements the reference count of the loaded DLL. When the reference
count reaches zero, the module is unmapped from the address space of the
calling process. |
|
|
Decrements the reference count of a loaded DLL by one, and then
calls ExitThread
to terminate the calling thread. |
|
|
Retrieves the application-specific portion of the search path used
to locate DLLs for the application. |
|
|
Retrieves the full path and file name for the file containing the
specified module. |
|
|
Retrieves a module handle for the specified module. |
|
|
Retrieves a module handle for the specified module. |
|
|
Retrieves the address of an exported function or variable from the
specified DLL. |
|
|
Maps the specified executable module into the address space of the
calling process. |
|
|
Maps the specified executable module into the address space of the
calling process. |
|
|
Modifies the search path used to locate DLLs for the application. |
Obsolete Functions
These functions are provided only for compatibility with 16-bit
versions of Windows.
 The new process runs
in the security context of the specified user. |
|
|
Creates a new process and its primary thread. The new process then
runs the specified executable file in the security context of the specified
credentials (user, domain, and password). |
|
|
Creates a new process and its primary thread. The new process runs
in the security context of the specified token. |
|
|
Ends a process and all its threads. |
|
|
Frees a block of environment strings. |
|
|
Retrieves the command-line string for the current process. |
|
|
Retrieves a pseudo handle for the current process. |
|
|
Retrieves the process identifier of the calling process. |
|
|
Retrieves the environment block for the current process. |
|
|
Retrieves the value of the specified variable from the environment
block of the calling process. |
|
|
Retrieves the termination status of the specified process. |
|
|
Retrieves the count of handles to graphical user interface (GUI)
objects in use by the specified process. |
|
|
Retrieves information about logical processors and related hardware. |
|
|
Retrieves the priority class for the specified process. |
|
|
Retrieves a process affinity mask for the specified process and the
system affinity mask for the system. |
|
|
Retrieves the number of open handles that belong to the specified
process. |
|
|
Retrieves the process identifier of the specified process. |
|
|
Retrieves the process identifier of the process associated with the
specified thread. |
|
|
Retrieves accounting information for all I/O operations performed by
the specified process. |
|
|
Retrieves the priority boost control state of the specified process. |
|
|
Retrieves shutdown parameters for the currently calling process. |
|
|
Retrieves timing information about for the specified process. |
|
|
Retrieves the major and minor version numbers of the system on which
the specified process expects to run. |
|
|
Retrieves the minimum and maximum working set sizes of the specified
process. |
|
|
Retrieves the minimum and maximum working set sizes of the specified
process. |
|
|
Retrieves the contents of the STARTUPINFO
structure that was specified when the calling process was created. |
|
|
Opens an existing process object. |
|
|
Determines whether the current directory should be included in the
search path for the specified executable. |
|
|
Sets the value of an environment variable for the current process. |
|
|
Sets the priority class for the specified process. |
|
|
Sets a processor affinity mask for the threads of a specified
process. |
|
|
Disables the ability of the system to temporarily boost the priority
of the threads of the specified process. |
|
|
Sets shutdown parameters for the currently calling process. |
|
|
Sets the minimum and maximum working set sizes for the specified
process. |
|
|
Sets the minimum and maximum working set sizes for the specified
process. |
|
|
Terminates the specified process and all of its threads. |
The following functions are used with threads.
|
Function |
Description |
|
Attaches the input processing mechanism of one thread to that of
another thread. |
|
|
Creates a thread that runs in the virtual address space of another
process. |
|
|
Creates a thread to execute within the virtual address space of the
calling process. |
|
|
Ends a thread. |
|
|
Retrieves a pseudo handle for the current thread. |
|
|
Retrieves the thread identifier of the calling thread. |
|
|
Retrieves the termination status of the specified thread. |
|
|
Retrieves the thread identifier of the specified thread. |
|
|
Determines whether a specified thread has any I/O requests pending. |
|
|
Retrieves the priority value for the specified thread. |
|
|
Retrieves the priority boost control state of the specified thread. |
|
|
Retrieves timing information for the specified thread. |
|
|
Opens an existing thread object. |
|
|
Decrements a thread's suspend count. |
|
|
Sets a processor affinity mask for the specified thread. |
|
|
Specifies a preferred processor for a thread. |
|
|
Sets the priority value for the specified thread. |
|
|
Disables the ability of the system to temporarily boost the priority
of a thread. |
|
|
Suspends the execution of the current thread for a specified
interval. |
|
|
Suspends the current thread until the specified condition is met. |
|
|
Suspends the specified thread. |
|
|
Causes the calling thread to yield execution to another thread that
is ready to run on the current processor. |
|
|
Terminates a thread. |
|
|
An application-defined function that serves as the starting address
for a thread. |
|
|
Allocates a thread local storage (TLS) index. |
|
|
Releases a TLS index. |
|
|
Retrieves the value in the calling thread's TLS slot for a specified
TLS index. |
|
|
Stores a value in the calling thread's TLS slot for a specified TLS
index. |
|
|
Waits until the specified process is waiting for user input with no
input pending, or until the time-out interval has elapsed. |
The following functions are used with job objects.
|
Function |
Description |
|
Associates a process with an existing job object. |
|
|
Creates or opens a job object. |
|
|
Determines if the process is running in the specified job. |
|
|
Opens an existing job object. |
|
|
Retrieves limit and job state information from the job object. |
|
|
Set limits for a job object. |
|
|
Terminates all processes currently associated with the job. |
|
|
Grants or denies access to a handle to a User object to a job that
has a user-interface restriction. |
The following functions are used in thread pooling.
|
Function |
Description |
|
Binds the specified file handle to the thread pool's I/O completion
port. |
|
|
Queues a work item to a worker thread in the thread pool. |
The following functions are used with fibers.
|
Function |
Description |
|
Converts the current fiber into a thread. |
|
|
Converts the current thread into a fiber. |
|
|
Converts the current thread into a fiber. |
|
|
Allocates a fiber object, assigns it a stack, and sets up execution
to begin at the specified start address. |
|
|
Allocates a fiber object, assigns it a stack, and sets up execution
to begin at the specified start address. |
|
|
Deletes an existing fiber. |
|
|
An application-defined function used with the CreateFiber function. |
|
|
Allocates a fiber local storage (FLS) index. |
|
|
Releases an FLS index. |
|
|
Retrieves the value in the calling fiber's FLS slot for a specified
FLS index. |
|
|
Stores a value in the calling fiber's FLS slot for a specified FLS
index. |
|
|
Schedules a fiber. |
The following are the NUMA functions.
|
Function |
Description |
|
Retrieves the amount of memory available in the specified node. |
|
|
Retrieves the node that currently has the highest number. |
|
|
Retrieves the processor mask for the specified node. |
|
|
Retrieves the node number for the specified processor. |
REGISTRY –
The following are the registry functions.
|
Function |
Description |
|
Releases a handle to the specified registry key. |
|
|
Establishes a connection to a predefined registry handle on another
computer. |
|
|
Creates the specified registry key. |
|
|
Deletes a subkey. |
|
|
Removes a named value from the specified registry key. |
|
|
Disables the predefined registry handle table of HKEY_CURRENT_USER
for the specified process. |
|
|
Enumerates subkeys of the specified open registry key. |
|
|
Enumerates the values for the specified open registry key. |
|
|
Writes all the attributes of the specified open registry key into
the registry. |
|
|
Retrieves a copy of the security descriptor protecting the specified
open registry key. |
|
|
Creates a subkey under HKEY_USERS or HKEY_LOCAL_MACHINE and stores
registration information from a specified file into that subkey. |
|
|
Notifies the caller about changes to the attributes or contents of a
specified registry key. |
|
|
Retrieves a handle to the HKEY_CURRENT_USER key for the user the
current thread is impersonating. |
|
|
Opens the specified registry key. |
|
|
Retrieves a handle to the HKEY_CLASSES_ROOT key for the specified
user. |
|
|
Maps a predefined registry key to a specified registry key. |
|
|
Retrieves information about the specified registry key. |
|
|
Retrieves the type and data for a list of value names associated
with an open registry key. |
|
|
Retrieves the type and data for a specified value name associated
with an open registry key. |
|
|
Replaces the file backing a registry key and all its subkeys with
another file. |
|
|
Reads the registry information in a specified file and copies it
over the specified key. |
|
|
Saves the specified key and all of its subkeys and values to a new
file. |
|
|
Sets the security of an open registry key. |
|
|
Sets the data and type of a specified value under a registry key. |
|
|
Unloads the specified registry key and its subkeys from the
registry. |
The following shell functions can be used with the registry.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The following are the initialization-file functions. They retrieve
information from and copy information to a system- or application-defined
initialization file. These functions are provided only for compatibility with
16-bit versions of Windows. New applications should use the registry.
|
Function |
Description |
|
Retrieves an integer associated with a key in the specified section
of an initialization file. |
|
|
Retrieves all the keys and values for the specified section of an
initialization file. |
|
|
Retrieves the names of all sections in an initialization file. |
|
|
Retrieves a string from the specified section in an initialization
file. |
|
|
Retrieves the data associated with a key in the specified section of
an initialization file. |
|
|
Retrieves an integer from a key in the specified section of the
Win.ini file. |
|
|
Retrieves all the keys and values for the specified section of the
Win.ini file. |
|
|
Retrieves the string associated with a key in the specified section
of the Win.ini file. |
|
|
Replaces the keys and values for the specified section in an
initialization file. |
|
|
Copies a string into the specified section of an initialization
file. |
|
|
Copies data into a key in the specified section of an initialization
file. |
|
|
Replaces the contents of the specified section in the Win.ini file
with specified keys and values. |
|
|
Copies a string into the specified section of the Win.ini file. |


 Shane has learned how to use a spoon ("poon").  He also likes to say outside ("tide"), rain, wet, cookie, scone, down, blue, flakes, toast, basket, CD, cold, cat, monkey, bear, birdy, ducky, fishy, foggy, box, tounge ("gung"), teeth, and pretzle. Shane can also count to four.
Shane got dressed up in his spiffy clothes (courtesy of Auntie Amber) to attend his first wedding. Milind finally stopped dilly dallying around and tied the knot with Aparna! Zubin flew in from California for the big event. On the way home from the wedding Zubin and Shane went night night.
The leaves are starting to fall and Shane is very excited to see so many leaves on the ground. He is helping Mom and Dad clean them up, one leaf at a time. Shane likes to be helpful. Besides picking up leaves, he can put things in the garbage and "help" put away the clean laundry. Shane can say his first name now and count to 10. He can also say "E" as in Yvonne. He has lots of new words: phone, garbage, up, crayon, purple, green, red, plate, fork, juice, pumpkin, pasta, pizza, diaper, wipes, butt, peel (as in banana), flakes (as in corn flakes), clothes, tie (as in shoe), belt, pants, shirt, undies, bra, boat, cracker, bounce, paper, mail, pest, and OK ("kay"), and there you go. He knows that doggies say woof woof, cats say meow, duckies say quack quack, birdies say tweet tweet, cars say beep beep, fishies say blub blub, and monkeys say ee-eee. He know that E comes on the choo choo, and he recognizes the sound of the choo choo when he hears it. And he likes to sing E-I-E-I-O. Shane had lots of visitors over the past few weeks. It is getting too cold outside for sandles, so Shane got some new shoes.
Shane got a new winter coat. It is blue and orange -- like his pumpkin. Shane thinks pumpkins are pretty neat. He was very excited to watch Mom and Dad turn his pumpkin into a jack-o-lantern. Shane dressed up as a doggy for Halloween. He learned to say "tail," "candy," and "ghost." What do ghosts say? "Boo" of course!
Privacy policy
This page maintained by Shane's Mom


FILM TITLE: BELLE EPOQUE DIRECTOR: FERNANDO TRUEBA COUNTRY: SPAIN 1993 CINEMATOGRAPHY: JOSE LUIS ALCAINE MUSIC: ANTOINE DUHAMEL CAST: Penelope Crus ( Luz ), Miriam Diaz-Aroca Clara ), Gabino Diego ( Juanito ), Michel Galabru ( Danglard ), Fernando Fernan Gomez ( Manolo ),Ariadna Gil ( Violeta), Maribel Verdu ( Rocio ), Mary Carmen Ramirez ( Amalia ) SUPER FEATURES: Funny story. Oscar winner for 1994.
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Belle Epoque is a fun film to watch, but one better be prepared to get a handle on the political jokes, or this film will simply come off as a bit of a weird, and unusual story. What really drives this film, is not the story, or the lucky young man, but the political upheavals that even the family is going through, from the father, to the daughters, and finally, the mother.
It is the story of a young man that deserts the army because it has gone crazy on him, and is fighting too many political battles that don't make sense at all. And he wants out of it. But his wanting out of it, only lands him in a place where politics reigns supreme, even if not honorably.
When he is ready to leave the place he wound up in, he finds out that the old man he has befriended has four daughters. And he decides to stick around.  At least they agree on something.... food..... and well .... sex.
But what starts out as what might appear as a good intention on the young man's part, becomes either a joke, or just another conquest. And everyone is on a conquest, except Don Manolo. And he is the best part of the story, and the most interesting. Surprisingly enough he is the only not walking around thinking of sex. Well for good reason, if we can appreciate the fact that his own wife is also on a conquest.
But BELLE EPOQUE is a fun film to watch, as things turn so quickly and get so mixed up that it is a wonder that worse things do not happen all the time. While well directed, with almost all the political stuff as throw away lines and bits of comedy, Fernando Trueba's terrain seems to indicate that the area of love is never to be mixed up with politics. One of the daughters lives a terrible ( is it.? ) mess because of it, but takes advantage of it when it serves her.
Eventually Fernandp finds his match, well, the one that he got caught with, anyway. And the film comes to a nice close.... nothing changed, it seems. And politics are still alive and well. And maybe Juanito and Luz will make it and have a better time for it. But after three sisters, this may take some doing.
Unlike some other spanish films that take the political situations seriously, this one makes a complete mockery of them, starting with Juanito, who has a terrible problem with his mother.  In 1931, and after the second world war, this was a serious problem. Many country folks did not take to the new system as easily as the town folks did under the pointed guns.
BELLE EPOQUE is a fun film to watch and stay with, even if it appears to drag here and there. All the girls are interesting and everyone of them is well defined as a character.
Fun film.
3.5 GIBLOONS Reviewed by Pedro Sena. Ygdrasil's Film Newsgroup Copyright (c) Pedro Sena 1995. All Rights Reserved.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Namespaces | |
| namespace | core |
| namespace | io |
Typedefs | |
| typedef unsigned char | u8 |
| 8 bit unsigned variable. | |
| typedef signed char | s8 |
| 8 bit signed variable. | |
| typedef char | c8 |
| 8 bit character variable. | |
| typedef unsigned short | u16 |
| 16 bit unsigned variable. | |
| typedef signed short | s16 |
| 16 bit signed variable. | |
| typedef unsigned int | u32 |
| 32 bit unsigned variable. | |
| typedef signed int | s32 |
| 32 bit signed variable. | |
| typedef float | f32 |
| 32 bit floating point variable. | |
| typedef double | f64 |
| 64 bit floating point variable. |
| typedef char irr::c8 |
8 bit character variable.
This is a typedef for char, it ensures portability of the engine.
Definition at line 21 of file irrTypes.h.
| typedef float irr::f32 |
32 bit floating point variable.
This is a typedef for float, it ensures portability of the engine.
Definition at line 55 of file irrTypes.h.
| typedef double irr::f64 |
64 bit floating point variable.
This is a typedef for double, it ensures portability of the engine.
Definition at line 59 of file irrTypes.h.
| typedef signed short irr::s16 |
16 bit signed variable.
This is a typedef for signed short, it ensures portability of the engine.
Definition at line 31 of file irrTypes.h.
| typedef signed int irr::s32 |
32 bit signed variable.
This is a typedef for signed int, it ensures portability of the engine.
Definition at line 41 of file irrTypes.h.
| typedef signed char irr::s8 |
8 bit signed variable.
This is a typedef for signed char, it ensures portability of the engine.
Definition at line 17 of file irrTypes.h.
| typedef unsigned short irr::u16 |
16 bit unsigned variable.
This is a typedef for unsigned short, it ensures portability of the engine.
Definition at line 27 of file irrTypes.h.
| typedef unsigned int irr::u32 |
32 bit unsigned variable.
This is a typedef for unsigned int, it ensures portability of the engine.
Definition at line 37 of file irrTypes.h.
| typedef unsigned char irr::u8 |
8 bit unsigned variable.
This is a typedef for unsigned char, it ensures portability of the engine.
Definition at line 13 of file irrTypes.h.


The label said, "Go Jun Hee is an actress with a unique aura. We will be supporting her fully so she can be in many works. We will be using her strength of being the trendsetter to show the strengths of Korean artists internationally."
The label currently houses starts such as Park Hae Jin, Kim Eun Soo, Hong Sae Rom, and Kim Hyun Jin.


Slogan has the ability to take apart data structures and do pattern matching on them. A pattern match expression has the following general form:
match (value)
pattern_1 -> result_1
| pattern_2 -> result_2
| ...
If value
does not match any of the listed patterns, a no_match_found
error is raised.
Let us begin our exploration of pattern matching with the help of a few simple examples. Later we will see how this facility can lead to the clean and concise specification of a non-trivial algorithm.
Our first example re-implements a function from Slogan core
- the length
function that return the number of
elements in a list.
function length(xs)
match(xs)
[] -> 0
| head:tail -> 1 + length(tail)
Our definition of length
does a pattern destructuring on its argument. If the pattern matches an empty list, 0
is returned.
If the pattern matches a head and a tail pair, the length is 1
added to the length of tail.
We can write this function more compactly, by eliminating the explicit declaration of match
. We also do not need to
bind the head
variable because we don't use it. This can be replaced by the `-`
wildcard character.
function length(xs)
| [] -> 0
| _:tail -> 1 + length(tail)
Pattern matching can be done on any data type with a literal representation - numbers, strings, lists, arrays, hashtables, sets and so on. Some more examples are shown below:
function factorial(n)
| 0 -> 1
| _ -> n * factorial(n-1)
factorial(10)
//=> 3628800
factorial(3)
//=> 6
// Evaluate arithmetic expressions in the
// format #{operation: [expr1, expr2]}, where `operation`
// is one of the four symbols - 'add, 'sub, 'mul and 'div.
// An expression can also be a numeric literal.
function calculator(expr)
| #{'add: [e1, e2]} -> calculator(e1) + calculator(e2)
| #{'sub: [e1, e2]} -> calculator(e1) - calculator(e2)
| #{'mul: [e1, e2]} -> calculator(e1) * calculator(e2)
| #{'div: [e1, e2]} -> calculator(e1) / calculator(e2)
| e where is_number(e) -> e
calculator(#{'add: [#{'mul: [10, 20]}, 500]})
//=> 700
calculator(#{'sub: [100, 20]})
//=> 80
calculator(#{'sub: [100, "ok"]})
//-> error: no_match_found
The calculator
function makes use of the where
guard in the last pattern to make sure that
the value that gets bound to the variable is a number.
In addition to the built-in data structures, user defined records can also be destructured:
record circle(radius)
record rectangle(width, length)
function area(shape)
| circle(r) -> 3.14159 * (r * r)
| rectangle(w, ln) -> w * ln
area(circle(radius = 10.34))
//=><PHONE_NUMBER>0399995
area(rectangle(width=20, length=52.78))
//=> 1055.6
If a function with an implicit match takes more than one parameter, all the arguments are packed into a list and passed to the pattern matcher:
function f(a, b)
| [1, b] -> b * 10
| [2, b] -> b * 100
f(1, 2)
//=> 20
f(2, 2)
//=> 200
Slogan supports or-patterns
, which is a feature that allows us to collapse multiple clauses with identical right-hand sides
into a single clause:
function f(xs)
| [a, b]
| #[a, b]
| #(a, b) -> a * b
f([10, 20])
//=> 200
f(#[10, 20])
//=> 200
f(#(10, 20))
//=> 200
Now that we have covered the basics, let us write some code that exploits the true expressive power of pattern matching! We are going to implement a data structure that is often flagged as "advanced". This is the red-black tree - one of the most popular of all balanced binary trees.
In a red-black tree every node is colored either red or black and it satisfies the following two balance invariants:
These invariants guarantee that the longest possible path in the tree is not longer than the shortest possible path times two. (The longest path has alternating red and black nodes and the shortest path has only black nodes.)
These invariants are enforced while inserting a new node, using a balance
function. This function re-configures
all possible black-red-red paths into a red-black-black path. The black-red-red paths can occur in four configurations,
depending on whether the red node is a left or right child. The rewrite required is the same in all cases. Pattern matching makes it possible
to write the balance
function in a compact, declarative style:
function balance(color, t, z, d)
| ['b, ['r,['r,a,x,b],y,c], z, d]
| ['b, ['r,a,x,['r,b,y,c]], z, d]
| ['b, a, x, ['r,['r,b,y,c],z,d]]
| ['b, a, x, ['r,b,y,['r,c,z,d]]]
-> ['r,['b,a,x,b],y,['b,c,z,d]]
| _ -> [color, t, z, d]
The complete code for the red-black tree is shown below. It is implemented as a module with a simple public interface of two functions for inserting and fetching key-value data.
module red_black_tree(get, put)
{ function get(x, t)
| [_, 'empty] -> false
| [x, [_,a,y,b]] ->
match (y)
k:v ->
if (x < k) get(x, a)
else if (k < x) get(x, b)
else v
function balance(color, t, z, d)
| ['b, ['r,['r,a,x,b],y,c], z, d]
| ['b, ['r,a,x,['r,b,y,c]], z, d]
| ['b, a, x, ['r,['r,b,y,c],z,d]]
| ['b, a, x, ['r,b,y,['r,c,z,d]]]
-> ['r,['b,a,x,b],y,['b,c,z,d]]
| _ -> [color, t, z, d]
function insert(x, s)
{ function ins(rs)
| 'empty -> ['r,'empty,x,'empty]
| [color,a,y,b] ->
match([x,y])
[kx:_, ky:_] ->
if (kx < ky) balance(color, ins(a), y, b)
else if (ky < kx) balance(color, a, y, ins(b))
else s;
match(ins(s)) [_,a,y,b] -> ['b,a,y,b] }
function put(key, value, s = 'empty) insert(key:value, s) }
// Usage:
let rbt = red_black_tree
let t = rbt.put(0, 'abc)
for_each(^(i) t = rbt.put(i, i*100, t), range(1, 1000))
rbt.get(0, t)
//=> abc
rbt.get(125, t)
//=> 12500
rbt.get(23, t)
//=> 2300
rbt.get(997, t)
//=> 99700
rbt.get(1322, t)
//=> false
(For a detailed description of a red-black tree structure similar to the one presented here, please see the book "Purely functional data structures" by Chris Okasaki.)


Javascript
Variables
Data Types
Numbers
Strings
Booleans
Arrays
Functions
Undefined
Null
NaN
Infinity and -Infinity
Operators
Assignment
Arithmetic
Comparison
Logical
Binary
Ternary
String Manipulation
Control Flow
Loops
Looping
Looping Arrays
Looping Objects
Functions


|
KratosMultiphysics
KRATOS Multiphysics (Kratos) is a framework for building parallel, multi-disciplinary simulation software, aiming at modularity, extensibility, and high performance. Kratos is written in C++, and counts with an extensive Python interface.
|
The structural mechanics contact implicit dynamic solver. More...
Public Member Functions | |
| def | __init__ (self, model, custom_settings) |
| def | ValidateSettings (self) |
| This function validates the settings of the solver. More... | |
| def | AddVariables (self) |
| def | AddDofs (self) |
| def | Initialize (self) |
| def | Solve (self) |
| def | SolveSolutionStep (self) |
| def | ExecuteFinalizeSolutionStep (self) |
| def | ComputeDeltaTime (self) |
| def | AddProcessesList (self, processes_list) |
| def | AddPostProcess (self, post_process) |
| def | GetDefaultParameters (cls) |
| Public Member Functions inherited from structural_mechanics_implicit_dynamic_solver.ImplicitMechanicalSolver | |
| def | GetMinimumBufferSize (self) |
| def | InitializeSolutionStep (self) |
Public Attributes | |
| contact_settings | |
| linear_solver_settings | |
| echo_level | |
| processes_list | |
| post_process | |
| mechanical_scheme | |
| linear_solver | |
| mechanical_convergence_criterion | |
| builder_and_solver | |
The structural mechanics contact implicit dynamic solver.
This class creates the mechanical solvers for contact implicit dynamic analysis. It currently supports Newmark, Bossak and dynamic relaxation schemes. Public member variables: dynamic_settings -- settings for the implicit dynamic solvers. See structural_mechanics_solver.py for more information.
| def contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.__init__ | ( | self, | |
| model, | |||
| custom_settings | |||
| ) |
| def contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.AddDofs | ( | self | ) |
Reimplemented from structural_mechanics_implicit_dynamic_solver.ImplicitMechanicalSolver.
| def contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.AddPostProcess | ( | self, | |
| post_process | |||
| ) |
| def contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.AddProcessesList | ( | self, | |
| processes_list | |||
| ) |
| def contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.AddVariables | ( | self | ) |
| def contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.ComputeDeltaTime | ( | self | ) |
| def contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.ExecuteFinalizeSolutionStep | ( | self | ) |
| def contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.GetDefaultParameters | ( | cls | ) |
| def contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.Initialize | ( | self | ) |
| def contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.Solve | ( | self | ) |
| def contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.SolveSolutionStep | ( | self | ) |
| def contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.ValidateSettings | ( | self | ) |
This function validates the settings of the solver.
| contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.builder_and_solver |
| contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.contact_settings |
| contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.echo_level |
| contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.linear_solver |
| contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.linear_solver_settings |
| contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.mechanical_convergence_criterion |
| contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.mechanical_scheme |
| contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.post_process |
| contact_structural_mechanics_implicit_dynamic_solver.ContactImplicitMechanicalSolver.processes_list |


Plugin Details
Plugins cannot be edited, but details about the plugin can be viewed on this page. Additionally, the plugin can be deleted via the Delete button below.
Plugin Coordinates
- Group Id
-
{{ plugin.groupId }}
- Artifact Id
-
{{ plugin.artifactId }}
- Version
-
{{ plugin.version }}
- Classifier (optional)
-
{{ plugin.classifier }}
- Type (optional)
-
{{ plugin.type }}
Plugin Info
- Description
-
{{ plugin.description }}


SIGNAL
Section: Linux Programmer's Manual (2)
Updated: 2014-08-19
Index
Return to Main Contents
NAME
signal - ANSI C signal handling
SYNOPSIS
#include <signal.h>
typedef void (*sighandler_t)(int);
sighandler_t signal(int signum, sighandler_t handler);
DESCRIPTION
The behavior of
signal()
varies across UNIX versions,
and has also varied historically across different versions of Linux.
Avoid its use: use
sigaction(2)
instead.
See Portability below.
signal()
sets the disposition of the signal
signum
to
handler,
which is either
SIG_IGN,
SIG_DFL,
or the address of a programmer-defined function (a "signal handler").
If the signal
signum
is delivered to the process, then one of the following happens:
- *
-
If the disposition is set to
SIG_IGN,
then the signal is ignored.
- *
-
If the disposition is set to
SIG_DFL,
then the default action associated with the signal (see
signal(7))
occurs.
- *
-
If the disposition is set to a function,
then first either the disposition is reset to
SIG_DFL,
or the signal is blocked (see Portability below), and then
handler
is called with argument
signum.
If invocation of the handler caused the signal to be blocked,
then the signal is unblocked upon return from the handler.
The signals
SIGKILL
and
SIGSTOP
cannot be caught or ignored.
RETURN VALUE
signal()
returns the previous value of the signal handler, or
SIG_ERR
on error.
In the event of an error,
errno
is set to indicate the cause.
ERRORS
- EINVAL
-
signum
is invalid.
CONFORMING TO
C89, C99, POSIX.1-2001.
NOTES
The effects of
signal()
in a multithreaded process are unspecified.
According to POSIX, the behavior of a process is undefined after it
ignores a
SIGFPE,
SIGILL,
or
SIGSEGV
signal that was not generated by
kill(2)
or
raise(3).
Integer division by zero has undefined result.
On some architectures it will generate a
SIGFPE
signal.
(Also dividing the most negative integer by -1 may generate
SIGFPE.)
Ignoring this signal might lead to an endless loop.
See
sigaction(2)
for details on what happens when
SIGCHLD
is set to
SIG_IGN.
See
signal(7)
for a list of the async-signal-safe functions that can be
safely called from inside a signal handler.
The use of
sighandler_t
is a GNU extension, exposed if
_GNU_SOURCE
is defined;
glibc also defines (the BSD-derived)
sig_t
if
_BSD_SOURCE
is defined.
Without use of such a type, the declaration of
signal()
is the somewhat harder to read:
void ( *signal(int signum, void (*handler)(int)) ) (int);
Portability
The only portable use of
signal()
is to set a signal's disposition to
SIG_DFL
or
SIG_IGN.
The semantics when using
signal()
to establish a signal handler vary across systems
(and POSIX.1 explicitly permits this variation);
do not use it for this purpose.
POSIX.1 solved the portability mess by specifying
sigaction(2),
which provides explicit control of the semantics when a
signal handler is invoked; use that interface instead of
signal().
In the original UNIX systems, when a handler that was established using
signal()
was invoked by the delivery of a signal,
the disposition of the signal would be reset to
SIG_DFL,
and the system did not block delivery of further instances of the signal.
This is equivalent to calling
sigaction(2)
with the following flags:
sa.sa_flags = SA_RESETHAND | SA_NODEFER;
System V also provides these semantics for
signal().
This was bad because the signal might be delivered again
before the handler had a chance to reestablish itself.
Furthermore, rapid deliveries of the same signal could
result in recursive invocations of the handler.
BSD improved on this situation, but unfortunately also
changed the semantics of the existing
signal()
interface while doing so.
On BSD, when a signal handler is invoked,
the signal disposition is not reset,
and further instances of the signal are blocked from
being delivered while the handler is executing.
Furthermore, certain blocking system calls are automatically
restarted if interrupted by a signal handler (see
signal(7)).
The BSD semantics are equivalent to calling
sigaction(2)
with the following flags:
sa.sa_flags = SA_RESTART;
The situation on Linux is as follows:
- *
-
The kernel's
signal()
system call provides System V semantics.
- *
-
By default, in glibc 2 and later, the
signal()
wrapper function does not invoke the kernel system call.
Instead, it calls
sigaction(2)
using flags that supply BSD semantics.
This default behavior is provided as long as the
_BSD_SOURCE
feature test macro is defined.
By default,
_BSD_SOURCE
is defined;
it is also implicitly defined if one defines
_GNU_SOURCE,
and can of course be explicitly defined.
- *
-
On glibc 2 and later, if the
_BSD_SOURCE
feature test macro is not defined, then
signal()
provides System V semantics.
(The default implicit definition of
_BSD_SOURCE
is not provided if one invokes
gcc(1)
in one of its standard modes
(-std=xxx or -ansi)
or defines various other feature test macros such as
_POSIX_SOURCE,
_XOPEN_SOURCE,
or
_SVID_SOURCE;
see
feature_test_macros(7).)
SEE ALSO
kill(1),
alarm(2),
kill(2),
killpg(2),
pause(2),
sigaction(2),
signalfd(2),
sigpending(2),
sigprocmask(2),
sigsuspend(2),
bsd_signal(3),
raise(3),
siginterrupt(3),
sigqueue(3),
sigsetops(3),
sigvec(3),
sysv_signal(3),
signal(7)
Index
- NAME
-
- SYNOPSIS
-
- DESCRIPTION
-
- RETURN VALUE
-
- ERRORS
-
- CONFORMING TO
-
- NOTES
-
- Portability
-
- SEE ALSO
-
This document was created by
man2html,
using the manual pages.
Time: 02:54:45 GMT, September 18, 2014


Open in a new tab
Open in a new window
Open in Incognito mode
Edit...
Delete
Open all in tabs
Open all in a new window
Open all in Incognito mode
Edit...
Delete...


Jekyll-Bootstrap
The quickest way to start and publish your Jekyll powered blog. 100% compatible with GitHub pages
Usage
For all usage and documentation please see: http://jekyllbootstrap.com
Version
0.3.0 - stable and versioned using semantic versioning.
NOTE: 0.3.0 introduces a new theme which is not backwards compatible in the sense it won't look like the old version. However, the actual API has not changed at all. You might want to run 0.3.0 in a branch to make sure you are ok with the theme design changes.
Contributing
This repository tracks 2 projects:
-
Jekyll-Bootstrap Framework. The framework for which users should clone and build their blog on top of is available in the master branch.
To contribute to the framework please make sure to checkout your branch based on
jb-development
!! This is very important as it allows me to accept your pull request without having to publish a public version release.Small, atomic Features, bugs, etc. Use the
jb-development
branch but note it will likely change fast as pull requests are accepted. Please rebase as often as possible when working. Work on small, atomic features/bugs to avoid upstream commits affecting/breaking your development work.For Big Features or major API extensions/edits: This is the one case where I'll accept pull-requests based off the master branch. This allows you to work in isolation but it means I'll have to manually merge your work into the next public release. Translation : it might take a bit longer so please be patient! (but sincerely thank you).
Jekyll-Bootstrap Documentation Website. The documentation website at http://jekyllbootstrap.com is maintained in the gh-pages branch. Please fork and contribute documentation additions to this branch only.
The master and gh-pages branch do not share the same ancestry. Please treat them as completely separate git repositories!
License
Install jekyll
sudo apt-get install ruby1.9.1 sudo apt-get install rubygems sudo gem install jekyll
jekyll serve


You are viewing an historical archive of past issues. Please
report new issues to the appropriate project issue tracker on
GitHub.
Comments
-
Greg Hurrell
"Fixed" by getting a new SSL cert from RapidSSL.
I say "fixed" because the old cert was still valid until May 2013, so I effectively forfeited a year. Good thing it only cost $10.
-
Greg Hurrell
Status changed:
- From: new
- To: closed
Add a comment
Comments are now closed for this issue.


Ten Books
I was persuaded to take part in one of those Facecloth round-robins, in which I was asked to name ten favourite books “without thinking too hard”. Here is my list (A-Z by author):
- Watt, Samuel Beckett
- Who Was Changed And Who Was Dead, Barbara Comyns
- The Household Wreck, Thomas De Quincey
- Amphigorey, Edward Gorey
- The Falls, Peter Greenaway
- Bartleby The Scrivener, Herman Melville
- Pale Fire, Vladimir Nabokov
- W or The Memory Of Childhood, Georges Perec
- The Crying Of Lot 49, Thomas Pynchon
- The Purple Cloud, M P Shiel
Do not be confused by No. 10 The screenplay of Greenaway's majestic film is (or was) available in paperback, and takes the form of a continuous piece of prose.


Annotation Type StatusCode
Annotation used to denote an HTTP response status code.
Can be used in the following locations:
- Arguments of server-side
@RestOp -annotated methods. - Methods and return types of server-side and client-side
@Response -annotated interfaces.
Arguments of server-side @RestOp -annotated methods
On server-side REST, this annotation can be applied to method parameters to identify them as an HTTP response value.
Example:
The parameter type must be Value
with a parameterized type of Integer
.
Public methods of @Response -annotated types
On @Response
-annotated classes, this method can be used to denote an HTTP status code on a response.
Example:
The method being annotated must be public and return a numeric value.
See Also:
Methods and return types of server-side and client-side @Response-annotated interfaces
See Also:
See Also:
-
Optional Element Summary
-
Element Details
-
on
Dynamically apply this annotation to the specified classes.See Also:
- Returns:
- The annotation value.
- Default:
- {}
-
onClass
Dynamically apply this annotation to the specified classes.Identical to
on()
except allows you to specify class objects instead of a strings.See Also:
- Returns:
- The annotation value.
- Default:
- {}
-
value
int[] valueThe HTTP response codes. The default value is500 for exceptions and200 for return types.- Returns:
- The annotation value.
- Default:
- {}
-


Creating Pages
Frontmatter Properties
Frontmatter must begin as the first line in the file and must use exactly three dashes to mark the beginning and end of the frontmatter block. Properties must be specified in the format of name: value
, one per line. Example:
---
title: A page title
layout: layoutname
customproperty: true
---
All properties specified in the frontmatter object will be available as part of the page's data. The page being rendered is available via context.page
. For example, to access the page's title, use context.page.title
.
Standard Properties
| Property | Description |
|---|---|
| title |
the page's title |
| layout |
the name of the layout to use when rendering the page. Defaults to default if not specified. |
| order |
Override for order in siblings list. Value of 1 will be a the top of the list, bigger numbers lower. If not set, will appear sorted alphabetically below all prioritized pages. |
| renderMarkdown |
If false , skips rendering using markdown and only executes the template. Use for non-HTML files, like a JSON file. |
Suggested Properties
These properties aren't used by sitepiler directly, but are some suggested options that authors may wish to make use of in their templates.
| Property | Description |
|---|---|
| notoc |
true to exclude from navigation |
| ispreview |
true to include a preview banner at the top of the site |
| hideTitle |
true to hide the page's title from the layout |
Special Behavior
Implied titles
In the absense of a title in the frontmatter setting, if the first line in a page is a markdown heading, the text of the heading will be used as the page's title. The attribute hideTitle
will also be set to true
. The actual body of the page will remain unaffected.


Guides
Get Started
HTML Navigation & Routing
Using Data in HTML
HTML Event Actions
Add-ons to do more with HTML
Components
<{data:tag}>
Testing
First: Get Started
Cookies
This site uses cookies for tracking.


Loading Squidex
Your browser is out-of-date!
Update your browser to view this website correctly.
Update my browser now
×


WITNESS LIST Transportation & Homeland Security Committee April 22, 2005 - 8:30A SB 1706 ON: Anderson, Tim ROW Attorney (Texas Department of Transportation), Austin, TX Behrens, Michael W. Exec. Director (TxDOT), Austin, TX Jackson, Bob Deputy General Counsel (Texas Department of Transportation), Austin, TX Registering, but not testifying: On: Saenz, Amadeo Asst. Exec. Dir., Engineering Operations (Texas Department of Transportation), Austin, TX Simmons, Steve Deputy Executive Director (Texas Department of Transportation), Austin, TX


This past weekend, YWAP hosted a 200-person camp at a training center about 45 minutes outside of town. The Highland team was there for camp, and although they were involved with some of the skits and worship, they were considered campers for the weekend.
One of the highlights of the camp was the worship sets. The worship time seemed to really have a moving of the Spirit.
During camp, I was the filmographer. I held a camcorder in my hand almost the entire time. While filming is fun at first, after doing it for many, many hours in one weekend it can become a chore. However, I am glad that I was able to serve in that way. We will be making a camp video soon. I know it will be great.
Thank you for your prayers during camp. That weekend, many students professed to believe in the power of Christ for the first time. The church now has the task of nursing these new believers into maturity. Pray that the church will persevere in this.
-PJ


--- title: Time series clustering with Dynamic Time Warping (Part 2) author: '' date: '2018-09-27' slug: time-series-clustering-with-dynamic-time-warping-part-2 categories: [] tags: [] header: caption: '' image: '' ---
Like every good movies, my previous blog post “Time series clustering with Dynamic Time Warping” deserves a sequel. In this Part 2, I will have a look at the athletes’ training plan for a marathon. Because marathons are such a demanding performance, most of athletes have a specific training plan to follow in order to be prepared. Many different training plan can be found on the web such as this one from the website www.runireland.com.
In this blog post I will try to cluster different simulated athlete training plans with Dynamic Time Warping and some seasonality, states and power band extractions.
# data wrangling
library(dplyr) # data wrangling
library(tidyr) # datawrangling
# analysis
library(dtwclust) # dynamic time warpping
library(depmixS4) # Hidden Markov Model
library(WaveletComp) # Wavelet Analysis
# graphics
library(ggplot2) # grammar of graphics
library(ggdendro) # grammar of dendrograms
library(gtable) # plot organisation
library(grid) # plot organisation
library(gridExtra) # plot organisation
For this purpose, I will create a data frame of 20 athlete training plans with 10 of them with a random plan and 10 with a repeated pattern non synchronized on their date and intensity. The main variable is the distance they have ran of every day since 25 weeks (175 days) before the marathon.
date_marathon <- as.Date("2015-10-26")
#
df <- NULL
# random training plan with runs from 5 to 40km with a high proability of non run days (between 25% and 75% depending on athletes)
for (i in 1:10){
random_proba <- runif(8)
random_proba <- random_proba/sum(random_proba)
value <- base::sample(
x = seq(from = 0, to = 40, by = 5),
size = 175,
replace = TRUE,
prob = c(runif(1, 0.25, 0.75),random_proba)
)
athlete <- paste0("athlete_rand_",i)
new_df <- data.frame(athlete = athlete, value = value, rundate = seq.Date(date_marathon-175, date_marathon-1, by="day"))
df <- rbind(df,new_df)
}
# training plan with a reapeated pattern with can change according the weeks and with a different intensity according athletes
for (i in 11:20){
value <- rep_len(
x = c(rep(x = 0, sample(1:3, 1)),10,0,15,20,30)*runif(1, 0.5, 1.5),
length.out = 175
)
athlete <- paste0("athlete_plan_",i)
new_df <- data.frame(athlete = athlete, value = value, rundate = seq.Date(date_marathon-175, date_marathon-1, by="day"))
df <- rbind(df,new_df)
}
Once we have the data generated, a key trick will be to convert this data frame into a list of time series. The reason behind this choice is the possibility to implement a multivariate DTW analysis in the future (maybe in a Part 3).
plan_list <- df %>%
tidyr::spread(athlete,value) %>%
dplyr::select(-rundate) %>%
purrr::map(~(.))
After creating the list of data, let’s implement a simple DTW clustering on the raw data to see if we can identify our two groups.
Nclust <- 2
dtw_model <- dtwclust::tsclust(series = plan_list,
type = "h",
k = Nclust,
distance = "dtw_basic",
control = hierarchical_control(method = "complete"),
preproc = NULL,
#args = tsclust_args(dist = list(window.size = 5L)),
trace = TRUE)
#
dtw_data <- ggdendro::dendro_data(dtw_model, type="rectangle")
#
labels_order <- dtw_data$labels$label
#
dtw_result <- data.frame(label = names(plan_list),
cluster = factor(stats::cutree(dtw_model, k = Nclust)))
#
dtw_data[["labels"]] <- merge(dtw_data[["labels"]], dtw_result, by="label")
dtw_result <- dplyr::full_join(dtw_result,dtw_data$labels, by=c("label", "cluster"))%>%
dplyr::arrange(x)
cluster_box <- aggregate(x~cluster, ggdendro::label(dtw_data), range)
cluster_box <- data.frame(cluster_box$cluster,cluster_box$x)
cluster_threshold <- mean(dtw_model$height[length(dtw_model$height)-((Nclust-2):(Nclust-1))])
#
numColors <- length(levels(dtw_result$cluster)) # How many colors you need
getColors <- scales::hue_pal() # Create a function that takes a number and returns a qualitative palette of that length (from the scales package)
myPalette <- getColors(numColors)
names(myPalette) <- levels(dtw_result$cluster) # Give every color an appropriate name
p1 <- ggplot() +
geom_rect(data=cluster_box, aes(xmin=X1-.3, xmax=X2+.3, ymin=0, ymax=cluster_threshold, color=cluster_box.cluster), fill=NA)+
geom_segment(data=ggdendro::segment(dtw_data), aes(x=x, y=y, xend=xend, yend=yend)) +
coord_flip() +
scale_y_continuous("Distance") +
scale_x_continuous("",breaks = 1:20, labels = labels_order) +
guides(color=FALSE, fill = FALSE)+
theme(
panel.grid.major = element_blank(),
panel.grid.minor = element_blank(), # remove grids
panel.background = element_blank(),
axis.text.y = element_text(colour = myPalette[dtw_result$cluster],hjust=0.5),
axis.ticks.y=element_blank()
)
#
p2 <- as.data.frame(matrix(unlist(plan_list),
nrow=length(unlist(plan_list[1])),
dimnames = list(c(),names(plan_list)))) %>%
dplyr::mutate(rundatelocal = seq.Date(date_marathon-175, date_marathon-1, by="day")) %>%
tidyr::gather(key = label,value = value, -rundatelocal) %>%
dplyr::mutate(label = as.factor(label)) %>%
dplyr::full_join(., dtw_result, by = "label") %>%
mutate(label = factor(label, levels = rev(as.character(labels_order)))) %>%
ggplot(aes(x = rundatelocal, y = value, colour = as.factor(cluster))) +
geom_line() +
geom_area(aes(fill = as.factor(cluster))) +
coord_cartesian(ylim = c(0,50)) +
scale_y_continuous(name = "Total distance per day [km]", breaks = seq(0, 50, by = 50)) +
scale_x_date(name = "Run Date", date_breaks = "4 week", date_labels = "%b %d") +
facet_wrap(~label, ncol = 1, strip.position="left") +
guides(color=FALSE, fill = FALSE) +
theme_bw() +
theme(strip.background = element_blank(), strip.text = element_blank())
#
plt_list <- list(p2, p1)
plt_layout <- rbind(c(NA, 2),
c(1, 2),
c(NA, 2))
#
grid.arrange(grobs = plt_list, layout_matrix = plt_layout, heights = c(0.04, 1, 0.05))
I think I get a nice plot thanks to the solutions provided on Stack Overflow graphically speaking (except some overlap with the labels but I’m working on it). The results are not too bad but some of the random plan can be included in the repeated pattern plan. Well randomness can be expected and can create some nice patterns sometimes. Another interesting result is the necessity to increase the cluster number in order to have a clean clustering.
We can also have a look at the centroids to see with plans are the most representative of the clusters. Obviously with only two clusters, it is not very useful but it can be a key element to distinguish between many different training plans.
dtw_model_centroids <- data.frame(dtw_model@centroids, rundatelocal = seq.Date(date_marathon-175, date_marathon-1, by="day")) %>%
tidyr::gather(label, totaldistancekm, starts_with("athlete")) %>%
dplyr::left_join(., dtw_result, by = "label") %>%
dplyr::mutate(label = factor(label, levels = rev(labels_order)))
#
dtw_model_centroids %>%
ggplot(aes(rundatelocal,totaldistancekm, color = cluster, fill = cluster)) +
geom_line() +
geom_area() +
facet_wrap(~ label + cluster, ncol = 1, strip.position="right", labeller=labeller(.rows = label_both)) +
scale_y_continuous(name = "Total distance per day [km]") +
scale_x_date(name = "Run Date", date_breaks = "4 week", date_labels = "%b %d") +
guides(color=FALSE, fill = FALSE) +
theme_bw()
The main problem with raw data is the noise. In order to extract recurrent patterns, the randomness of the noise can sometimes simulate non meaningful pattern and then change the cluster structure. Because we are interested in classification of recurrent pattern, a nice thing would be to remove the noise. Noise removal analyses are probably the most important contribution of signal treatment research and many can be applied here such as seasonality decomposition, Hidden Markov Models and power spectrum analysis.
R for time series analysis have some unavoidable packages and functions. If you are interested in time series analysis, you probably cannot work without zoo::zoo()
, xts::xts()
or tibbletime::as_tbl_time()
. However for time series analysis, the stats
package have one of the most used and nice function: stl()
. Stl allows a Seasonal Decomposition of Time Series by Loess which is powerful in order to extract time series noise, trend and seasonality (i.e periods). In our case we will try to use stl()
in order to extract training plan seasonality over one week and then to cluster the results with the DTW method.
So first let’s apply the stl()
decomposition to every time series in our master list.
extract_seasonality <- function(x, robust){
x_ts = ts(as.numeric(unlist(x)), frequency = 7)
stl_test = stl(x_ts, s.window = 7, robust)
return(stl_test$time.series[,1])
}
#
plan_seasonality <- plan_list %>%
purrr::map(~extract_seasonality(., robust = TRUE))
and then let’s process our model and to plot the results.
Nclust <- 2
dtw_model <- dtwclust::tsclust(series = plan_seasonality,
type = "h",
k = Nclust,
distance = "dtw_basic",
control = hierarchical_control(method = "complete"),
preproc = NULL,
#args = tsclust_args(dist = list(window.size = 5L)),
trace = TRUE)
#
dtw_data <- ggdendro::dendro_data(dtw_model, type="rectangle")
#
labels_order <- dtw_data$labels$label
#
dtw_result <- data.frame(label = names(plan_seasonality),
cluster = factor(stats::cutree(dtw_model, k = Nclust)))
#
dtw_data[["labels"]] <- merge(dtw_data[["labels"]], dtw_result, by="label")
dtw_result <- dplyr::full_join(dtw_result,dtw_data$labels, by=c("label", "cluster"))%>%
dplyr::arrange(x)
cluster_box <- aggregate(x~cluster, ggdendro::label(dtw_data), range)
cluster_box <- data.frame(cluster_box$cluster,cluster_box$x)
cluster_threshold <- mean(dtw_model$height[length(dtw_model$height)-((Nclust-2):(Nclust-1))])
#
numColors <- length(levels(dtw_result$cluster)) # How many colors you need
getColors <- scales::hue_pal() # Create a function that takes a number and returns a qualitative palette of that length (from the scales package)
myPalette <- getColors(numColors)
names(myPalette) <- levels(dtw_result$cluster) # Give every color an appropriate name
p1 <- ggplot() +
geom_rect(data=cluster_box, aes(xmin=X1-.3, xmax=X2+.3, ymin=0, ymax=cluster_threshold, color=cluster_box.cluster), fill=NA)+
geom_segment(data=ggdendro::segment(dtw_data), aes(x=x, y=y, xend=xend, yend=yend)) +
coord_flip() +
scale_y_continuous("Distance") +
scale_x_continuous("",breaks = 1:20, labels = labels_order) +
guides(color=FALSE, fill = FALSE)+
theme(
panel.grid.major = element_blank(),
panel.grid.minor = element_blank(), # remove grids
panel.background = element_blank(),
axis.text.y = element_text(colour = myPalette[dtw_result$cluster],hjust=0.5),
axis.ticks.y=element_blank()
)
#
p2 <- as.data.frame(matrix(unlist(plan_seasonality),
nrow=length(unlist(plan_seasonality[1])),
dimnames = list(c(),names(plan_seasonality)))) %>%
dplyr::mutate(rundatelocal = seq.Date(date_marathon-175, date_marathon-1, by="day")) %>%
tidyr::gather(key = label,value = value, -rundatelocal) %>%
dplyr::mutate(label = as.factor(label)) %>%
dplyr::full_join(., dtw_result, by = "label") %>%
mutate(label = factor(label, levels = rev(as.character(labels_order)))) %>%
ggplot(aes(x = rundatelocal, y = value, colour = as.factor(cluster))) +
geom_line() +
geom_area(aes(fill = as.factor(cluster))) +
coord_cartesian(ylim = c(-25,25)) +
scale_y_continuous(name = "Seasonal distance per day [km]", breaks = seq(-25, 25, by = 50)) +
scale_x_date(name = "Run Date", date_breaks = "4 week", date_labels = "%b %d") +
facet_wrap(~label, ncol = 1, strip.position="left") +
guides(color=FALSE, fill = FALSE) +
theme_bw() +
theme(strip.background = element_blank(), strip.text = element_blank())
#
plt_list <- list(p2, p1)
plt_layout <- rbind(c(NA, 2),
c(1, 2),
c(NA, 2))
#
grid.arrange(grobs = plt_list, layout_matrix = plt_layout, heights = c(0.04, 1, 0.05))
Well that’s an epic fail I think but let’s have a look why. Different reasons can explain why we have a first cluster with only 3 time series and as second with all the 17 remaining ones:
So let’s try another method!
Last but not least, the probable best approach to evaluate seasonality/frequency in training plan pattern can be the power spectrum analysis. By identifying the underlying frequencies of each time series it is possible to cluster them according their pattern. A nice new package WaveletComp
can be used for this purpose. WaveletComp
is analyzing the frequency structure of uni- and bivariate time series using the Morlet wavelet.
extract_poweravg <- function(x){
x <- as.data.frame(x)
power_spectrum <- WaveletComp::analyze.wavelet(
my.data = x,
my.series = 1,
loess.span = 0,
dt = 1,
verbose = FALSE
)
max_period <- max(power_spectrum$Period)
dat <- spline(power_spectrum$Power.avg, n = max_period)$y # WARNING:power band starts at 2 not 1
return(dat)
}
plan_poweravge <- plan_list %>%
purrr::map(~extract_poweravg(.))
Nclust <- 2
dtw_model <- dtwclust::tsclust(series = plan_poweravge,
type = "h",
k = Nclust,
distance = "dtw_basic",
control = hierarchical_control(method = "complete"),
preproc = NULL,
#args = tsclust_args(dist = list(window.size = 5L)),
trace = TRUE)
#
dtw_data <- ggdendro::dendro_data(dtw_model, type="rectangle")
#
labels_order <- dtw_data$labels$label
#
dtw_result <- data.frame(label = names(plan_poweravge),
cluster = factor(stats::cutree(dtw_model, k = Nclust)))
#
dtw_data[["labels"]] <- merge(dtw_data[["labels"]], dtw_result, by="label")
dtw_result <- dplyr::full_join(dtw_result,dtw_data$labels, by=c("label", "cluster"))%>%
dplyr::arrange(x)
cluster_box <- aggregate(x~cluster, ggdendro::label(dtw_data), range)
cluster_box <- data.frame(cluster_box$cluster,cluster_box$x)
cluster_threshold <- mean(dtw_model$height[length(dtw_model$height)-((Nclust-2):(Nclust-1))])
#
numColors <- length(levels(dtw_result$cluster)) # How many colors you need
getColors <- scales::hue_pal() # Create a function that takes a number and returns a qualitative palette of that length (from the scales package)
myPalette <- getColors(numColors)
names(myPalette) <- levels(dtw_result$cluster) # Give every color an appropriate name
p1 <- ggplot() +
geom_rect(data=cluster_box, aes(xmin=X1-.3, xmax=X2+.3, ymin=0, ymax=cluster_threshold, color=cluster_box.cluster), fill=NA)+
geom_segment(data=ggdendro::segment(dtw_data), aes(x=x, y=y, xend=xend, yend=yend)) +
coord_flip() +
scale_y_continuous("Distance") +
scale_x_continuous("",breaks = 1:20, labels = labels_order) +
guides(color=FALSE, fill = FALSE)+
theme(
panel.grid.major = element_blank(),
panel.grid.minor = element_blank(), # remove grids
panel.background = element_blank(),
axis.text.y = element_text(colour = myPalette[dtw_result$cluster],hjust=0.5),
axis.ticks.y=element_blank()
)
#
p2 <- as.data.frame(matrix(unlist(plan_poweravge),
nrow=length(unlist(plan_poweravge[1])),
dimnames = list(c(),names(plan_poweravge)))) %>%
dplyr::mutate(rundatelocal = 1:n()) %>%
tidyr::gather(key = label,value = value, -rundatelocal) %>%
dplyr::mutate(label = as.factor(label)) %>%
dplyr::full_join(., dtw_result, by = "label") %>%
mutate(label = factor(label, levels = rev(as.character(labels_order)))) %>%
ggplot(aes(x = rundatelocal, y = value, colour = as.factor(cluster))) +
geom_line() +
geom_area(aes(fill = as.factor(cluster))) +
coord_cartesian(ylim = c(0,1)) +
scale_y_continuous(name = "Average power density", breaks = seq(0, 1, by = 1)) +
scale_x_continuous(name = "Period (days)") +
facet_wrap(~label, ncol = 1, strip.position="left") +
guides(color=FALSE, fill = FALSE) +
theme_bw() +
theme(strip.background = element_blank(), strip.text = element_blank())
#
plt_list <- list(p2, p1)
plt_layout <- rbind(c(NA, 2),
c(1, 2),
c(NA, 2))
#
grid.arrange(grobs = plt_list, layout_matrix = plt_layout, heights = c(0.04, 1, 0.05))
This frequency decomposition looks amazing but be careful because the power frequency are average and as stated in “WaveletComp 1.1:A guided tour through the R package”, “The average power plot cannot distinguish between consecutive periods and overlapping periods”. This is annoying but average power is definitely a first step toward a nice classification of training plan patterns.


Enter the side of cube (in cm) :
Volume of cube:
Lateral Surface Area of cube:
Total Surface Area of cube:


Georide road trip ! Why ?
Georide allow to share a trip only when we have already finish it. My application allow the
georide user
to share his position for the time he need. If the time is not finish, we can follow his
position live.
You want to share your road trip ?
Step 0 : You need a georide account !
You can check their website
Step 1 : Create account
Create an account, fill all the informations requiered. You can have help on create account page with the information about georide.
Sign UpStep 2 : share the url to everyone
You can share this url : https://georide.ripoul.fr/trip/your-username. With this url, your friend can follow you live and have some information.
That's it !
The user can select only the dates in your road trip.You want to follow a road trip ?
All the link bellow are a shared road trip :-
{% for profile in profiles %}
- {{ profile.user.username }} {% endfor %}
Open-Source
This project is open-source ! Feel free to share it to your friends.All contributions are welcome. The project is on github here.


Fecha_Creacion: 2018-01-21T19:01:19.496Z
Dimension: Replacement Dimension
Id_Locacion: 67
Nombre: Blips and Chitz
Residentes: ['https://rickandmortyapi.com/api/character/242']
Tipo: Arcade
URL: https://rickandmortyapi.com/api/location/67


Say love to you once again
问题描述 :
Say love to you once again——I remember that day, you’re sitting in front of me. Obviously your wishes, waiting for my performance. I said some other day, when I have sufficient time
, I would certainly give you a perfect declaration of love. I would like to seize every moment, I am afraid that the story is yesterday. I came to realize that neglect is the largest defect of me, but it was to late. I really want to say love to you once again. I am willing to give up everything only in exchange for you. If time can turn the clock back for you. I will hold your hands once again, say, I love you!
, I would certainly give you a perfect declaration of love. I would like to seize every moment, I am afraid that the story is yesterday. I came to realize that neglect is the largest defect of me, but it was to late. I really want to say love to you once again. I am willing to give up everything only in exchange for you. If time can turn the clock back for you. I will hold your hands once again, say, I love you!
It is an old legend.
If you can solve this problem, god will give you a chance to say love to your darling once again, so, yifenfei, seize the chance.
There are N plane in the sky, and every one can attack each other. Now, we assigned each has a number i (1 <= i <= N), plane i and plane j can produce Aij points of hurt. Your task is to divide N planes into two groups. Each group in itself don’t produce any point of hurt, but plane between two groups will produces hurt.
Please maximize sum of all the hurt.
输入:
For each case, first input a N(2 <= N <= 25), represent the number of planes in the sky, then a matrix A, (Aij = Aji, Aii = 0 for all i,j<= N), Aij represents the hurt between plane i and plane j.
输出:
For each case, first input a N(2 <= N <= 25), represent the number of planes in the sky, then a matrix A, (Aij = Aji, Aii = 0 for all i,j<= N), Aij represents the hurt between plane i and plane j.
样例输入:
3 0 150 20 150 0 140 20 140 0
样例输出:
290.
http://acm.hdu.edu.cn/showproblem.php?pid=2625
随便写出一个dfs然后猥琐随机化法剪枝，第一次AC的战绩是1/18，还跑了700+ms，随机50w次成功率还这么低。。。最近rp真是太烂了有木有。。。
#include <iostream> #include <cstdlib> #include <ctime> using namespace std ; int map[30][30] ; int n ; int ans ; int vis[30] ; void dfs(int d) { if(d==n) { int temp=0 ; for(int i=0;i<n;i++) if(vis[i]) for(int j=0;j<n;j++) if(!vis[j]) temp+=map[i][j] ; if(ans<temp) ans=temp ; return ; } vis[d]=1 ; dfs(d+1) ; vis[d]=0 ; dfs(d+1) ; } int main() { while(~scanf("%d",&n)) { for(int i=0;i<n;i++) for(int j=0;j<n;j++) scanf("%d",&map[i][j]) ; memset(vis,0,sizeof(vis)) ; ans=0 ; if(n<20) dfs(0) ; else { int times=500000 ; srand(time(0)) ; while(times--) { vis[rand()%n]^=1 ; int temp=0 ; for(int i=0;i<n;i++) if(vis[i]) for(int j=0;j<n;j++) if(!vis[j]) temp+=map[i][j] ; if(ans<temp) ans=temp ; } } printf("%d.\n",ans) ; } return 0 ; }
解题转自：http://www.cnblogs.com/xiaohongmao/archive/2012/06/07/2539860.html
(adsbygoogle = window.adsbygoogle || []).push({});
我喜欢强势的凰北月。
我喜欢强势的凰北月。
我喜欢强势的凰北月。
我喜欢强势的凰北月。
我喜欢强势的凰北月。
我喜欢强势的凰北月。
我喜欢强势的凰北月。
很好，找的就是这一题
其实就是DFS搜索，数据量较小，穷举了所有情况
博主的C++功底真是好
真考人啊
多谢支持！
m /= i; 是一直在变的。参考这一篇关于质因数的http://www.acmerblog.com/integer-factorization-5124.html
为什么暴力求解方法循环到sqrt(n) 就可以了呢
这是研发的在线笔试题吗?发现很多C啊，阿里不是JAVA多么？
good !
思路二可以用一个长度为k的队列来实现，入队后判断下队尾元素的next指针是否为空，若为空，则出队指针即为所求。
分析的很专业！
使用ListNodeWrapper很蹩脚的感觉，没有更好的解决办法？
很好，注释很详细啊
不错的网站，建议添加些比赛信息